{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:09:58Z","timestamp":1778252998445,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226727","type":"print"},{"value":"9783540286462","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-28646-2_28","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:30:21Z","timestamp":1285083021000},"page":"302-309","source":"Crossref","is-referenced-by-count":16,"title":["Ant Algorithms for Urban Waste Collection Routing"],"prefix":"10.1007","author":[{"given":"Joaqu\u00edn","family":"Bautista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Bautista, J.: Proyecto integral de gesti\u00f3n de residuos urbanos en el municipio de Sant Boi de Llobregat CPDA Barcelona (2001)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S0305-0548(02)00046-1","volume":"30","author":"J.M. Belenger","year":"2003","unstructured":"Belenger, J.M., Benavent, E.: A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research\u00a030, 705\u2013728 (2003)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"E. Beltrami","year":"1974","unstructured":"Beltrami, E., Bodin, L.: Networks and vehicle routing for municipal waste collection. Networks\u00a04(1), 65\u201394 (1974)","journal-title":"Networks"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E. Benavent","year":"1992","unstructured":"Benavent, E., Campos, A., Corber\u00e1n, A., Mota, E.: The capacitated arc routing problem: Lower bounds. Networks\u00a022(4), 669\u2013690 (1992)","journal-title":"Networks"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/S0305-0548(00)00091-5","volume":"29","author":"A. Corber\u00e1n","year":"2002","unstructured":"Corber\u00e1n, A., Mart\u00ed, R., Mart\u00ednez, E., Soler, D.: The Rural Postman Problem on Mixed Graphs with turn penalties. Computers and Operations Research\u00a029, 887\u2013903 (2002)","journal-title":"Computers and Operations Research"},{"issue":"6","key":"28_CR6","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/0305-0483(73)90089-3","volume":"1","author":"N. Christofides","year":"1973","unstructured":"Christofides, N.: The optimum traversal of a graph. Omega\u00a01(6), 719\u2013732 (1973)","journal-title":"Omega"},{"key":"28_CR7","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dip. Elettronica, Politecnico di Milano, Italy (1991)"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics - Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics - Part B"},{"key":"28_CR9","volume-title":"Arc Routing: Theory, Solutions and Applications","year":"2000","unstructured":"Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"28_CR10","unstructured":"Fischer, M., Meier, B., Teich, T., Vogel, A.: Inner city disposal of waste with ant colony optimization. In: Dorigo, et al. (eds.) Proceedings of ANTS\u20192000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, Brussels, Belgium, September 7-9, pp. 51\u201358 (2000)"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B.L. Golden","year":"1983","unstructured":"Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Computers and Operations Research\u00a011(1), 49\u201366 (1983)","journal-title":"Computers and Operations Research"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Guntsch, M., Middendorf, M.: A population based approach for ACO. LNCS, vol.\u00a02037, pp. 72\u201381 (2002)","DOI":"10.1007\/3-540-46004-7_8"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A. Hertz","year":"2000","unstructured":"Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search heuristic for the capacitated arc routing problem. Operations Research\u00a048(1), 129\u2013135 (2000)","journal-title":"Operations Research"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/ijoc.11.1.53","volume":"11","author":"A. Hertz","year":"1999","unstructured":"Hertz, A., Laporte, G., Nanchen, P.: Improvement procedures for the undirected rural postman problem. INFORMS Journal of Computing\u00a011, 53\u201362 (1999)","journal-title":"INFORMS Journal of Computing"},{"issue":"2","key":"28_CR15","first-page":"155","volume":"9","author":"R. Hirabayashi","year":"1992","unstructured":"Hirabayashi, R., Saruwatari, Y., Nishida, N.: Tour construction algorithm for the capacitated arc routing problems. Asia Pacific Journal of Operations Research\u00a09(2), 155\u2013175 (1992)","journal-title":"Asia Pacific Journal of Operations Research"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-45365-2_49","volume-title":"Applications of Evolutionary Computing","author":"P. Lacomme","year":"2001","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, p. 473. Springer, Heidelberg (2001)"},{"issue":"5","key":"28_CR17","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1057\/jors.1992.73","volume":"43","author":"G. Laporte","year":"1992","unstructured":"Laporte, G., Mercure, H., Nobert, Y.: A branch and bound algorithm for a class of Assymmetrical Vehicle Routeing Problems. Journal of the Operational Research Society\u00a043(5), 469\u2013481 (1992)","journal-title":"Journal of the Operational Research Society"},{"key":"28_CR18","first-page":"217","volume":"47","author":"L.Y.O. Li","year":"1996","unstructured":"Li, L.Y.O., Eglese, R.W.: An interactive Algorithm for Vehicle Routing for Winter-Gritting. Journal of the Operational Research Society\u00a047, 217\u2013228 (1996)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0305-0548(91)90089-A","volume":"18","author":"W.L. Pearn","year":"1991","unstructured":"Pearn, W.L.: Augment algorithms for the capacitated arc routing problem. Computers and Operations Research\u00a018(2), 189\u2013198 (1991)","journal-title":"Computers and Operations Research"},{"key":"28_CR20","unstructured":"Pereira, J.: Modelizaci\u00f3n y resoluci\u00f3n de problemas de dise\u00f1o de sistemas de recogida de residuos urbanos Unpublished Ph.D. Thesis, UPC (2004)"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28646-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:14:58Z","timestamp":1778249698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-28646-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226727","9783540286462"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28646-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}