{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T05:49:59Z","timestamp":1773726599622,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T00:00:00Z","timestamp":1499990400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10479-017-2576-2","type":"journal-article","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T15:48:01Z","timestamp":1500047281000},"page":"243-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem"],"prefix":"10.1007","volume":"272","author":[{"given":"Houda","family":"Derbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rim","family":"Bhiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"2576_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.cie.2015.03.006","volume":"85","author":"J Armas","year":"2015","unstructured":"Armas, J., & Meli\u00e1n-Batista, B. (2015). Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Computers and Industrial Engineering, 85, 120\u2013131.","journal-title":"Computers and Industrial Engineering"},{"key":"2576_CR2","volume-title":"The vehicle routing problem: Latest advances and new challenges, chapter Routing a heterogeneous fleet of vehicles, 11\u201335","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Battara, M., & Vigo, D. (2008). The vehicle routing problem: Latest advances and new challenges, chapter Routing a heterogeneous fleet of vehicles, 11\u201335. Berlin: Springer."},{"key":"2576_CR3","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. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 120, 347\u2013380.","journal-title":"Mathematical Programming"},{"key":"2576_CR4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1016\/j.ejor.2007.05.059","volume":"195","author":"J Brandao","year":"2009","unstructured":"Brandao, J. (2009). A deterministic tabu search algorithm for the \u00c3r\u0301nCeet size and mix vehicle routing problem. European Journal of Operational Research, 195, 716\u2013728.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR5","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2010.04.008","volume":"38","author":"J Brandao","year":"2011","unstructured":"Brandao, J. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers and Operations Research, 38, 140\u2013151.","journal-title":"Computers and Operations Research"},{"key":"2576_CR6","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, 2080\u20132095.","journal-title":"Computers and Operations Research"},{"key":"2576_CR7","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. Oprations Research, 12, 568\u2013581.","journal-title":"Oprations Research"},{"key":"2576_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2015.09.047","volume":"250","author":"VN Coelho","year":"2016","unstructured":"Coelho, V. N., Grasas, A., Ramalhinho, H., Coelho, I. M., Souza, M. J. F., & Cruz, R. C. (2016). An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. European Journal of Operational Research, 250, 367\u2013376.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR9","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., & Cerda, 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, 1478\u20131507.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR10","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22, 340\u2013344.","journal-title":"Operations Research"},{"key":"2576_CR11","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. Decision Science, 8, 156\u2013166.","journal-title":"Decision Science"},{"key":"2576_CR12","doi-asserted-by":"crossref","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 and Operation Research, 11, 49\u201366.","journal-title":"Computers and Operation Research"},{"key":"2576_CR13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & Moreno, \u00c2\u0103 P J. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175, 367\u2013407.","journal-title":"Annals of Operations Research"},{"key":"2576_CR14","doi-asserted-by":"crossref","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\u201321.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR15","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. (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":"2576_CR16","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. (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":"2576_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., & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34, 2734\u20132742.","journal-title":"Computers and Operations Research"},{"key":"2576_CR18","doi-asserted-by":"crossref","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. Part E: Logistics and Transportation Review, 46, 1111\u20131127.","journal-title":"Part E: Logistics and Transportation Review"},{"key":"2576_CR19","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S. (1965). Computers solutions of the traveling salesman problem. Bell System Technical Journal, 44, 2245\u20132269.","journal-title":"Bell System Technical Journal"},{"key":"2576_CR20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.cie.2016.04.021","volume":"97","author":"J Liu","year":"2016","unstructured":"Liu, J., Smith, A. E., & Qian, D. (2016). The vehicle loading problem with a heterogenous transport fleet. Computers and Industrial Engineering, 97, 137\u2013145.","journal-title":"Computers and Industrial Engineering"},{"key":"2576_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tre.2013.03.010","volume":"54","author":"S Liu","year":"2013","unstructured":"Liu, S. (2013). A hybrid population heuristic for the heterogeneous vehicle routing problems. Transportation Research Part E, 54, 67\u201378.","journal-title":"Transportation Research Part E"},{"key":"2576_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1093\/imaman\/dpm017","volume":"18","author":"B Melian","year":"2007","unstructured":"Melian, B., & Mladenovi\u0107, N. (2007). Applications of variable neighborhood search. IMA Journal of Management Mathematics, 18, 99\u2013221.","journal-title":"IMA Journal of Management Mathematics"},{"key":"2576_CR23","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24, 1097\u2013100.","journal-title":"Computers and Operations Research"},{"key":"2576_CR24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"P Penna","year":"2013","unstructured":"Penna, P., Subramanian, A., & Ochi, L. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19, 201\u2013232.","journal-title":"Journal of Heuristics"},{"key":"2576_CR25","doi-asserted-by":"crossref","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"},{"key":"2576_CR26","first-page":"916","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins, C. (2009). Engineering applications of arti\u00ef\u0148\u0104cial intelligence. Two Memetic Algorithms for Heterogeneous Fleet Vehicle Routing Problems, 22, 916\u2013928.","journal-title":"Two Memetic Algorithms for Heterogeneous Fleet Vehicle Routing Problems"},{"key":"2576_CR27","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.cie.2016.06.018","volume":"98","author":"D Rahmani","year":"2016","unstructured":"Rahmani, D., & Ramezanian, R. (2016). A stable reactive approach in dynamic flexible flow shop scheduling with unexpected disruptions. Computers and Industrial Engineering, 98, 360\u2013372.","journal-title":"Computers and Industrial Engineering"},{"key":"2576_CR28","doi-asserted-by":"crossref","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, 95\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR29","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.cie.2015.10.010","volume":"90","author":"B Soylu","year":"2015","unstructured":"Soylu, B. (2015). A general variable neighborhood seaerch heuristic for multiple traveling salesman problem. Computers and Industrial Engineering, 90, 390\u2013401.","journal-title":"Computers and Industrial Engineering"},{"key":"2576_CR30","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.ejor.2012.03.016","volume":"221","author":"A Subramanian","year":"2012","unstructured":"Subramanian, A., Vaz Penna, P., Uchoa, E., & Ochi., L. (2012). A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 221, 285\u2013295.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR31","unstructured":"Subramanian, A., Penna, P.H.V., Uchoa, E., & Ochi, L.S. (2012). A hybrid algorithm for the fleet size and mix vehicle routing problem. In International conference on industrial engineering and systems management."},{"key":"2576_CR32","doi-asserted-by":"crossref","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 VRP. RAIRO. Rech. Op\u00e9r., 33, 1\u201314.","journal-title":"RAIRO. Rech. Op\u00e9r."},{"key":"2576_CR33","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1057\/palgrave.jors.2601443","volume":"54","author":"C Tarantilis","year":"2003","unstructured":"Tarantilis, C., Kiranoudis, C., & Vassiliadis, V. (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":"2576_CR34","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. European Journal of Operational Research, 152, 148\u2013158.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR35","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"CD Tarantilis","year":"2007","unstructured":"Tarantilis, C. D., & Kiranoudis, C. T. (2007). A flexible adaptive memory-based algorithm for reallife transportation operations: Two case studies from diary and construction company. European Journal of Operational Research, 179, 806\u2013822.","journal-title":"European Journal of Operational Research"},{"key":"2576_CR36","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1080\/03081069508717556","volume":"19","author":"D Teodorovic","year":"1995","unstructured":"Teodorovic, D., Krcmarnozic, E., & Pavkovic, G. (1995). The mixed fleet stochastic vehicle routing problem. Transportation Planning and Technology, 19, 31\u201334.","journal-title":"Transportation Planning and Technology"},{"key":"2576_CR37","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0611-6","volume":"106","author":"H Yaman","year":"2006","unstructured":"Yaman, H. (2006). Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming, 106, 365\u2013390.","journal-title":"Mathematical Programming"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2576-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2576-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2576-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T12:01:33Z","timestamp":1546344093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2576-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,14]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["2576"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2576-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,14]]}}}