{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:06:06Z","timestamp":1725563166883},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152856"},{"type":"electronic","value":"9783642152863"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15286-3_25","type":"book-chapter","created":{"date-parts":[[2010,8,25]],"date-time":"2010-08-25T03:56:43Z","timestamp":1282708603000},"page":"243-249","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic"],"prefix":"10.1007","author":[{"given":"Joseph Gallart","family":"Su\u00e1rez","sequence":"first","affiliation":[]},{"given":"Manuel Tupia","family":"Anticona","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Prins, C.: A GRASP X Evolutionary Local Search Hybrid for the Vehicle Routing Problem. In: Bioinspired Algorithms for the Vehicle Routing Problem, vol.\u00a01, p. 35 (2008)","DOI":"10.1007\/978-3-540-85152-3_2"},{"key":"25_CR2","unstructured":"Universidad de M\u00e1laga (2009), http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP\/"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Marinakis, Y., Migdalas, A.: Operational Research\u00a07(1), 27\u201346 (2007)","DOI":"10.1007\/BF02941184"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/net.3230160104","volume":"16","author":"G. Laporte","year":"1986","unstructured":"Laporte, G., Mercure, H., Nobert, Y.: An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks\u00a016, 33\u201346 (1986)","journal-title":"Networks"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/opre.42.5.846","volume":"42","author":"M. Fischetti","year":"1994","unstructured":"Fischetti, M., Toth, P., Vigo, D.: A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Operations Research\u00a042, 846\u2013859 (1994)","journal-title":"Operations Research"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"M.L. Fisher","year":"1994","unstructured":"Fisher, M.L.: Optimal solution of vehicle routing problems using minimum k-trees. Operations Research\u00a042, 626\u2013642 (1994)","journal-title":"Operations Research"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming\u00a033, 1\u201327 (1985)","journal-title":"Mathematical Programming"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1993","unstructured":"Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the symetric traveling salesman polytope. Mathematical Programming\u00a058, 53\u201388 (1993)","journal-title":"Mathematical Programming"},{"key":"25_CR9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P. Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Society of Industrial and Applied Mathematics (SIAM), Philadelphia (2002)"},{"key":"25_CR10","unstructured":"Claudio Contardo Vera: Formulaci\u00f3n y soluci\u00f3n de un problema de ruteo de veh\u00edculos con demanda variable en tiempo real, trasbordos y ventanas de tiempo. Universidad de Chile (2005)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012, 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0305-0548(91)90028-P","volume":"18","author":"M. Desrochers","year":"1991","unstructured":"Desrochers, M., Verhoog, T.W.: A new heuristic for the fleet size and mix vehicle routing problem. Computers & OR\u00a018, 263\u2013274 (1991)","journal-title":"Computers & OR"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1287\/opre.39.3.456","volume":"39","author":"K. Altinkemer","year":"1991","unstructured":"Altinkemer, K., Gavish, B.: Parallel Savings Based Heuristics for the Delivery Problem. Operations Research\u00a039(3), 456\u2013469 (1991)","journal-title":"Operations Research"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1057\/jors.1976.95","volume":"27","author":"R.H. Mole","year":"1976","unstructured":"Mole, R.H., Jameson, S.R.: A sequential route-building algorithm employing a generalized savings criterion. Operations Research Quarterly\u00a027, 503\u2013511 (1976)","journal-title":"Operations Research Quarterly"},{"key":"25_CR15","volume-title":"The vehicle routing problem","author":"N. Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. Wiley, Chichester (1979)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035 (1987)","DOI":"10.1287\/opre.35.2.254"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Dong, L.W., Xiang, C.T.: Ant Colony Optimization for VRP and Mail Delivery Problems. In: 2006 IEEE International Conference on Industrial Informatics, pp. 1143\u20131148 (2006)","DOI":"10.1109\/INDIN.2006.275779"},{"key":"25_CR18","first-page":"77","volume":"161","author":"B. Ombuki-Berman","year":"2009","unstructured":"Ombuki-Berman, B., Hanshar, F.T.: Using Genetic Algorithms for Multi-depot Vehicle Routing. Studies in Computational Intelligence\u00a0161, 77\u201399 (2009)","journal-title":"Studies in Computational Intelligence"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Wassan, N.A., Wassan, A.H., Nagy, G.: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization\u00a015(4) (2008)","DOI":"10.1007\/s10878-007-9090-4"},{"key":"25_CR20","first-page":"61","volume":"19","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Velarde, J.L.G.: GRASP: Greedy Randomized Adaptive Search Procedures. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial\u00a019, 61\u201376 (2003)","journal-title":"Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial"},{"key":"25_CR21","unstructured":"Olivera, A.: Heur\u00edsticas para Problemas de Ruteo de Veh\u00edculos. Instituto de Computaci\u00f3n, Facultad de Ingenier\u00eda, Universidad de la Rep\u00fablica, Montevideo, Uruguay (2004)"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence in Theory and Practice III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15286-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:57:47Z","timestamp":1559447867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15286-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152856","9783642152863"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15286-3_25","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2010]]}}}