{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:38:51Z","timestamp":1756895931183,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668220"},{"type":"electronic","value":"9783540466956"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46695-9_38","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:37:07Z","timestamp":1186907827000},"page":"453-464","source":"Crossref","is-referenced-by-count":11,"title":["Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem"],"prefix":"10.1007","author":[{"given":"Edmund","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0010-4485(76)90006-3","volume":"8","author":"M. Adamowicz","year":"1976","unstructured":"Adamowicz, M., Albano, A. 1976. Nesting Two-Dimensional Shapes in Rectangular Modules. Computer Aided Design, 8, 27\u201333","journal-title":"Computer Aided Design"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013248","DOI":"10.1109\/TSMC.1980.4308483"},{"key":"38_CR3","unstructured":"Art, R.C., 1966. An Approach to the Two-Dimensional Irregular Cutting Stock Problem. Technical Report 36.008, IBM Cambridge Centre."},{"key":"38_CR4","unstructured":"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\u201323, 1997, to appear in: Annals of Operations Research (Dawid, Feichtinger and Hartl (eds.): Nonlinear Economic Dynamics and Control, 1999"},{"key":"38_CR5","unstructured":"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\u2019 99), Monte Carlo Resort, Las Vegas, Nevada, USA, 28 June\u20131 July 1999"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/3-540-46695-9_38"},{"key":"38_CR7","unstructured":"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"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1976","unstructured":"Christofides, N., Whitlock, C. 1976. An Algorithm for Two_Dimensional Cutting Problems. Operations Research, 25, 30\u201344","journal-title":"Operations Research"},{"key":"38_CR9","unstructured":"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\u00e4nner and B. Manderick (Eds.), Elsevier Publishing, 509\u2013520"},{"key":"38_CR10","unstructured":"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\u2013142"},{"issue":"1","key":"38_CR11","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"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\u201353. [116]","journal-title":"JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa D. and A. Hertz (1997). Ants Can Colour Graphs. Journal of the Operational Research Society, 48, 295\u2013305","journal-title":"Journal of the Operational Research Society"},{"key":"38_CR13","first-page":"50","volume":"12","author":"R. Cunninghame-Green","year":"1989","unstructured":"Cunninghame-Green, R. 1989. Geometry, Shoemaking and the Milk Tray Problem. New Scientist, 12, August 1989, 1677, pp 50\u201353","journal-title":"New Scientist"},{"issue":"3","key":"38_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1057\/ori.1992.20","volume":"5","author":"R. Cunninghame-Green","year":"1992","unstructured":"Cunninghame-Green, R., Davis, L.S. 1992. Cut Out Waste! O.R. Insight, Vol 5, iss 3, pp4\u20137","journal-title":"O.R. Insight"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G. Di Caro","year":"1998","unstructured":"Di Caro G. & Dorigo M. (1998). AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research (JAIR), 9:317\u2013365","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"38_CR16","volume-title":"Optimization, Learning and Natural Algorithms","author":"M. Dorigo","year":"1992","unstructured":"Dorigo M. (1992). Optimization, Learning and Natural Algorithms. Ph.D.Thesis (in italian), Politecnico di Milano, Italy, in Italian"},{"key":"38_CR17","unstructured":"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"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Dorigo M., G. Di Caro & L. M. Gambardella (1999). Ant Algorithms for Discrete Optimization. Artificial Life, 5(2), in press","DOI":"10.1162\/106454699568728"},{"issue":"1","key":"38_CR19","first-page":"29","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"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\u201341","journal-title":"IEEE Transactions on Systems"},{"key":"38_CR20","unstructured":"Falkenauer, E. 1998. Genetic Algorithms and Grouping Problems. John Wiley and Sons"},{"key":"38_CR21","unstructured":"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"},{"key":"38_CR22","unstructured":"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\u2013424, MIT Press"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Maniezzo V. and A. Colorni (1999). The Ant System Applied to the Quadratic Assignment Problem. IEEE Transactions on Knowledge and Data Engineering, to appear","DOI":"10.1109\/69.806935"},{"key":"38_CR24","unstructured":"Oliveira, J.F., Gomes, A.M., Ferreira, S. 1998. TOPOS A new constructive algorithm for nesting problems. Accepted for ORSpektrum"},{"key":"38_CR25","unstructured":"St\u00fctzle 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"}],"container-title":["Lecture Notes in Computer Science","Advanced Topics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46695-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T01:03:42Z","timestamp":1732842222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-46695-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668220","9783540466956"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-46695-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}