IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v271y2018i1p288-316.html
   My bibliography  Save this article

Yard Crane Scheduling for container storage, retrieval, and relocation

Author

Listed:
  • Galle, Virgile
  • Barnhart, Cynthia
  • Jaillet, Patrick

Abstract

This paper introduces a novel optimization problem resulting from the combination of two major existing problems arising at storage yards in container terminals. The Yard Crane Scheduling Problem is typically concerned with routing the crane given a sequence of storage and retrieval requests to perform, while the Container Relocation Problem tackles the minimization of relocations when retrieving containers in a simpler setting. This paper is the first to consider a model that integrates these two problems by scheduling storage, retrieval and relocations requests and deciding on storage and relocation positions. We formulate this problem as an integer program that jointly optimizes current crane travel time and future relocations. Based on the structure of the proposed formulation and the linear programming relaxation of subproblems, we propose a heuristic local search scheme. Finally, we show the value of our solutions on both simulated instances as well as real data from a port terminal.

Suggested Citation

  • Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "Yard Crane Scheduling for container storage, retrieval, and relocation," European Journal of Operational Research, Elsevier, vol. 271(1), pages 288-316.
    • Handle: RePEc:eee:ejores:v:271:y:2018:i:1:p:288-316
    DOI: 10.1016/j.ejor.2018.05.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718303850
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.05.007?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. Gharehgozli, Amir Hossein & Yu, Yugang & de Koster, René & Udding, Jan Tijmen, 2014. "An exact method for scheduling a yard crane," European Journal of Operational Research, Elsevier, vol. 235(2), pages 431-447.
    2. Ulf Speer & Kathrin Fischer, 2017. "Scheduling of Different Automated Yard Crane Systems at Container Terminals," Transportation Science, INFORMS, vol. 51(1), pages 305-324, February.
    3. Iris F. A. Vis & Kees Jan Roodbergen, 2009. "Scheduling of Container Storage and Retrieval," Operations Research, INFORMS, vol. 57(2), pages 456-467, April.
    4. M. Hakan Akyüz & Chung‐Yee Lee, 2014. "A mathematical formulation and efficient heuristics for the dynamic container relocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 101-118, March.
    5. Yat‐wah Wan & Jiyin Liu & Pei‐Chun Tsai, 2009. "The assignment of storage locations to containers for a container stack," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(8), pages 699-713, December.
    6. Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations," European Journal of Operational Research, Elsevier, vol. 267(2), pages 467-477.
    7. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    8. 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.
    9. Caserta, Marco & Schwarze, Silvia & Voß, Stefan, 2012. "A mathematical formulation and complexity considerations for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 219(1), pages 96-104.
    10. Amir Hossein Gharehgozli & Yugang Yu & Xiandong Zhang & René de Koster, 2017. "Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System," Transportation Science, INFORMS, vol. 51(1), pages 19-33, February.
    11. Yuan, Yuan & Tang, Lixin, 2017. "Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse," European Journal of Operational Research, Elsevier, vol. 262(2), pages 424-437.
    12. Ananthapadmanabhan Narasimhan & Udatta S. Palekar, 2002. "Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations," Transportation Science, INFORMS, vol. 36(1), pages 63-78, February.
    13. Amir Hossein Gharehgozli & Debjit Roy & René de Koster, 2016. "Sea container terminals: New technologies and OR models," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 18(2), pages 103-140, June.
    14. Ki Young Kim & Kap Hwan Kim, 2003. "Heuristic algorithms for routing yard‐side equipment for minimizing loading times in container terminals," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 498-514, August.
    15. Amir Hossein Gharehgozli & Gilbert Laporte & Yugang Yu & René de Koster, 2015. "Scheduling Twin Yard Cranes in a Container Block," Transportation Science, INFORMS, vol. 49(3), pages 686-705, August.
    16. Rui Rei & João Pedroso, 2013. "Tree search for the stacking problem," Annals of Operations Research, Springer, vol. 203(1), pages 371-388, March.
    17. Kap Hwan Kim & Ki Young Kim, 1999. "An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals," Transportation Science, INFORMS, vol. 33(1), pages 17-33, February.
    18. 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.
    19. Lee, Der-Horng & Cao, Zhi & Meng, Qiang, 2007. "Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm," International Journal of Production Economics, Elsevier, vol. 107(1), pages 115-124, May.
    20. Zehendner, Elisabeth & Caserta, Marco & Feillet, Dominique & Schwarze, Silvia & Voß, Stefan, 2015. "An improved mathematical formulation for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 415-422.
    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. Lennart Zey & Dirk Briskorn & Nils Boysen, 2022. "Twin-crane scheduling during seaside workload peaks with a dedicated handshake area," Journal of Scheduling, Springer, vol. 25(1), pages 3-34, February.
    2. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    3. Gharehgozli, Amir & Xu, Chao & Zhang, Wenda, 2021. "High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system," European Journal of Operational Research, Elsevier, vol. 289(2), pages 495-507.
    4. Feng, Yuanjun & Song, Dong-Ping & Li, Dong, 2022. "Smart stacking for import containers using customer information at automated container terminals," European Journal of Operational Research, Elsevier, vol. 301(2), pages 502-522.
    5. Ahmed Talaat & Mohamed Gheith & Amr Eltawil, 2023. "A Multi-Stage Approach for External Trucks and Yard Cranes Scheduling with CO 2 Emissions Considerations in Container Terminals," Logistics, MDPI, vol. 7(4), pages 1-23, November.
    6. Sumin Chen & Qingcheng Zeng & Yushan Hu, 2022. "Scheduling optimization for two crossover automated stacking cranes considering relocation," Operational Research, Springer, vol. 22(3), pages 2099-2120, July.
    7. Wu, Lingxiao & Jia, Shuai & Wang, Shuaian, 2020. "Pilotage planning in seaports," European Journal of Operational Research, Elsevier, vol. 287(1), pages 90-105.
    8. Damla Kizilay & Deniz Türsel Eliiyi, 2021. "A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 1-42, March.
    9. Vallada, Eva & Belenguer, Jose Manuel & Villa, Fulgencia & Alvarez-Valdes, Ramon, 2023. "Models and algorithms for a yard crane scheduling problem in container ports," European Journal of Operational Research, Elsevier, vol. 309(2), pages 910-924.
    10. Tanaka, Shunji & Tierney, Kevin & Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Ruiz, Rubén, 2019. "A branch and bound approach for large pre-marshalling problems," European Journal of Operational Research, Elsevier, vol. 278(1), pages 211-225.
    11. 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.
    12. Jin, Bo & Yu, Zhishan & Yu, Mingzhu, 2022. "Inbound container remarshaling problem in an automated container terminal," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).

    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. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    2. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    3. Jin, Bo & Tanaka, Shunji, 2023. "An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules," European Journal of Operational Research, Elsevier, vol. 304(2), pages 494-514.
    4. Amir Gharehgozli & Nima Zaerpour & Rene Koster, 2020. "Container terminal layout design: transition and future," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 22(4), pages 610-639, December.
    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. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Zeng, Qingcheng, 2020. "The stochastic container relocation problem with flexible service policies," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 116-163.
    7. Xiao-Ming Yang & Xin-Jia Jiang, 2020. "Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(02), pages 1-28, March.
    8. Gharehgozli, Amir Hossein & Vernooij, Floris Gerardus & Zaerpour, Nima, 2017. "A simulation study of the performance of twin automated stacking cranes at a seaport container terminal," European Journal of Operational Research, Elsevier, vol. 261(1), pages 108-128.
    9. Andresson Silva Firmino & Ricardo Martins Abreu Silva & Valéria Cesário Times, 2019. "A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time," Journal of Heuristics, Springer, vol. 25(2), pages 141-173, April.
    10. de Melo da Silva, Marcos & Toulouse, Sophie & Wolfler Calvo, Roberto, 2018. "A new effective unified model for solving the Pre-marshalling and Block Relocation Problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 40-56.
    11. 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.
    12. Gharehgozli, Amir & Xu, Chao & Zhang, Wenda, 2021. "High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system," European Journal of Operational Research, Elsevier, vol. 289(2), pages 495-507.
    13. Vallada, Eva & Belenguer, Jose Manuel & Villa, Fulgencia & Alvarez-Valdes, Ramon, 2023. "Models and algorithms for a yard crane scheduling problem in container ports," European Journal of Operational Research, Elsevier, vol. 309(2), pages 910-924.
    14. Silva, Marcos de Melo da & Erdoğan, Güneş & Battarra, Maria & Strusevich, Vitaly, 2018. "The Block Retrieval Problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 931-950.
    15. Huiling Zhu & Mingjun Ji & Wenwen Guo & Qingbin Wang & Yongzhi Yang, 2019. "Mathematical formulation and heuristic algorithm for the block relocation and loading problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(4), pages 333-351, June.
    16. Ruiyou Zhang & Shixin Liu & Herbert Kopfer, 2016. "Tree search procedures for the blocks relocation problem with batch moves," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 397-424, September.
    17. Zweers, Bernard G. & Bhulai, Sandjai & van der Mei, Rob D., 2020. "Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 954-971.
    18. Zhou, Chenhao & Lee, Byung Kwon & Li, Haobin, 2020. "Integrated optimization on yard crane scheduling and vehicle positioning at container yards," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    19. 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.
    20. Lennart Zey & Dirk Briskorn & Nils Boysen, 2022. "Twin-crane scheduling during seaside workload peaks with a dedicated handshake area," Journal of Scheduling, Springer, vol. 25(1), pages 3-34, February.

    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:ejores:v:271:y:2018:i:1:p:288-316. 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/eor .

    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.