{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:40:33Z","timestamp":1739918433417,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004865"},{"type":"electronic","value":"9783642004872"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00487-2_19","type":"book-chapter","created":{"date-parts":[[2010,2,27]],"date-time":"2010-02-27T20:57:08Z","timestamp":1267304228000},"page":"179-187","source":"Crossref","is-referenced-by-count":1,"title":["The Undirected Rural Postman Problem Solved by the MAX-MIN Ant System"],"prefix":"10.1007","author":[{"given":"Mar\u00eda Luisa","family":"P\u00e9rez-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"J.L. Deneubourg","year":"1990","unstructured":"Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The self-organizing exploratory pattern of the argentine ant. J. Insect Behav.\u00a03, 159\u2013168 (1990)","journal-title":"J. Insect Behav."},{"key":"19_CR2","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Dip. Elettronica, Politecnico di Milano, Italy (1992)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization: a survey. Theorical Computer Science\u00a0344, 243\u2013278 (2005)","journal-title":"Theorical Computer Science"},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"19_CR5","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"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K., Rinnooy-Kan, A.H.G.: On general routing problems. Networks\u00a06(3), 273\u2013280 (1976)","journal-title":"Networks"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Oper. Res.\u00a043(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"key":"19_CR8","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An algorithm for the rural postman problem. Tech. Rep. IC-O.R.-81-5, Imperial College, London, UK (1981)"},{"key":"19_CR9","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., Sanch\u00eds, J.M.: A polyhedral approach to the rural postman problem. Eur. J. Oper. Res.\u00a079, 95\u2013114 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR10","unstructured":"Letchford, A.N.: Polyhedral results for some constrained arc routing problems. Ph.D. thesis, Lancaster University, Lancaster (1996)"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G. Ghiani","year":"2000","unstructured":"Ghiani, G.: A branch-and-cut algorithm for the undirected rural postman problem. Math. Programming\u00a087(3), 467\u2013481 (2000)","journal-title":"Math. Programming"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BFb0121091","volume":"26","author":"N. Chistofides","year":"1986","unstructured":"Chistofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An algorithm for the rural postman problem on a directed graph. Math. Programming Stud.\u00a026, 155\u2013166 (1986)","journal-title":"Math. Programming Stud."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Chistofides","year":"1986","unstructured":"Chistofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Math. Programming\u00a020(1), 255\u2013282 (1986)","journal-title":"Math. Programming"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1287\/opre.51.2.281.12790","volume":"51","author":"E. Fern\u00e1ndez","year":"2003","unstructured":"Fern\u00e1ndez, E., Meza, O., Garfinkel, R., Ortega, M.: On the undirected rural postman problem: Tight bounds based on a new formulation. Oper. Res.\u00a051(2), 281\u2013291 (2003)","journal-title":"Oper. Res."},{"issue":"12","key":"19_CR15","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, 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."},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G.N. Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM\u00a026(3), 538\u2013554 (1979)","journal-title":"J. ACM"},{"issue":"12","key":"19_CR17","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1016\/j.cor.2005.02.014","volume":"33","author":"G. Ghiani","year":"2006","unstructured":"Ghiani, G., Lagan\u00e0, D., Musmanno, R.: A constructive heuristic for the undirected rural postman problem. Comput. Oper. Res.\u00a033(12), 3450\u20133457 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"19_CR18","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 Vuure, J.H.: Efficient heuristics for the rural postman problem. Orion\u00a021(1), 33\u201351 (2005)","journal-title":"Orion"},{"issue":"1","key":"19_CR19","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-Hugo, P.: Improvement procedures for the undirected rural postman problem. INFORMS J. Comput.\u00a011(1), 53\u201362 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"8","key":"19_CR20","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/0305-0548(94)00070-O","volume":"22","author":"W.L. Pearn","year":"1995","unstructured":"Pearn, W.L., Wu, T.C.: Algorithms for the rural postman problem. Comput. Oper. Res.\u00a022(8), 819\u2013828 (1995)","journal-title":"Comput. Oper. Res."},{"key":"19_CR21","unstructured":"Baldoqu\u00edn, M.G.: Heuristics and metaheuristics approaches used to solve the rural postman problem: a comparative case study. In: Proc. Fourth Internat. ICSC Symposium on Engineering of Intelligent Systems (EIS 2004), Maderia, Portugal (2004)"},{"key":"19_CR22","unstructured":"Baldoqu\u00edn, M.G., Ryan, G., Rodriguez, R., Castellini, A.: Un enfoque h\u00edbrido basado en metaheur\u00edsticas para el problema del cartero rural. In: Proc. of XI CLAIO, Concepci\u2019on de Chile, Chile (2002)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kang, M.J., Han, C.G.: Solving the rural postman problem using a genetic algorithm with a graph transformation. Tech. rep., Dept. of Computer Engineering, Kyung Hee University (1998)","DOI":"10.1145\/330560.330839"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","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)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/978-3-540-75867-9_101","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2007","author":"M.L. P\u00e9rez-Delgado","year":"2007","unstructured":"P\u00e9rez-Delgado, M.L., Matos-Franco, J.C.: Self-organizing feature maps to solve the undirected rural postman problem. In: Moreno D\u00edaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol.\u00a04739, pp. 804\u2013811. Springer, Heidelberg (2007)"},{"key":"19_CR26","unstructured":"Rodrigues, A.M., Ferreira, J.S.: Solving the rural postman problem by memetic algorithms. In: MIC 2001 - 4TH Metaheuristics Internat. Conf., Porto, Portugal (2001)"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: The MAX-MIN Ant System and local search for the traveling salesman problem. In: B\u00e4ck, T., Michalewicz, Z., Yao, X. (eds.) Proc. IEEE Internat. Conf. on Evolutionary Computation, pp. 309\u2013314 (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"4","key":"19_CR28","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T. St\u00fctzle","year":"2002","unstructured":"St\u00fctzle, T., Dorigo, M.: A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans. Evol. Comput.\u00a06(4), 358\u2013365 (2002)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Advances in Intelligent and Soft Computing","7th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2009)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00487-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:22:10Z","timestamp":1739917330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00487-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004865","9783642004872"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00487-2_19","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2009]]}}}