{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:04:08Z","timestamp":1725552248478},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642123832"},{"type":"electronic","value":"9783642123849"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12384-9_29","type":"book-chapter","created":{"date-parts":[[2010,4,15]],"date-time":"2010-04-15T10:57:07Z","timestamp":1271329027000},"page":"241-246","source":"Crossref","is-referenced-by-count":2,"title":["Solving an Arc-Routing Problem Using Artificial Ants with a Graph Transformation"],"prefix":"10.1007","author":[{"given":"Mar\u00eda-Luisa","family":"P\u00e9rez-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Baldoqu\u00edn, M.G., Ryan, G., Rodriguez, R., Castellini, A.: Un enfoque hibrido basado en metaheur\u00edsticas para el problema del cartero rural. In: Proc. of XI CLAIO, Concepci\u00f3n de Chile, Chile (2002)"},{"key":"29_CR2","volume-title":"An algorithm for the rural postman problem","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An algorithm for the rural postman problem. Imperial College Report, London (1981)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","volume":"79","author":"A. Corber\u00e1n","year":"1994","unstructured":"Corber\u00e1n, A., Sanchis, J.M.: A polyhedral approach to the rural postman problem. Eur. J. Oper. Res.\u00a079, 95\u2013114 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput.\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(98)00028-8","volume":"25","author":"P. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, P., Garc\u00eda Raffi, L.M., Sanchis, J.M.: A heuristic algorithm based on Monte Carlo methods for the rural postman problem. Comput. Oper. Res.\u00a025(12), 1097\u20131106 (1998)","journal-title":"Comput. Oper. Res."},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G. Frederickson","year":"1979","unstructured":"Frederickson, G.: Approximation algorithms for some postman problems. J. Assoc. Comput. Mach.\u00a026, 538\u2013554 (1979)","journal-title":"J. Assoc. Comput. Mach."},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G. Ghiani","year":"2000","unstructured":"Ghiani, G., Laporte, G.: A branch and cut algorithm for the undirected rural postman problem. Math. Program\u00a087, 467\u2013481 (2000)","journal-title":"Math. Program"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B.L. Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated Arc Routing Problems. Networks\u00a011, 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"1","key":"29_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.5784\/21-1-17","volume":"21","author":"G.W. Groves","year":"2005","unstructured":"Groves, G.W., van Vuuren, J.H.: Efficiente heuristics for the rural postman problem. Orion\u00a021(1), 33\u201351 (2005)","journal-title":"Orion"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/ijoc.11.1.53","volume":"1","author":"A. Hertz","year":"1999","unstructured":"Hertz, A., Laporte, G., Nanchen, P.: Improvement procedures for the undirected rural postman problem. INFORMS J. Comput.\u00a01, 53\u201362 (1999)","journal-title":"INFORMS J. Comput."},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J.K. LenstrA","year":"1981","unstructured":"LenstrA, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing and scheduling problems. Networks\u00a011, 221\u2013227 (1981)","journal-title":"Networks"},{"key":"29_CR12","unstructured":"Letchford, A.N.: Polyhedral results for some constrained arc routing problemas. PhD Dissertation. Lancaster University, Lancaster (1996)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C.S. Orloff","year":"1974","unstructured":"Orloff, C.S.: A fundamental problem in vehicle routing. Networks\u00a04, 35\u201364 (1974)","journal-title":"Networks"},{"key":"29_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-75271-4_23","volume-title":"Current Topics in Artificial Intelligence","author":"M.L. P\u00e9rez-Delgado","year":"2007","unstructured":"P\u00e9rez-Delgado, M.L.: A solution to the rural postman problem based on artificial ant colonies. In: Borrajo, D., Castillo, L., Corchado, J.M. (eds.) CAEPIA 2007. LNCS (LNAI), vol.\u00a04788, pp. 220\u2013228. Springer, Heidelberg (2007)"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0305-0548(87)90065-7","volume":"14","author":"W.L. Pearn","year":"1987","unstructured":"Pearn, W.L., Assard, A., Golden, B.L.: Transforming arc routing into node routing problems. Comput. Oper. Res.\u00a014(4), 285\u2013288 (1987)","journal-title":"Comput. Oper. Res."},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"The Traveling Salesman","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The traveling salesman problem: computational solutions for TSP applications. In: Reinelt, G. (ed.) The Traveling Salesman. LNCS, vol.\u00a0840. Springer, Heidelberg (1994)"}],"container-title":["Advances in Intelligent and Soft Computing","Advances in Practical Applications of Agents and Multiagent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12384-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:40:32Z","timestamp":1619782832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12384-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642123832","9783642123849"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12384-9_29","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2010]]}}}