A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Year of publication: |
2023
|
---|---|
Authors: | Araya, Ignacio ; Toledo, Martín |
Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 23.2023, 3, Art.-No. 51, p. 1-29
|
Subject: | (O) Combinatorial optimization | Beam search transportation | Constructive algorithms | Container premarshalling problem | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Containerverkehr | Container transport | Containerterminal | Container terminal | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem | Tourenplanung | Vehicle routing problem |
-
A reactive GRASP algorithm for the container loading problem with load-bearing constraints
Alonso, Maria Teresa, (2015)
-
Anghinolfi, Davide, (2017)
-
Integrated drayage scheduling problem with stochastic container packing and unpacking times
Shiri, Samaneh, (2019)
- More ...
-
A beam search approach to the container loading problem
Araya, Ignacio, (2014)
-
A beam search algorithm for the biobjective container loading problem
Araya, Ignacio, (2020)
-
VCS : a new heuristic function for selecting boxes in the single container loading problem
Araya, Ignacio, (2017)
- More ...