{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T04:43:47Z","timestamp":1761108227807,"version":"3.44.0"},"reference-count":25,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T00:00:00Z","timestamp":1272412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Logist. Res."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s12159-010-0028-3","type":"journal-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T17:36:56Z","timestamp":1272389816000},"page":"3-11","source":"Crossref","is-referenced-by-count":28,"title":["A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem"],"prefix":"10.1108","volume":"2","author":[{"given":"Jalel","family":"Euchi","sequence":"first","affiliation":[]},{"given":"Habib","family":"Chabchoub","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2010,4,28]]},"reference":[{"key":"28_CR1","volume-title":"Distribution management: mathematical modeling and practical analysis","author":"S Eilon","year":"1971","unstructured":"Eilon S, Watson-Grandy C, Christofides N (1971) Distribution management: mathematical modeling and practical analysis. Hafner, New York"},{"issue":"1","key":"28_CR2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G-B Dantzig","year":"1959","unstructured":"Dantzig G-B, Ramser J-H (1959) The truck dispatching problem. Manage Sci 6(1):80\u201391","journal-title":"Manage Sci"},{"key":"28_CR3","first-page":"69","volume":"10","author":"L-D Bodin","year":"1983","unstructured":"Bodin L-D, Golden B-L, Assad A-A, Ball M-O (1983) Routing and scheduling of vehicles and crews. The state of the Art. Comp Oper Res 10:69\u2013211","journal-title":"Comp Oper Res"},{"issue":"3","key":"28_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345\u2013358","journal-title":"Eur J Oper Res"},{"issue":"2","key":"28_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):247\u2013291","journal-title":"Eur J Oper Res"},{"issue":"1","key":"28_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0377-2217(93)90279-V","volume":"71","author":"G Laporte","year":"1993","unstructured":"Laporte G (1993) Computer aided routing CWI tract.75:M.W.P. Savelsbergh Mathematisch Centrum, Amsterdam, 1992, 134 pages, DFL.40.00, ISBN 90 6196 412 1. Eur J Oper Res 71(1):143","journal-title":"Eur J Oper Res"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","volume":"123","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487\u2013512","journal-title":"Discrete Appl Math"},{"issue":"1","key":"28_CR8","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 (1984) The fleet size and mix vehicle routing problem. Comp Oper Res 11(1):49\u201366","journal-title":"Comp Oper Res"},{"key":"28_CR9","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 (1999) A Tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comp Oper Res 26:1153\u20131173","journal-title":"Comp Oper Res"},{"key":"28_CR10","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. Comp Oper Res 34:2080\u20132095","journal-title":"Comp Oper Res"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0483(92)90009-V","volume":"20","author":"S Salhi","year":"1992","unstructured":"Salhi S, Sari M, Sadi D, Touati NAC (1992) Adaptation of some vehicle fleet mix heuristics. OMEGA 20:653\u2013660","journal-title":"OMEGA"},{"key":"28_CR12","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 VFMP. In: Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD (eds) Modern heuristic search methods. Wiley, New York, pp 131\u2013153"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E-D Taillard","year":"1993","unstructured":"Taillard E-D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661\u2013673","journal-title":"Networks"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"E-D Taillard","year":"1995","unstructured":"Taillard E-D, Rochat Y (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147\u2013167","journal-title":"J Heuristics"},{"issue":"1","key":"28_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"E-D Taillard","year":"1999","unstructured":"Taillard E-D (1999) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33(1):1\u201314","journal-title":"RAIRO"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","volume":"152","author":"C Tarantilis","year":"2004","unstructured":"Tarantilis C, Kiranoudis C, Vassiliadis V (2004) A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152:148\u2013158","journal-title":"Eur J Oper Res"},{"key":"28_CR17","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-L, Wasil E-A (2007) A record to record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comp Oper Res 34:2734\u20132742","journal-title":"Comp Oper Res"},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(91)90028-P","volume":"18","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Verhoog T-W (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comp Oper Res 18:263\u2013274","journal-title":"Comp Oper Res"},{"issue":"3","key":"28_CR19","first-page":"190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014Part I. ORSA. J Comp 1(3):190\u2013206","journal-title":"J Comp"},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1016\/j.cor.2005.07.007","volume":"33","author":"H Arntzen","year":"2006","unstructured":"Arntzen H, Hvattum L-M, Lokketangen A (2006) Adaptive memory search for multi demand multidimensional knapsack problems. Comp Oper Res 33:2508\u20132525","journal-title":"Comp Oper Res"},{"issue":"1","key":"28_CR21","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156\u2013166","journal-title":"Decis Sci"},{"key":"28_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J-Y Potvin","year":"1993","unstructured":"Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331\u2013340","journal-title":"Eur J Oper Res"},{"key":"28_CR23","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0377-2217(98)00315-4","volume":"118","author":"F-H Liu","year":"1999","unstructured":"Liu F-H, Shen S-Y (1999) A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur J Oper Res 118:485\u2013504","journal-title":"Eur J Oper Res"},{"key":"28_CR24","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 (2009) A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 195:716\u2013728","journal-title":"Eur J Oper Res"},{"key":"28_CR25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet management and logistics","author":"B Golden","year":"1998","unstructured":"Golden B, Wasil E, Kelly J, Chao I-M (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33\u201356"}],"container-title":["Logistics Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12159-010-0028-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12159-010-0028-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12159-010-0028-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T20:32:40Z","timestamp":1757104360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12159-010-0028-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,28]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s12159-010-0028-3","relation":{},"ISSN":["1865-035X","1865-0368"],"issn-type":[{"type":"print","value":"1865-035X"},{"type":"electronic","value":"1865-0368"}],"subject":[],"published":{"date-parts":[[2010,4,28]]}}}