A hybrid placement strategy for the three-dimensional strip packing problem

DOI10.1016/j.ejor.2010.09.023zbMath1205.90238MaRDI QIDQ621967

Graham Kendall, Sam D. Allen, Edmund Kieran Burke

Publication date: 31 January 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.2010.09.023

zbMATH Keywords

heuristics; metaheuristics; cutting/packing

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

An effective shaking procedure for 2D and 3D strip packing problems, An effective heuristic for the two-dimensional irregular bin packing problem, A space-indexed formulation of packing boxes into a larger box, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP, A global search framework for practical three-dimensional packing with variable carton orientations, A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint, A reference length approach for the 3D strip packing problem, Effective loading in combined vehicle routing and container loading problems, Order and static stability into the strip packing problem, The exact solutions of several types of container loading problems, Constraints in container loading -- a state-of-the-art review, A comparative review of 3D container loading algorithms, Data Structures for Higher-Dimensional Rectilinear Packing

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of simulated annealing to the cutting stock problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• An improved typology of cutting and packing problems
• A heuristic for the three-dimensional strip packing problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A parallel hybrid local search algorithm for the container loading problem
• On Three-Dimensional Packing
• An asymptotic approximation algorithm for 3D-strip packing
• Orthogonal Packings in Two Dimensions
• Heuristic algorithms for on-line packing in three dimensions
• An Application of Bin-Packing to Multiprocessor Scheduling
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• LATIN 2004: Theoretical Informatics