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

A heuristic algorithm for yard truck scheduling and storage allocation problems

Author

Listed:
  • Lee, Der-Horng
  • Cao, Jin Xin
  • Shi, Qixin
  • Chen, Jiang Hang

Abstract

The yard truck scheduling and the storage allocation are two important decision problems affecting the efficiency of container terminal operations. This paper proposes a novel approach that integrates these two problems into a whole. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. Due to the intractability of the proposed problem, a hybrid insertion algorithm is designed for effective problem solutions. Computational experiments are conducted to examine the key factors of the problem and the performance of the proposed heuristic algorithm.

Suggested Citation

  • Lee, Der-Horng & Cao, Jin Xin & Shi, Qixin & Chen, Jiang Hang, 2009. "A heuristic algorithm for yard truck scheduling and storage allocation problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(5), pages 810-820, September.
    • Handle: RePEc:eee:transe:v:45:y:2009:i:5:p:810-820
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655450900043X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. Kastner, Marvin & Peters, Malte & Jahn, Carlos, 2021. "Assessing performance of container slot allocation heuristics," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Jahn, Carlos & Kersten, Wolfgang & Ringle, Christian M. (ed.), Adapting to the Future: Maritime and City Logistics in the Context of Digitalization and Sustainability. Proceedings of the Hamburg International Conf, volume 32, pages 427-454, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    2. Chen, Mu-Chen & Hsiao, Yu-Hsiang & Himadeep Reddy, Reddivari & Tiwari, Manoj Kumar, 2016. "The Self-Learning Particle Swarm Optimization approach for routing pickup and delivery of multiple products with material handling in multiple cross-docks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 208-226.
    3. 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.
    4. Luo, Jiabin & Wu, Yue, 2015. "Modelling of dual-cycle strategy for container storage and vehicle scheduling problems at automated container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 49-64.
    5. Shell Ying Huang & Ya Li, 2017. "Yard crane scheduling to minimize total weighted vessel loading time in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 689-720, December.
    6. 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.
    7. Chenhao Zhou & Qitong Zhao & Haobin Li, 2021. "Simulation optimization iteration approach on traffic integrated yard allocation problem in transshipment terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 663-688, September.
    8. Kress, Dominik & Meiswinkel, Sebastian & Pesch, Erwin, 2019. "Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas," European Journal of Operational Research, Elsevier, vol. 279(3), pages 732-750.
    9. Wang, Zehao & Zeng, Qingcheng & Li, Xingchun & Qu, Chenrui, 2024. "A branch-and-price heuristic algorithm for the ART and external truck scheduling problem in an automated container terminal with a parallel layout," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    10. Wu, Yue & Luo, Jiabin & Zhang, Dali & Dong, Ming, 2013. "An integrated programming model for storage management and vehicle scheduling at container terminals," Research in Transportation Economics, Elsevier, vol. 42(1), pages 13-27.
    11. Zhang, Di & Chen, Feng & Mei, Ziqiao, 2023. "Optimization on joint scheduling of yard allocation and transfer manpower assignment for automobile RO-RO terminal," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    12. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.
    13. Zhang, Xiaoju & Zeng, Qingcheng & Yang, Zhongzhen, 2016. "Modeling the mixed storage strategy for quay crane double cycling in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 171-187.
    14. Abou Kasm, Omar & Diabat, Ali & Bierlaire, Michel, 2021. "Vessel scheduling with pilotage and tugging considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 148(C).

    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:45:y:2009:i:5:p:810-820. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.