An average-case asymptotic analysis of the Container Relocation Problem

Author(s)
Manshadi, V.H.; Galle, Virgile; Borjian Boroujeni, Setareh; Barnhart, Cynthia; Jaillet, Patrick
Thumbnail
Download2016 08 elsarticle-template-num - final.pdf (570.0Kb)
PUBLISHER_CC
Terms of use
Creative Commons Attribution-NonCommercial-NoDerivs License http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
Abstract
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. Keywords: CRP; Asymptotic analysis; Expected lower bound
Date issued
2016-09
URI
http://hdl.handle.net/1721.1/118934
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Journal
Operations Research Letters
Publisher
Elsevier
Citation
Galle, V. et al. “An Average-Case Asymptotic Analysis of the Container Relocation Problem.” Operations Research Letters 44, 6 (November 2016): 723–728 © 2016 Elsevier B.V.
Version: Author's final manuscript
ISSN
0167-6377
Collections