The multiple container loading cost minimization problem
From MaRDI portal
Publication:635154
DOI10.1016/j.ejor.2011.04.017zbMath1226.90085OpenAlexW1998992748MaRDI QIDQ635154
Weili Huang, Wenbin Zhu, Chan Hou Che, Andrew E. B. Lim
Publication date: 19 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.017
Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items (17)
A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ The multiple container loading problem with preference ⋮ Solving a large multicontainer loading problem in the car manufacturing industry ⋮ A new iterative-doubling greedy-lookahead algorithm for the single container loading problem ⋮ Space defragmentation for packing problems ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ Minimizing late deliveries in a truck loading problem ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ Constraints in container loading -- a state-of-the-art review
Uses Software
Cites Work
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A heuristic for multiple container loading problems
- An efficient approach for the multi-pallet loading problem
- Solving container loading problems by block arrangement
- Heuristic algorithms for the three-dimensional bin packing problem
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- A bottleneck assignment approach to the multiple container loading problem
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Container loading with multi-drop constraints
- The Three-Dimensional Bin Packing Problem
- The G4-Heuristic for the Pallet Loading Problem
- Loading Multiple Pallets
This page was built for publication: The multiple container loading cost minimization problem
