An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

DOI10.1016/j.disopt.2009.04.002zbMath1179.90285OpenAlexW2069382764MaRDI QIDQ1040080

Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi

Publication date: 23 November 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/85223

zbMATH Keywords

iterated local searchno-fit polygonirregular strip packing problemunconstrained nonlinear programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (15)

Robust mixed-integer linear programming models for the irregular strip packing problem ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints ⋮ 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 ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem ⋮ Irregular packing problems: a review of mathematical models ⋮ Raster penetration map applied to the irregular packing problem ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ Heuristics for container loading of furniture ⋮ 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
• L-BFGS

Cites Work

• Unnamed Item
• Unnamed Item
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• On the limited memory BFGS method for large scale optimization
• Compaction and separation algorithms for non-convex polygons and their applications
• Finding the medial axis of a simple polygon in linear time
• TOPOS -- A new constructive algorithm for nesting problems
• 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
• A 2-exchange heuristic for nesting problems
• Computing the intersection-depth to polyhedra
• Fast neighborhood search for two- and three-dimensional nesting problems
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

This page was built for publication: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem