An average-case asymptotic analysis of the Container Relocation Problem

The Container Relocation Problem (CRP) involves finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers in a given order. In this paper, we focus on average case analysis of the CRP when the number of columns grows asymptotically. We show...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 44; no. 6; pp. 723 - 728
Main Authors Galle, V., Boroujeni, S. Borjian, Manshadi, V.H., Barnhart, C., Jaillet, P.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.11.2016
Subjects
Asymptotic analysis
CRP
Expected lower bound
CRP
Asymptotic analysis
Expected lower bound
Online AccessGet full text

Cover

More Information
Summary:The Container Relocation Problem (CRP) involves finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers in a given order. In this paper, we focus on average case analysis of the CRP when the number of columns grows asymptotically. We show that the expected minimum number of relocations converges to a simple and intuitive lower-bound for which we give an analytical formula.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2016.08.006