Solution approaches to irregular nesting problems
From MaRDI portal
Publication:1127203
DOI10.1016/0377-2217(95)00019-MzbMath0918.90116MaRDI QIDQ1127203
William B. Dowsland, Kathryn A. Dowsland
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming, A simulated annealing approach for the circular cutting problem, 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, Solving nesting problems with non-convex polygons by constraint logic programming, Fast neighborhood search for two- and three-dimensional nesting problems, A clique covering MIP model for the irregular strip packing problem, A new algorithm for the two-polygon containment problem, An effective heuristic for the two-dimensional irregular bin packing problem, Cut scheduling in the apparel industry, Heuristics for a dynamic rural postman problem, Algorithms for nesting with defects, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, Covering Polygons with Rectangles, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning, A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems, A fully general, exact algorithm for nesting irregular shapes, Optimal clustering of a pair of irregular objects, Mixed-integer programming models for nesting problems, An object-based evolutionary algorithm for solving nesting problems, Exact solution techniques for two-dimensional cutting and packing, Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle, Irregular packing problems: a review of mathematical models, Translational packing of arbitrary polytopes, Rotational polygon overlap minimization and compaction, Computing closely matching upper and lower bounds on textile nesting problems, Alternative formulations for a layout problem in the fashion industry, 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
- Composite stock cutting through simulated annealing
- Packing problems
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- Applied simulated annealing
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- Jostling for position: local improvement for irregular cutting patterns
- New approaches for the nesting of two-dimensional shapes for press tool design
- Performance testing of rectangular parts-nesting heuristics
- Modeling of packing problems
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
