Annals of Operations Research

, Volume 236, Issue 2, pp 463–474 | Cite as

Scheduling issues in vehicle routing

  • Gilbert Laporte


Scheduling often plays an important role in vehicle routing. This paper describes several applications in which the author has been involved in recent years. These arise in the dial-a-ride problem, speed optimization in routing problems, the pollution-routing problem, long-haul vehicle routing and scheduling with working hour rules, and synchronization in arc routing.


Vehicle routing Scheduling Arc routing Time windows Speed 



This work was partly funded by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10. This support is gratefully acknowledged. The author thanks several of his coauthors who have taken part in the projects described in this study: Tolga Bektas, François Bellavance, Gerardo Berbeglia, Jean-François Cordeau, Emrah Demir, Kjetil Fagerholt, Lars Magnus Hvattum, André Langevin, Inge Norstad, Julie Paquette, Marta M.B. Pascoal, Marie-Ève Rancourt and Angélica M. Salazar-Aguilar. Thanks are also due to Ola Jabali who kindly commented on an earlier version of the manuscript, and to the referees for their valuable comments.


  1. Archetti, C., & Savelsbergh, M. W. P. (2009). The trip scheduling problem. Transportation Science, 43, 417–431. CrossRefGoogle Scholar
  2. Baldacci, R., Mingozzi, A., & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218, 1–6. CrossRefGoogle Scholar
  3. Barth, M., & Boriboonsomsin, K. (2009). Energy and emissions impacts of a freeway-based dynamic eco-driving system. Transportation Research. Part D, 14, 400–410. CrossRefGoogle Scholar
  4. Barth, M., Younglove, T., & Scora, G. (2005). Development of a heavy-duty diesel modal emissions and fuel consumption model. Technical report UCP-ITS-PRR-2005-1, California PATH Program, Institute of Transportation Studies, University of California at Berkeley. Google Scholar
  5. Bektas, T., & Laporte, G. (2011). The pollution-routing problem. Transportation Research. Part B, 45, 1232–1250. CrossRefGoogle Scholar
  6. Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2011). Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, 45, 399–412. CrossRefGoogle Scholar
  7. Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2012a). Feasibility of the pickup and delivery problem with fixed partial routes: a complexity analysis. Transportation Science, 46, 359–373. CrossRefGoogle Scholar
  8. Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2012b). A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing, 24, 343–355. CrossRefGoogle Scholar
  9. Ceselli, A., Righini, R., & Salani, M. (2009). A column generation algorithm for a rich vehicle-routing problem. Transportation Science, 43, 56–69. CrossRefGoogle Scholar
  10. Cordeau, J.-F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research. Part B, 37, 579–594. CrossRefGoogle Scholar
  11. Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: models and algorithms. Annals of Operations Research, 153, 29–46. CrossRefGoogle Scholar
  12. Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6, 80–91. CrossRefGoogle Scholar
  13. Demir, E., Bektas, T., & Laporte, G. (2012). An adaptive large neighborhood search heuristic for the pollution-routing problem. European Journal of Operational Research, 223, 346–359. CrossRefGoogle Scholar
  14. Drexl, M. (2012). Synchronization in vehicle routing—a survey of VRPs with multiple synchronization constraints. Transportation Science, 46, 297–316. CrossRefGoogle Scholar
  15. Fagerholt, K., Laporte, G., & Norstad, I. (2010). Reducing fuel emissions by optimizing speed on shipping routes. Journal of the Operational Research Society, 61, 523–529. CrossRefGoogle Scholar
  16. Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109–133. CrossRefGoogle Scholar
  17. Gehring, H., & Homberger, J. A. (1999). A parallel hybrid evolutionary metaheuristic for the vehicle routing with time windows. In K. Miettinen, M. M. Makela, & J. Toivanen (Eds.), Proceedings of EUROGEN99, Jyväskiä, Finland. Google Scholar
  18. Goel, A. (2009). Vehicle scheduling and routing with drivers’ working hours. Transportation Science, 43, 17–26. CrossRefGoogle Scholar
  19. Goel, A., Archetti, A., & Savelsbergh, M. W. P. (2012). Truck driver scheduling in Australia. Computers & Operations Research, 39, 1122–1132. CrossRefGoogle Scholar
  20. Goel, A., & Kok, A. L. (2012). Truck driver scheduling in the United States. Transportation Science, 46, 317–326. CrossRefGoogle Scholar
  21. Goel, A., & Rousseau, L.-M. (2011). Truck driver scheduling in Canada. Journal of Scheduling, forthcoming. Google Scholar
  22. Golden, B. L., Raghavan, S., & Wasil, E. A. (2008). The vehicle routing problem: latest advances and new challenges. New York: Springer. CrossRefGoogle Scholar
  23. Hvattum, L. M., Norstad, I., Fagerholt, K., & Laporte, G. (2013). Analysis of an exact algorithm for the vessel speed optimization problem. Networks, forthcoming. Google Scholar
  24. Kok, A. L., Hans, E. W., & Schutten, J. M. J. (2011). Optimizing departure times in vehicle routes. European Journal of Operational Research, 210, 579–587. CrossRefGoogle Scholar
  25. Kok, A. L., Meyer, C. M., Kopfer, H., & Schutten, J. M. J. (2010). A dynamic programming heuristic for the vehicle routing problem with time windows and European community social legislation. Transportation Science, 44, 442–454. CrossRefGoogle Scholar
  26. Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43, 408–416. CrossRefGoogle Scholar
  27. McKinnon, A. (2007). CO2 emissions from freight transport in the UK. Technical report prepared for the Climate Change Working Group of the Commission for Integrated Transport. London, UK. Accessed 11 February 2011.
  28. Nagata, Y., Bräysy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 37, 724–737. CrossRefGoogle Scholar
  29. Norstad, I., Fagerholt, K., & Laporte, G. (2011). Tramp ship routing and scheduling with speed optimization. Transportation Research. Part C, 19, 853–865. CrossRefGoogle Scholar
  30. Paquette, J. (2010). Mesure de la qualité de service et conception de tournées en transport adapté. Ph.D. thesis, HEC, Montréal, Canada. Google Scholar
  31. Paquette, J., Bellavance, F., Cordeau, J.-F., & Laporte, G. (2012). Measuring quality of service in dial-a-ride operations: the case of a Canadian city. Transportation, 39, 539–564. CrossRefGoogle Scholar
  32. Paquette, J., Cordeau, J.-F., Laporte, G., & Pascoal, M. M. B. (2013). Combining multicriteria analysis and tabu search for dial-a-rial problems. Transportation Research B, 52, 1–16. CrossRefGoogle Scholar
  33. Parragh, S. N., Doerner, K. F., & Hartl, R. L. (2008a). A survey of pickup and delivery models: Part I: Transportation between customers and depot. Journal für Betriebswirtschaft, 58, 21–51. CrossRefGoogle Scholar
  34. Parragh, S. N., Doerner, K. F., & Hartl, R. L. (2008b). A survey of pickup and delivery models: Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58, 81–117. CrossRefGoogle Scholar
  35. Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34, 2403–2435. CrossRefGoogle Scholar
  36. Prescott-Gagnon, E., Drexl, M., & Rousseau, L.-M. (2010). European driver rules in vehicle routing with time windows. Transportation Science, 44, 455–473. CrossRefGoogle Scholar
  37. Rancourt, M.-È., Cordeau, J.-F., & Laporte, G. (2013). Long-haul vehicle routing and scheduling with working hour rules. Transportation Science, 47, 81–107. CrossRefGoogle Scholar
  38. Ropke, S., Cordeau, J.-F., & Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258–272. CrossRefGoogle Scholar
  39. Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2012). Synchronized arc routing for snow plowing operations. Computers & Operations Research, 39, 1432–1440. CrossRefGoogle Scholar
  40. Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2013). The synchronized arc and node routing problem: application to road marking. Computers & Operations Research, 40, 1708–1715. CrossRefGoogle Scholar
  41. Savelsbergh, M. W. P. (1992). The vehicle routing problem with time windows: minimizing route duration. ORSA Journal on Computing, 4, 146–154. CrossRefGoogle Scholar
  42. Solomon, M. M. (1987). Algorithms for the vehicle-routing and scheduling problems with time window constraints. Operations Research, 35, 254–265. CrossRefGoogle Scholar
  43. Toth, P., & Vigo, D. (2002). The vehicle routing problem. Philadelphia: SIAM. CrossRefGoogle Scholar
  44. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, M., & da Fonseca, G. V. (2003). Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation, 7, 117–132. CrossRefGoogle Scholar
  45. Zitzler, E., Thiele, L., & Bader, J. (2010). On set-based multiobjective optimization. IEEE Transactions on Evolutionary Computation, 14, 58–79. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Canada Research Chair in Distribution ManagementHEC MontréalMontréalCanada

Personalised recommendations