{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T07:23:02Z","timestamp":1774682582370,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T00:00:00Z","timestamp":1291939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10951-010-0213-x","type":"journal-article","created":{"date-parts":[[2010,12,9]],"date-time":"2010-12-09T16:57:48Z","timestamp":1291913868000},"page":"601-615","source":"Crossref","is-referenced-by-count":34,"title":["Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs"],"prefix":"10.1007","volume":"14","author":[{"given":"Sara","family":"Ceschia","sequence":"first","affiliation":[]},{"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,10]]},"reference":[{"key":"213_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"3","author":"C. Archetti","year":"2007","unstructured":"Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 3, 49\u201376.","journal-title":"Journal of Heuristics"},{"key":"213_CR2","unstructured":"Baldacci, R., Battara, M., & Vigo, D. (2007) Routing a heterogeneous fleet of vehicles (Technical Report 2007\/1). DEIS, University of Bologna."},{"key":"213_CR3","first-page":"11","volume-title":"GECCO 2002: Proceedings of the genetic and evolutionary computation conference","author":"M. Birattari","year":"2002","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In W. B. Langdon et al. (Eds.), GECCO 2002: Proceedings of the genetic and evolutionary computation conference (pp. 11\u201318). New York: Morgan Kaufmann."},{"issue":"2","key":"213_CR4","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.ejor.2006.10.013","volume":"183","author":"M. C. Bolduc","year":"2007","unstructured":"Bolduc, M. C., Renaud, J., & Boctor, F. (2007). A heuristic for the routing and carrier selection problem. European Journal of Operational Research, 183(2), 926\u2013932. doi: 10.1016\/j.ejor.2006.10.013 .","journal-title":"European Journal of Operational Research"},{"key":"213_CR5","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1057\/palgrave.jors.2602390","volume":"59","author":"M. C. Bolduc","year":"2008","unstructured":"Bolduc, M. C., Renaud, J., Boctor, F., & Laporte, G. (2008). A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. Journal of the Operational Research Society, 59, 776\u2013787.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"213_CR6","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2005a). Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transportation Science, 39(1), 104\u2013118. doi: 10.1287\/trsc.1030.0056 .","journal-title":"Transportation Science"},{"issue":"1","key":"213_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2005b). Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1), 119\u2013139. doi: 10.1287\/trsc.1030.0057 .","journal-title":"Transportation Science"},{"issue":"3","key":"213_CR8","doi-asserted-by":"crossref","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 multi-restart 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"},{"issue":"1","key":"213_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"S. E. Butt","year":"1994","unstructured":"Butt, S. E., & Cavalier, T. M. (1994). A heuristic for the multiple tour maximum collection problem. Computers and Operations Research, 21(1), 101\u2013111.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"213_CR10","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I. M. Chao","year":"1996","unstructured":"Chao, I. M., Golden, B. L., & Wasil, EA (1996). The team orienteering problem. European Journal of Operational Research, 88(3), 464\u2013474.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"213_CR11","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. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34(7), 2080\u20132095.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"213_CR12","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2003.08.067","volume":"127","author":"C. W. Chu","year":"2005","unstructured":"Chu, C. W. (2005). A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research, 127(3), 657\u2013667.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"213_CR13","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. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568\u2013581.","journal-title":"Operations Research"},{"issue":"2","key":"213_CR14","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.ejor.2008.09.009","volume":"198","author":"J. F. C\u00f4t\u00e9","year":"2009","unstructured":"C\u00f4t\u00e9, J. F., & Potvin, J. Y. (2009). A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research, 198(2), 464\u2013469.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"213_CR15","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. (1959). The truck dispatching problem. Management Science, 6(1), 80\u201391.","journal-title":"Management Science"},{"key":"213_CR16","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M., Monaci, M., Pagani, C., & Vigo, D. (2006) Heuristic approaches for the fllet size and mix vehicle routing problem with time windows (Tech. rep.). DISMI, University of Modena and Reggio Emilia, Italy.","DOI":"10.1287\/trsc.1070.0190"},{"issue":"8","key":"213_CR17","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L. Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software\u2014Practice and Experience, 33(8), 733\u2013765.","journal-title":"Software\u2014Practice and Experience"},{"issue":"1","key":"213_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms, 5(1), 65\u201389.","journal-title":"Journal of Mathematical Modeling and Algorithms"},{"key":"213_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-540-74446-7_6","volume-title":"Engineering stochastic local search algorithms (SLS-2007)","author":"L. Gaspero Di","year":"2007","unstructured":"Di Gaspero, L., Roli, A., & Schaerf, A. (2007). EasyAnalyzer: an object-oriented framework for the experimental analysis of stochastic local search algorithms. In T. St\u00fctzle, M. Birattari, & H.\u00a0Hoos (Eds.), Lecture notes in computer science: Vol. 4683. Engineering stochastic local search algorithms (SLS-2007) (pp. 76\u201390). Berlin: Springer."},{"issue":"1","key":"213_CR20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/ijoc.7.1.24","volume":"7","author":"M. Diaby","year":"1995","unstructured":"Diaby, M., & Ramesh, R. (1995). The distribution problem with carrier service: a dual based approach. ORSA Journal on Computing, 7(1), 24\u201335.","journal-title":"ORSA Journal on Computing"},{"issue":"12","key":"213_CR21","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, ED (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 26(12), 1153\u20131173.","journal-title":"Computers and Operations Research"},{"key":"213_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic."},{"key":"213_CR23","volume-title":"Stochastic local search\u2014foundations and applications","author":"H. H. Hoos","year":"2005","unstructured":"Hoos, H. H., & St\u00fctzle, T. (2005). Stochastic local search\u2014foundations and applications. San Francisco: Morgan Kaufmann."},{"key":"213_CR24","volume-title":"The VIII metaheuristics international conference (MIC 2009)","author":"L. M. Hvattum","year":"2009","unstructured":"Hvattum, L. M. (2009). On the value of aspiration criteria in tabu search. In The VIII metaheuristics international conference (MIC 2009), Hamburg, Germany."},{"issue":"4","key":"213_CR25","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G. Laporte","year":"2009","unstructured":"Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408\u2013416.","journal-title":"Transportation Science"},{"issue":"9","key":"213_CR26","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. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34(9), 2734\u20132742.","journal-title":"Computers and Operations Research"},{"issue":"7","key":"213_CR27","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"F. H. Liu","year":"1999","unstructured":"Liu, F. H., & SY, Shen (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721\u2013732.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"213_CR28","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02941184","volume":"7","author":"Y. Marinakis","year":"2007","unstructured":"Marinakis, Y., & Migdalas, A. (2007). Annotated bibliography in vehicle routing. Operational Research, 7(1), 27\u201346. doi: 10.1007\/BF02941184 .","journal-title":"Operational Research"},{"key":"213_CR29","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-64359-1_691","volume":"1388","author":"L. S. Ochi","year":"1998","unstructured":"Ochi, L. S., Vianna, D. S., Drummond, L. M. A., & Victor, A. O. (1998). A\u00a0parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Parallel and Distributed Processing, 1388, 216\u2013224.","journal-title":"Parallel and Distributed Processing"},{"key":"213_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-1361-8","volume-title":"Modern heuristic search methods","author":"I. H. Osman","year":"1996","unstructured":"Osman, I. H., & Salhi, S. (1996). Local search strategies for the vehicle fleet mix problem. In V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods, Chap.\u00a08 (pp. 131\u2013153). New York: Wiley."},{"key":"213_CR31","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. F. (2002). A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, 140, 618\u2013628.","journal-title":"European Journal of Operational Research"},{"key":"213_CR32","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF02023006","volume":"41","author":"F. Semet","year":"1993","unstructured":"Semet, F., & Taillard, E. (1993). Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations Research, 41, 469\u2013488.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"213_CR33","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254\u2013265.","journal-title":"Operations Research"},{"issue":"1","key":"213_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"E. Taillard","year":"1999","unstructured":"Taillard, E. (1999). A heuristic column generation method for the heterogeneous fleet vrp. RAIRO Recherche Op\u00e9rationnelle, 33(1), 1\u201314.","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"issue":"4\u20135","key":"213_CR35","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"ED Taillard","year":"1991","unstructured":"Taillard, ED (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17(4\u20135), 443\u2013455.","journal-title":"Parallel Computing"},{"issue":"6","key":"213_CR36","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H. Tang","year":"2005","unstructured":"Tang, H., & Miller-Hooks, E. (2005). A tabu search heuristic for the team orienteering problem. Computers and Operations Research, 32(6), 1379\u20131407.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"213_CR37","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. (2003). A\u00a0list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Journal of the Operational Research Society, 54(1), 65\u201371.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"213_CR38","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. (2004). A\u00a0threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research, 152(1), 148\u2013158.","journal-title":"European Journal of Operational Research"},{"key":"213_CR39","first-page":"1","volume-title":"The vehicle routing problem","author":"P. Toth","year":"2001","unstructured":"Toth, P., & Vigo, D. (2001). An overview of vehicle routing problems. In The vehicle routing problem (pp. 1\u201326). Philadelphia: Society for Industrial and Applied Mathematics."},{"key":"213_CR40","volume-title":"The vehicle routing problem. Monographs on discrete mathematics and applications","year":"2002","unstructured":"Toth, P., & Vigo, D. (Eds.) (2002). The vehicle routing problem. Monographs on discrete mathematics and applications. Philadelphia: SIAM."},{"key":"213_CR41","series-title":"Statistics and computing","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21706-2","volume-title":"Modern applied statistics with S","author":"W. N. Venables","year":"2002","unstructured":"Venables, W. N., & Ripley, B. D. (2002). Statistics and computing. Modern applied statistics with S (4th ed.). Berlin: Springer.","edition":"4"},{"issue":"11","key":"213_CR42","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1057\/jors.1987.177","volume":"38","author":"T. Volgenant","year":"1987","unstructured":"Volgenant, T., & Jonker, R. (1987). On some generalizations of the travelling-salesman problem. Journal of the Operational Research Society, 38(11), 1073\u20131079.","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"213_CR43","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1057\/palgrave.jors.2601344","volume":"53","author":"N. A. 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(7), 768\u2013782.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0213-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0213-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0213-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T23:17:40Z","timestamp":1559863060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0213-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,10]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0213-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,10]]}}}