Vehicle routing and scheduling with time-varying data: A case study
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%.
Keywordsvehicle routing distribution heuristics environment
This research was supported by the Engineering and Physical Sciences Research Council Green Logistics project: Grant No. EP/D043328/1.
- Maden W (2006). Models and heuristic algorithms for complex routing and scheduling problems. PhD Thesis, Lancaster University Management School.Google Scholar
- 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).
- Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem. SIAM: Philadelphia.Google Scholar