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

Inbound container remarshaling problem in an automated container terminal

Author

Listed:
  • Jin, Bo
  • Yu, Zhishan
  • Yu, Mingzhu

Abstract

In the container terminal yard, operators typically rearrange containers during the idle time of the yard cranes (so-called remarshaling operation) to improve the efficiency of future container retrieval. In this study, we address the inbound container remarshaling problem in an automated container terminal, which is aimed at determining the optimal container movement sequence during the remarshaling operation to minimize the expected time for retrieving all containers in the future. The randomness of the inbound containers’ future retrieval order and the maximum available time of the remarshaling operation are both considered. Two new integer linear programming models are proposed to formulate the problem. Numerical experiments show the outperformance of the proposed models over the existing mixed-integer programming model in the literature. Especially, one of the proposed models demonstrates considerably high computational efficiency, which is capable of solving practical-sized instances to optimality in just a few hundred of milliseconds. In addition, we investigate the bi-objective remarshaling problem in order to examine the relationship between the minimum future retrieval time and the maximum available remarshaling time.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:transe:v:168:y:2022:i:c:s1366554522003155
    DOI: 10.1016/j.tre.2022.102938
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554522003155
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2022.102938?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. 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).
    2. 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.
    3. Yu, Mingzhu & Qi, Xiangtong, 2013. "Storage space allocation models for inbound containers in an automatic container terminal," European Journal of Operational Research, Elsevier, vol. 226(1), pages 32-45.
    4. Zehendner, Elisabeth & Feillet, Dominique & Jaillet, Patrick, 2017. "An algorithm with performance guarantee for the Online Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 48-62.
    5. 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.
    6. Filip Covic, 2017. "Re-marshalling in automated container yards with terminal appointment systems," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 433-503, December.
    7. 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.
    8. 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.
    9. Azab, Ahmed & Morita, Hiroshi, 2022. "Coordinating truck appointments with container relocations and retrievals in container terminals under partial appointments information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    10. 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.
    11. 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.
    12. 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).
    13. Young Kim, Ki & Hwan Kim, Kap, 1999. "A routing algorithm for a single straddle carrier to load export containers onto a containership," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 425-433, March.
    14. 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).
    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. 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.
    2. 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.
    3. 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).
    4. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Xie, Ying, 2022. "Service fairness and value of customer information for the stochastic container relocation problem under flexible service policy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    5. 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.
    6. 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.
    7. Hang Yu & Yiyun Deng & Leijie Zhang & Xin Xiao & Caimao Tan, 2022. "Yard Operations and Management in Automated Container Terminals: A Review," Sustainability, MDPI, vol. 14(6), pages 1-24, March.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    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. 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).
    14. 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.
    15. Asadi, Amin & Nurre Pinkley, Sarah, 2021. "A stochastic scheduling, allocation, and inventory replenishment problem for battery swap stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    16. 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.
    17. 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.
    18. Iris F. A. Vis & Hector J. Carlo, 2010. "Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal," Transportation Science, INFORMS, vol. 44(2), pages 169-182, May.
    19. 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.
    20. Xi Guo & Shell Ying Huang, 2012. "Dynamic Space and Time Partitioning for Yard Crane Workload Management in Container Terminals," Transportation Science, INFORMS, vol. 46(1), pages 134-148, 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:transe:v:168:y:2022:i:c:s1366554522003155. 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.