Vehicle Routing and Scheduling with Time Varying Data: A Case Study

W. Maden, R. Eglese, D. Black

Research output: Contribution to journalArticlepeer-review

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%.
Original languageEnglish
Pages (from-to)515-522
Number of pages8
JournalJournal of the Operational Research Society
Volume61
Issue number3
DOIs
Publication statusPublished - 14 Mar 2010

Fingerprint

Dive into the research topics of 'Vehicle Routing and Scheduling with Time Varying Data: A Case Study'. Together they form a unique fingerprint.

Cite this