Abstract
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant algorithm) is developed and the results from this algorithm are compared against SA, TS and GA We discuss the ideas behind ant algorithms and describe how they have been implemented with regards to the nesting problem. The evaluation method used is described, as is the NFP. Computational results are given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adamowicz, M., Albano, A. 1976. Nesting Two-Dimensional Shapes in Rectangular Modules. Computer Aided Design, 8, 27–33
Albano, A., Sappupo, G. 1980. Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods. IEEE Trans. Syst., Man and Cybernetics, SMC-10, pp 242–248
Art, R.C., 1966. An Approach to the Two-Dimensional Irregular Cutting Stock Problem. Technical Report 36.008, IBM Cambridge Centre.
Bullnheimer B., R.F. Hartl and C. Strauss (1999). An Improved Ant system Algorithm for the Vehicle Routing Problem. The Sixth Viennese workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna (Austria), May 21–23, 1997, to appear in: Annals of Operations Research (Dawid, Feichtinger and Hartl (eds.): Nonlinear Economic Dynamics and Control, 1999
Burke, E., K., Kendall, G. 1999. Applying Evolutionary Algorithms the No Fit Polygon to the Nesting Problem. Accepted for The 1999 International Conference on Artificial Intelligence (IC-AI’ 99), Monte Carlo Resort, Las Vegas, Nevada, USA, 28 June–1 July 1999
Burke, E., K., Kendall, G. 1999. Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem. Accepted for WMC (World Manufacturing Congress), September 1999, Durham, UK
Burke, E., K., Kendall, G. 1999. Evaluation of Two Dimensional Bin Packing using the No Fit Polygon. Submitted to CIE26 (Computers and Industrial Engineering), December, 1999, Melbourne, Australia
Christofides, N., Whitlock, C. 1976. An Algorithm for Two_Dimensional Cutting Problems. Operations Research, 25, 30–44
Colorni A., M. Dorigo & V. Maniezzo (1992). An Investigation of Some Properties of an Ant Algorithm. Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), Brussels, Belgium, R. Männer and B. Manderick (Eds.), Elsevier Publishing, 509–520
Colorni A., M. Dorigo & V. Maniezzo (1992). Distributed Optimization by Ant Colonies. Proceedings of the First European Conference on Artificial Life, Paris, France, F. Varela and P. Bourgine (Eds.), Elsevier Publishing, 134–142
Colorni A., M. Dorigo, V. Maniezzo and M. Trubian (1994). Ant system for Job-shop Scheduling. JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science, 34(1):39–53. [116]
Costa D. and A. Hertz (1997). Ants Can Colour Graphs. Journal of the Operational Research Society, 48, 295–305
Cunninghame-Green, R. 1989. Geometry, Shoemaking and the Milk Tray Problem. New Scientist, 12, August 1989, 1677, pp 50–53
Cunninghame-Green, R., Davis, L.S. 1992. Cut Out Waste! O.R. Insight, Vol 5, iss 3, pp4–7
Di Caro G. & Dorigo M. (1998). AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research (JAIR), 9:317–365
Dorigo M. (1992). Optimization, Learning and Natural Algorithms. Ph.D.Thesis (in italian), Politecnico di Milano, Italy, in Italian
Dorigo M. and G. Di Caro (1999). The Ant Colony Optimization Meta-Heuristic. In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, McGraw-Hill, in press
Dorigo M., G. Di Caro & L. M. Gambardella (1999). Ant Algorithms for Discrete Optimization. Artificial Life, 5(2), in press
Dorigo M., V. Maniezzo & A. Colorni (1996). The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29–41
Falkenauer, E. 1998. Genetic Algorithms and Grouping Problems. John Wiley and Sons
Forsyth P. and A. Wren (1997). An Ant System for Bus Driver Scheduling. Presented at the 7th International Workshop on Computer-Aided Scheduling of Public Transport, Boston, August 1997
Kuntz P., P. Layzell and D. Snyers (1997). A Colony of Ant-like Agents for Partitioning in VLSI Technology. Proceedings of the Fourth European Conference on Artificial Life, P. Husbands and I. Harvey, (Eds.), 417–424, MIT Press
Maniezzo V. and A. Colorni (1999). The Ant System Applied to the Quadratic Assignment Problem. IEEE Transactions on Knowledge and Data Engineering, to appear
Oliveira, J.F., Gomes, A.M., Ferreira, S. 1998. TOPOS A new constructive algorithm for nesting problems. Accepted for ORSpektrum
Stützle T. and M. Dorigo (1999). ACO Algorithms for the Traveling Salesman Problem. In K. Miettinen, M. Makela, P. Neittaanmaki, J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, Wiley, 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burke, E., Kendall, G. (1999). Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive