.png){kind=icon}
.png){kind=icon}
Return
A beam search algorithm for minimizing crane times in premarshalling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2022.01.038.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The premarshalling problem consists of sorting the containers placed in a bay of the container yard so that they can be retrieved in the order in which they will be required. We study the premarshalling problem with crane time minimization objective and develop a beam search algorithm, with some new elements adapted to the characteristics of the problem, to solve it. We propose various evaluation criteria, depending on the type of container movement, for its local evaluation; a new heuristic algorithm including local search for blue its global evaluation; and several new dominance rules. The computational study shows the contribution of each new element. The performance of the complete algorithm is tested on well-known benchmarks. The beam search algorithm matches all known optimal solutions, improves on the known suboptimal solutions, and obtains solutions for the largest instances, for which no solution had previously been found. (C) 2022 The Author(s). Published by Elsevier B.V.
Keywords:
Logistics
Container premarshalling
Crane time
Beam search
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W