{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T12:48:41Z","timestamp":1768481321625,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T00:00:00Z","timestamp":1365552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10479-013-1366-8","type":"journal-article","created":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T06:25:09Z","timestamp":1365488709000},"page":"1-22","source":"Crossref","is-referenced-by-count":18,"title":["Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework"],"prefix":"10.1007","volume":"206","author":[{"given":"Theodore","family":"Athanasopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Minis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,10]]},"reference":[{"key":"1366_CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.ejor.2006.12.040","volume":"185","author":"G. Andreatta","year":"2008","unstructured":"Andreatta, G., & Lulli, G. (2008). A multi-period TSP with stochastic regular and urgent demands. European Journal of Operational Research, 185, 122\u2013132.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1366_CR2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.orl.2007.02.006","volume":"35","author":"E. Angelelli","year":"2007","unstructured":"Angelelli, E., Savelsbergh, M. W. P., & Speranza, M. G. (2007a). Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Operations Research Letters, 35(6), 713\u2013721.","journal-title":"Operations Research Letters"},{"issue":"4","key":"1366_CR3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1002\/net.20180","volume":"49","author":"E. Angelelli","year":"2007","unstructured":"Angelelli, E., Speranza, M. G., & Savelsbergh, M. W. P. (2007b). Competitive analysis for dynamic multi-period uncapacitated routing problems. Networks, 49(4), 308\u2013317.","journal-title":"Networks"},{"issue":"2","key":"1366_CR4","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.trc.2008.02.001","volume":"17","author":"E. Angelelli","year":"2009","unstructured":"Angelelli, E., Bianchessi, N., Mansini, R., & Speranza, M. G. (2009). Short term strategies for a dynamic multi-period routing problem. Transportation Research. Part C, 17(2), 106\u2013119.","journal-title":"Transportation Research. Part C"},{"key":"1366_CR5","unstructured":"Athanasopoulos, T. (2011). The multi-period vehicle routing problem and its applications. PhD thesis, Financial and Management Engineering, University of the Aegean."},{"key":"1366_CR6","doi-asserted-by":"crossref","first-page":"232","DOI":"10.4018\/978-1-61520-633-9.ch011","volume-title":"Supply chain optimization, design and management: advances and intelligent methods","author":"T. Athanasopoulos","year":"2010","unstructured":"Athanasopoulos, T., & Minis, I. (2010). Multi-period routing in hybrid courier operations. In I. Minis, V. Zeimpekis, G. Dounias, & N. Ampazis (Eds.), Supply chain optimization, design and management: advances and intelligent methods (pp. 232\u2013251). Hershey: IGI Global."},{"issue":"2","key":"1366_CR7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"J. F. Bard","year":"2002","unstructured":"Bard, J. F., Kontoravdis, G., & Yu, G. (2002). A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science, 36(2), 250\u2013269.","journal-title":"Transportation Science"},{"issue":"3","key":"1366_CR8","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329.","journal-title":"Operations Research"},{"key":"1366_CR9","unstructured":"Battarra, M. (2010). Exact and heuristic algorithms for routing problems. PhD thesis, University of Bologna."},{"key":"1366_CR10","volume-title":"Proceedings of the sixth triennial symposium on transportation analysis","author":"M. Bierlaire","year":"2006","unstructured":"Bierlaire, M., Eggenberg, N., & Salani, M. (2006). Column generation methods for disrupted airline schedules. In Proceedings of the sixth triennial symposium on transportation analysis, Thailand."},{"key":"1366_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-0-387-77778-8_3","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"L. Bertazzi","year":"2008","unstructured":"Bertazzi, L., Savelsbergh, M., & Speranza, M. G. (2008). Inventory routing. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges (pp. 49\u201372). Berlin: Springer."},{"key":"1366_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/978-0-387-77778-8_23","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"N. Bostel","year":"2008","unstructured":"Bostel, N., Dejax, P., Guez, P., & Tricoire, F. (2008). Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges (pp. 503\u2013525). Berlin: Springer."},{"issue":"4","key":"1366_CR13","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/trsc.1030.0054","volume":"38","author":"A. M. Campbell","year":"2004","unstructured":"Campbell, A. M., & Savelsbergh, M. (2004). A decomposition approach for the inventory routing problem. Transportation Science, 38(4), 488\u2013502.","journal-title":"Transportation Science"},{"key":"1366_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4615-5755-5_4","volume-title":"Fleet management and logistics","author":"A. Campbell","year":"1998","unstructured":"Campbell, A., Clarke, L., Kleywegt, A., & Savelsbergh, M. (1998). Inventory routing. In T. Crainic & G. Laporte (Eds.), Fleet management and logistics (pp. 95\u2013112). Boston: Kluwer."},{"issue":"1","key":"1366_CR15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/trsc.1080.0256","volume":"43","author":"A. Ceselli","year":"2009","unstructured":"Ceselli, A., Righini, G., & Salani, M. (2009). A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints. Transportation Science, 43(1), 56\u201369.","journal-title":"Transportation Science"},{"key":"1366_CR16","doi-asserted-by":"crossref","first-page":"2972","DOI":"10.1016\/j.cor.2005.02.029","volume":"33","author":"A. Chabrier","year":"2006","unstructured":"Chabrier, A. (2006). Vehicle routing problem with elementary shortest path based column generation. Computers & Operations Research, 33, 2972\u20132990.","journal-title":"Computers & Operations Research"},{"key":"1366_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"Christofides, N., & Beasley, J. E. (1984). The period routing problem. Networks, 14, 237\u2013256.","journal-title":"Networks"},{"key":"1366_CR18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J. F. Cordeau","year":"1997","unstructured":"Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105\u2013119.","journal-title":"Networks"},{"key":"1366_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/1.9780898718515.ch7","volume-title":"SIAM monographs on discrete mathematics and applications: the vehicle routing problem","author":"J.-F. Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2002). The VRP with time windows. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications: the vehicle routing problem (pp. 157\u2013193). Philadelphia: SIAM."},{"key":"1366_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/0-387-25486-2_4","volume-title":"Column generation","author":"E. Danna","year":"2005","unstructured":"Danna, E., & Le Pape, C. (2005). Branch-and-price heuristics: a case study on the vehicle routing problem with time windows. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp.\u00a099\u2013129). Berlin: Springer."},{"key":"1366_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8, 101\u2013111.","journal-title":"Operations Research"},{"key":"1366_CR22","unstructured":"Desrochers, M. (1988). An algorithm for the shortest path problem with resource constraints. Les cahiers du GERAD no. G-88-27."},{"key":"1366_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/0-387-25486-2_1","volume-title":"Column generation","author":"J. Desrosiers","year":"2005","unstructured":"Desrosiers, J., & L\u00fcbbecke, M. (2005). A primer in column generation. In G. Desaulniers, J. Desrosiers, & M. Solomon (Eds.), Column generation (pp. 1\u201332). New York: Springer."},{"key":"1366_CR24","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40, 342\u2013354.","journal-title":"Operations Research"},{"key":"1366_CR25","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M. Dror","year":"1994","unstructured":"Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research, 42, 977\u2013979.","journal-title":"Operations Research"},{"key":"1366_CR26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02022035","volume":"4","author":"M. Dror","year":"1985","unstructured":"Dror, M., Ball, M., & Golden, B. L. (1985). Computational comparison of algorithms for the inventory routing problem. Annals of Operations Research, 4, 3\u201323.","journal-title":"Annals of Operations Research"},{"issue":"6","key":"1366_CR27","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1016\/j.cor.2009.08.006","volume":"37","author":"N. Eggenberg","year":"2010","unstructured":"Eggenberg, N., Salani, M., & Bierlaire, M. (2010). Constraint-specific recovery network for solving airline recovery problems. Computers & Operations Research, 37(6), 1014\u20131026.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1366_CR28","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B. Eksioglu","year":"2009","unstructured":"Eksioglu, B., Vural, A. F., & Reisman, A. (2009). The vehicle routing problem: a taxonomic review. Computers & Industrial Engineering, 57(4), 1472\u20131483.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"1366_CR29","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D. Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks, 44(3), 216\u2013229.","journal-title":"Networks"},{"key":"1366_CR30","unstructured":"Feillet, D., Gendreau, M., & Rousseau, L. M. (2005). New refinements for the solution of vehicle routing problems with branch and price (Technical Report C7PQMR PO2005-08-X). Center for Research on Transportation, Montreal."},{"key":"1366_CR31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-0-387-77778-8_4","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"P. Francis","year":"2008","unstructured":"Francis, P., Smilowitz, K., & Tzur, M. (2008). The period vehicle routing problem and its extensions. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges (pp. 73\u2013102). Berlin: Springer."},{"key":"1366_CR32","series-title":"Operations research\/computer science interfaces series","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"B. Golden","year":"2008","unstructured":"Golden, B., Raghavan, S., & Wasil, E. (2008). Operations research\/computer science interfaces series: Vol.\u00a043. The vehicle routing problem: latest advances and new challenges. Berlin: Springer."},{"issue":"2","key":"1366_CR33","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M. Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008). Subset-row in-equalities applied to the vehicle-routing problem with time windows. Operations Research, 56(2), 497\u2013511.","journal-title":"Operations Research"},{"key":"1366_CR34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/0-387-25486-2_3","volume-title":"Column generation","author":"B. Kallehauge","year":"2005","unstructured":"Kallehauge, B., Larsen, J., Madsen, O. B., & Solomon, M. M. (2005). The vehicle routing problem with time windows. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp. 67\u201398). Berlin: Springer."},{"key":"1366_CR35","unstructured":"Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark."},{"issue":"1","key":"1366_CR36","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N. Kohl","year":"1999","unstructured":"Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1999). 2-path cuts for the vehicle routing problem with time windows. Transportation Science, 33(1), 101\u2013116.","journal-title":"Transportation Science"},{"key":"1366_CR37","unstructured":"Larsen, J. (2001). Parallelization of the vehicle routing problem with time windows. PhD thesis (IMM-PHD-2001-62), Department of Mathematical Modeling, Technical University of Denmark."},{"key":"1366_CR38","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"1366_CR39","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1016\/j.ejor.2006.02.030","volume":"183","author":"M. Mourgaya","year":"2007","unstructured":"Mourgaya, M., & Vanderbeck, F. (2007). Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research, 183(3), 1028\u20131041.","journal-title":"European Journal of Operational Research"},{"key":"1366_CR40","unstructured":"Petersen, B. (2011). Shortest paths and vehicle routing. PhD thesis, DTU Management Engineering."},{"key":"1366_CR41","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-0-387-77778-8_18","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"B. Petersen","year":"2008","unstructured":"Petersen, B., Pisinger, D., & Spoorendonk, S. (2008). Chvatal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows. In B. Golden, R. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges (pp. 397\u2013420). Berlin: Springer."},{"key":"1366_CR42","first-page":"26","volume-title":"Proceedings of the international network optimization conference","author":"S. Pirkwieser","year":"2009","unstructured":"Pirkwieser, S., & Raidl, G. R. (2009). A column generation approach for the periodic vehicle routing problem with time windows. In M. G. Scutell\u00e0 et al. (Eds.), Proceedings of the international network optimization conference, Pisa, Italy (pp. 26\u201329)."},{"issue":"3","key":"1366_CR43","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G. Righini","year":"2006","unstructured":"Righini, G., & Salani, M. (2006). Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization, 3(3), 255\u2013273.","journal-title":"Discrete Optimization"},{"issue":"3","key":"1366_CR44","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G. Righini","year":"2008","unstructured":"Righini, G., & Salani, M. (2008). New dynamic programming algorithms for the resource constrained shortest path problem. Networks, 51(3), 155\u2013170.","journal-title":"Networks"},{"key":"1366_CR45","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254\u2013265.","journal-title":"Operations Research"},{"key":"1366_CR46","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"SIAM monographs on discrete mathematics and applications: the vehicle routing problem","author":"P. Toth","year":"2002","unstructured":"Toth, P., & Vigo, D. (2002). SIAM monographs on discrete mathematics and applications: the vehicle routing problem. Philadelphia: SIAM."},{"key":"1366_CR47","unstructured":"Tricoire, F. (2006). Optimization des tournees de vehicules et de personnels de maintenance: application a la distribution et au traitement des eaux. PhD thesis, University of Nantes, France."},{"issue":"2","key":"1366_CR48","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10288-006-0028-y","volume":"5","author":"F. Tricoire","year":"2007","unstructured":"Tricoire, F. (2007). Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment, 4OR, 5(2), 165\u2013168.","journal-title":"4OR"},{"issue":"9","key":"1366_CR49","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.cor.2009.12.002","volume":"37","author":"M. Wen","year":"2010","unstructured":"Wen, M., Cordeau, J., Laporte, G., & Larsen, J. (2010). The dynamic multi-period vehicle routing problem. Computers & Operations Research, 37(9), 1615\u20131623.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1366-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1366-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1366-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:42Z","timestamp":1559138982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1366-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,10]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1366"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1366-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,10]]}}}