Silva, Marcos de Melo da, Erdoğan, Güneş, Battarra, Maria and Strusevich, Vitaly (2017) The block retrieval problem. European Journal of Operational Research, 265 (3). pp. 931-950. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2017.08.048)

Preview

PDF (Author Accepted Manuscript) 20041 STRUSEVICH_The_Block_Retrieval_Problem_2017.pdf - Accepted Version Download (922kB) | Preview

Abstract

Retrieving containers from a bay in a port terminal yard is a time consuming activity. The Block Retrieval Problem (BRTP) aims at minimizing the number of relocations, the unproductive moves of hindering con- tainers, while retrieving target containers belonging to a customer. The choice of relocations leads to alternative bay configurations, some of which would minimize the relocations of forthcoming retrievals. The Bi-objective Block Retrieval Problem (2BRTP) includes a secondary objective, the minimization of the expected number of relocations for retrieving the containers of the next customer. This paper pro- vides N P -Hardness proofs for both the BRTP and 2BRTP. A branch-and-bound algorithm and a linear time heuristic are developed for the BRTP; a branch-and-bound algorithm and a beam search algorithm are presented for the 2BRTP. Extensive computational tests on randomly generated instances as well as instances adapted from the literature are performed, and the results are presented.

Item Type:	Article
Uncontrolled Keywords:	Combinatorial optimization; Container terminals; Import containers; Branch-and-bound
Subjects:	Q Science > QA Mathematics
Faculty / School / Research Centre / Research Group:	Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS) Faculty of Engineering & Science
Last Modified:	04 Mar 2022 13:07
URI:	http://gala.gre.ac.uk/id/eprint/20041

Actions (login required)

View Item

Downloads