An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows

Published Online:https://doi.org/10.1287/opre.2019.1874

References

  • Archetti C, Speranza M, Vigo D (2014) Vehicle routing problems with profits. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization, vol. 18 (Society for Industrial and Applied Mathematics, Philadelphia), 273–298.CrossrefGoogle Scholar
  • Azi N, Gendreau M, Potvin JY (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur. J. Oper. Res. 178(3):755–766.CrossrefGoogle Scholar
  • Azi N, Gendreau M, Potvin JY (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3):756–763.CrossrefGoogle 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.LinkGoogle 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.LinkGoogle Scholar
  • Cattaruzza D, Absi N, Feillet D (2016a) The multi-trip vehicle routing problem with time windows and release dates. Transportation Sci. 50(2):676–693.LinkGoogle Scholar
  • Cattaruzza D, Absi N, Feillet D (2016b) Vehicle routing problems with multiple trips. 4OR 14(3):223–259.CrossrefGoogle Scholar
  • Cheng C, Adulyasak Y, Rousseau LM (2018) Formulations and exact algorithms for drone routing problem. Technical Report CIRRELT-2018-31, CIRRELT, Polytechnique Montréal, Montréal.Google Scholar
  • Dorling K, Heinrichs J, Messier GG, Magierowski S (2017) Vehicle routing problems for drone delivery. IEEE Trans. Systems Man Cybernetics Systems 47(1):70–85.CrossrefGoogle Scholar
  • Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirtschaftswissenschaften, Universität Hamburg, Hamburg, Germany.Google Scholar
  • Hernandez F, Feillet D, Giroudeau R, Naud O (2014) A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR 12(3):235–259.CrossrefGoogle Scholar
  • Hernandez F, Feillet D, Giroudeau R, Naud O (2016) Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res. 249(2):551–559.CrossrefGoogle 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.LinkGoogle Scholar
  • Macedo R, Alves C, De Carvalho JMV, Clautiaux F, Hanafi S (2011) Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3):536–545.CrossrefGoogle Scholar
  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.LinkGoogle Scholar
  • Tilk C, Irnich S (2017) Dynamic programming for the minimum tour duration problem. Transportation Sci. 51(2):549–565.LinkGoogle Scholar
  • Vansteenwegen P, Souffriau W, Vanden Berghe G, Van Oudheusden D (2009) Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12):3281–3290.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.