Abstract
The Nesting Problem naturally appears in the context of several production processes, as in the textile, wood or steel industries, whenever is necessary to cut pieces with irregular (non-rectangular) shapes from larger plates. This problem belongs to the more generic class of Cutting and Packing problems.
Usually the Nesting Problem is solved using interactive computer graphics approaches, being very few the completely automatic approaches known. In this paper we present an automatic layout algorithm for the Nesting Problem, based in the Simulated Annealing approach to combinatorial optimization problems.
Our algorithm has been implemented in two versions. The first version assumes that the irregular pieces are represented in a raster form. In the second one, a more precise one, the pieces are represented by a set of vertices that connected by straight lines define a polygon.
The main purpose of the paper is to report, in a compact form, our extensive numerical experiences while developing the final versions of the algorithm. In addition, our experiences of solving the Nesting Problem with a simple local search algorithm will also be presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Collins N. E. et al (1988), Simulated Annealing: An Annoted Bibliography, American Journal of Mathematical and Management Sciences 8, 209–307.
Dowsland K. (1990), Some experiments with simulated annealing techniques for packing problems, IFORS’90, Athens.
Dyckhoff H. (1990), A Typology of Cutting and Packing Problems, European Journal of Operational Research 44, 145–159.
Evans J.R. (1987), Structural Analysis of Local Search Heuristics in Combinatorial Optimization, Computers and Operations Research, Computers and Operations Research 14, 465–477.
Kirkpatrick S. et al (1983), Optimization by Simulated Annealing, Science 220, 671–680.
Konopasek M. (1981), Mathematical Treatments of Some Apparel Marking and Cutting Problems, U.S. Department of Commerce Report 99–26–90857–10.
Laarhoven P.J.M. and Aarts E.H.L. (1987), Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Boston.
Metropolis N. et al (1953), Equation of State Calculations by Fast Computing Machines, Journal of Chemical Physics 21, 1087–1092.
Otten R.H. and Van Ginneken L.P. (1989), The annealing algorithm, Kluwer Academic Publishers, Boston.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Oliveira, J.F.C., Ferreira, J.A.S. (1993). Algorithms for Nesting Problems. In: Vidal, R.V.V. (eds) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46787-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-46787-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56229-0
Online ISBN: 978-3-642-46787-5
eBook Packages: Springer Book Archive