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%. © 2010 Operational Research Society Ltd. All rights reserved.
https://doi.org/10.1057/jors.2009.116Cite as:
@article{Maden_2010,
doi = {10.1057/jors.2009.116},
url = {https://doi.org/10.1057%2Fjors.2009.116},
year = 2010,
month = {mar},
publisher = {Informa {UK} Limited},
volume = {61},
number = {3},
pages = {515--522},
author = {W Maden and R Eglese and D Black},
title = {Vehicle routing and scheduling with time-varying data: A case study},
journal = {Journal of the Operational Research Society}
}