IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v173y2016icp111-121.html
   My bibliography  Save this article

Models on ship scheduling in transshipment hubs with considering bunker cost

Author

Listed:
  • Zhen, Lu
  • Shen, Tao
  • Wang, Shuaian
  • Yu, Shucheng

Abstract

This paper studies a decision problem for scheduling ships׳ starting operation time in a transshipment hub with considering the bunker cost and the transshipment cost of containers. Based on the information about the handing capacity of the container port in each period, the port operator makes a proper decision and informs the shipping companies about the start operation days of each liner route. The optimized decision may help shipping companies significantly reduce the cost. This study proposes a mixed integer programming model. The NP-hardness of the problem is proved. A local branching based solution method is also developed for solving the model. Extensive numerical experiments demonstrate the optimality of the solution by the proposed method is less than 3% for large-scale problem instances.

Suggested Citation

  • Zhen, Lu & Shen, Tao & Wang, Shuaian & Yu, Shucheng, 2016. "Models on ship scheduling in transshipment hubs with considering bunker cost," International Journal of Production Economics, Elsevier, vol. 173(C), pages 111-121.
    • Handle: RePEc:eee:proeco:v:173:y:2016:i:c:p:111-121
    DOI: 10.1016/j.ijpe.2015.12.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527315005332
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2015.12.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Zhiyuan & Meng, Qiang & Wang, Shuaian & Sun, Zhuo, 2014. "Global intermodal liner shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 28-39.
    2. Tran, Nguyen Khoi & Haasis, Hans-Dietrich, 2015. "An empirical study of fleet expansion and growth of ship size in container liner shipping," International Journal of Production Economics, Elsevier, vol. 159(C), pages 241-253.
    3. He, Junliang & Chang, Daofang & Mi, Weijian & Yan, Wei, 2010. "A hybrid parallel genetic algorithm for yard crane scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(1), pages 136-155, January.
    4. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    5. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    6. Mohammad Mazraati, 2011. "Challenges and prospects of international marine bunker fuels demand," OPEC Energy Review, Organization of the Petroleum Exporting Countries, vol. 35(1), pages 1-26, March.
    7. Talley, Wayne K. & Ng, ManWo, 2013. "Maritime transport chain choice by carriers, ports and shippers," International Journal of Production Economics, Elsevier, vol. 142(2), pages 311-316.
    8. Pang, King-Wah & Xu, Zhou & Li, Chung-Lun, 2011. "Ship routing problem with berthing time clash avoidance constraints," International Journal of Production Economics, Elsevier, vol. 131(2), pages 752-762, June.
    9. Qiang Meng & Shuaian Wang & Henrik Andersson & Kristian Thun, 2014. "Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions," Transportation Science, INFORMS, vol. 48(2), pages 265-280, May.
    10. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    11. Du, Yuquan & Chen, Qiushuang & Quan, Xiongwen & Long, Lei & Fung, Richard Y.K., 2011. "Berth allocation considering fuel consumption and vessel emissions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1021-1037.
    12. Jun Xia & Kevin X. Li & Hong Ma & Zhou Xu, 2015. "Joint Planning of Fleet Deployment, Speed Optimization, and Cargo Allocation for Liner Shipping," Transportation Science, INFORMS, vol. 49(4), pages 922-938, November.
    13. Cordeau, Jean-Francois & Gaudioso, Manlio & Laporte, Gilbert & Moccia, Luigi, 2007. "The service allocation problem at the Gioia Tauro Maritime Terminal," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1167-1184, January.
    14. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship route schedule design with sea contingency time and port time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 615-633.
    15. Fan, Lei & Wilson, William W. & Dahl, Bruce, 2012. "Congestion, port expansion and spatial competition for US container imports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1121-1136.
    16. Ng, ManWo, 2014. "Distribution-free vessel deployment for liner shipping," European Journal of Operational Research, Elsevier, vol. 238(3), pages 858-862.
    17. Wang, Shuaian & Meng, Qiang, 2015. "Robust bunker management for liner shipping networks," European Journal of Operational Research, Elsevier, vol. 243(3), pages 789-797.
    18. Mulder, Judith & Dekker, Rommert, 2014. "Methods for strategic liner shipping network design," European Journal of Operational Research, Elsevier, vol. 235(2), pages 367-377.
    19. Jin, Jian Gang & Lee, Der-Horng & Hu, Hao, 2015. "Tactical berth and yard template design at container transshipment terminals: A column generation based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 168-184.
    20. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    21. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2015. "Liner hub-and-spoke shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 32-48.
    22. Brouer, Berit Dangaard & Desaulniers, Guy & Pisinger, David, 2014. "A matheuristic for the liner shipping network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 42-59.
    23. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    24. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    25. Giallombardo, Giovanni & Moccia, Luigi & Salani, Matteo & Vacca, Ilaria, 2010. "Modeling and solving the Tactical Berth Allocation Problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 232-245, February.
    26. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    27. Wang, Shuaian & Meng, Qiang, 2012. "Sailing speed optimization for container ships in a liner shipping network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 701-714.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Maxim A. Dulebenets & Junayed Pasha & Olumide F. Abioye & Masoud Kavoosi, 2021. "Vessel scheduling in liner shipping: a critical literature review and future research needs," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 43-106, March.
    2. Hongchu Yu & Zhixiang Fang & Guojun Peng & Mingxiang Feng, 2017. "Revealing the Linkage Network Dynamic Structures of Chinese Maritime Ports through Automatic Information System Data," Sustainability, MDPI, vol. 9(10), pages 1-17, October.
    3. Xu Zhao & Qianjun Lin & Hao Yu, 2019. "An Improved Mathematical Model for Green Lock Scheduling Problem of the Three Gorges Dam," Sustainability, MDPI, vol. 11(9), pages 1-23, May.
    4. Zhen, Lu & Wang, Wencheng & Lin, Shumin, 2022. "Analytical comparison on two incentive policies for shore power equipped ships in berthing activities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    5. Junayed Pasha & Maxim A. Dulebenets & Masoud Kavoosi & Olumide F. Abioye & Oluwatosin Theophilus & Hui Wang & Raphael Kampmann & Weihong Guo, 2020. "Holistic tactical-level planning in liner shipping: an exact optimization approach," Journal of Shipping and Trade, Springer, vol. 5(1), pages 1-35, December.
    6. Lijuan Yang & Eldon Y. Li & Yu Zhang, 2020. "Pricing and Subsidy Models for Transshipment Sustainability in the Three Gorges Dam Region of China," Sustainability, MDPI, vol. 12(17), pages 1-20, August.
    7. Ma, Hoi-Lam & Wong, Collin Wai-Hung & Leung, Lawrence C. & Chung, Sai-Ho, 2020. "Facility sharing in business-to-business model: A real case study for container terminal operators in Hong Kong port," International Journal of Production Economics, Elsevier, vol. 221(C).
    8. Dulebenets, Maxim A., 2018. "A comprehensive multi-objective optimization model for the vessel scheduling problem in liner shipping," International Journal of Production Economics, Elsevier, vol. 196(C), pages 293-318.
    9. Zhen, Lu & Wang, Shuaian & Zhuge, Dan, 2017. "Dynamic programming for optimal ship refueling decision," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 63-74.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    2. Zhen, Lu & Liang, Zhe & Zhuge, Dan & Lee, Loo Hay & Chew, Ek Peng, 2017. "Daily berth planning in a tidal port with channel flow control," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 193-217.
    3. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    4. Lee, Chung-Yee & Song, Dong-Ping, 2017. "Ocean container transport in global supply chains: Overview and research opportunities," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 442-474.
    5. Mulder, J. & Dekker, R., 2016. "Optimization in container liner shipping," Econometric Institute Research Papers EI2016-05, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Wang, Shuaian, 2016. "Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization," European Journal of Operational Research, Elsevier, vol. 250(1), pages 46-55.
    7. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    8. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    9. Liu, Ming & Lee, Chung-Yee & Zhang, Zizhen & Chu, Chengbin, 2016. "Bi-objective optimization for the container terminal integrated planning," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 720-749.
    10. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    11. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    12. Guo, Liming & Zheng, Jianfeng & Liang, Jinpeng & Wang, Shuaian, 2023. "Column generation for the multi-port berth allocation problem with port cooperation stability," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 3-28.
    13. Jin, Jian Gang & Lee, Der-Horng & Hu, Hao, 2015. "Tactical berth and yard template design at container transshipment terminals: A column generation based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 168-184.
    14. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    15. Wang, Shuaian, 2015. "Optimal sequence of container ships in a string," European Journal of Operational Research, Elsevier, vol. 246(3), pages 850-857.
    16. Yang, Dong & Pan, Kai & Wang, Shuaian, 2018. "On service network improvement for shipping lines under the one belt one road initiative of China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 82-95.
    17. Wawrzyniak, Jakub & Drozdowski, Maciej & Sanlaville, Éric, 2020. "Selecting algorithms for large berth allocation problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 844-862.
    18. Lu Zhen & Shuaian Wang & Kai Wang, 2016. "Terminal allocation problem in a transshipment hub considering bunker consumption," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(7), pages 529-548, October.
    19. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
    20. Ksciuk, Jana & Kuhlemann, Stefan & Tierney, Kevin & Koberstein, Achim, 2023. "Uncertainty in maritime ship routing and scheduling: A Literature review," European Journal of Operational Research, Elsevier, vol. 308(2), pages 499-524.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:173:y:2016:i:c:p:111-121. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.