{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:33:29Z","timestamp":1759332809693},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024801"},{"type":"electronic","value":"9783642024818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-02481-8_74","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T01:18:06Z","timestamp":1244251086000},"page":"507-514","source":"Crossref","is-referenced-by-count":5,"title":["Rank-Based Ant System to Solve 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":"74_CR1","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":"74_CR2","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":"74_CR3","doi-asserted-by":"publisher","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"},{"issue":"8","key":"74_CR4","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1057\/palgrave.jors.2601161","volume":"52","author":"G. Ghiani","year":"2001","unstructured":"Ghiani, G., Improta, G.: The Laser-plotter Beam Routing Problem. J. Oper. Res. Soc.\u00a052(8), 945\u2013951 (2001)","journal-title":"J. Oper. Res. Soc."},{"key":"74_CR5","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An Algorithm for the Rural Postman Problem. Imperial College Report IC-OP-81-5. London (1981)"},{"key":"74_CR6","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"},{"issue":"3","key":"74_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. Programming\u00a087(3), 467\u2013481 (2000)","journal-title":"Math. Programming"},{"key":"74_CR8","unstructured":"Letchford, A.N.: Polyhedral Results for Some Constrained Arc Routing Problemas. PhD Dissertation, Lancaster University, Lancaster (1996)"},{"issue":"3","key":"74_CR9","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":"74_CR10","doi-asserted-by":"publisher","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":"74_CR11","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":"74_CR12","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":"74_CR13","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."},{"issue":"12","key":"74_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":"1","key":"74_CR15","doi-asserted-by":"publisher","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":"74_CR16","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. on Computing\u00a011(1), 53\u201362 (1999)","journal-title":"INFORMS J. on Computing"},{"key":"74_CR17","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":"74_CR18","unstructured":"Baldoqu\u00edn, M.G.: Heuristics and Metaheuristics Approaches Used to Solve the Rural Postman Problem: a Comparative Case Study. In: Fourth International ICSC Symposium on Engineering of Intelligent Systems, Madeira, Portugal (2004)"},{"key":"74_CR19","unstructured":"Baldoqu\u00edn, M.G., Ryan, G., Rodr\u00edguez, R., Castellini, A.: Un Enfoque H\u00edbrido Basado en Metaheur\u00edsticas para el Problema del Cartero Rural. In: XI CLAIO, Concepci\u00f3n de Chile, Chile (2002)"},{"key":"74_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. Technical report, Dept. of Computer Engineering, Kyung Hee University (1998)","DOI":"10.1145\/330560.330839"},{"key":"74_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":"74_CR22","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, vol.\u00a04788, pp. 220\u2013228. Springer, Heidelberg (2007)"},{"key":"74_CR23","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":"74_CR24","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":"74_CR25","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. Journal of Insect Behaviour\u00a03, 159\u2013168 (1990)","journal-title":"Journal of Insect Behaviour"},{"issue":"1","key":"74_CR26","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"},{"issue":"1","key":"74_CR27","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank-based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics\u00a07(1), 25\u201338 (1999)","journal-title":"Central European Journal for Operations Research and Economics"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02481-8_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T18:28:06Z","timestamp":1558376886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02481-8_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024801","9783642024818"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02481-8_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}