An effective shaking procedure for 2D and 3D strip packing problems

DOI10.1016/J.COR.2013.05.017MaRDI QIDQ336597zbMATH OpenOpenAlexFDO

Authors T. Wauters, Jannes Verstichel, Greet Vanden Berghe

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.05.017

zbMATH Keywords

heuristicsstrip packingbottom-left-fill

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Upper bounds for heuristic approaches to the strip packing problem
• A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
• An exact algorithm for the two-dimensional strip-packing problem
• A heuristic for the three-dimensional strip packing problem
• An exact approach to the strip-packing problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
• A heuristic for the three-dimensional strip packing problem
• A hybrid placement strategy for the three-dimensional strip packing problem
• A simple randomized algorithm for two-dimensional strip packing
• A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
• A squeaky wheel optimisation methodology for two-dimensional strip packing
• A typology of cutting and packing problems
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An improved typology of cutting and packing problems
• An iterative scheduling technique for resource-constrained project scheduling
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
• Guillotineable bin packing: A genetic approach
• Heuristics for the container loading problem
• On genetic algorithms for the packing of polygons
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Orthogonal Packings in Two Dimensions
• Packing problems
• Reactive GRASP for the strip-packing problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• Two-dimensional packing problems: a survey

Cited in

(5)

• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
• Effective loading in combined vehicle routing and container loading problems
• Upper bounds for heuristic approaches to the strip packing problem
• A squeaky wheel optimisation methodology for two-dimensional strip packing
• Order and static stability into the strip packing problem

This page was built for publication: An effective shaking procedure for 2D and 3D strip packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336597)