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 | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Containerverkehr | Container transport | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Containerterminal | Container terminal | Packproblem | Packing problem | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming |
-
Silva, Allyson, (2021)
-
Modeling soft unloading constraints in the multi-drop container loading problem
Bonet Filella, Guillem, (2023)
-
Target-guided algorithms for the container pre-marshalling problem
Wang, Ning, (2015)
- More ...
-
Upper bounding in inner regions for global optimization under inequality constraints
Araya, Ignacio, (2014)
-
A beam search approach to the container loading problem
Araya, Ignacio, (2014)
-
VCS : a new heuristic function for selecting boxes in the single container loading problem
Araya, Ignacio, (2017)
- More ...