Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
type: Item
instance of: scholarly article
title: Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
zbMATH Open document ID: 1251.90244
author: Stephen C. H. Leung
author: Yangbin Lin
author: Defu Zhang
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107500
zbMATH Keywords: irregular strip packing problem
zbMATH Keywords: nesting
zbMATH Keywords: local search
zbMATH Keywords: unconstrained nonlinear programming
zbMATH Keywords: tabu search
describes a project that uses: TOPOS
MaRDI profile type: Publication
full work available at URL: j.cor.2011.05.025
OpenAlex ID: W2138403652
cites work: A review of the application of meta-heuristic algorithms to 2D strip packing problems
cites work: The geometry of nesting problems: a tutorial
cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: Fast neighborhood search for two- and three-dimensional nesting problems
cites work: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
cites work: A 2-exchange heuristic for nesting problems
cites work: Jostling for position: local improvement for irregular cutting patterns
cites work: The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
cites work: Complete and robust no-fit polygon generation for the irregular stock cutting problem
cites work: Computing the intersection-depth to polyhedra
cites work: Compaction and separation algorithms for non-convex polygons and their applications
cites work: Future paths for integer programming and links to artificial intelligence
DOI: 10.1016/J.COR.2011.05.025
Recommended article: Q5318691
Recommended article: Solving the irregular strip packing problem via guided local search for overlap minimization
Recommended article: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
Recommended article: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
Recommended article: An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
Recommended article: A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
Recommended article: A hybrid metaheuristic for the two-dimensional strip packing problem
Recommended article: An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
description: scientific article; zbMATH DE number 6107500