{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:36:30Z","timestamp":1742992590245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190655"},{"type":"electronic","value":"9783319190662"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19066-2_22","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T01:20:34Z","timestamp":1430356834000},"page":"222-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Thomas Andre","family":"Lian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marilex Rea","family":"Llave","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten","family":"Goodwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noureddine","family":"Bouhmala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant colony optimization: overview and recent advances. In: Handbook of Metaheuristics, pp. 227\u2013263 (2010)","DOI":"10.1007\/978-1-4419-1665-5_8"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation 6(4), 333\u2013346 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics 18(1), 41\u201348 (2004)","journal-title":"Advanced Engineering Informatics"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-36605-9_31","volume-title":"Applications of Evolutionary Computing","author":"K Socha","year":"2003","unstructured":"Socha, K., Sampels, M., Manfrin, M.: Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 334\u2013345. Springer, Heidelberg (2003)"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","volume":"185","author":"K Socha","year":"2008","unstructured":"Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. European Journal of Operational Research 185(3), 1155\u20131173 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"22_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-min ant system. Future Generation Computer Systems 16(8), 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"22_CR7","unstructured":"Garey, M.R., Johnson, D.S.: A guide to the theory of np-completeness. San Francisco (1979)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/11839088_20","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M Manfrin","year":"2006","unstructured":"Manfrin, M., Birattari, M., St\u00fctzle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224\u2013234. Springer, Heidelberg (2006)"},{"key":"22_CR9","unstructured":"St\u00fctzle, T., Dorigo, M.: Aco algorithms for the traveling salesman problem. In: Evolutionary Algorithms in Engineering and Computer Science, pp. 163\u2013183 (1999)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Goodwin, M., Granmo, O.C., Radianti, J.: Escape planning in realistic fire scenarios with ant colony optimisation. Applied Intelligence, 1\u201312 (2014)","DOI":"10.1007\/s10489-014-0538-9"},{"key":"22_CR11","first-page":"28","volume":"95","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs. SC 95, 28 (1995)","journal-title":"SC"},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","volume":"15","author":"U Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.K.: A multilevel memetic approach for improving graph k-partitions. IEEE Transactions on Evolutionary Computation 15(5), 624\u2013642 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"22_CR13","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.50.5.862.373","volume":"50","author":"C Walshaw","year":"2002","unstructured":"Walshaw, C.: A multilevel approach to the travelling salesman problem. Operations Research 50(5), 862\u2013877 (2002)","journal-title":"Operations Research"},{"issue":"5","key":"22_CR14","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.camwa.2006.12.098","volume":"55","author":"IO Oduntan","year":"2008","unstructured":"Oduntan, I.O., Toulouse, M., Baumgartner, R., Bowman, C., Somorjai, R., Crainic, T.G.: A multilevel tabu search algorithm for the feature selection problem in biomedical data. Computers & Mathematics with Applications 55(5), 1019\u20131033 (2008)","journal-title":"Computers & Mathematics with Applications"},{"issue":"4","key":"22_CR15","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1162\/EVCO_a_00078","volume":"20","author":"N Bouhmala","year":"2012","unstructured":"Bouhmala, N.: A multilevel memetic algorithm for large sat-encoded problems. Evolutionary Computation 20(4), 641\u2013664 (2012)","journal-title":"Evolutionary Computation"},{"issue":"6","key":"22_CR16","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11(6), 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"key":"22_CR17","unstructured":"Whitley, D., Starkweather, T., Shaner, D.: The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. Colorado State University, Department of Computer Science (1991)"}],"container-title":["Lecture Notes in Computer Science","Current Approaches in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19066-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T08:06:29Z","timestamp":1674201989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19066-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190655","9783319190662"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19066-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}