{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:06:10Z","timestamp":1725570370953},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148828"},{"type":"electronic","value":"9783642148835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14883-5_81","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T00:36:16Z","timestamp":1289954176000},"page":"637-644","source":"Crossref","is-referenced-by-count":0,"title":["Solving the General Routing Problem by Artificial Ants"],"prefix":"10.1007","author":[{"given":"Mar\u00eda-Luisa","family":"P\u00e9rez-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"81_CR1","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0927-0507(05)80109-4","volume-title":"Network Routing","author":"A.A. Assard","year":"1995","unstructured":"Assard, A.A., Golden, B.L.: Arc routing methods and applications. In: Ball, M.G., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, vol.\u00a08, pp. 375\u2013483. Elsevier, Amsterdam (1995)"},{"key":"81_CR2","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1057\/palgrave.jors.2601590","volume":"54","author":"M. Blais","year":"2003","unstructured":"Blais, M., Laporte, G.: Exact solution of the generalized routing problem through graph transformations. The J. of the Oper. Res. Soc.\u00a054, 906\u2013910 (2003)","journal-title":"The J. of the Oper. Res. Soc."},{"key":"81_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/PL00011426","volume":"90","author":"A. Corber\u00e1n","year":"2001","unstructured":"Corber\u00e1n, A., Letchford, N., Sanch\u00eds, J.M.: A cutting plane algorithm for the general routing problem. Math. Program. Ser. A\u00a090, 291\u2013316 (2001)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"81_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/S0377-2217(96)00337-2","volume":"108","author":"A. Corber\u00e1n","year":"1998","unstructured":"Corber\u00e1n, A., Sanch\u00eds, J.M.: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra. Eur. J. Oper. Res.\u00a0108(3), 538\u2013550 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"81_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornuejols","year":"1985","unstructured":"Cornuejols, G., Fonlupt, J., Naddef, D.: The traveling salesman on a graph and some related integer polyhedra. Math. Program.\u00a033, 1\u201327 (1985)","journal-title":"Math. Program."},{"volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985","key":"81_CR6","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, New York (1985)"},{"key":"81_CR7","unstructured":"Dorigo, M, Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IRIDIA. 96-05. Universit\u00e9 Libre de Bruxelles (1996)"},{"key":"81_CR8","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: an atocatalytic optimizing process. Dipartamento di Electtronica e Informazione - Politecnico di Milano, Italia (1991)"},{"key":"81_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4495-1","volume-title":"Arc Routing: Theory, Solutions and Applications","author":"M. Dror","year":"2000","unstructured":"Dror, M.: Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston (2000)"},{"issue":"3","key":"81_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, Part I: The chinese postman problem. Oper. Res.\u00a043(3), 231\u2013244 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"81_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."},{"key":"81_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"B. Fleischmann","year":"1985","unstructured":"Fleischmann, B.: A cutting-plane procedure for the travelling salesman on a road network. Eur. J. Oper. Res.\u00a021, 307\u2013317 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"81_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0020-0190(92)90161-N","volume":"41","author":"K. Jansen","year":"1992","unstructured":"Jansen, K.: An approximation algorithm for the general routing problem. Inf. Proc. Letts\u00a041, 333\u2013339 (1992)","journal-title":"Inf. Proc. Letts"},{"issue":"2","key":"81_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res.\u00a059(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"81_CR15","first-page":"61","volume":"21","author":"G. Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: Generalized traveling salesman through n sets of nodes: an integer programming approach. INFOR\u00a021, 61\u201375 (1983)","journal-title":"INFOR"},{"key":"81_CR16","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, 273\u2013380 (1976)","journal-title":"Networks"},{"issue":"2","key":"81_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0377-2217(96)00346-3","volume":"96","author":"A.N. Letchford","year":"1997","unstructured":"Letchford, A.N.: New inequalities for the general routing problem. Eur. J. Oper. Res.\u00a096(2), 317\u2013322 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"81_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0377-2217(97)00377-9","volume":"112","author":"A.N. Letchford","year":"1999","unstructured":"Letchford, A.N.: The general routing polyhedron: A unifying framework. Eur. J. Oper. Res.\u00a0112(1), 122\u2013133 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"81_CR19","first-page":"39","volume":"31","author":"C.E. Noon","year":"1993","unstructured":"Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR\u00a031, 39\u201343 (1993)","journal-title":"INFOR"},{"key":"81_CR20","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":"81_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/net.3230060306","volume":"6","author":"C.S. Orloff","year":"1976","unstructured":"Orloff, C.S.: On general routing problems. Networks\u00a06, 281\u2013284 (1976)","journal-title":"Networks"},{"key":"81_CR22","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/trsc.10.4.361","volume":"19","author":"C.S. Orloff","year":"1976","unstructured":"Orloff, C.S., Caprera, D.: Reduction and solution of large scale vehicle routing problems. Transp. Sci.\u00a019, 361\u2013373 (1976)","journal-title":"Transp. Sci."},{"key":"81_CR23","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.dam.2007.04.025","volume":"156","author":"G. Reinelt","year":"2008","unstructured":"Reinelt, G., Theis, D.O.: On the general routing polytope. Discrete Applied Mathematics\u00a0156, 368\u2013384 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"81_CR24","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.: MAX-MIN ant system. Futur. Gener. Comput. Syst.\u00a016(8), 889\u2013914 (2000)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"81_CR25","unstructured":"St\u00fctzle, T., Hoos, H.: Improving the ant-system: A detailed report on the MAX-MIN ant system. AIDA-96-12. FG Intellektik, TH Darmstadt (1996)"},{"key":"81_CR26","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Baeck, T., Michalewicz, Z., Yao, X. (eds.) Proc. of the IEEE Int. Conf. on Evol. Comput., pp. 309\u2013314 (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"4","key":"81_CR27","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.: 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."},{"volume-title":"The Vehicle Routing Problem","year":"2002","key":"81_CR28","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)"}],"container-title":["Advances in Intelligent and Soft Computing","Distributed Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14883-5_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T02:25:36Z","timestamp":1553221536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14883-5_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148828","9783642148835"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14883-5_81","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2010]]}}}