Compaction and separation algorithms for non-convex polygons and their applications

DOI10.1016/0377-2217(95)00021-HzbMath1127.90403MaRDI QIDQ1127207

Victor J. Milenkovic, Zhen-Yu Li

Publication date: 13 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (32)

Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums ⋮ The geometry of nesting problems: a tutorial ⋮ An improved typology of cutting and packing problems ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ A moment based metric for 2-D and 3-D packing ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ A fully general, exact algorithm for nesting irregular shapes ⋮ Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem ⋮ Layout optimization for the objects located within a rotating vessel -- a three-dimensional packing problem with behavioral constraints ⋮ A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Mixed-integer programming models for nesting problems ⋮ An object-based evolutionary algorithm for solving nesting problems ⋮ Two-dimensional profile-packing approach for multi-torch flame cutting ⋮ Irregular packing problems: a review of mathematical models ⋮ Rotational polygon overlap minimization and compaction ⋮ A heuristic algorithm for solving triangle packing problem ⋮ Raster penetration map applied to the irregular packing problem ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem ⋮ A method of optimal lattice packing of congruent oriented polygons in the plane ⋮ A 2-exchange heuristic for nesting problems ⋮ An algorithm for polygon placement using a bottom-left strategy ⋮ The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. ⋮ Densest translational lattice packing of non-convex polygons ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Robust polygon modelling
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Multiple translational containment. I: An approximate algorithm
• A typology of cutting and packing problems
• Relationships between nondeterministic and deterministic tape complexities
• On the solution of inequality systems relevant to IC-layout
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

This page was built for publication: Compaction and separation algorithms for non-convex polygons and their applications