IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v69y2014icp199-217.html
   My bibliography  Save this article

Container yard template planning under uncertain maritime market

Author

Listed:
  • Zhen, Lu

Abstract

A yard template determines the assignment of spaces in a yard for arriving vessels. Fluctuation of demand for freight transportation brings new challenges for making a robust yard template when facing uncertain maritime market. A model is proposed for yard template planning considering random numbers of containers that will be loaded onto vessels that visit the port periodically. Traffic congestions and multiple schedule cycle times for vessel arrival patterns are also considered. Moreover, a meta-heuristic method is developed for solving the model in large-scale cases. Numerical experiments are conducted to validate effectiveness and efficiency of the model.

Suggested Citation

  • Zhen, Lu, 2014. "Container yard template planning under uncertain maritime market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 199-217.
    • Handle: RePEc:eee:transe:v:69:y:2014:i:c:p:199-217
    DOI: 10.1016/j.tre.2014.06.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554514001069
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2014.06.011?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. M. Avriel & A. C. Williams, 1970. "The Value of Information and Stochastic Programming," Operations Research, INFORMS, vol. 18(5), pages 947-954, October.
    2. Kim, Kap Hwan & Park, Young Man & Ryu, Kwang-Ryul, 2000. "Deriving decision rules to locate export containers in container yards," European Journal of Operational Research, Elsevier, vol. 124(1), pages 89-101, July.
    3. Han, Xiao-le & Lu, Zhi-qiang & Xi, Li-feng, 2010. "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1327-1340, December.
    4. 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.
    5. Meisel, Frank & Bierwirth, Christian, 2009. "Heuristics for the integration of crane productivity in the berth allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 196-209, January.
    6. Chang, Daofang & Jiang, Zuhua & Yan, Wei & He, Junliang, 2010. "Integrating berth allocation and quay crane assignments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(6), pages 975-990, November.
    7. 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.
    8. Chen, C. S. & Lee, S. M. & Shen, Q. S., 1995. "An analytical model for the container loading problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 68-76, January.
    9. Jiang, Xinjia & Lee, Loo Hay & Chew, Ek Peng & Han, Yongbin & Tan, Kok Choon, 2012. "A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port," European Journal of Operational Research, Elsevier, vol. 221(1), pages 64-73.
    10. Hwan Kim, Kap & Bae Kim, Hong, 1999. "Segregating space allocation models for container inventories in port container terminals," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 415-423, March.
    11. 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.
    12. L Zhen, 2013. "Yard template planning in transshipment hubs under uncertain berthing time and position," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(9), pages 1418-1428, September.
    13. Vis, Iris F. A. & de Koster, Rene, 2003. "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, Elsevier, vol. 147(1), pages 1-16, May.
    14. Nishimura, Etsuko & Imai, Akio & Janssens, Gerrit K. & Papadimitriou, Stratos, 2009. "Container storage and transshipment marine terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(5), pages 771-786, September.
    15. 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.
    16. Zhang, Chuqian & Liu, Jiyin & Wan, Yat-wah & Murty, Katta G. & Linn, Richard J., 2003. "Storage space allocation in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 37(10), pages 883-903, December.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. Zhen, Lu & Xu, Zhou & Wang, Kai & Ding, Yi, 2016. "Multi-period yard template planning in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 700-719.
    3. 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.
    4. 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.
    5. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    6. 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.
    7. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. 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.
    9. Feng Li & Jiuh-Biing Sheu & Zi-You Gao, 2015. "Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range," Transportation Science, INFORMS, vol. 49(4), pages 968-989, November.
    10. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    11. 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.
    12. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    13. Carlo, Héctor J. & Vis, Iris F.A. & Roodbergen, Kees Jan, 2014. "Storage yard operations in container terminals: Literature overview, trends, and research directions," European Journal of Operational Research, Elsevier, vol. 235(2), pages 412-430.
    14. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    15. Hsien-Pin Hsu & Chia-Nan Wang, 2020. "Resources Planning for Container Terminal in a Maritime Supply Chain Using Multiple Particle Swarms Optimization (MPSO)," Mathematics, MDPI, vol. 8(5), pages 1-31, May.
    16. Hyun Ji Park & Sung Won Cho & Abhilasha Nanda & Jin Hyoung Park, 2023. "Data-driven dynamic stacking strategy for export containers in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 170-195, March.
    17. Matthew E. H. Petering & Yong Wu & Wenkai Li & Mark Goh & Robert Souza & Katta G. Murty, 2017. "Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 369-402, December.
    18. 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.
    19. Tao, Yi & Lee, Chung-Yee, 2015. "Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 34-50.
    20. Voß, Andre & Guckenbiehl, Gabriel & Schütt, Holger & Buer, Tobias, 2016. "A storage strategy with dynamic bay reservations for container terminals," Bremen Computational Logistics Group Working Papers 4, University of Bremen, Computational Logistics Junior Research Group.

    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:transe:v:69:y:2014:i:c:p:199-217. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.