Journal of the Operational Research Society

, Volume 61, Issue 3, pp 515–522 | Cite as

Vehicle routing and scheduling with time-varying data: A case study

  • W Maden
  • R Eglese
  • D Black
Part 2: Transportation, Logistics and the Environment

Abstract

A heuristic algorithm is described for vehicle routing and scheduling problems to minimise the total travel time, where the time required for a vehicle to travel along any road in the network varies according to the time of travel. The variation is caused by congestion that is typically greatest during morning and evening rush hours. The algorithm is used to schedule a fleet of delivery vehicles operating in the South West of the United Kingdom for a sample of days. The results demonstrate how conventional methods that do not take time-varying speeds into account when planning, except for an overall contingency allowance, may still lead to some routes taking too long. The results are analysed to show that in the case study using the proposed approach can lead to savings in CO2 emissions of about 7%.

Keywords

vehicle routing distribution heuristics environment 

Notes

Acknowledgements

This research was supported by the Engineering and Physical Sciences Research Council Green Logistics project: Grant No. EP/D043328/1.

References

  1. Eglese RW, Maden W and Slater A (2006). A Road Timetable™ to aid vehicle routing and scheduling. Comput Opns Res 33: 3508–3519.CrossRefGoogle Scholar
  2. Fleischmann B, Gietz M and Gnutzmann S (2004). Time-varying travel times in vehicle routing. Trans Sci 38: 160–173.CrossRefGoogle Scholar
  3. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276–1290.CrossRefGoogle Scholar
  4. Ichoua S, Gendreau M and Potvin J-Y (2003). Vehicle dispatching with time-dependent travel times. Eur J Opl Res 144: 379–396.CrossRefGoogle Scholar
  5. Ichoua S, Gendreau M and Potvin J-Y (2006). Exploiting knowledge about future demands for real-time vehicle dispatching. Trans Sci 40: 211–225.CrossRefGoogle Scholar
  6. Maden W (2006). Models and heuristic algorithms for complex routing and scheduling problems. PhD Thesis, Lancaster University Management School.Google Scholar
  7. Malandraki C and Daskin MS (1992). Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Trans Sci 26: 185–200.CrossRefGoogle Scholar
  8. McKinnon AC and Piecyk MI (2009). Measurement of CO2 emissions from road freight transport: A review of UK experience. Working Paper, Logistics Research Centre, School of Management and Languages, Heriot-Watt University, Edinburgh EH14 4AS. Also available to download from http://www.greenlogistics.org/ (accessed 3 July 2009).
  9. Potvin J-Y and Rousseau J-M (1993). A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Opl Res 66: 331–340.CrossRefGoogle Scholar
  10. Solomon M (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Opns Res 35: 245–265.CrossRefGoogle Scholar
  11. Taillard ED, Badeau P, Gendreau M, Guertin F and Potvin J-Y (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Trans Sci 31: 170–186.CrossRefGoogle Scholar
  12. Taniguchi E and Shimamoto H (2004). Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Trans Res Part C 12: 235–250.CrossRefGoogle Scholar
  13. Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem. SIAM: Philadelphia.Google Scholar
  14. Van Woensel T, Kerbache L, Peremans H and Vandaele N (2008). Vehicle routing with dynamic travel times: a queueing approach. Eur J Opl Res 186: 990–1007.CrossRefGoogle Scholar

Copyright information

© Operational Research Society 2009

Authors and Affiliations

  • W Maden
    • 1
  • R Eglese
    • 2
  • D Black
    • 2
  1. 1.University of HuddersfieldHuddersfieldUK
  2. 2.Lancaster University Management SchoolLancasterUK

Personalised recommendations