An Exact Algorithm for the Green Vehicle Routing Problem

References

• Andelmin J, Bartolini E (2017) A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation. Technical report, Aalto University School of Science, Aalto, Finland.Google Scholar
• Avci B, Girotra K, Netessine S (2014) Electric vehicles with a battery switching station: Adoption and environmental impact. Management Sci. 61(4):772–794.Link, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.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
• Baldacci R, Mingozzi A, Roberti R (2012) New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J. Comput. 24(3):356–371.Link, Google Scholar
• 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–834.Crossref, Google Scholar
• Bektaş T, Lysgaard J (2015) Optimal vehicle routing with lower and upper bounds on route durations. Networks 65(2):166–179.Crossref, Google Scholar
• Boschetti MA, Mingozzi A, Ricciardelli S (2008) A dual ascent procedure for the set partitioning problem. Discrete Optim. 5(4):735–747.Crossref, Google Scholar
• Conrad RG, Figliozzi MA (2011) The recharging vehicle routing problem. Doolen T, Van Aken E, eds. Proc. 2011 Indust. Engrg. Res. Conf. (IIE, Norcross, GA).Google Scholar
• Crevier B, Cordeau J-F, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176(2):756–773.Crossref, Google Scholar
• Demir E, Bektaş T, Laporte G (2014) A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3):775–793.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, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6):1388–1405Link, Google Scholar
• Eisenbrand F (1999) On the membership problem for the elementary closure of a polyhedron. Combinatorica 19(2):297–300.Crossref, Google Scholar
• Erdoǧan S (2014) Personal communication, April 24.Google Scholar
• Erdoǧan S, Miller-Hooks E (2012) A green vehicle routing problem. Transportation Res. Part E 48(1):100–114.Crossref, Google Scholar
• Felipe Á, Ortuño MT, Righini G, Tirado G (2014) A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transportation Res. Part E 71:111–128.Crossref, Google Scholar
• Fischetti M, Lodi A (2007) Optimizing over the first Chvátal closure. Math. Programming 110(1):3–20.Crossref, Google Scholar
• Goeke D, Schneider M (2015) Routing a mixed fleet of electric and conventional vehicles. Eur. J. Oper. Res. 245(1):81–99.Crossref, Google Scholar
• Hiermann G, Puchinger J, Røpke S, Hartl RF (2016) The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252(3):995–1018.Crossref, Google Scholar
• Ichimori T, Ishii H, Nishida T (1981) Routing a vehicle with the limitation of fuel. J. Oper. Res. Soc. Japan 24(3):277–281.Google Scholar
• Ichimori T, Ishii H, Nishida T (1983) Two routing problems with the limitation of fuel. Discrete Appl. Math. 6(1):85–89.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
• Koç Ç, Karaoglan I (2016) The green vehicle routing problem: A heuristic based exact solution approach. Appl. Soft Comput. 39:154–164.Crossref, Google Scholar
• Kohl N, Desrosiers J, Madsen OBG, Solomon M, 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, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper. Res. 33(5):1050–1073.Link, Google Scholar
• Lin C, Choy KL, Ho GT, Chung S, Lam H (2014) Survey of green vehicle routing problem: Past and future trends. Expert Syst. Appl. 41(4):1118–1138.Crossref, Google Scholar
• Montoya A, Guéret C, Mendoza JE, Villegas JG (2016) A multi-space sampling heuristic for the green vehicle routing problem. Transportation Res. Part C 70:113–128.Crossref, Google Scholar
• Pelletier S, Jabali O, Laporte G (2016) 50th anniversary invited article—Goods distribution with electric vehicles: Review and research perspectives. Transportation Sci. 50(1):3–22.Link, Google Scholar
• Petersen B, Pisinger D, Spoorendonk S (2008) Chvátal–Gomory rank-1 cuts used in a Dantzig–Wolfe decomposition of the vehicle routing problem with time windows. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 397–419.Crossref, Google Scholar
• Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transportation Sci. 48(4):500–520.Link, Google Scholar
• Schneider M, Stenger A, Hof J (2015) An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectrum 37(2):353–387.Crossref, Google Scholar