EconPapers    
Economics at your fingertips  
 

Container Pre-Marshaling Problem with Uncertain Intra-Group Retrievals

Ning Wang, Jiahuan Chen (), Zhihao Jiang () and Lili Yu ()
Additional contact information
Ning Wang: School of Management, Shanghai University, Shanghai 200444, P. R. China
Jiahuan Chen: School of Management, Shanghai University, Shanghai 200444, P. R. China
Zhihao Jiang: School of Management, Shanghai University, Shanghai 200444, P. R. China
Lili Yu: School of Management, Shanghai University, Shanghai 200444, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2025, vol. 42, issue 03, 1-21

Abstract: In real-world terminals, containers are divided into multiple groups according to the reservation time. The container retrieval order between different groups is known, while the retrieval order within the same group is unknown. Previous research studies prioritize between groups but seldom prioritize within the same group, especially uncertain intra-group priorities. This paper studies the container pre-marshaling problem with uncertain intra-group retrievals (CPMP-UIR). Since the retrieval order of intra-group containers is uncertain, after the pre-marshaling, containers still need to be relocated during retrieval. CPMP-UIR conducts pre-marshaling, ensuring no relocations between groups and a minimum expected number of overstows during retrieval. In this paper, we first give the formula for calculating the expected number of overstows in a layout. The value obtained by the formula is a lower bound for the expected number of relocations. Second, we develop an algorithm called the Expected Overstow-based Heuristic (EOH) for solving CPMP-UIR. In addition, a hard-enough dataset is generated to evaluate the performance of EOH. Finally, our numerical experiments show that the expected number of overstows during the retrieval phase is reduced dramatically after the pre-marshaling.

Keywords: Container pre-marshaling problem; uncertain intra-group retrievals; the expected number of overstows; heuristic algorithm (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595924500179
Access to full text is restricted to subscribers

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:wsi:apjorx:v:42:y:2025:i:03:n:s0217595924500179

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595924500179

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().

 
Page updated 2025-06-14
Handle: RePEc:wsi:apjorx:v:42:y:2025:i:03:n:s0217595924500179