Algorithms for nesting with defects

DOI10.1016/j.dam.2012.03.026zbMath1303.90084OpenAlexW2065009499WikidataQ59195720 ScholiaQ59195720MaRDI QIDQ406491

Vittorio Maniezzo, Maurizio Ganovelli, Roberto Baldacci, Marco Antonio Boschetti

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.026

zbMATH Keywords

guided local searchsubgradient optimizationdefected masternesting problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

Robust mixed-integer linear programming models for the irregular strip packing problem ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ Decomposition Algorithm for Irregular Placement Problems ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Descending packing algorithm for irregular graphics based on geometric feature points ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Irregular packing problems: a review of mathematical models ⋮ Exact approaches for the cutting path determination problem ⋮ A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

Uses Software

• TOPOS

Cites Work

• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• 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
• A beam search implementation for the irregular shape packing problem
• Solution approaches to irregular nesting problems
• On genetic algorithms for the packing of polygons
• Applied simulated annealing
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• TOPOS -- A new constructive algorithm for nesting problems
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• A 2-exchange heuristic for nesting problems
• \(\Phi\)-functions for complex 2D-objects
• The nesting problem in the leather manufacturing industry
• Mathematical model and efficient algorithms for object packing problem
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• 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
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Irregular Packing Using the Line and Arc No-Fit Polygon
• Jostling for position: local improvement for irregular cutting patterns
• New approaches for the nesting of two-dimensional shapes for press tool design
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• Two-Dimensional Finite Bin-Packing Algorithms
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Guided Local Search

This page was built for publication: Algorithms for nesting with defects