An Improved Path Optimum Algorithm for Container Relocation Problems in Port Terminals Worldwide

A. Wang, Fahad Mehmood (), Y.T. Mohmand and S. Zheng
Additional contact information
Fahad Mehmood: Métis Lab EM Normandie - EM Normandie - École de Management de Normandie = EM Normandie Business School
S. Zheng: MM - Multimédia - LTCI - Laboratoire Traitement et Communication de l'Information - IMT - Institut Mines-Télécom [Paris] - Télécom Paris - IMT - Institut Mines-Télécom [Paris] - IP Paris - Institut Polytechnique de Paris, IDS - Département Images, Données, Signal - Télécom ParisTech

Post-Print from HAL

Abstract: The container relocation problem (CRP) for ports worldwide has been a highly significant research topic because of its contribution to the improvement of yard-running efficiency. It can be defined as a sequence that allows each container to be extracted with the least number of relocations when identical containers in a cluster have been stacked in a block. This study differs from previous research mainly in five aspects: (1) a two-level goal programming model for CRP is presented that can help in understanding of this problem and provide a solid theoretical ground for this research; (2) because of the NP time hardness of the CRP, heuristic rules are proposed to reduce hunting space by the way of dividing solution space; (3) an improved path optimum algorithm (I-POA) is proposed to reduce unfeasible solutions and find a high-quality solution for any three-dimensional case in a shorter running time; (4) the numerical experiments show that the algorithm proposed in this research achieves better performance than similar algorithms because of its higher levels of efficiency and more robust property; and (5) a general expression for the utilization level of the storage area and the number of relocations is proposed to check the reliability of the result by conducting a sensitivity analysis. Based on this research, the following conclusion can be obtained: I-POA possesses significant practical value in the improvement of intelligent resource scheduling standards of coastal container ports worldwide. \textcopyright 2018 Coastal Education and Research Foundation, Inc.

Keywords: Extractive sequence; general expression; heuristic rules; least number of relocations; two-level goal programming model (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Published in Journal of Coastal Research, 2018, 34 (3), pp.752--765. ⟨10.2112/JCOASTRES-D-17-00056.1⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-04317826

DOI: 10.2112/JCOASTRES-D-17-00056.1

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().