A squeaky wheel optimisation methodology for two-dimensional strip packing
type: Item
instance of: scholarly article
title: A squeaky wheel optimisation methodology for two-dimensional strip packing
zbMATH Open document ID: 1205.90240
author: Matthew R. Hyde
author: Graham Kendall
author: Edmund K. Burke
published in: Computers \& Operations Research
publication date: 2011-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5843114
zbMATH Keywords: cutting stock
zbMATH Keywords: heuristics
zbMATH Keywords: local search
zbMATH Keywords: artificial intelligence
MaRDI profile type: Publication
full work available at URL: j.cor.2010.10.005
OpenAlex ID: W1964092627
cites work: A typology of cutting and packing problems
cites work: An improved typology of cutting and packing problems
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
cites work: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
cites work: Reactive GRASP for the strip-packing problem
cites work: One-dimensional heuristics adapted for two-dimensional rectangular strip packing
cites work: Q4252525
cites work: Packing problems
cites work: Two-dimensional packing problems: a survey
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations
cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem
cites work: A branch and bound algorithm for the strip packing problem
cites work: Orthogonal Packings in Two Dimensions
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: Lower bounds for on-line two-dimensional packing algorithms
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: A new heuristic recursive algorithm for the strip rectangular packing problem
cites work: A two-dimensional strip cutting problem with sequencing constraint
cites work: Bidirectional best-fit heuristic for orthogonal rectangular strip packing
cites work: On genetic algorithms for the packing of polygons
cites work: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
cites work: Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
cites work: An application of simulated annealing to the cutting stock problem
cites work: An exact approach to the strip-packing problem
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Two-Dimensional Finite Bin-Packing Algorithms
DOI: 10.1016/J.COR.2010.10.005
description: scientific article; zbMATH DE number 5843114