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

An enhanced variable neighborhood search method for refrigerated container stacking and relocation problem with duplicate priorities

Author

Listed:
  • Wang, Wenyuan
  • Liu, Huakun
  • Tian, Qi
  • Xia, Zicheng
  • Liu, Suri
  • Peng, Yun

Abstract

Due to the stringent timeliness requirements of temperature-controlled cargoes and distinctive storage operations of refrigerated container (RC), it is imperative to optimize the storage process of RCs in terms of reducing relocations and delays. Aiming to manage RC storage more efficiently, this paper addresses an integrated problem of refrigerated container stacking and relocation problem (RCSRP) with unique characteristics, including various storage modes (i.e., RC block and cold storage), concurrent stacking and retrieving tasks, and duplicate handling priorities. A new virtual stack concept is introduced to develop a new binary formulation of RC block configuration, enabling simultaneous handling of stacking and retrieving tasks. Based on the new binary formulation, a mixed integer programming (MIP) model is developed and incorporates novel constraints related to RC operations and duplicate handling priorities. To improve solvability, a decomposition strategy is proposed to make it possible to solve large-scale problems. An enhanced variable neighborhood search (EVNS) algorithm is developed to solve the decomposed model iteratively. A handling sequence and stacking and relocation scheduling (HSSRS) heuristic is designed to solve sub-problems. With the implementation of the decomposition strategy and tailored EVNS framework, both the solvability and solving efficiency of the original integrated MIP model are significantly improved. The decomposed model can be optimally solved by CPLEX under the EVNS on small-scale instances. On medium-scale instances, the proposed approach can also obtain extreme high-quality solutions with an average gap of less than 0.1%, while the solving efficiency is increased more than 30%. On large-scale instances, the decomposed model is still worked, while the original MIP model cannot be solved. Besides, by applying the HSSRS, the EVNS can also optimally solve small-scale instances, and yields satisfactory solutions with an average gap below 3.2% on medium and large-scale instances. Meanwhile, the computing efficiency is significantly higher than CPLEX and general genetic algorithm. The computational experiments results indicate that, the proposed decomposition strategy can effectively improve the solvability of the original MIP integrated model. Benefit from the unique characteristic of the RCSRP, the tailored EVNS framework and HSSRS heuristic significantly improve the solving efficiency of the decomposed model, while ensuring the solution quality and convergence. The proposed approach can help port operators to manage RC storage in a more effective manner. Under specific scales and workloads, the proposed model and algorithm could also help managers to determine the equipment configuration in RC storage yards.

