A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
From MaRDI portal
Publication:1926951
DOI10.1016/j.ejor.2012.04.036zbMath1253.90015OpenAlexW1986685337MaRDI QIDQ1926951
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.036
Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ The multiple container loading problem with preference ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ A beam search approach to the container loading problem ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ A beam search algorithm for the biobjective container loading problem ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ A two-stage packing problem procedure ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A fast implementation for the 2D/3D box placement problem ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions ⋮ A comparative review of 3D container loading algorithms ⋮ A two-phase approach for single container loading with weakly heterogeneous boxes ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem
Cites Work
- The multiple container loading cost minimization problem
- An efficient placement heuristic for three-dimensional rectangular packing
- Weight distribution considerations in container loading
- Heuristic algorithms for the multiple knapsack problem
- Allowing for weight considerations in container loading
- An efficient approach for the multi-pallet loading problem
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Three-dimensional packing of items with limited load bearing strength
- An improved typology of cutting and packing problems
- A Tree Search Algorithm for Solving the Container Loading Problem
- 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
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Genetic Algorithm for Solving the Container Loading Problem
- Loading Multiple Pallets
- A hybrid genetic algorithm for the container loading problem
