.png){kind=icon}
.png){kind=icon}
Return
An algorithm with performance guarantee for the Online Container Relocation Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.09.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces and investigates the Online Container Relocation Problem, where containers have to be retrieved from a bay in a container terminal so as to minimize the number of relocations. Unlike the offline version of the problem, the order of container retrievals is revealed one at a time in an online fashion. We analyze the so-called leveling heuristic using the perspective of worst-case competitive analysis of online algorithms and derive its competitive ratio. We then provide some computational experiments which give insights on the actual average performance of the heuristic. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Container terminal
Algorithm with performance guarantee
Container relocation
Online algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W