Solving the irregular strip packing problem via guided local search for overlap minimization
From MaRDI portal
Publication:3401324
DOI10.1111/j.1475-3995.2009.00707.xzbMath1179.90293OpenAlexW2025291444MaRDI QIDQ3401324
Koji Nonobe, Toshihide Ibaraki, Takashi Imamichi, Shunji Umetani, Mutsunori Yagiura, Shinji Imahori
Publication date: 29 January 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00707.x
Related Items (9)
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 ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ A personal perspective on problem solving by general purpose solvers ⋮ Mixed-integer programming models for nesting problems ⋮ Raster penetration map applied to the irregular packing problem ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
Cites Work
- Unnamed Item
- 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
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Compaction and separation algorithms for non-convex polygons and their applications
- Triangulating 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.
- Guided local search and its application to the traveling salesman problem
- A 2-exchange heuristic for nesting problems
- An algorithm for polygon placement using a bottom-left strategy
- Computing the intersection-depth to polyhedra
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- An improved method for calculating the no-fit polygon
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A tabu thresholding implementation for the irregular stock cutting problem
This page was built for publication: Solving the irregular strip packing problem via guided local search for overlap minimization
