25 Citations (SciVal)
69 Downloads (Pure)


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 containers, 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 provides NP-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.
Original languageEnglish
Pages (from-to)931-950
Number of pages20
JournalEuropean Journal of Operational Research
Issue number3
Early online date8 Sept 2017
Publication statusPublished - 16 Mar 2018

Bibliographical note

Ref.: Ms. No. EJOR-D-17-00027R1
The Block Retrieval Problem
European Journal of Operational Research

Dear Dr. Gunes Erdogan,

I am pleased to inform you that your paper has been accepted for publication in the European Journal of Operational Research.

The PDF file of the final version of your article will be available on ScienceDirect shortly after the corrections to the proofs have been received by Elsevier. I suggest that you read them carefully and check them once more against the original; you are the only one responsible for doing this. Together with the proofs you will receive an order form for reprints.

Your paper from now on is no longer under my control. Please, address queries only to the Journal Manager:
Kate Partner
E-Mail: K.Partner@elsevier.com


Dive into the research topics of 'The Block Retrieval Problem'. Together they form a unique fingerprint.

Cite this