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.

    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.

    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.