Solution approaches to irregular nesting problems

DOI10.1016/0377-2217(95)00019-MzbMATH Open0918.90116MaRDI QIDQ1127203FDOQ1127203

Authors: K. Dowsland, William B. Dowsland 

Publication date: 13 August 1998

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

Recommendations

• The geometry of nesting problems: a tutorial
• Irregular packing problems: a review of mathematical models
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• The irregular nesting problem involving triangles and rectangles
• scientific article; zbMATH DE number 2111993

zbMATH Keywords

surveyheuristicspackingnesting of irregularly shaped pieces

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• Title not available (Why is that?)
• Applied simulated annealing
• Title not available (Why is that?)
• Packing problems
• Modeling of packing problems
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Title not available (Why is that?)
• Jostling for position: local improvement for irregular cutting patterns
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• New approaches for the nesting of two-dimensional shapes for press tool design
• Composite stock cutting through simulated annealing
• Title not available (Why is that?)
• Performance testing of rectangular parts-nesting heuristics
• Title not available (Why is that?)

Cited In (39)

• Packaging optimization using the dynamic vector fields method
• Irregular packing: MILP model based on a polygonal enclosure
• Exact solution techniques for two-dimensional cutting and packing
• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
• A new algorithm for the two-polygon containment problem
• Solving nesting problems with non-convex polygons by constraint logic programming
• Covering polygons with rectangles
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
• Alternative formulations for a layout problem in the fashion industry
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
• Title not available (Why is that?)
• A tutorial in irregular shape packing problems
• Cut scheduling in the apparel industry
• The irregular nesting problem involving triangles and rectangles
• A clique covering MIP model for the irregular strip packing problem
• Irregular packing problems: a review of mathematical models
• Mixed-integer programming models for nesting problems
• Densest translational lattice packing of non-convex polygons
• Algorithms for nesting with defects
• Fast neighborhood search for two- and three-dimensional nesting problems
• A customized branch-and-bound approach for irregular shape nesting
• An effective heuristic for the two-dimensional irregular bin packing problem
• Rotational polygon overlap minimization and compaction
• Translational packing of arbitrary polytopes
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
• Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle
• Optimal clustering of a pair of irregular objects
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
• Heuristics for a dynamic rural postman problem
• A fully general, exact algorithm for nesting irregular shapes
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• An object-based evolutionary algorithm for solving nesting problems
• A simulated annealing approach for the circular cutting problem
• Computing closely matching upper and lower bounds on textile nesting problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering

This page was built for publication: Solution approaches to irregular nesting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127203)