A squeaky wheel optimisation methodology for two-dimensional strip packing
From MaRDI portal
Publication:622159
DOI10.1016/j.cor.2010.10.005zbMath1205.90240OpenAlexW1964092627MaRDI QIDQ622159
Graham Kendall, Matthew R. Hyde, Edmund Kieran Burke
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.005
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An effective shaking procedure for 2D and 3D strip packing problems ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Upper bounds for heuristic approaches to the strip packing problem
Cites Work
- Unnamed Item
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Reactive GRASP for the strip-packing problem
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An application of simulated annealing to the cutting stock problem
- Lower bounds for on-line two-dimensional packing algorithms
- Packing problems
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- A new constraint programming approach for the orthogonal packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- A two-dimensional strip cutting problem with sequencing constraint
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
