{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:51:58Z","timestamp":1777099918910,"version":"3.51.4"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T00:00:00Z","timestamp":1510185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["446683\/2014-0"],"award-info":[{"award-number":["446683\/2014-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305223\/2015-1"],"award-info":[{"award-number":["305223\/2015-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["428549\/2016-0"],"award-info":[{"award-number":["428549\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["308498\/2015-1"],"award-info":[{"award-number":["308498\/2015-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["400722\/2013-5"],"award-info":[{"award-number":["400722\/2013-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10479-017-2642-9","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T04:11:48Z","timestamp":1510200708000},"page":"5-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet"],"prefix":"10.1007","volume":"273","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5414-1405","authenticated-orcid":false,"given":"Puca Huachi Vaz","family":"Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5183-8485","authenticated-orcid":false,"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Prins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,9]]},"reference":[{"issue":"2","key":"2642_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s11750-012-0266-4","volume":"22","author":"P Amorim","year":"2014","unstructured":"Amorim, P., Parragh, S., Sperandio, F., & Almada-Lobo, B. (2014). A rich vehicle routing problem dealing with perishable food: A case study. TOP, 22(2), 489\u2013508.","journal-title":"TOP"},{"key":"2642_CR2","first-page":"11","volume-title":"The vehicle routing problem: Latest advances and new challenges. Chap. Routing a heterogeneous fleet of vehicles","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Battarra, M., & Vigo, D. (2008). The vehicle routing problem: Latest advances and new challenges. Chap. Routing a heterogeneous fleet of vehicles (pp. 11\u201335). Berlin: Springer."},{"issue":"4","key":"2642_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1002\/net.20331","volume":"54","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., Battarra, M., & Vigo, D. (2009). Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. Networks, 54(4), 178\u2013189.","journal-title":"Networks"},{"issue":"3","key":"2642_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10287-009-0118-3","volume":"7","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A., & Roberti, R. (2010a). An exact solution framework for a broad class of vehicle routing problems. Computational Management Science, 7(3), 229\u2013268.","journal-title":"Computational Management Science"},{"issue":"1","key":"2642_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10479-009-0650-0","volume":"175","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Toth, P., & Vigo, D. (2010b). Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research, 175(1), 213\u2013245.","journal-title":"Annals of Operations Research"},{"key":"2642_CR6","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2008.08.003","volume":"199","author":"P Belfiore","year":"2009","unstructured":"Belfiore, P., & Yoshizaki, H. T. Y. (2009). Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. European Journal of Operational Research, 199, 750\u2013758.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2642_CR7","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s10845-012-0627-8","volume":"24","author":"F Belmecheri","year":"2013","unstructured":"Belmecheri, F., Prins, C., Yalaoui, F., & Amodeo, L. (2013). Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. Journal of Intelligent Manufacturing, 24(4), 775\u2013789.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"9\u201312","key":"2642_CR8","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1007\/s00170-014-6512-1","volume":"77","author":"M Berghida","year":"2015","unstructured":"Berghida, M., & Boukra, A. (2015). EBBO: An enhanced biogeography-based optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. The International Journal of Advanced Manufacturing Technology, 77(9\u201312), 1711\u20131725.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"5","key":"2642_CR9","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., & Righini, G. (2011). A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies, 19(5), 723\u2013740.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"3","key":"2642_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR), 35(3), 268\u2013308.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"2642_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-75514-2_2","volume-title":"Hybrid metaheuristics. Lecture notes in computer science","author":"M Boudia","year":"2007","unstructured":"Boudia, M., Prins, C., & Reghioui, M. (2007). An effective memetic algorithm with population management for the split delivery vehicle routing problem. In T. Bartz-Beielstein, M. Blesa Aguilera, C. Blum, B. Naujoks, A. Roli, G. Rudolph, & M. Sampels (Eds.), Hybrid metaheuristics. Lecture notes in computer science (Vol. 4771, pp. 16\u201330). Berlin: Springer."},{"key":"2642_CR12","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.ejor.2007.05.059","volume":"195","author":"J Brand\u00e3o","year":"2009","unstructured":"Brand\u00e3o, J. (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 195, 716\u2013728.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR13","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.cor.2010.04.008","volume":"38","author":"J Brand\u00e3o","year":"2011","unstructured":"Brand\u00e3o, J. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers & Operations Research, 38, 140\u2013151.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2642_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/trsc.1070.0217","volume":"42","author":"O Br\u00e4ysy","year":"2008","unstructured":"Br\u00e4ysy, O., Dullaert, W., Hasle, G., Mester, D., & Gendreau, M. (2008). An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transportation Science, 42(3), 371\u2013386.","journal-title":"Transportation Science"},{"key":"2642_CR15","doi-asserted-by":"publisher","first-page":"8460","DOI":"10.1016\/j.eswa.2008.10.040","volume":"36","author":"O Br\u00e4ysy","year":"2009","unstructured":"Br\u00e4ysy, O., Porkka, P. P., Dullaert, W., Repoussis, P. P., & Tarantilis, C. D. (2009). A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows. Expert Systems with Applications, 36, 8460\u20138475.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"2642_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2666003","volume":"47","author":"J C\u00e1ceres-Cruz","year":"2014","unstructured":"C\u00e1ceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2014a). Rich vehicle routing problem: Survey. ACM Computing Surveys, 47(2), 1\u201328.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"2642_CR17","first-page":"69","volume":"6","author":"J C\u00e1ceres-Cruz","year":"2014","unstructured":"C\u00e1ceres-Cruz, J., Grasas, A., Ramalhinho, H., & Juan, A. A. (2014b). A savings-based randomized heuristic for the heterogeneous fixed fleet vehicle routing problem with multi-trips. Journal of Applied Operational Research, 6(2), 69\u201381.","journal-title":"Journal of Applied Operational Research"},{"key":"2642_CR18","unstructured":"C\u00e1ceres-Cruz, J., Riera, D., Buil, R., & Juan, A. A. (2013). Applying a savings algorithm for solving a rich vehicle routing problem in a real urban context. In 5th International conference on applied operational research. Lecture notes in management science (Vol.\u00a05, pp. 84\u201392)."},{"issue":"1","key":"2642_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/trsc.1080.0256","volume":"43","author":"A Ceselli","year":"2009","unstructured":"Ceselli, A., Righini, G., & Salani, M. (2009). A column generation algorithm for a rich vehicle-routing problem. Transportation Science, 43(1), 56\u201369.","journal-title":"Transportation Science"},{"key":"2642_CR20","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E Choi","year":"2007","unstructured":"Choi, E., & Tcha, D. W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 34, 2080\u20132095.","journal-title":"Computers & Operations Research"},{"key":"2642_CR21","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. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568\u2013581.","journal-title":"Operations Research"},{"key":"2642_CR22","first-page":"292","volume":"39","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J. F., & Laporte, G. (2001). A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR, 39, 292\u20138.","journal-title":"INFOR"},{"key":"2642_CR23","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52, 928\u2013936.","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"2642_CR24","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"JF Cordeau","year":"2004","unstructured":"Cordeau, J. F., Laporte, G., & Mercier, A. (2004). Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. The Journal of the Operational Research Society, 55(5), 542\u2013546.","journal-title":"The Journal of the Operational Research Society"},{"issue":"9","key":"2642_CR25","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"JF Cordeau","year":"2012","unstructured":"Cordeau, J. F., & Maischberger, M. (2012). A parallel iterated tabu search heuristic for vehicle routing problems. Computers & Operations Research, 39(9), 2033\u20132050.","journal-title":"Computers & Operations Research"},{"key":"2642_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6, 80\u201391.","journal-title":"Management Science"},{"key":"2642_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.cie.2015.03.006","volume":"85","author":"J Armas de","year":"2015","unstructured":"de Armas, J., & Meli\u00e1n-Batista, B. (2015). Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Computers & Industrial Engineering, 85, 120\u2013131.","journal-title":"Computers & Industrial Engineering"},{"key":"2642_CR28","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.engappai.2015.03.009","volume":"42","author":"J Armas de","year":"2015","unstructured":"de Armas, J., Meli\u00e1n-Batista, B., Moreno-P\u00e9rez, J. A., & Brito, J. (2015). GVNS for a real-world rich vehicle routing problem with time windows. Engineering Applications of Artificial Intelligence, 42, 45\u201356.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"4","key":"2642_CR29","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/trsc.1070.0190","volume":"41","author":"M Dell\u2019Amico","year":"2007","unstructured":"Dell\u2019Amico, M., Monaci, M., Pagani, C., & Vigo, D. (2007). Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Science, 41(4), 516\u2013526.","journal-title":"Transportation Science"},{"issue":"1","key":"2642_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10732-013-9232-z","volume":"20","author":"U Derigs","year":"2014","unstructured":"Derigs, U., & Vogel, U. (2014). Experience with a framework for developing heuristics for solving rich vehicle routing problems. Journal of Heuristics, 20(1), 75\u2013106.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"2642_CR31","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10479-014-1551-4","volume":"236","author":"O Dominguez","year":"2016","unstructured":"Dominguez, O., Juan, A. A., Barrios, B., Faulin, J., & Agustin, A. (2016). Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet. Annals of Operations Research, 236(2), 383\u2013404.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2642_CR32","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., & Cerd\u00e1, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478\u20131507.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR33","unstructured":"Dongarra, J. J. (2010). Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee"},{"issue":"3","key":"2642_CR34","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"M Dror","year":"1990","unstructured":"Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics, 37(3), 383\u2013402.","journal-title":"Naval Research Logistics"},{"key":"2642_CR35","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-30671-6_9","volume-title":"Hybrid metaheuristics. Studies in computational intelligence","author":"C Duhamel","year":"2013","unstructured":"Duhamel, C., Gouinaud, C., Lacomme, P., & Prodhon, C. (2013). A multi-thread GRASPxELS for the heterogeneous capacitated vehicle routing problem. In E. G. Talbi (Ed.), Hybrid metaheuristics. Studies in computational intelligence (Vol. 434, pp. 237\u2013269). Berlin: Springer."},{"issue":"4","key":"2642_CR36","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.cor.2010.09.010","volume":"38","author":"C Duhamel","year":"2011","unstructured":"Duhamel, C., Lacomme, P., & Prodhon, C. (2011). Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Computers & Operations Research, 38(4), 723\u2013739.","journal-title":"Computers & Operations Research"},{"key":"2642_CR37","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Musaraganyi, C., & Taillard, E. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26, 1153\u20131173.","journal-title":"Computers & Operations Research"},{"key":"2642_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13800-3_1","volume-title":"Learning and intelligent optimization. Lecture notes in computer science","author":"A Goel","year":"2010","unstructured":"Goel, A. (2010). A column generation heuristic for the general vehicle routing problem. In C. Blum & R. Battiti (Eds.), Learning and intelligent optimization. Lecture notes in computer science (Vol. 6073, pp. 1\u20139). Berlin: Springer."},{"issue":"3","key":"2642_CR39","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.ejor.2006.12.065","volume":"191","author":"A Goel","year":"2008","unstructured":"Goel, A., & Gruhn, V. (2008). A general vehicle routing problem. European Journal of Operational Research, 191(3), 650\u2013660.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"BL Golden","year":"1984","unstructured":"Golden, B. L., Assad, A. A., Levy, L., & Gheysens, F. G. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research, 11, 49\u201366.","journal-title":"Computers & Operations Research"},{"key":"2642_CR41","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & P\u00e9rez, J. M. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175, 367\u2013407.","journal-title":"Annals of Operations Research"},{"key":"2642_CR42","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1016\/j.cor.2010.03.015","volume":"37","author":"A Hoff","year":"2010","unstructured":"Hoff, A., Andersson, H., Christiansen, M., Hasle, G., & L\u00f8kketangen, A. (2010). Industrial aspects and literature survey: Fleet composition and routing. Computers & Operations Research, 37, 2041\u20132061.","journal-title":"Computers & Operations Research"},{"key":"2642_CR43","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2008.07.022","volume":"197","author":"A Imran","year":"2009","unstructured":"Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197, 509\u2013518.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR44","doi-asserted-by":"crossref","unstructured":"Irnich, S., Schneider, M., & Vigo, D. (2014) Vehicle routing: Problems, methods, and applications, chap Four variants of the vehicle routing problem (pp. 241\u2013271). MOS-SIAM series on optimization.","DOI":"10.1137\/1.9781611973594.ch9"},{"key":"2642_CR45","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"\u00c7 Ko\u00e7","year":"2015","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., & Laporte, G. (2015). A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Computers & Operations Research, 64, 11\u201327.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2642_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2642_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani, R., Khemakhem, M., & Semet, F. (2015). Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research, 241(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR48","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1057\/palgrave.jors.2602421","volume":"59","author":"Y Lee","year":"2008","unstructured":"Lee, Y., Kim, J., Kang, K., & Kim, K. (2008). A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Journal of the Operational Research Society, 59, 833\u2013841.","journal-title":"Journal of the Operational Research Society"},{"key":"2642_CR49","doi-asserted-by":"publisher","first-page":"2734","DOI":"10.1016\/j.cor.2005.10.015","volume":"34","author":"F Li","year":"2007","unstructured":"Li, F., Golden, B., & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 34, 2734\u20132742.","journal-title":"Computers & Operations Research"},{"key":"2642_CR50","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.eswa.2011.07.025","volume":"39","author":"X Li","year":"2012","unstructured":"Li, X., Leung, S. C., & Tian, P. (2012). A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Systems with Applications, 39, 365\u2013374.","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"2642_CR51","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.tre.2010.02.004","volume":"46","author":"X Li","year":"2010","unstructured":"Li, X., Tian, P., & Aneja, Y. (2010). An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1111\u20131127.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"2642_CR52","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.endm.2004.06.027","volume":"18","author":"CMRR Lima","year":"2004","unstructured":"Lima, C. M. R. R., Goldbarg, M. C., & Goldbarg, E. F. G. (2004). A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electronic Notes in Discrete Mathematics, 18, 171\u2013176.","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"7","key":"2642_CR53","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"FH Liu","year":"1999","unstructured":"Liu, F. H., & Shen, S. Y. (1999). The fleet size and mix vehicle routing problem with time windows. The Journal of the Operational Research Society, 50(7), 721\u2013732.","journal-title":"The Journal of the Operational Research Society"},{"key":"2642_CR54","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.tre.2008.10.003","volume":"45","author":"S Liu","year":"2009","unstructured":"Liu, S., Huang, W., & Ma, H. (2009). An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transportation Research Part E, 45, 434\u2013445.","journal-title":"Transportation Research Part E"},{"key":"2642_CR55","first-page":"363","volume-title":"Handbook of metaheuristics. International series in operations research & management science","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H. R., Martin, O. C., & St\u00fctzle, T. (2010). Iterated local search: Framework and applications. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics. International series in operations research & management science (Vol. 146, pp. 363\u2013397). New York: Springer."},{"key":"2642_CR56","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","volume":"70","author":"S Mancini","year":"2016","unstructured":"Mancini, S. (2016). A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: Formulation and adaptive large neighborhood search based matheuristic. Transportation Research Part C: Emerging Technologies, 70, 100\u2013112.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"2","key":"2642_CR57","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10732-011-9159-1","volume":"19","author":"J Mar-Ortiz","year":"2013","unstructured":"Mar-Ortiz, J., Gonz\u00e1lez-Velarde, J., & Adenso-D\u00edaz, B. (2013). Designing routes for weee collection: The vehicle routing problem with split loads and date windows. Journal of Heuristics, 19(2), 103\u2013127.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"2642_CR58","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1287\/opre.31.2.277","volume":"31","author":"LF McGinnis","year":"1983","unstructured":"McGinnis, L. F. (1983). Implementation and testing of a primal\u2013dual algorithm for the assignment problem. Operations Research, 31(2), 277\u2013291.","journal-title":"Operations Research"},{"issue":"4","key":"2642_CR59","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Br\u00e4ysy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 37(4), 724\u2013737.","journal-title":"Computers & Operations Research"},{"key":"2642_CR60","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BFb0055938","volume":"1391","author":"L Ochi","year":"1998","unstructured":"Ochi, L., Vianna, D., Drummond, L. M. A., & Victor, A. (1998a). An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. Lecture Notes in Computer Science, 1391, 187\u2013195.","journal-title":"Lecture Notes in Computer Science"},{"key":"2642_CR61","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0167-739X(98)00034-X","volume":"14","author":"L Ochi","year":"1998","unstructured":"Ochi, L., Vianna, D., Drummond, L. M. A., & Victor, A. (1998b). A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems, 14, 285\u2013292.","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"2642_CR62","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/08839511003715196","volume":"24","author":"PM Ozfirat","year":"2010","unstructured":"Ozfirat, P. M., & Ozkarahan, I. (2010). A constraint programming heuristic for a heterogeneous vehicle routing problem with split deliveries. Applied Artificial Intelligence, 24(4), 277\u2013294.","journal-title":"Applied Artificial Intelligence"},{"key":"2642_CR63","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10732-007-9045-z","volume":"14","author":"D Paraskevopoulos","year":"2008","unstructured":"Paraskevopoulos, D., Repoussis, P., Tarantilis, C., Ioannou, G., & Prastacos, G. (2008). A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. Journal of Heuristics, 14, 425\u2013455.","journal-title":"Journal of Heuristics"},{"key":"2642_CR64","first-page":"627","volume-title":"Knowledge-based intelligent information and engineering systems. Lecture notes in computer science","author":"P Pellegrini","year":"2007","unstructured":"Pellegrini, P., Favaretto, D., & Moretti, E. (2007). Multiple ant colony optimization for a rich vehicle routing problem: A case study. In B. Apolloni, R. Howlett, & L. Jain (Eds.), Knowledge-based intelligent information and engineering systems. Lecture notes in computer science (Vol. 4693, pp. 627\u2013634). Berlin: Springer."},{"issue":"2","key":"2642_CR65","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna, P. H. V., Subramanian, A., & Ochi, L. S. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19(2), 201\u2013232.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"2642_CR66","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.20330","volume":"54","author":"A Pessoa","year":"2009","unstructured":"Pessoa, A., Uchoa, E., & de Arag\u00e3o, M. P. (2009). A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks, 54(4), 167\u2013177.","journal-title":"Networks"},{"issue":"8","key":"2642_CR67","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., & R\u00f8pke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403\u20132435.","journal-title":"Computers & Operations Research"},{"key":"2642_CR68","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1016516326823","volume":"1","author":"C Prins","year":"2002","unstructured":"Prins, C. (2002). Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms, 1, 135\u2013150.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"6","key":"2642_CR69","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins, C. (2009). Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence, 22(6), 916\u2013928.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2642_CR70","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.trc.2014.01.011","volume":"40","author":"C Prins","year":"2014","unstructured":"Prins, C., Lacomme, P., & Prodhon, C. (2014). Order-first split-second methods for vehicle routing problems: A review. Transportation Research Part C, 40, 179\u2013200.","journal-title":"Transportation Research Part C"},{"issue":"5","key":"2642_CR71","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.trc.2009.08.004","volume":"18","author":"P Repoussis","year":"2010","unstructured":"Repoussis, P., & Tarantilis, C. (2010). Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transportation Research Part C: Emerging Technologies, 18(5), 695\u2013712.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"2642_CR72","doi-asserted-by":"crossref","unstructured":"Reyes, L. C., Barbosa, J. G., Vargas, D. R., Huacuja, H. F., Valdez, N. R., Ortiz, J. H., Cruz, B. A., & Orta, J. D. (2007) A distributed metaheuristic for solving a real-world scheduling\u2013routing\u2013loading problem. In I. Stojmenovic, R. Thulasiram, L. Yang, W. Jia, M. Guo, R. de\u00a0Mello (Eds.), Parallel and distributed processing and applications. Lecture notes in computer science (Vol. 4742, pp. 68 \u2013 77).","DOI":"10.1007\/978-3-540-74742-0_9"},{"issue":"1","key":"2642_CR73","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10479-010-0748-4","volume":"181","author":"J Rieck","year":"2010","unstructured":"Rieck, J., & Zimmermann, J. (2010). A new mixed integer linear model for a rich vehicle routing problem with docking constraints. Annals of Operations Research, 181(1), 337\u2013358.","journal-title":"Annals of Operations Research"},{"key":"2642_CR74","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., & Taillard, R. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"2642_CR75","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke, S., & Pisinger, D. (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171(3), 750\u2013775.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR76","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.cor.2013.05.011","volume":"52","author":"S Salhi","year":"2014","unstructured":"Salhi, S., Imran, A., & Wassan, N. A. (2014). The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Computers & Operations Research, 52, 315\u2013325.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2642_CR77","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","volume":"103","author":"S Salhi","year":"1997","unstructured":"Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103(1), 95\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"2642_CR78","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tre.2013.05.005","volume":"56","author":"S Salhi","year":"2013","unstructured":"Salhi, S., Wassan, N., & Hajarat, M. (2013). The fleet size and mix vehicle routing problem with backhauls: Formulation and set partitioning-based heuristics. Transportation Research Part E: Logistics and Transportation Review, 56, 22\u201335.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"2642_CR79","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2014.08.005","volume":"53","author":"MM Silva","year":"2015","unstructured":"Silva, M. M., Subramanian, A., & Ochi, L. S. (2015). An iterated local search heuristic for the split delivery vehicle routing problem. Computers & Operations Research, 53, 234\u2013249.","journal-title":"Computers & Operations Research"},{"key":"2642_CR80","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.ejor.2012.03.016","volume":"221","author":"A Subramanian","year":"2012","unstructured":"Subramanian, A., Penna, P. H. V., Uchoa, E., & Ochi, L. S. (2012). A hybrid algorithm for the heterogenous fleet vehicle routing problem. European Journal of Operational Research, 221, 285\u2013295.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"2642_CR81","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian, A., Uchoa, E., & Ochi, L. S. (2013). A hybrid algorithm for a class of vehicle routing problems. Computers & Operations Research, 40(10), 2519\u20132531.","journal-title":"Computers & Operations Research"},{"key":"2642_CR82","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"ED Taillard","year":"1999","unstructured":"Taillard, E. D. (1999). A heuristic column generation method for heterogeneous fleet. RAIRO (Recherche op\u00e9rationnelle), 33, 1\u201314.","journal-title":"RAIRO (Recherche op\u00e9rationnelle)"},{"key":"2642_CR83","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1057\/palgrave.jors.2601443","volume":"54","author":"CD Tarantilis","year":"2003","unstructured":"Tarantilis, C. D., Kiranoudis, C. T., & Vassiliadis, V. S. (2003). A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Journal of the Operational Research Society, 54, 65\u201371.","journal-title":"Journal of the Operational Research Society"},{"key":"2642_CR84","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","volume":"152","author":"CD Tarantilis","year":"2004","unstructured":"Tarantilis, C. D., Kiranoudis, C. T., & Vassiliadis, V. S. (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research, 152, 148\u2013158.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"2642_CR85","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jfranklin.2005.12.002","volume":"344","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam, R., Safaei, N., Kah, M., & Rabbani, M. (2007). A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. Journal of the Franklin Institute, 344(5), 406\u2013425. (Modeling, simulation and applied optimization Part II).","journal-title":"Journal of the Franklin Institute"},{"key":"2642_CR86","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ejor.2009.03.044","volume":"201","author":"GY T\u00fct\u00fcnc\u00fc","year":"2010","unstructured":"T\u00fct\u00fcnc\u00fc, G. Y. (2010). An interactive gramps algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls. European Journal of Operational Research, 201, 593\u2013600.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2642_CR87","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013a). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 231(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2642_CR88","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013b). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & Operations Research, 40(1), 475\u2013489.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2642_CR89","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658\u2013673.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2642_CR90","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10732-014-9273-y","volume":"21","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Crainic, T., Gendreau, M., & Prins, C. (2015). Time-window relaxations in vehicle routing heuristics. Journal of Heuristics, 21(3), 329\u2013358.","journal-title":"Journal of Heuristics"},{"key":"2642_CR91","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1057\/palgrave.jors.2601344","volume":"53","author":"NA Wassan","year":"2002","unstructured":"Wassan, N. A., & Osman, I. H. (2002). Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society, 53, 768\u2013782.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"2642_CR92","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10479-015-1792-x","volume":"242","author":"B Yao","year":"2016","unstructured":"Yao, B., Yu, B., Hu, P., Gao, J., & Zhang, M. (2016). An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals of Operations Research, 242(2), 303\u2013320.","journal-title":"Annals of Operations Research"},{"issue":"9","key":"2642_CR93","doi-asserted-by":"publisher","first-page":"2565","DOI":"10.1080\/00207543.2013.855337","volume":"52","author":"M Yousefikhoshbakht","year":"2014","unstructured":"Yousefikhoshbakht, M., Didehvar, F., & Rahmati, F. (2014). Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm. International Journal of Production Research, 52(9), 2565\u20132575.","journal-title":"International Journal of Production Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2642-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2642-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2642-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T18:34:34Z","timestamp":1572028474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2642-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,9]]},"references-count":93,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["2642"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2642-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,9]]},"assertion":[{"value":"9 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}