IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v90y2016icp83-104.html
   My bibliography  Save this article

Modeling of yard congestion and optimization of yard template in container ports

Author

Listed:
  • Zhen, Lu

Abstract

As a tactical-level plan, a yard template determines the assignment of spaces in a container port yard for arriving vessels. This paper investigates the concept of yard congestion quantitatively in the context of yard truck interruptions, and develops a combination of probabilistic and physics-based models for truck interruptions. The above work enables us to exactly evaluate the expected link travel time, which then acts as the basis for proposing a mixed-integer programming model that minimizes the total expected travel time of moving containers around the yard. A Squeaky Wheel Optimization based meta-heuristic is developed to solve the model. Experiments are also conducted to validate the effectiveness of the model and the solution method.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:90:y:2016:i:c:p:83-104
    DOI: 10.1016/j.trb.2016.04.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261515302599
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2016.04.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. 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.
    2. 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.
    3. 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.
    4. Carlo, Héctor J. & Vis, Iris F.A. & Roodbergen, Kees Jan, 2014. "Transport operations in container terminals: Literature overview, trends, research directions and classification scheme," European Journal of Operational Research, Elsevier, vol. 236(1), pages 1-13.
    5. 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.
    6. Debjit Roy & Akash Gupta & René B.M. De Koster, 2016. "A non-linear traffic flow-based queuing model to estimate container terminal throughput with AGVs," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 472-493, January.
    7. 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.
    8. Umang, Nitish & Bierlaire, Michel & Vacca, Ilaria, 2013. "Exact and heuristic methods to solve the berth allocation problem in bulk ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 14-31.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Min Zhang & Rajan Batta & Rakesh Nagi, 2009. "Modeling of Workflow Congestion and Optimization of Flow Routing in a Manufacturing/Warehouse Facility," Management Science, INFORMS, vol. 55(2), pages 267-280, February.
    15. 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.
    16. Wang, Shuaian & Liu, Zhiyuan & Meng, Qiang, 2015. "Segment-based alteration for container liner shipping network design," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 128-145.
    17. 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.
    18. 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.
    19. 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.
    20. Wang, Shuaian & Liu, Zhiyuan & Bell, Michael G.H., 2015. "Profit-based maritime container assignment models for liner shipping networks," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 59-76.
    21. 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.
    22. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    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. 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.
    2. 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).
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Jiang, Xin Jia & Jin, Jian Gang, 2017. "A branch-and-price method for integrated yard crane deployment and container allocation in transshipment yards," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 62-75.
    9. Zhou, Chenhao & Wang, Wencheng & Li, Haobin, 2020. "Container reshuffling considered space allocation problem in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    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. 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.
    12. 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.
    13. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    14. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    15. Chen, Xiaojing & Li, Feng & Jia, Bin & Wu, Jianjun & Gao, Ziyou & Liu, Ronghui, 2021. "Optimizing storage location assignment in an automotive Ro-Ro terminal," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 249-281.
    16. 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.
    17. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    18. 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.
    19. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
    20. Wang, Kai & Wang, Shuaian & Zhen, Lu & Qu, Xiaobo, 2017. "Cruise service planning considering berth availability and decreasing marginal profit," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 1-18.

    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:transb:v:90:y:2016:i:c:p:83-104. 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/548/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.