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

Authors:
Takashi Imamichi;Mutsunori Yagiura;Hiroshi Nagamochi
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Yoshida hommachi, Sakyo-ku, Kyoto 606-8501, Japan;Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Furocho, Chikusa-ku, Nagoya 464-8603, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Yoshida hommachi, Sakyo-ku, Kyoto 606-8501, Japan
Venue:
Discrete Optimization
Year:
2009

Citing 10
Cited 4

A Linear time algorithm for computing the Voronoi diagram of a convex polygon

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the limited memory BFGS method for large scale optimization

Mathematical Programming: Series A and B
An algorithm to compute the Minkowski sum outer-face of two simple polygons

Proceedings of the twelfth annual symposium on Computational geometry
The irregular cutting-stock problem mdash; a new procedure for deriving the no-fit polygon

Computers and Operations Research
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

Artificial Intelligence Review
Penetration depth of two convex polytopes in 3D

Nordic Journal of Computing
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion

IEEE Transactions on Visualization and Computer Graphics
Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting

Management Science
A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

Operations Research
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications

A heuristic approach for packing identical rectangles in convex regions

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

Computers and Operations Research
An algorithm for the strip packing problem using collision free region and exact fitting placement

Computer-Aided Design
Collision free region determination by modified polygonal Boolean operations

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

The irregular strip packing problem is a combinatorial optimization problem that requires to place a given set of two-dimensional polygons within a rectangular container so that no polygon overlaps with other polygons or protrudes from the container, where each polygon is not necessarily convex. The container has a fixed width, while its length can change so that all polygons are placed in it. The objective is to find a layout of the set of polygons that minimizes the length of the container. We propose an algorithm that separates overlapping polygons based on nonlinear programming, and an algorithm that swaps two polygons in a layout so as to find their new positions in the layout with the least overlap. We incorporate these algorithms as components into an iterated local search algorithm for the overlap minimization problem and then develop an algorithm for the irregular strip packing problem using the iterated local search algorithm. Computational comparisons on representative instances disclose that our algorithm is competitive with other existing algorithms. Moreover, our algorithm updates several best known results.