Pre-processing a container yard under limited available time
To pick up a container from a container terminal, other containers may need to be relocated to other positions. In practice, these relocation moves are usually done when it is busy at a terminal. However, if the crane is idle for some amount of time, it may be more efficient to execute some pre-processing moves to reduce the number of future relocation moves. In this paper, the authors propose a model for optimal pre-processing moves if the available time is limited. The authors develop a heuristic to produce fast solutions for this new optimization problem. This heuristic consists out of multiple phases and for each phase, two different approaches are possible, and thus, the heuristic produces multiple solutions. Besides that, an optimal branch-and-bound algorithm is presented. Third, the authors propose another heuristic in which the remaining relocation moves are estimated in a sub-optimal way in the branch-and-bound method. This algorithm is not guaranteed to find the optimal solution, but its running time is faster than the optimal branch-and-bound method. Finally, the authors give an integer linear program that can be used to extend these solutions for a single bay of containers to a complete yard of containers.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/1793974
-
Supplemental Notes:
- © 2020 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
-
Authors:
- Zweers, Bernard G
-
0000-0003-2477-1291
- Bhulai, Sandjai
-
0000-0003-1124-8821
- van der Mei, Rob D
- Publication Date: 2020-11
Language
- English
Media Info
- Media Type: Web
- Features: Appendices; Figures; References; Tables;
- Pagination: 105045
-
Serial:
- Computers & Operations Research
- Volume: 123
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0305-0548
- Serial URL: https://www.sciencedirect.com/journal/computers-and-operations-research
Subject/Index Terms
- TRT Terms: Branch and bound algorithms; Container handling; Container terminals; Heuristic methods; Terminal operations
- Subject Areas: Freight Transportation; Operations and Traffic Management; Planning and Forecasting;
Filing Info
- Accession Number: 01839431
- Record Type: Publication
- Files: TRIS
- Created Date: Mar 23 2022 10:52AM