Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

DOI10.1016/j.cor.2011.05.025zbMath1251.90244OpenAlexW2138403652MaRDI QIDQ1762025

Stephen C. H. Leung, Defu Zhang, Yangbin Lin

Publication date: 15 November 2012

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

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

zbMATH Keywords

tabu searchlocal searchnestingirregular strip packing problemunconstrained nonlinear programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (10)

Robust mixed-integer linear programming models for the irregular strip packing problem ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ Dealing with nonregular shapes packing ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Raster penetration map applied to the irregular packing problem ⋮ A hybrid chaos firefly algorithm for three-dimensional irregular packing problem ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering

Uses Software

• TOPOS

Cites Work

• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Compaction and separation algorithms for non-convex polygons and their applications
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• Future paths for integer programming and links to artificial intelligence
• A 2-exchange heuristic for nesting problems
• Computing the intersection-depth to polyhedra
• The geometry of nesting problems: a tutorial
• Fast neighborhood search for two- and three-dimensional nesting problems
• Jostling for position: local improvement for irregular cutting patterns
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

This page was built for publication: Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem