Abstract
A combinatorial path planning problem arises when trying to cut optimally a layout of nested irregular forms. Heuristic search techniques coming from AI and OR are applied to build an approximate resolution method. Results for "real-life" instances (clothing layouts in the apparel industry) are presented and evaluated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Távora, "Path planning for a class of cutting operations," Applications of Artificial Intelligence VII, Mohan M. Trivedi (ed.), Proc. SPIE 1095, pp 404–415, (1989).
J. Távora, "Tool-path planning in textile cutters: heuristic methods for a new combinatorial optimization problem," Thesis for a Researcher Degree, LNETI, March 1989 (in portuguese).
J.A. Chisman, "The Clustered Travelling Salesman," in Computers and Operational Research, Vol. 2, pp. 115–119, Pergamon Press, UK (1975).
F.C.J. Lokin, "Procedures for Travelling Salesman Problems with Aditional Constraints," European Journal of Operational Research 3, pp. 135–141 (1978).
K. Jongens and T. Volgenant, "The Symmetric Clustered Travelling Salesman Problem," European Journal of Operational Research 19, pp. 68–75 (1985).
M.T. Almeida and L. Brum, "Heuristic methods for the Clustered Travelling Salesman Problem," work doc. n. 43, CEMABRE, Instituto Superior de Economia, Lisbon (1988) (in portuguese).
J. Távora, "Optimizing tool-path when cutting pieces of fabric," Proceedings of the Third Portuguese Meeting on AI (EPIA-87), 7–9 October 1987, Braga, Portugal (in portuguese).
LECTRA Systèmes, Cestas Bordeaux, France; personal communication (1986).
GERBER (GGT), Tolland CT, USA; catalog 10057.
D.S. Johnson and C.H. Papadimitriou, "Performance guarantees for heuristics," in E.L. Lawler et al. (ed.) The Travelling Salesman Problem, John Wiley & Sons, Chichester, UK (1985).
Golden et altri, "Approximate Travelling Salesman Algorithms," Operations Research, Vol. 28, No. 3, Part II, May–June (1980).
S. Lin, "Computer Solutions of the Travelling Salesman Problem," Bell System Technical Journal 44, pp. 2245–2269 (1965).
E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numer. Math. 1, pp. 269–271 (1959).
N. Nilsson, Problem-solving Methods in Artificial Intelligence, McGraw-Hill, NY (1971).
J. Pearl, Heuristics, Addison-Wesley Pub. Co. Reading MA (1984).
B.L. Golden and W.R. Stewart, "Empirical analysis of heuristics", in E.L. Lawler et al. (ed.) The Travelling Salesman Problem, John Wiley & Sons, Chichester, UK (1985).
D.G. Dannenbring, "Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems," Management Science Vol. 23 No. 12, pp. 1273–1283, Aug. (1977).
F. Janeiro, J. Jorge, J. Távora, "Optimizing the plotting of clothing pieces," Proc. PPP/AC-89, 10–12 May 1989, Lisbon (in portuguese).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Távora, J., Coelho, H. (1989). A path planner for the cutting of nested irregular layouts. In: Martins, J.P., Morgado, E.M. (eds) EPIA 89. EPIA 1989. Lecture Notes in Computer Science, vol 390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51665-4_90
Download citation
DOI: https://doi.org/10.1007/3-540-51665-4_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51665-1
Online ISBN: 978-3-540-46743-4
eBook Packages: Springer Book Archive