A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
From MaRDI portal
Publication:299777
DOI10.1016/J.EJOR.2014.08.015zbMath1338.90270OpenAlexW2056376603MaRDI QIDQ299777
Andrew E. B. Lim, Wenbin Zhu, Lijun Wei
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.08.015
integer programminggoal-driven searchmultiple container loading cost minimization problemprototype column generation
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
The multiple container loading problem with preference ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ 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 ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ The exact solutions of several types of container loading problems
Uses Software
Cites Work
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- The multiple container loading cost minimization problem
- Weight distribution considerations in container loading
- 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
- A bottleneck assignment approach to the multiple container loading problem
- 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
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- Neighborhood structures for the container loading problem: a VNS implementation
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- 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
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- The Three-Dimensional Bin Packing Problem
This page was built for publication: A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
