{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:04:14Z","timestamp":1725552254873},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_27","type":"book-chapter","created":{"date-parts":[[2010,4,15]],"date-time":"2010-04-15T06:57:07Z","timestamp":1271314627000},"page":"221-230","source":"Crossref","is-referenced-by-count":1,"title":["Elitist Ants Applied to the Undirected Rural Postman Problem"],"prefix":"10.1007","author":[{"given":"Mar\u00eda-Luisa","family":"P\u00e9rez-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Baldoqu\u00edn, M.G.: Heuristics and metaheuristics approaches used to solve the rural postman problem: a comparative case study. In: Proc. of the Fourth International ICSC Symposium on Engineering of Intelligent Systems (EIS 2004). Maderia, Portugal (2004)"},{"key":"27_CR2","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":"27_CR3","unstructured":"Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1976)"},{"key":"27_CR4","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An algorithm for the rural postman problem. Technical Report IC-OP-81-5 (1981)"},{"key":"27_CR5","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":"27_CR6","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":"27_CR7","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. Thesis, Dip. Elettronica, Politecnico di Milano (1992)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: 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":"1","key":"27_CR9","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.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, Cybern.- B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Systems, Man, Cybern.- B"},{"key":"27_CR10","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. The MIT Press, Cambridge (2004)"},{"issue":"3","key":"27_CR11","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."},{"issue":"12","key":"27_CR12","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":"27_CR13","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":"27_CR14","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":"3","key":"27_CR15","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(3), 467\u2013481 (2000)","journal-title":"Math. Program"},{"issue":"1","key":"27_CR16","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.: Efficient heuristics for the rural postman problem. Orion\u00a021(1), 33\u201351 (2005)","journal-title":"Orion"},{"issue":"1","key":"27_CR17","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."},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-1-4615-4495-1_9","volume-title":"Arc Routing: Theory, Solutions and Applications","author":"A. Hertz","year":"2000","unstructured":"Hertz, A., Mittaz, M.: Heuristic Algorithms. In: Arc Routing: Theory, Solutions and Applications, pp. 327\u2013386. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Kang, M.-J., Han,C.-G.: Solving the rural postman problem using a genetic algorithm with a graph transformation. Technical Report, Dept. of Computer Engineering, Kyung Hee University (1998)","DOI":"10.1145\/330560.330839"},{"issue":"3","key":"27_CR20","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 the general routing problem. Networks\u00a06(3), 273\u2013280 (1976)","journal-title":"Networks"},{"key":"27_CR21","unstructured":"Letchford, A.N.: Polyhedral results for some constrained arc routing problems. Ph.D. Thesis, Lancaster University, Lancaster (1996)"},{"key":"27_CR22","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":"27_CR23","first-page":"815","volume":"22","author":"W.L. Pearn","year":"1995","unstructured":"Pearn, W.L., Wu, C.M.: Algorithms for the rural postman problem. Comput. Oper. Res.\u00a022, 815\u2013828 (1995)","journal-title":"Comput. Oper. Res."},{"key":"27_CR24","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)"},{"key":"27_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":"27_CR26","unstructured":"Rodrigues, A.M., Ferreira, J.S.: Solving the rural postman problem by memetic algorithms. In: MIC 2001 - 4TH Metaheuristics International Conference, Porto, Portugal (2001)"},{"key":"27_CR27","unstructured":"Sanchis, J.M.: El poliedro del problema del cartero cural. Ph.D. Thesis, Universidad de Valencia, Spain (1990)"}],"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_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:53:40Z","timestamp":1606168420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12384-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642123832","9783642123849"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12384-9_27","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2010]]}}}