{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:21:13Z","timestamp":1776183673848,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["PTDC\/EGE-OGE\/28071\/2017"],"award-info":[{"award-number":["PTDC\/EGE-OGE\/28071\/2017"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["Lisboa-01.0145-Feder-28071"],"award-info":[{"award-number":["Lisboa-01.0145-Feder-28071"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/00297\/2019"],"award-info":[{"award-number":["UID\/MAT\/00297\/2019"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00291-019-00568-7","type":"journal-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T02:02:42Z","timestamp":1574647362000},"page":"75-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2321-2431","authenticated-orcid":false,"given":"T\u00e2nia Rodrigues Pereira","family":"Ramos","sequence":"first","affiliation":[]},{"given":"Maria Isabel","family":"Gomes","sequence":"additional","affiliation":[]},{"given":"Ana Paula","family":"Barbosa-P\u00f3voa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"2","key":"568_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0377-2217(01)00206-5","volume":"137","author":"E Angelelli","year":"2002","unstructured":"Angelelli E, Speranza MG (2002) The periodic vehicle routing problem with intermediate facilities. Eur J Oper Res 137(2):233\u2013247","journal-title":"Eur J Oper Res"},{"issue":"2","key":"568_CR2","doi-asserted-by":"publisher","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. Math Program 120(2):347\u2013380","journal-title":"Math Program"},{"issue":"5","key":"568_CR3","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci R, Hadjiconstantinou E, Mingozzi A (2004) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52(5):723\u2013738","journal-title":"Oper Res"},{"issue":"9","key":"568_CR4","first-page":"821","volume":"30","author":"JF Bard","year":"1998","unstructured":"Bard JF, Huang L, Dror M, Jaillet P (1998) A branch and cut algorithm for the VRP with satellite facilities. IIE Trans 30(9):821\u2013834","journal-title":"IIE Trans"},{"issue":"12","key":"568_CR5","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.cor.2010.03.019","volume":"37","author":"AM Benjamin","year":"2010","unstructured":"Benjamin AM, Beasley JE (2010) Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput Oper Res 37(12):2270\u20132280","journal-title":"Comput Oper Res"},{"issue":"1","key":"568_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/S0377-2217(97)00010-6","volume":"100","author":"J Brandao","year":"1997","unstructured":"Brandao J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Oper Res 100(1):180\u2013191","journal-title":"Eur J Oper Res"},{"issue":"3","key":"568_CR7","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.ejor.2013.06.012","volume":"236","author":"D Cattaruzza","year":"2014","unstructured":"Cattaruzza D, Absi N, Feillet D, Vidal T (2014) A memetic algorithm for the multi trip vehicle routing problem. Eur J Oper Res 236(3):833\u2013848","journal-title":"Eur J Oper Res"},{"key":"568_CR8","first-page":"371","volume":"13","author":"I Chao","year":"1993","unstructured":"Chao I, Golden BL, Wasil E (1993) A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am J Math Manag Sci 13:371\u2013406","journal-title":"Am J Math Manag Sci"},{"issue":"4","key":"568_CR9","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 JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"issue":"2","key":"568_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105\u2013119","journal-title":"Networks"},{"issue":"2","key":"568_CR11","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","volume":"176","author":"B Crevier","year":"2007","unstructured":"Crevier B, Cordeau JF, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176(2):756\u2013773","journal-title":"Eur J Oper Res"},{"key":"568_CR12","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2:393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"2","key":"568_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.compchemeng.2008.10.003","volume":"33","author":"RGDRG Dondo","year":"2009","unstructured":"Dondo RGDRG, Cerda J (2009) A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Comput Chem Eng 33(2):513\u2013530","journal-title":"Comput Chem Eng"},{"key":"568_CR14","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillet","year":"1974","unstructured":"Gillet BE, Miller LR (1974) A Heuristic algorithm for the vehicle-dispatch problem. Oper Res 22:340\u2013349","journal-title":"Oper Res"},{"issue":"2","key":"568_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10732-011-9188-9","volume":"19","author":"V Hemmelmayr","year":"2013","unstructured":"Hemmelmayr V, DoernerK F, Hartl RF, Rath S (2013) A heuristic solution method for node routing based solid waste collection problems. J Heuristics 19(2):129\u2013156","journal-title":"J Heuristics"},{"issue":"12","key":"568_CR16","doi-asserted-by":"publisher","first-page":"3624","DOI":"10.1016\/j.cor.2005.02.045","volume":"33","author":"BI Kim","year":"2006","unstructured":"Kim BI, Kim S, Sahoo S (2006) Waste collection vehicle routing problem with time windows. Comput Oper Res 33(12):3624\u20133642","journal-title":"Comput Oper Res"},{"issue":"4","key":"568_CR17","doi-asserted-by":"publisher","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. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"key":"568_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The vehicle routing problem, monographs on discrete mathematical and applications","author":"G Laporte","year":"2002","unstructured":"Laporte G, Semet F (2002) Classical heuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, monographs on discrete mathematical and applications. SIAM, Philadelphia, pp 109\u2013128"},{"key":"568_CR19","first-page":"283","volume":"44","author":"G Laporte","year":"1984","unstructured":"Laporte G, Nobert Y, Arpin D (1984) Optimal solutions to capacitated multi-depot vehicle routing problems. Congressus Numerantium 44:283\u2013292","journal-title":"Congressus Numerantium"},{"issue":"3","key":"568_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte G, Nobert Y, Taillefer S (1988) Solving a family of multi-depot vehicle-routing and location-routing problems. Transp Sci 22(3):161\u2013172","journal-title":"Transp Sci"},{"issue":"4","key":"568_CR21","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TASE.2005.853472","volume":"2","author":"A Lim","year":"2005","unstructured":"Lim A, Wang F (2005) Multi-depot vehicle routing problem: a one-stage approach. IEEE Trans Autom Sci Eng 2(4):397\u2013402","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"10","key":"568_CR22","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"568_CR23","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"key":"568_CR24","volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming. Annals of information system","year":"2009","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) (2009) Matheuristics: hybridizing metaheuristics and mathematical programming. Annals of information system. Springer, Berlin"},{"key":"568_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.trb.2015.12.004","volume":"84","author":"I Markov","year":"2016","unstructured":"Markov I, Varone S, Bierlaire M (2016) Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities. Transp Res B 84:256\u2013273","journal-title":"Transp Res B"},{"issue":"2","key":"568_CR26","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/ijoc.1110.0495","volume":"25","author":"A Mingozzi","year":"2013","unstructured":"Mingozzi A, Roberti R, Toth P (2013) An exact algorithm for the multitrip vehicle routing problem. Inf J Comput 25(2):193\u2013207","journal-title":"Inf J Comput"},{"issue":"3","key":"568_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1287\/trsc.2013.0489","volume":"48","author":"I Muter","year":"2014","unstructured":"Muter I, Cordeau JF, Laporte G (2014) A branch-and-price algorithm for the multidepot vehicle routing problem with interdepot routes. Transp Sci 48(3):425\u2013441","journal-title":"Transp Sci"},{"key":"568_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(03)00434-7","volume":"133","author":"RJ Petch","year":"2003","unstructured":"Petch RJ, Salhi S (2003) A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl Math 133:69\u201392","journal-title":"Discrete Appl Math"},{"key":"568_CR29","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1057\/jors.1996.29","volume":"47","author":"J Renaud","year":"1996","unstructured":"Renaud J, Boctor FF, Laporte G (1996a) An improved petal heuristic for the vehicle routing problem. J Oper Res Soc 47:329\u2013336","journal-title":"J Oper Res Soc"},{"issue":"3","key":"568_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J Renaud","year":"1996","unstructured":"Renaud J, Laporte G, Boctor FF (1996b) A tabu search heuristic for the multi-depot vehicle routing problem. Comput Oper Res 23(3):229\u2013235","journal-title":"Comput Oper Res"},{"key":"568_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00291-014-0376-5","volume":"37","author":"M Schneider","year":"2015","unstructured":"Schneider M, Stenger A, Hof J (2015) An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectr 37:353\u2013387","journal-title":"OR Spectr"},{"issue":"1","key":"568_CR32","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.1070.0230","volume":"20","author":"CD Tarantilis","year":"2008","unstructured":"Tarantilis CD, Zachariadis EE, Kiranoudis CT (2008) A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. Inf J Comput 20(1):154\u2013168","journal-title":"Inf J Comput"},{"key":"568_CR33","volume-title":"Vehicle routing: problems, methods, and applications, second edition. MOS-SIAM series on optimization, no. 18","year":"2014","unstructured":"Toth P, Vigo D (eds) (2014) Vehicle routing: problems, methods, and applications, second edition. MOS-SIAM series on optimization, no. 18. SIAM, Philadelphia"},{"key":"568_CR34","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tre.2013.11.003","volume":"61","author":"W Tu","year":"2014","unstructured":"Tu W, Fang Z, Li Q, Shaw S-L, Chen B (2014) A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transp Res E 61:84\u201397","journal-title":"Transp Res E"},{"issue":"4","key":"568_CR35","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"A Van Breedam","year":"2001","unstructured":"Van Breedam A (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Oper Res 28(4):289\u2013315","journal-title":"Comput Oper Res"},{"issue":"3","key":"568_CR36","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic T, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-019-00568-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-019-00568-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-019-00568-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T01:42:49Z","timestamp":1606182169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-019-00568-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["568"],"URL":"https:\/\/doi.org\/10.1007\/s00291-019-00568-7","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"22 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}