A squeaky wheel optimisation methodology for two-dimensional strip packing

DOI10.1016/J.COR.2010.10.005zbMATH Open1205.90240OpenAlexW1964092627MaRDI QIDQ622159FDOQ622159

Authors: Matthew R. Hyde, Graham Kendall, Edmund K. 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

Recommendations

• A simple randomized algorithm for two-dimensional strip packing
• Two-dimensional packing problems: a survey
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• An effective shaking procedure for 2D and 3D strip packing problems

zbMATH Keywords

heuristicslocal searchartificial intelligencecutting stock

Mathematics Subject Classification ID

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

Cites Work

• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• On genetic algorithms for the packing of polygons
• An improved typology of cutting and packing problems
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Lower bounds for on-line two-dimensional packing algorithms
• Two-dimensional packing problems: a survey
• Orthogonal Packings in Two Dimensions
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• A typology of cutting and packing problems
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A new heuristic recursive algorithm for the strip rectangular packing 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
• Two-Dimensional Finite Bin-Packing Algorithms
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A branch and bound algorithm for the strip packing problem
• Packing problems
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• A two-dimensional strip cutting problem with sequencing constraint
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Reactive GRASP for the strip-packing problem
• Title not available (Why is that?)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• A new constraint programming approach for the orthogonal packing problem
• An application of simulated annealing to the cutting stock problem

Cited In (10)

• Exact solution techniques for two-dimensional cutting and packing
• A simple randomized algorithm for two-dimensional strip packing
• Peak demand minimization via sliced strip packing
• Upper bounds for heuristic approaches to the strip packing problem
• Combinatorial Benders' cuts for the strip packing problem
• An effective shaking procedure for 2D and 3D strip packing problems
• An exact strip packing algorithm based on canonical forms
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
• An efficient deterministic heuristic for two-dimensional rectangular packing
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem

This page was built for publication: A squeaky wheel optimisation methodology for two-dimensional strip packing

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