{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,3]],"date-time":"2026-09-03T15:52:38Z","timestamp":1788450758185,"version":"build-2803163510"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (FWF)","doi-asserted-by":"crossref","award":["#P20342"],"award-info":[{"award-number":["#P20342"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Austrian Research Promotion Agency (FFG)","award":["#822739"],"award-info":[{"award-number":["#822739"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1016\/j.dam.2012.08.032","type":"journal-article","created":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T13:30:24Z","timestamp":1348061424000},"page":"53-64","source":"Crossref","is-referenced-by-count":83,"special_numbering":"P1","title":["A set-covering based heuristic algorithm for the periodic vehicle routing problem"],"prefix":"10.1016","volume":"163","author":[{"given":"V.","family":"Cacchiani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.C.","family":"Hemmelmayr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Tricoire","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2012.08.032_br000005","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":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.dam.2012.08.032_br000010","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/opre.1100.0875","article-title":"An exact algorithm for the period routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Operations research"},{"key":"10.1016\/j.dam.2012.08.032_br000015","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","article-title":"Networks and vehicle routing for municipial waste collection","volume":"4","author":"Beltrami","year":"1974","journal-title":"Networks"},{"issue":"8","key":"10.1016\/j.dam.2012.08.032_br000020","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/S0305-0548(03)00075-3","article-title":"An improved heuristic for the period traveling salesman problem","volume":"31","author":"Bertazzi","year":"2004","journal-title":"Computers & Operations Research"},{"issue":"5","key":"10.1016\/j.dam.2012.08.032_br000025","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0305-0548(94)00031-3","article-title":"A new heuristic for the period traveling salesman problem","volume":"22","author":"Chao","year":"1995","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.dam.2012.08.032_br000030","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230260104","article-title":"An improved heuristic for the period vehicle routing problem","volume":"26","author":"Chao","year":"1995","journal-title":"Networks"},{"key":"10.1016\/j.dam.2012.08.032_br000035","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"},{"issue":"2","key":"10.1016\/j.dam.2012.08.032_br000040","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"},{"issue":"1","key":"10.1016\/j.dam.2012.08.032_br000045","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","article-title":"Exploring relaxation induced neighborhoods to improve mip solutions","volume":"102","author":"Danna","year":"2005","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.dam.2012.08.032_br000050","series-title":"Column Generation, Vol. 5","author":"Desaulniers","year":"2005"},{"key":"10.1016\/j.dam.2012.08.032_br000055","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","article-title":"Note on the complexity of the shortest path models for column generation in vrptw","volume":"42","author":"Dror","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/j.dam.2012.08.032_br000060","series-title":"Distribution Management: Mathematical Modeling and Practical Analysis","author":"Eilon","year":"1971"},{"key":"10.1016\/j.dam.2012.08.032_br000065","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path with resource constraints: application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.dam.2012.08.032_br000070","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.dam.2012.08.032_br000075","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1050.0140","article-title":"The period vehicle routing problem with service choice","volume":"40","author":"Francis","year":"2006","journal-title":"Transportation Science"},{"key":"10.1016\/j.dam.2012.08.032_br000080","series-title":"The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43","article-title":"The period vehicle routing problem and its extensions","author":"Francis","year":"2008"},{"key":"10.1016\/j.dam.2012.08.032_br000085","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/trsc.26.2.86","article-title":"A heuristic for the periodic vehicle routing problem","volume":"26","author":"Gaudioso","year":"1992","journal-title":"Transportation Science"},{"issue":"6","key":"10.1016\/j.dam.2012.08.032_br000090","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":"Operations Research"},{"key":"10.1016\/j.dam.2012.08.032_br000095","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":"Journal of the Operational Research Society"},{"issue":"3","key":"10.1016\/j.dam.2012.08.032_br000100","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":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.dam.2012.08.032_br000105","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s00291-008-0134-7","article-title":"Delivery strategies for blood products supplies","volume":"31","author":"Hemmelmayr","year":"2009","journal-title":"OR Spectrum"},{"key":"10.1016\/j.dam.2012.08.032_br000110","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.endm.2010.05.088","article-title":"Column generation based primal heuristics","volume":"36","author":"Joncour","year":"2010","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.dam.2012.08.032_br000115","series-title":"Handbook of Metaheuristics","first-page":"321","article-title":"Iterated local search","author":"Louren\u00e7o","year":"2003"},{"key":"10.1016\/j.dam.2012.08.032_br000120","article-title":"Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates","author":"Pacheco","year":"2011","journal-title":"Journal of the Operational Research Society"},{"issue":"10","key":"10.1016\/j.dam.2012.08.032_br000125","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1016\/S0305-0548(01)00035-1","article-title":"The period traveling salesman problem: a new heuristic algorithm","volume":"29","author":"Paletta","year":"2002","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.dam.2012.08.032_br000130","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","article-title":"Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints","volume":"30","author":"Righini","year":"2006","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.dam.2012.08.032_br000135","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/net.20212","article-title":"New dynamic programming algorithms for the resource constrained elementary shortest path problem","volume":"51","author":"Righini","year":"2008","journal-title":"Networks"},{"key":"10.1016\/j.dam.2012.08.032_br000140","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1002\/net.3230210704","article-title":"A multiphase approach to the period routing problem","volume":"21","author":"Russel","year":"1991","journal-title":"Networks"},{"key":"10.1016\/j.dam.2012.08.032_br000145","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230090102","article-title":"An assignment routing problem","volume":"9","author":"Russel","year":"1979","journal-title":"Networks"},{"key":"10.1016\/j.dam.2012.08.032_br000150","unstructured":"M. Salani, Branch-and-Price algorithms for vehicle routing problems, Ph.D. Thesis, Universit\u00e1 degli Studi di Milano, 2006."},{"key":"10.1016\/j.dam.2012.08.032_br000155","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/0305-0483(84)90050-1","article-title":"A heuristic algorithm for the periodic vehicle routing problem","volume":"12","author":"Tan","year":"1984","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.dam.2012.08.032_br000160","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Operations Research"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X12003320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X12003320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T01:30:06Z","timestamp":1588815006000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X12003320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":32,"alternative-id":["S0166218X12003320"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2012.08.032","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}