{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:00:41Z","timestamp":1742943641843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624273"},{"type":"electronic","value":"9783319624280"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62428-0_30","type":"book-chapter","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T22:48:34Z","timestamp":1501541314000},"page":"377-387","source":"Crossref","is-referenced-by-count":0,"title":["Metaheuristic Hybridized Applied to Solve the Capacity Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Ernesto","family":"Li\u00f1\u00e1n-Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda Crystal","family":"Cruz Villegas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascual","family":"Montes Dorantes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerardo Maximiliano","family":"M\u00e9ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"key":"30_CR1","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problems. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"C Wen-Chyuan","year":"1996","unstructured":"Wen-Chyuan, C., Robert, R.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63, 3\u201327 (1996)","journal-title":"Ann. Oper. Res."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-005-5431-6","volume":"10","author":"B Olli","year":"2004","unstructured":"Olli, B., Wout, D., Michel, G.: Evolutionary algorithms for the vehicle routing problem with time windows. J. Heuristics 10, 587\u2013611 (2004)","journal-title":"J. Heuristics"},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"N Gabor","year":"2007","unstructured":"Gabor, N., Said, S.: Location-routing: issues, models and methods. Eur. J. Oper. Res. 177, 649\u2013672 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR6","unstructured":"Flatberg, T.: Dynamic and Stochastic Aspects in Vehicle Routing: A Literature Survey. SINTEF rapport. SINTEF ICT (2005). ISBN 9788214028430"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"B Olli","year":"2005","unstructured":"Olli, B., Michel, G.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39, 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"key":"30_CR8","first-page":"147","volume":"31","author":"L Gilbert","year":"1987","unstructured":"Gilbert, L., Yves, N.: Exact algorithms for the vehicle routing problem. Surv. Comb. Optim. 31, 147\u2013184 (1987)","journal-title":"Surv. Comb. Optim."},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"L Gilbert","year":"1992","unstructured":"Gilbert, L.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18, 41\u201348 (2004)","journal-title":"Adv. Eng. Inform."},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421\u2013451 (1993)","journal-title":"Ann. Oper. Res."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Czech, Z.J., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, Canary Islands-Spain, pp. 376\u2013383 (2002)","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Thangiah, S.R.: Vehicle routing with time windows using genetic algorithms (1995)","DOI":"10.1201\/9781420050073.ch11"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"JHG Homberger","year":"2005","unstructured":"Homberger, J.H.G.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162, 220\u2013238 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR15","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","volume":"21","author":"G Bruno-Laurent","year":"1994","unstructured":"Bruno-Laurent, G., Jean-Yves, P., Jean-Marc, R.: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput. Oper. Res. 21, 1025\u20131033 (1994)","journal-title":"Comput. Oper. Res."},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.cor.2012.06.008","volume":"40","author":"D Ta\u015f","year":"2013","unstructured":"Ta\u015f, D., Dellaert, N., Van Woensel, T., De Kok, T.: Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40, 214\u2013224 (2013)","journal-title":"Comput. Oper. Res."},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"4598","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 4598, 671\u2013680 (1983)","journal-title":"Science"},{"key":"30_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny, V.: Thermodynamical approach to the traveling salesman problem: an eficient simulation algorithm. J. Optim. Theory Appl. 45, 41\u201351 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"30_CR19","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"M Nicholas","year":"1953","unstructured":"Nicholas, M., Arianna, R., Marshall, R., Augusta, T., Edward, T.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"30_CR20","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E Aarts","year":"1989","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, Hoboken (1989)"},{"key":"30_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","volume":"18","author":"L Ingber","year":"1993","unstructured":"Ingber, L.: Simulated annealing: practice versus theory. J. Math. Comput. Model. 18, 29\u201357 (1993)","journal-title":"J. Math. Comput. Model."},{"key":"30_CR22","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890544","volume":"2","author":"U Kjaerul","year":"1991","unstructured":"Kjaerul, U.: Optimal decomposition of probabilistic networks by simulated annealing. Stat. Comput. 2, 7\u201317 (1991)","journal-title":"Stat. Comput."},{"key":"30_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"PJ Laarhoven van","year":"1987","unstructured":"van Laarhoven, P.J., Aarts, E.H.: Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, Berlin (1987)"},{"key":"30_CR24","doi-asserted-by":"crossref","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. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"30_CR25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.2306\/scienceasia1513-1874.2012.38.307","volume":"38","author":"P Tantikorn","year":"2012","unstructured":"Tantikorn, P., Ruengsak, K.: An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem. ScienceAsia 38, 307\u2013318 (2012)","journal-title":"ScienceAsia"},{"key":"30_CR26","first-page":"17","volume":"2012","author":"Y Kao","year":"2012","unstructured":"Kao, Y., Chen, M.-H., Huang, Y.-T.: A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems. Math. Prob. Eng. 2012, 17 (2012)","journal-title":"Math. Prob. Eng."},{"key":"30_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11590-012-0555-8","volume":"7","author":"JE Mendoza","year":"2013","unstructured":"Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7, 1\u201314 (2013)","journal-title":"Optim. Lett."}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62428-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T17:43:09Z","timestamp":1569951789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62428-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319624273","9783319624280"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62428-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}