{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:52:32Z","timestamp":1772657552383,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540752707","type":"print"},{"value":"9783540752714","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75271-4_23","type":"book-chapter","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T09:16:25Z","timestamp":1193649385000},"page":"220-228","source":"Crossref","is-referenced-by-count":7,"title":["A Solution to the Rural Postman Problem Based on Artificial Ant Colonies"],"prefix":"10.1007","author":[{"given":"Mar\u00eda Luisa","family":"P\u00e9rez-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: an Autocatalytic Optimizing Process. Tech. Rep. 91-016, Dipartamento di Electtronica e Informazione - Politecnico di Milano. Italia, pp. 1\u201326 (1991)"},{"key":"23_CR2","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD Thesis, Dip. Elettronica, Politecnico di Milano (1992)"},{"key":"23_CR3","unstructured":"Maniezzo, V., Colorni, A., Dorigo, M.: The Ant System Applied to the Quadratic Assignment Problem. Technical Report IRIDIA\/94-28, Universit\u00e9 Libre de Bruxelles, Belgium (1994)"},{"key":"23_CR4","unstructured":"Maniezzo, V.: Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem. Technical Report CSR 98-1, C.L. In: Science dell\u2019Informazione, Universit\u00e1 di Bologna, Italy (1998)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the Ant System to the Vehicle Routing Problem. Advances and Trends in Local Search Paradigms for Optimization, pp. 285\u2013296 (1999)","DOI":"10.1007\/978-1-4615-5775-3_20"},{"key":"23_CR6","volume-title":"New Ideas in Optimization","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E., Agazzi, G.: Ant Colonies for Vehicle Routing Problems. In: Corne, E.D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, McGraw-Hill, New York (1999)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D., Hertz, A.: Ants Can Colour Graphs. Journal of the Operational Research Society\u00a048, 295\u2013305 (1997)","journal-title":"Journal of the Operational Research Society"},{"key":"23_CR8","volume-title":"Network Models 7","author":"M.O. Ball","year":"1995","unstructured":"Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L.: Network Models 7. North-Holland, Amsterdam (1995)"},{"key":"23_CR9","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a Large-scale Traveling Salesman Problem. Operations Research\u00a02, 393\u2013410 (1954)","journal-title":"Operations Research"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"The Traveling Salesman Problem: Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman. LNCS, vol.\u00a0840. Springer, Heidelberg (1994)"},{"key":"23_CR11","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":"23_CR12","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. Journal of the Association for Computing Machinery\u00a026, 538\u2013554 (1979)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"23_CR13","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An Algorithm for the Rural Postman Problem. Imperial College Report. London (1981)"},{"key":"23_CR14","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. European Journal of the Operational Research\u00a079, 95\u2013114 (1994)","journal-title":"European Journal of the Operational Research"},{"key":"23_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. Mathematical Programming\u00a087, 467\u2013481 (2000)","journal-title":"Mathematical Programming"},{"key":"23_CR16","unstructured":"Letchford, A.N.: Polyhedral Results for Some Constrained Arc Routing Problems. PhD Dissertation, Lancaster University, Lancaster (1996)"},{"issue":"12","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(98)00028-8","volume":"25","author":"P. Fern\u00e1ndez de C\u00f3rdoba","year":"1998","unstructured":"Fern\u00e1ndez de C\u00f3rdoba, P., Garc\u00eda Raffi, L.M., Sanchis, J.M.: A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem. Computers Ops. Res.\u00a025(12), 1097\u20131106 (1998)","journal-title":"Computers Ops. Res."},{"key":"23_CR18","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."},{"issue":"1","key":"23_CR19","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":"23_CR20","doi-asserted-by":"crossref","unstructured":"Kang, M.-J., Han, C.-G.: Solving the Rural Postman Problem Using a Genetic Algorithm with a Graph Transformation. RR: Dept. of Computer Engineering, Kyung Hee University (1998)","DOI":"10.1145\/330560.330839"},{"key":"23_CR21","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":"23_CR22","unstructured":"Baldoqu\u00edn, M.G., Ryan, G., Rodr\u00edguez, R., Castellini, A.: Un Enfoque Hibrido Basado en Metaheur\u00edsticas para el Problema del Cartero Rural. In: Proceedings of XI CLAIO, Concepci\u00f3n de Chile, Chile (2002)"},{"issue":"1","key":"23_CR23","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 Transaction on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transaction on Evolutionary Computation"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. Biosystems\u00a043, 73\u201381 (1997)","journal-title":"Biosystems"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75271-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:57:54Z","timestamp":1619521074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75271-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752707","9783540752714"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75271-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}