A multi-round partial beam search approach for the single container loading problem with shipment priority
Year of publication: |
2013
|
---|---|
Authors: | Wang, Ning ; Lim, Andrew ; Zhu, Wenbin |
Published in: |
International journal of production economics. - Amsterdam [u.a.] : Elsevier, ISSN 0925-5273, ZDB-ID 1092526-0. - Vol. 145.2013, 2, p. 531-540
|
Subject: | Packing | Single container loading | Shipment priority | Beam search | Full-support constraint | Packproblem | Packing problem | Heuristik | Heuristics | Containerverkehr | Container transport | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
Silva, Allyson, (2021)
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
-
Modeling soft unloading constraints in the multi-drop container loading problem
Bonet Filella, Guillem, (2023)
- More ...
-
The multiple container loading cost minimization problem
Che, Chan Hou, (2011)
-
A skyline heuristic for the 2D rectangular packing and strip packing problems
Wei, Lijun, (2011)
-
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
Zhu, Wenbin, (2012)
- More ...