{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:04Z","timestamp":1725512044170},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681229"},{"type":"electronic","value":"9783540681236"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68123-6_36","type":"book-chapter","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T08:11:39Z","timestamp":1210320699000},"page":"329-338","source":"Crossref","is-referenced-by-count":7,"title":["An Ant Colony System Algorithm to Solve Routing Problems Applied to the Delivery of Bottled Products"],"prefix":"10.1007","author":[{"given":"Laura","family":"Cruz Reyes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 F.","family":"Delgado Orta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan J.","family":"Gonz\u00e1lez Barbosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Torres Jimenez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9ctor J.","family":"Fraire Huacuja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B\u00e1rbara A.","family":"Arra\u00f1aga Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Toth, P., Vigo, D. (eds.): The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics (2001)"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-74742-0_9","volume-title":"Parallel and Distributed Processing and Applications","author":"L. Cruz","year":"2007","unstructured":"Cruz, L., et al.: A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol.\u00a04742, pp. 68\u201377. Springer, Heidelberg (2007)"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"36_CR4","unstructured":"Jong, C., Kant, G., Vliet, A.V.: On Finding Minimal Route Duration in the Vehicle Routing Problem with Multiple Time Windows, tech. report, Dept. of Computer Science, Utrecht Univ. (1996)"},{"key":"36_CR5","unstructured":"Mingozzi, A.: An exact Algorithm for Period and Multi-Depot Vehicle Routing Problems. Department of Mathematics, University of Bologna, Bologna, Italy (2003)"},{"key":"36_CR6","unstructured":"Archetti, C., Mansini, R., Speranza, M.G.: The Vehicle Routing Problem with capacity 2 and 3, General Distances and Multiple Customer Visits. Operational Research in Land and Resources Manangement, p. 102 (2001)"},{"key":"36_CR7","unstructured":"Thangiah, S.: A Site Dependent Vehicle Routing Problem with Complex Road Constraints. Artificial Intelligence and Robotics Laboratory, Slippery Rock University, U.S.A (2003)"},{"key":"36_CR8","unstructured":"Dorronsoro, B.: The VRP Web. AUREN. Language and Computation Sciences of the University of Mlaga (2005), \n                    \n                      http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP"},{"key":"36_CR9","unstructured":"Leonora, B.: Notes on Dynamic Vehicle Routing. Technical Report IDSIA-05-01. IDSIA - Istituto Dalle Molle di Studi sull\u2019Intelligenza Artificiale, Switzerland (2000)"},{"key":"36_CR10","unstructured":"Blescha, J., Goetshalckx, M.: The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms. Techincal report MHRC-TR-88-13, Georgia Institute of Technology (1993)"},{"key":"36_CR11","unstructured":"Fleischmann, B.: The Vehicle routing problem with multiple use of vehicles. Working paper, Fachbereigh Wirtschaftswissenschaften, Universitt Hamburg (1990)"},{"key":"36_CR12","unstructured":"Taillard, E.: A Heuristic Column Generation Method For the Heterogeneous Fleet VRP. Istituto Dalle Moli di Studi sull Inteligenza Artificiale, Switzerland. CRI-96-03 (1996)"},{"key":"36_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1007\/978-3-540-76631-5_103","volume-title":"MICAI 2007: Advances in Artificial Intelligence","author":"R. Cruz","year":"2007","unstructured":"Cruz, R., et al.: DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants. In: Gelbukh, A., Kuri Morales, \u00c1.F. (eds.) MICAI 2007. LNCS (LNAI), vol.\u00a04827, pp. 1078\u20131088. Springer, Heidelberg (2007)"},{"key":"36_CR14","unstructured":"Pisinger, D., Ropke, S.: A General Heuristic for Vehicle Routing Problems, tech. report, Dept. of Computer Science, Univ. Copenhagen (2005)"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-36605-9_28","volume-title":"Applications of Evolutionary Computing","author":"M. Reimann","year":"2003","unstructured":"Reimann, M., Doerner, K., Hartl, R.: Analyzing a Unified Ant System for the VRP and some of Its Variants. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 300\u2013310. Springer, Heidelberg (2003)"},{"key":"36_CR16","unstructured":"OR\/MS Today: Vehicle Routing Software Survey. United States. Institute for Operations Research and the Management Sciences (2006)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Dorigo, L., Gambardella, M.: Ant Colony System: A Cooperative Learning A-pproach to the Traveling Salesman Problem. In: Proc. IEEE Transactions on Evolutionary Computation, Belgica, vol.\u00a01(1) (1997)","DOI":"10.1109\/4235.585892"},{"key":"36_CR18","unstructured":"Bock, F.: An algorithm for solving traveling salesman and related network optimization problems. In: Fourteenth National Meeting of the Operational Research Society of America, St. Louis, MO, USA (1958)"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., Badeau, P., Gendreu, M., Guertin, F., Potvin, J.Y.: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science\u00a031, 170\u2013186 (1997)","journal-title":"Transportation Science"},{"key":"36_CR20","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"5","author":"G. Croes","year":"1958","unstructured":"Croes, G.: A method for solving traveling salesman problems. Proc. Operations Research 5, 791\u2013812 (1958)","journal-title":"Proc. Operations Research"},{"key":"36_CR21","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J. Potvin","year":"1995","unstructured":"Potvin, J., Rousseau, J.M.: An Exchange Heuristic for Routing Problems with Time Windows. Proc. Journal of the Operational Research Society\u00a046, 1433\u20131446 (1995)","journal-title":"Proc. Journal of the Operational Research Society"},{"key":"36_CR22","unstructured":"Prosser, P., Shaw, P.: Study of Greedy Search with Multiple Improvement Heuristics for Vehicle Routing Problems, tech. report, University of Strathclyde, Glasgow, Scotland (1996)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68123-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:35:52Z","timestamp":1620002152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68123-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681229","9783540681236"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68123-6_36","relation":{},"subject":[]}}