透過您的圖書館登入
IP:216.73.216.60
  • 期刊

A New Algorithm for the Container Pre-marshalling Problem

摘要


Container pre-marshalling is a kind of transportation operation. In container terminal operation, containers are usually stacked with a certain number of layers. If the containers to be picked up are pressed down by other containers, the barrier boxes on them must be removed at this time. Due to the uncertainty in wharf operation, unpacking is almost inevitable. The average number of unpacking is an indicator to measure the level of wharf operation management. Different from previous literature, this paper designs a new algorithm to solve this problem by integrating heuristic algorithm and rule constraint. All kinds of indicators to evaluate the current layout are used as the coding part of the genetic algorithm, and the whole unpacking process is realized by constantly iterating to find the appropriate weight coefficient and emptying the stack rules. Finally, an example is given to prove the effectiveness of the algorithm.

參考文獻


Lee Y, Chao S L. A neighborhood search heuristic for pre-marshalling export containers[J]. European Journal of Operational Research, 2009, 196(2):468-475.
Hottung A, Tierney K. A biased random-key genetic algorithm for the container pre-marshalling problem [J]. Computers & Operations Research, 2016, 75(nov.):83-102.
Tierney K, Pacino D, Vo S. Solving the Pre-Marshalling Problem to Optimality with A* and IDA*[J]. Flexible Services and Manufacturing Journal, 2014:223-259.
Huang S H, Lin T H. Heuristic algorithms for container pre-marshalling problems[J]. Computers & Industrial Engineering, 2012, 62(1):13-20.
Wang N, Jin B, Zhang Z, et al. A feasibility-based heuristic for the container pre-marshalling problem[J]. European Journal of Operational Research, 2017, 256(1):90-101.

延伸閱讀