Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows

References

• Andelmin J, Bartolini E (2017) An exact algorithm for the green vehicle routing problem. Transportation Sci. 51(4):1288–1303.Link, Google Scholar
• Baldacci R, Hadjiconstantinou E, Mingozzi A (2004) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5):723–738.Link, 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) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1):1–6.Crossref, Google Scholar
• Bektaş T, Laporte G (2011) The pollution-routing problem. Transportation Res. Part B Methodol. 45(8):1232–1250.Crossref, Google Scholar
• Bektaş T, Demir E, Laporte G (2016) Green vehicle routing. Psaraftis HN, ed. Green Transportation Logistics: The Quest for Win-Win Solutions (Springer, Cham, Switzerland), 243–265.Crossref, Google Scholar
• Boland NL, Savelsbergh MW (2019) Perspectives on integer programming for time-dependent models. TOP 27(2):147–173.Crossref, Google Scholar
• Bräysy O (2003) A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15(4):347–368.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
• Çimen M, Soysal M (2017) Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm. Transportation Res. Part D Transport Environ. 54(July):82–98.Crossref, Google Scholar
• Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transportation Sci. 53(4):946–985.Link, Google Scholar
• Dabia S, Demir E, Van Woensel T (2017) An exact approach for a variant of the pollution-routing problem. Transportation Sci. 51(2):607–628.Link, Google Scholar
• Dabia S, Ropke S, Van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):380–396.Link, Google Scholar
• Demir E, Bektaş T, Laporte G (2012) An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2):346–359.Crossref, Google Scholar
• Demir E, Bektaş T, Laporte G (2014a) The bi-objective pollution-routing problem. Eur. J. Oper. Res. 232(3):464–478.Crossref, Google Scholar
• Demir E, Bektaş T, Laporte G (2014b) A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3):775–793.Crossref, Google Scholar
• Desaulniers G, Madsen OB, Ropke S (2014) The vehicle routing problem with time windows. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed. (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
• Desrosiers J, Soumis F, Desrochers M (1984) Routing with time windows by column generation. Networks 14(4):545–565.Crossref, Google Scholar
• Donati AV, Montemanni R, Casagrande N, Rizzoli AE, Gambardella LM (2008) Time dependent vehicle routing problem with a multi ant colony system. Eur. J. Oper. Res. 185(3):1174–1191.Crossref, 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
• Franceschetti A, Honhon D, Van Woensel T, Bektaş T, Laporte G(2013) The time-dependent pollution-routing problem. Transportation Res. Part B: Methodol. 56(October):265–293.Crossref, Google Scholar
• Franceschetti A, Demir E, Honhon D, Van Woensel T, Laporte G, Stobbe M (2017) A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3):972–991.Crossref, Google Scholar
• Fukasawa R, He Q, Song Y (2016) A branch-cut-and-price algorithm for the energy minimization vehicle routing problem. Transportation Sci. 50(1):23–34.Link, Google Scholar
• Hashimoto H, Yagiura M, Ibaraki T (2008) An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optim. 5(2):434–456.Crossref, Google Scholar
• Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2):379–396.Crossref, Google Scholar
• Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, Boston), 33–65.Crossref, Google Scholar
• Jabali O, Van Woensel T, De Kok A (2012) Analysis of travel times and CO2 emissions in time-dependent vehicle routing. Production Oper. Management 21(6):1060–1074.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
• Kazemian I, Rabbani M, Farrokhi-Asl H (2018) A way to optimally solve a green time-dependent vehicle routing problem with time windows. Comput. Appl. Math. 37(3):2766–2783.Crossref, Google Scholar
• Kelly JP, Xu J (1999) A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. Comput. 11(2):161–172.Link, Google Scholar
• Kuo Y (2010) Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput. Indust. Engrg. 59(1):157–165.Crossref, Google Scholar
• Laporte G (2009) Fifty years of vehicle routing. Transportation Sci. 43(4):408–416.Link, Google Scholar
• Lin C, Choy KL, Ho GT, Chung SH, Lam H (2014) Survey of green vehicle routing problem: Past and future trends. Expert Systems Appl. 41(4):1118–1138.Crossref, Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Sci. 26(3):185–200.Link, Google Scholar
• Malandraki C, Dial RB (1996) A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur. J. Oper. Res. 90(1):45–55.Crossref, Google Scholar
• Moghdani R, Salimifard K, Demir E, Benyettou A (2021) The green vehicle routing problem: A systematic literature review. J. Cleaner Production 279(January):123691.Crossref, Google Scholar
• Pan B, Zhang Z, Lim A (2021) Multi-trip time-dependent vehicle routing problem with time windows. Eur. J. Oper. Res. 291(1):218–231.Crossref, Google Scholar
• Pecin D, Contardo C, Desaulniers G, Uchoa E (2017a) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J. Comput. 29(3):489–502.Link, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E (2017b) Improved branch-cut-and-price for capacitated vehicle routing. Math. Programming Comput. 9(1):61–100.Crossref, Google Scholar
• Poggi M, Uchoa E (2014) New exact algorithms for the capacitated vehicle routing problem. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed. (SIAM, Philadelphia), 59–86.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
• Soler D, Albiach J, Martínez E (2009) A way to optimally solve a time-dependent vehicle routing problem with time windows. Oper. Res. Lett. 37(1):37–42.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
• Sun W, Yu Y, Wang J (2019) Heterogeneous vehicle pickup and delivery problems: Formulation and exact solution. Transportation Res. Part E Logist. Transportation Rev. 125(May):181–202.Crossref, Google Scholar
• Toth P, Vigo D, eds. (2014) Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia).Crossref, Google Scholar
• United States Environmental Protection Agency (2021) Inventory of U.S. greenhouse gas emissions and sinks. Accessed September 25, 2021, https://www.epa.gov/ghgemissions/inventory-us-greenhouse-gas-emissions-and-sinks.Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.Crossref, Google Scholar
• Vu DM, Hewitt M, Boland N, Savelsbergh M (2020) Dynamic discretization discovery for solving the time-dependent traveling salesman problem with time windows. Transportation Sci. 54(3):703–720.Link, Google Scholar
• Wang J, Yu Y, Tang J (2018) Compensation and profit distribution for cooperative green pickup and delivery problem. Transportation Res. Part B: Methodol. 113(July):54–69.Crossref, Google Scholar
• Yu Y, Wu Y, Wang J (2019a) Bi-objective green ride-sharing problem: Model and exact method. Internat. J. Production Econom. 208(February):472–482.Crossref, Google Scholar
• Yu Y, Wang S, Wang J, Huang M (2019b) A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows. Transportation Res. Part B: Methodol. 122(April):511–527.Crossref, Google Scholar
• Yu Y, Tang J, Li J, Sun W, Wang J (2016) Reducing carbon emission of pickup and delivery using integrated scheduling. Transportation Res. Part D Transp. Environ. 47(August):237–250.Crossref, Google Scholar