Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
Year of publication: |
1 January 2018
|
---|---|
Authors: | Tanaka, Shunji ; Tierney, Kevin |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 264.2018, 1 (1.1.), p. 165-180
|
Subject: | OR in maritime industry | Container pre-marshalling | Terminal operations | Containerterminal | Container terminal | Containerschifffahrt | Container shipping | Containerverkehr | Container transport | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Minimizing crane times in pre-marshalling problems
Parreño-Torres, Consuelo, (2020)
-
A GRASP algorithm for the container stowage slot planning problem
Parreño, Francisco, (2016)
-
Target-guided algorithms for the container pre-marshalling problem
Wang, Ning, (2015)
- More ...
-
A branch and bound approach for large pre-marshalling problems
Tanaka, Shunji, (2019)
-
Deep learning assisted heuristic tree search for the container pre-marshalling problem
Hottung, André, (2020)
-
An exact algorithm for the precedence-constrained single-machine scheduling problem
Tanaka, Shunji, (2013)
- More ...