{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:39:59Z","timestamp":1780627199869,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T00:00:00Z","timestamp":1315440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10732-011-9186-y","type":"journal-article","created":{"date-parts":[[2011,9,7]],"date-time":"2011-09-07T04:47:24Z","timestamp":1315370844000},"page":"201-232","source":"Crossref","is-referenced-by-count":212,"title":["An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Puca Huachi Vaz","family":"Penna","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,9,8]]},"reference":[{"key":"9186_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R. Baldacci","year":"2009","unstructured":"Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120, 347\u2013380 (2009)","journal-title":"Math. Program."},{"key":"9186_CR2","first-page":"11","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"R. Baldacci","year":"2008","unstructured":"Baldacci, R., Battarra, M., Vigo, D.: Routing a heterogeneous fleet of vehicles. In: The Vehicle Routing Problem: Latest Advances and New Challenges, pp.\u00a011\u201335. Springer, Berlin (2008)"},{"issue":"1","key":"9186_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10852-005-9033-y","volume":"5","author":"L. Bianchi","year":"2006","unstructured":"Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., Schiavinotto, T.: Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J.\u00a0Math. Model. Algorithms 5(1), 91\u2013110 (2006)","journal-title":"J.\u00a0Math. Model. Algorithms"},{"key":"9186_CR4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1016\/j.ejor.2007.05.059","volume":"195","author":"J. Brand\u00e3o","year":"2009","unstructured":"Brand\u00e3o, J.: A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 195, 716\u2013728 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9186_CR5","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1016\/j.eswa.2009.06.047","volume":"37","author":"P. Chen","year":"2010","unstructured":"Chen, P., Huang, H.K., Dong, X.Y.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Syst. Appl. 37(2), 1620\u20131627 (2010)","journal-title":"Expert Syst. Appl."},{"key":"9186_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/07408170304371","volume":"35","author":"R. Cheung","year":"2003","unstructured":"Cheung, R., Hang, D.: Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls. IIE Trans. 35, 191\u2013205 (2003)","journal-title":"IIE Trans."},{"key":"9186_CR7","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E. Choi","year":"2007","unstructured":"Choi, E., Tcha, D.W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2080\u20132095 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR8","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":"9186_CR9","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J.F. Cordeau","year":"2002","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F.: A guide to vehicle routing problem. J.\u00a0Oper. Res. Soc. 53, 512\u2013522 (2002)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9186_CR10","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. Tech. Rep. CS-89-85. Computer Science Department, University of Tennessee (2010)"},{"key":"9186_CR11","doi-asserted-by":"crossref","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.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26, 1153\u20131173 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9186_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths in integer programming and links to Artificial Intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/0-306-48056-5_1","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Marti, R.: Scatter search and path relinking: advances and appl. In: Handbook of Metaheuristics, pp.\u00a01\u201336. Kluwer Academic, Dordrecht (2003)"},{"key":"9186_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B.L. Golden","year":"1984","unstructured":"Golden, B.L., Assad, A.A., Levy, L., Gheysens, F.G.: The feet size and mix vehicle routing problem. Comput. Oper. Res. 11, 49\u201366 (1984)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR15","doi-asserted-by":"crossref","first-page":"1515","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.: Industrial aspects and literature survey: Fleet composition and routing. Comput. Oper. Res. 37, 1515\u20131536 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR16","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"issue":"11","key":"9186_CR17","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1016\/j.dam.2007.04.022","volume":"156","author":"T. Ibaraki","year":"2008","unstructured":"Ibaraki, T., Imahori, S., Nonobe, K., Sobue, K., Uno, T., Yagiura, M.: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Appl. Math. 156(11), 2050\u20132069 (2008)","journal-title":"Discrete Appl. Math."},{"key":"9186_CR18","doi-asserted-by":"crossref","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.: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 197, 509\u2013518 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9186_CR19","doi-asserted-by":"crossref","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.: A heuristic for vehicle fleet mix problem using tabu search and set partitioning. J. Oper. Res. Soc.. 59, 833\u2013841 (2008)","journal-title":"J. Oper. Res. Soc."},{"key":"9186_CR20","doi-asserted-by":"crossref","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.: A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2734\u20132742 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR21","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.endm.2004.06.027","volume":"18","author":"C.M.R.R. Lima","year":"2004","unstructured":"Lima, C.M.R.R., Goldbarg, M.C., Goldbarg, E.F.G.: A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electron. Notes Discrete Math. 18, 171\u2013176 (2004)","journal-title":"Electron. Notes Discrete Math."},{"key":"9186_CR22","doi-asserted-by":"crossref","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.: An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transp. Res., Part B, Methodol. 45, 434\u2013445 (2009)","journal-title":"Transp. Res., Part B, Methodol."},{"key":"9186_CR23","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp.\u00a0321\u2013353. Kluwer Academic, Dordrecht (2003)"},{"key":"9186_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of Metaheuristics","author":"P. Moscato","year":"2003","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to memetic algorithm. In: Handbook of Metaheuristics, pp.\u00a0105\u2013144. Kluwer Academic, Dordrecht (2003)"},{"key":"9186_CR26","doi-asserted-by":"crossref","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.: An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. Lect. Notes Comput. Sci. 1391, 187\u2013195 (1998a)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9186_CR27","doi-asserted-by":"crossref","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.: A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Gener. Comput. Syst. 14, 285\u2013292 (1998b)","journal-title":"Future Gener. Comput. Syst."},{"key":"9186_CR28","unstructured":"Or, I.: Traveling salesman-type combinational problems and their relation to the logistics of blood banking. PhD thesis, Northwestern University, USA (1976)"},{"issue":"1\u20134","key":"9186_CR29","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(1\u20134), 421\u2013451 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9186_CR30","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-0-387-77778-8_14","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"A. Pessoa","year":"2008","unstructured":"Pessoa, A., Uchoa, E., de Arag\u00e3o, M.P.: Robust branch-and-cut-and-price algorithms for vehicle routing problems. In: The Vehicle Routing Problem: Latest Advances and New Challenges, pp.\u00a0297\u2013325. Springer, Berlin (2008)"},{"issue":"4","key":"9186_CR31","doi-asserted-by":"crossref","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.: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Network 54(4), 167\u2013177 (2009)","journal-title":"Network"},{"key":"9186_CR32","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1016516326823","volume":"1","author":"C. Prins","year":"2002","unstructured":"Prins, C.: Efficient heuristics for the heterogeneous fleet multitrip vrp with application to a large-scale real case. J. Math. Model. Algorithms 1, 135\u2013150 (2002)","journal-title":"J. Math. Model. Algorithms"},{"key":"9186_CR33","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-85152-3_2","volume-title":"Bio-inspired Algorithms for the Vehicle Routing Problem","author":"C. Prins","year":"2009","unstructured":"Prins, C.: A GRASP \u00d7 evolutionary local search hybrid for the Vehicle Routing Problem. In: Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, vol. 161, pp.\u00a035\u201353. Springer, Berlin (2009a)"},{"issue":"6","key":"9186_CR34","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C. Prins","year":"2009","unstructured":"Prins, C.: Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng. Appl. Artif. Intell. 22(6), 916\u2013928 (2009b)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9186_CR35","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/S0377-2217(01)00237-5","volume":"140","author":"J. Renaud","year":"2002","unstructured":"Renaud, J., Boctor, F.: A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140, 618\u2013628 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9186_CR36","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A. Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L., Bentes, C., Ochi, L., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9186_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"E.D. Taillard","year":"1999","unstructured":"Taillard, E.D.: A heuristic column generation method for heterogeneous fleet. RAIRO. Rech. Op\u00e9r. 33, 1\u201314 (1999)","journal-title":"RAIRO. Rech. Op\u00e9r."},{"key":"9186_CR38","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Jy, P.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"key":"9186_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0260-8774(00)00187-4","volume":"50","author":"C.D. Tarantilis","year":"2001","unstructured":"Tarantilis, C.D., Kiranoudis, C.T.: A meta-heuristic algorithm for the efficient distribution of perishable foods. J. Food Eng. 50, 1\u20139 (2001)","journal-title":"J. Food Eng."},{"key":"9186_CR40","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"C.D. Tarantilis","year":"2007","unstructured":"Tarantilis, C.D., Kiranoudis, C.T.: A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. Eur. J. Oper. Res. 179, 806\u2013822 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9186_CR41","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1057\/palgrave.jors.2601443","volume":"54","author":"C.D. Tarantilis","year":"2003","unstructured":"Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. J. Oper. Res. Soc. 54, 65\u201371 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"9186_CR42","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","volume":"152","author":"C.D. Tarantilis","year":"2004","unstructured":"Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Oper. Res. 152, 148\u2013158 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9186_CR43","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0611-6","volume":"106","author":"H. Yaman","year":"2006","unstructured":"Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Program. 106, 365\u2013390 (2006)","journal-title":"Math. Program."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9186-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9186-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:32Z","timestamp":1559242472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9186-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,8]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9186"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9186-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,8]]}}}