An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier

References

• Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problem with profits. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization, vol. 18 (SIAM, Philadelphia), 273–297.Crossref, Google Scholar
• Balas E (1975) Facets of the knapsack polytope. Math. Programming 8(1):146–164.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Bolduc M-C, Renaud J, Boctor F, Laporte G (2008) A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J. Oper. Res. Soc. 59(6):776–787.Crossref, Google Scholar
• Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Sci. 39(1):104–118.Link, Google Scholar
• Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Sci. 39(1):119–139.Link, Google Scholar
• Chabrier A (2006) Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10):2972–2990.Crossref, Google Scholar
• Chu C-W (2005) A heuristic algorithm for the truckload and less-than-truckload problem. Eur. J. Oper. Res. 165(3):657–667.Crossref, Google Scholar
• Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568–581.Link, Google Scholar
• Cook W, Rich JL (1999) A parallel cutting plane algorithm for the vehicle routing problem with time windows. Technical Report TR99-04, Computational and Applied Mathematics, Rice University, Houston.Google Scholar
• Côté J-F, Potvin J-Y (2009) A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. Eur. J. Oper. Res. 198(2):464–469.Crossref, Google Scholar
• Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3):387–404.Link, Google Scholar
• Desaulniers G, Madsen OBG, Ropke S (2014) The vehicle routing problem with time windows. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization, vol. 18 (SIAM, Philadelphia), 119–159.Crossref, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342–354.Link, Google Scholar
• 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–229.Crossref, Google Scholar
• Gahm C, Brabänder C, Tuma A (2017) Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options. Transportation Res. Part E. Logist. Transportation Rev. 97(C):192–216.Crossref, Google Scholar
• Gendreau M, Tarantilis CD (2010) Solving large-scale vehicle routing problems with time windows: The state of the art. Technical Report 2010-04, CIRRELT, Montreal.Google Scholar
• Irnich S, Villeneuve D (2006) The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS J. Comput. 18(3):391–406.Link, Google Scholar
• Irnich S, Schneider M, Vigo D (2014) Four variants of the vehicle routing problem. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization, vol. 18 (SIAM, Philadelpia), 241–271.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497–511.Link, Google Scholar
• Kallehauge B (2008) Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35(7):2307–2330.Crossref, Google Scholar
• Kaparis K, Letchford AN (2008) Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 186(1):91–103.Crossref, Google Scholar
• Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33(1):101–116.Link, Google Scholar
• Laporte G (1992) The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3):345–358.Crossref, Google Scholar
• Laporte G (2007) What you should know about the vehicle routing problem. Naval Res. Logist. 54(8):811–819.Crossref, Google Scholar
• Liu FH, Shen SY (1999) The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50(7):721–732.Crossref, Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Pisinger D (1997) A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45(5):758–767.Link, Google Scholar
• Potvin J-Y, Naud M-A (2011) Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. J. Oper. Res. Soc. 62(2):326–336.Crossref, Google Scholar
• Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3):255–273.Crossref, Google Scholar
• Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Stenger A, Schneider M, Goeke D (2013) The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost. Eur. J. Transportation Logist. 2(1):57–87.Crossref, Google Scholar
• Stenger A, Vigo D, Enz S, Schwind M (2013) A variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transportation Sci. 47(1):64–80.Link, Google Scholar
• Toth P, Vigo D (2014) Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization, vol. 18 (SIAM, Philadelphia).Crossref, Google Scholar
• Vidal T, Maculan N, Satoru Ochi L, Vaz Penna PH (2016) Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transportation Sci. 50(2):720–734.Link, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3):611–624.Link, Google Scholar
• Wolsey LA (1975) Faces for linear inequalities in 0-1 variables. Math. Programming 8(1):165–178.Crossref, Google Scholar
• Zonghao G, Nemhauser GL, Savelbergh MWP (1998) Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS J. Comput. 10(4):427–437.Link, Google Scholar