{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T09:57:23Z","timestamp":1721815043581},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"Natural Sciences and Engineering Council of Canada (NSERC)"},{"name":"Fonds de Recherche du Qu\u00e9bec \u2013 Nature et Technologies (FRQ-NT)"},{"name":"EMME\/2-STAN Royalty Research Funds"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1016\/j.cor.2014.07.004","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T16:31:37Z","timestamp":1405441897000},"page":"9-23","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":47,"special_numbering":"C","title":["Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm"],"prefix":"10.1016","volume":"53","author":[{"given":"Alireza","family":"Rahimi-Vahed","sequence":"first","affiliation":[]},{"given":"Teodor","family":"Gabriel Crainic","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Rei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2014.07.004_bib1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag Sci"},{"key":"10.1016\/j.cor.2014.07.004_bib2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1080\/07408170600575454","article-title":"Periodic product distribution from multi-depots under limited supplies","volume":"38","author":"Parthanadee","year":"2006","journal-title":"IIE Trans"},{"key":"10.1016\/j.cor.2014.07.004_bib3","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1057\/palgrave.jors.2600641","article-title":"A multi-depot period vehicle routing problem arising in the utilities sector","volume":"49","author":"Hadjiconstantinou","year":"1998","journal-title":"J Oper Res Soc"},{"issue":"3","key":"10.1016\/j.cor.2014.07.004_bib4","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.ejor.2005.03.063","article-title":"Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts","volume":"179","author":"Alegre","year":"2007","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/j.cor.2014.07.004_bib6","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multi-depots and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with probabilistic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transp Sci"},{"key":"10.1016\/j.cor.2014.07.004_bib8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0041-1647(71)90023-2","article-title":"A study of a look-ahead procedure for solving the multiterminal delivery problem","volume":"5","author":"Tillman","year":"1971","journal-title":"Transp Res"},{"key":"10.1016\/j.cor.2014.07.004_bib9","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1287\/mnsc.18.11.664","article-title":"An upper bound algorithm for the single and multiple terminal delivery problem","volume":"18","author":"Tillman","year":"1972","journal-title":"Manag Sci"},{"key":"10.1016\/j.cor.2014.07.004_bib10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/j.cor.2014.07.004_bib11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0377-2217(82)80011-8","article-title":"A modular algorithm for an extended vehicle scheduling problem","volume":"11","author":"Raft","year":"1982","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/jors.1972.26","article-title":"TRAMPA multi-depot vehicle scheduling system","volume":"23","author":"Cassidy","year":"1972","journal-title":"J Oper Res Soc"},{"issue":"3\u20134","key":"10.1016\/j.cor.2014.07.004_bib13","first-page":"371","article-title":"A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions","volume":"13","author":"Chao","year":"1993","journal-title":"Am J Math Manag Sci"},{"key":"10.1016\/j.cor.2014.07.004_bib14","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.tre.2011.02.002","article-title":"The period vehicle routing problem","volume":"47","author":"Gulczynski","year":"2011","journal-title":"Transp Res Part E\u2014Log Transp Rev"},{"key":"10.1016\/j.cor.2014.07.004_bib15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","article-title":"A multi-level composite heuristic for the multi-depot vehicle fleet mix problem","volume":"103","author":"Salhi","year":"1997","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib16","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1002\/net.3230210704","article-title":"A multi-phase approach to the period routing problem","volume":"21","author":"Russell","year":"1991","journal-title":"Networks"},{"key":"10.1016\/j.cor.2014.07.004_bib17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0167-739X(99)00118-1","article-title":"An asynchronous parallel metaheuristic for the period vehicle routing problem","volume":"17","author":"Drummond","year":"2001","journal-title":"Future Gener Comput Syst"},{"key":"10.1016\/j.cor.2014.07.004_bib18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","article-title":"A tabu search heuristic for the multi-depot vehicle routing problem","volume":"23","author":"Renaud","year":"1996","journal-title":"Comput Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib19","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","article-title":"A variable neighborhood search heuristic for periodic routing problems","volume":"195","author":"Hemmelmayr","year":"2009","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib20","doi-asserted-by":"crossref","unstructured":"Pirkwieser S, Raidl GR. Multilevel variable neighborhood search for periodic routing problems; 2010.","DOI":"10.1007\/978-3-642-12139-5_20"},{"key":"10.1016\/j.cor.2014.07.004_bib21","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","article-title":"A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows","volume":"176","author":"Dondo","year":"2007","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1016\/j.cor.2014.07.004_bib22","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TASE.2009.2019265","article-title":"Application of genetic algorithms to solve the multidepot vehicle routing problem","volume":"7","author":"Lau","year":"2010","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"10.1016\/j.cor.2014.07.004_bib23","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.2009.161","article-title":"A parallel improved ant colony optimization for multi-depot vehicle routing problem","volume":"62","author":"Yu","year":"2011","journal-title":"J Oper Res Soc"},{"key":"10.1016\/j.cor.2014.07.004_bib24","doi-asserted-by":"crossref","unstructured":"Kang K, Lee Y, Lee B. An exact algorithm for multi-depot and multi-period vehicle scheduling problem; 2005.","DOI":"10.1007\/11424925_38"},{"key":"10.1016\/j.cor.2014.07.004_bib25","doi-asserted-by":"crossref","unstructured":"Crainic TG, Crisan GC, Gendreau M, Lahrichi N, Rei W. A concurrent evolutionary approach for rich combinatorial optimization. In: Genetic and evolutionary computation conference; 2009. p. 2017\u201322.","DOI":"10.1145\/1570256.1570269"},{"key":"10.1016\/j.cor.2014.07.004_bib26","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10732-013-9221-2","article-title":"A path relinking algorithm for a multi-depot periodic vehicle routing problem","volume":"19","author":"Rahimi-Vahed","year":"2013","journal-title":"J Heuristics"},{"key":"10.1016\/j.cor.2014.07.004_bib27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/0305-0483(84)90050-1","article-title":"A heuristic algorithm for the period vehicle routing problem","volume":"12","author":"Tan","year":"1984","journal-title":"Omega\u2014Int J Manag Sci"},{"key":"10.1016\/j.cor.2014.07.004_bib28","doi-asserted-by":"crossref","unstructured":"Fisher ML, Jaikumar R. A generalized assignment heuristic for the vehicle routing problem. In: Conference on computer networks; 1981.","DOI":"10.1002\/net.3230110205"},{"issue":"2","key":"10.1016\/j.cor.2014.07.004_bib29","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","article-title":"The period routing problem","volume":"14","author":"Christofides","year":"1984","journal-title":"Networks"},{"key":"10.1016\/j.cor.2014.07.004_bib30","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D. The vehicle routing problem; 2002.","DOI":"10.1137\/1.9780898718515"},{"key":"10.1016\/j.cor.2014.07.004_bib31","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib32","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Comput Oper Res"},{"key":"10.1016\/j.cor.2014.07.004_bib33","unstructured":"Lahrichi N, Crainic T, Gendreau M, Rei W, Rousseau L. Strategic analysis of the dairy transportation problem. In: CIRRELT 80; 2012."},{"key":"10.1016\/j.cor.2014.07.004_bib34","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"J Oper Res Soc"},{"key":"10.1016\/j.cor.2014.07.004_bib35","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1026569813391","article-title":"Using experimental design to find effective parameter settings for heuristics","volume":"7","author":"Coy","year":"2000","journal-title":"J Heuristics"},{"key":"10.1016\/j.cor.2014.07.004_bib36","series-title":"Parameter tuning of evolutionary algorithms: generalist vs specialist","author":"Smith","year":"2010"},{"key":"10.1016\/j.cor.2014.07.004_bib37","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Oper Res"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054814001865?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054814001865?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T17:20:52Z","timestamp":1565630452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054814001865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":37,"alternative-id":["S0305054814001865"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2014.07.004","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2014.07.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}