Journal Article10.1007/S002910050105
TOPOS – A new constructive algorithm for nesting problems
142
TL;DR: In this article, a new constructive algorithm for nesting problems is presented, where the layout is built by successively adding a new piece to a partial solution, i.e. to the set of pieces previously nested.
read more
Abstract: . In this paper we present a new constructive algorithm for nesting problems. The layout is built by successively adding a new piece to a partial solution, i.e. to the set of pieces previously nested. Several criteria to choose the next piece to place and its orientation are proposed and tested. Different objective functions are also proposed to evaluate and compare partial solutions. A total of 126 variants of the algorithm, generated by the complete set of combinations of criteria and objective functions, are computationally tested. The computational experiments are based on data sets published in the literature or provided by other authors. In some cases this new algorithm generates better solutions than the best known (published) solutions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An improved typology of cutting and packing problems
TL;DR: An improved typology of C&P problems is presented, which is partially based on Dyckhoff’s original ideas, but introduces new categorisation criteria, which define problem categories different from those of Dykhoff.
1.5K
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
TL;DR: The metaheuristic simulated annealing is used to guide the search over the solution space while linear programming models are solved to generate neighbourhoods during the search process to solve Irregular Strip Packing problems.
238
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems
E. Hopper,B. C. H. Turton +1 more
TL;DR: The objective of this paper is to present and categorise the solution approaches in the literature for 2D regular and irregular strip packing problems and focus is hereby on the analysis of themethods involving genetic algorithms.
A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
TL;DR: A new heuristic algorithm is presented for the two-dimensional irregular stock-cutting problem, which generates significantly better results than the previous state of the art on a wide range of established benchmark problems.
A 2-exchange heuristic for nesting problems
TL;DR: A new heuristic for the nesting problem based on a 2-exchange neighbourhood generation strategy that guides the search through the solution space consisting of the sequences of pieces and relies on a low-level placement heuristic to actually convert one sequence in a feasible layout.
165
References
A typology of cutting and packing problems
TL;DR: The paper develops a consistent and systematic approach for a comprehensive typology integrating the various kinds of problems, founded on the basic logical structure of cutting and packing problems.
1.1K
•Dissertation
An approach to the two dimensional irregular cutting stock problem.
Richard Carl Art
- 01 Jan 1966
TL;DR: Alfred P. Sloan Thesis as mentioned in this paper, 1966; B.S. Thesis, 1966, Massachusetts Institute of Technology, MIT Sloan School of Management, Boston, Massachusetts.
119
Mathematical Model and Solution Method of Optimization Problem of Placement of Rectangles and Circles Taking into Account Special Constraints
Yu. G. Stoyan,Georgiy Yaskov +1 more
TL;DR: In this article, a branch-and-bound algorithm and a reduced gradient method are used to solve the problem of finding the extremum of a linear objective function at extreme points.
93
Jostling for position: local improvement for irregular cutting patterns
TL;DR: A new improvement heuristic for irregular cutting and packing problems that is based on a small number of repetitions of any leftmost placement policy and is particularly effective in situations where computation time is strictly limited but exceeds that required for a single pass approach.
72
•Proceedings Article
A Two-stage Solution of the Cutting-stock Problem.
Michael Adamowicz,Antonio Albano +1 more
- 01 Jan 1971
28