Suggested Citation

  • Wang, Wenyuan & Liu, Huakun & Tian, Qi & Xia, Zicheng & Liu, Suri & Peng, Yun, 2024. "An enhanced variable neighborhood search method for refrigerated container stacking and relocation problem with duplicate priorities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
  • Handle: RePEc:eee:transe:v:188:y:2024:i:c:s1366554524002345
    DOI: 10.1016/j.tre.2024.103643
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2024.103643?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. Lee, Der-Horng & Jin, Jian Gang, 2013. "Feeder vessel management at container transshipment terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 201-216.
    2. Chargui, Kaoutar & Zouadi, Tarik & El Fallahi, Abdellah & Reghioui, Mohamed & Aouam, Tarik, 2021. "Berth and quay crane allocation and scheduling with worker performance variability and yard truck deployment in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    3. Hartmann, Sönke, 2013. "Scheduling reefer mechanics at container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 51(C), pages 17-27.
    4. 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.
    5. Jin, Bo & Zhu, Wenbin & Lim, Andrew, 2015. "Solving the container relocation problem by an improved greedy look-ahead heuristic," European Journal of Operational Research, Elsevier, vol. 240(3), pages 837-847.
    6. Hongtao Hu & Ye Zhang & Lu Zhen, 2017. "A two-stage decomposition method on fresh product distribution problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(16), pages 4729-4752, August.
    7. Jiantong Zhang & Yujian Song, 2017. "Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-13, March.
    8. 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.
    9. 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.
    10. Ali Cheaitou & Pierre Cariou, 2012. "Liner shipping service optimisation with reefer containers capacity: an application to northern Europe--South America trade," Maritime Policy & Management, Taylor & Francis Journals, vol. 39(6), pages 589-602, November.
    11. Benantar, A. & Abourraja, M.N. & Boukachour, J. & Boudebous, D. & Duvallet, C., 2020. "On the integration of container availability constraints into daily drayage operations arising in France: Modelling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    12. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    13. 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.
    14. Zhang, Xiunian & Lam, Jasmine Siu Lee, 2018. "Shipping mode choice in cold chain from a value-based management perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 147-167.
    15. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Zhao, Ke & Jin, Jian Gang & Zhang, Di & Ji, Sheng & Lee, Der-Horng, 2023. "A variable neighborhood search heuristic for real-time barge scheduling in a river-to-sea channel with tidal restrictions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    21. Park, Taejin & Choe, Ri & Hun Kim, Young & Ryel Ryu, Kwang, 2011. "Dynamic adjustment of container stacking policy in an automated container terminal," International Journal of Production Economics, Elsevier, vol. 133(1), pages 385-392, September.
    22. Antonella Meneghetti & Sara Ceschia, 2020. "Energy-efficient frozen food transports: the Refrigerated Routing Problem," International Journal of Production Research, Taylor & Francis Journals, vol. 58(14), pages 4164-4181, July.
    23. 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.
    24. Zhang, Canrong & Guan, Hao & Yuan, Yifei & Chen, Weiwei & Wu, Tao, 2020. "Machine learning-driven algorithms for the container relocation problem," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 102-131.
    25. Feng, Xuehao & He, Yucheng & Kim, Kap-Hwan, 2022. "Space planning considering congestion in container terminal yards," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 52-77.
    26. Chen, Lu & Lu, Zhiqiang, 2012. "The storage location assignment problem for outbound containers in a maritime terminal," International Journal of Production Economics, Elsevier, vol. 135(1), pages 73-80.
    27. Baozhen Yao & Chao Chen & Xiaolin Song & Xiaoli Yang, 2019. "Fresh seafood delivery routing problem using an improved ant colony optimization," Annals of Operations Research, Springer, vol. 273(1), pages 163-186, February.
    28. Boschma, René & Mes, Martijn R.K. & de Vries, Leon R., 2023. "Approximate dynamic programming for container stacking," European Journal of Operational Research, Elsevier, vol. 310(1), pages 328-342.
    29. Jian Gang Jin & Der-Horng Lee & Jin Xin Cao, 2016. "Storage Yard Management in Maritime Container Terminals," Transportation Science, INFORMS, vol. 50(4), pages 1300-1313, November.
    30. Akio Imai & Fausto Rivera, 2001. "Strategic fleet size planning for maritime refrigerated containers," Maritime Policy & Management, Taylor & Francis Journals, vol. 28(4), pages 361-374, October.
    31. Kai Wang & Weiwei Liu & Shuaian Wang & Zhiyuan Liu, 2017. "Optimal reefer slot conversion for container freight transportation," Maritime Policy & Management, Taylor & Francis Journals, vol. 44(6), pages 727-743, August.
    32. Feifeng Zheng & Xiaoyi Man & Feng Chu & Ming Liu & Chengbin Chu, 2019. "A two-stage stochastic programming for single yard crane scheduling with uncertain release times of retrieval tasks," International Journal of Production Research, Taylor & Francis Journals, vol. 57(13), pages 4132-4147, July.
    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. 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.
    2. 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).
    3. 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.
    4. 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.
    5. 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).
    6. 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.
    7. Zhang, Xiaoju & Jia, Nan & Song, Dongping & Liu, Baoli, 2024. "Modelling and analyzing the stacking strategies in automated container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    8. 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.
    9. Zhu, Jianxin & Zhang, Weidan & Yu, Lean & Guo, Xinghai, 2024. "A novel multi-attention reinforcement learning for the scheduling of unmanned shipment vessels (USV) in automated container terminals," Omega, Elsevier, vol. 129(C).
    10. 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.
    11. 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.
    12. Tanaka, Shunji & Voß, Stefan, 2019. "An exact algorithm for the block relocation problem with a stowage plan," European Journal of Operational Research, Elsevier, vol. 279(3), pages 767-781.
    13. Gao, Yinping & Zhen, Lu, 2024. "A decision framework for decomposed stowage planning for containers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    14. Zhang, Canrong & Wang, Qi & Yuan, Guoping, 2023. "Novel models and algorithms for location assignment for outbound containers in container terminals," European Journal of Operational Research, Elsevier, vol. 308(2), pages 722-737.
    15. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
    16. 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.
    17. 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).
    18. 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.
    19. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    20. Li, Yiming & Sun, Zhuo & Hong, Soondo, 2024. "An exact algorithm for multiple-equipment integrated scheduling in an automated container terminal using a double-cycling strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(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:188:y:2024:i:c:s1366554524002345. 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.