{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T12:45:53Z","timestamp":1767530753597,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283256"},{"type":"electronic","value":"9783540318583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539117_164","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T22:10:45Z","timestamp":1279663845000},"page":"1229-1238","source":"Crossref","is-referenced-by-count":6,"title":["Ant Colony Search Algorithms for Optimal Packing Problem"],"prefix":"10.1007","author":[{"given":"Wen","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruofeng","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinxiang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"164_CR1","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. Thesis, Italy (1992)"},{"key":"164_CR2","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the ant system to the vehicle routing problem. In: The Second Metaheuristics International Conference, France (1997)"},{"key":"164_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, A., Bullnheimer, B., Hartl, R.F.: An ant colony optimization approach for the single machine tool tardiness problem. In: Proceeding of the Congress on Evolutionary Computation, pp. 1445\u20131450 (1999)","DOI":"10.1109\/CEC.1999.782653"},{"key":"164_CR4","doi-asserted-by":"crossref","unstructured":"McMullen, P.R.: An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. In: Artificial Intelligence, pp. 309\u2013317 (2001)","DOI":"10.1016\/S0954-1810(01)00004-8"},{"key":"164_CR5","doi-asserted-by":"crossref","unstructured":"Yeung, L.H.W., Wallace, K.S.T.: A Hybrid Genetic Approach for Garment Cutting in the Clothing Industry. IEEE Transaction on Industrial Electronics\u00a050 (2003)","DOI":"10.1109\/TIE.2003.812285"},{"key":"164_CR6","unstructured":"Kado, K., Ross, P., Come, D.: A study of genetic algorithm hybrids for facility layout problem. In: Proceeding of the 6th International Conference Genetic Algorithm, pp. 498\u2013505 (1995)"},{"key":"164_CR7","doi-asserted-by":"crossref","unstructured":"Jakobs, S.: On genetic algorithms for the packing problems. European Journal of Operational Research, 165\u2013188 (1996)","DOI":"10.1016\/0377-2217(94)00166-9"},{"key":"164_CR8","first-page":"598","volume":"15","author":"C. Yong","year":"2003","unstructured":"Yong, C., Min, T., Ruofeng, T., Jinxiang, D.: Packing of Polygons Using Genetic Simulated Annealing Algorithm. Journal of CAD & CG\u00a015, 598\u2013603, 609 (2003)","journal-title":"Journal of CAD & CG"},{"key":"164_CR9","unstructured":"Ramesh, B.A., Ramesh, B.N.: Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research, 1925\u20131943 (1999)"},{"key":"164_CR10","doi-asserted-by":"crossref","unstructured":"Martens, J.: Two genetic algorithms to solve a layout problem in the fashion industry. European Journal of Operational Research, 304\u2013322 (2004)","DOI":"10.1016\/S0377-2217(02)00706-3"},{"key":"164_CR11","doi-asserted-by":"crossref","unstructured":"Han, G.: Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing. Journal of Engineering Manufacture, 509\u2013519 (1996)","DOI":"10.1243\/PIME_PROC_1996_210_150_02"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539117_164.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:08:05Z","timestamp":1740287285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539117_164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283256","9783540318583"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11539117_164","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}