Home > Research > Publications & Outputs > Minimum cost VRP with time-dependent speed data...

Associated organisational unit

Electronic data


Text available via DOI:

View graph of relations

Minimum cost VRP with time-dependent speed data and congestion charge

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>04/2015
<mark>Journal</mark>Computers and Operations Research
Number of pages10
Pages (from-to)41-50
Publication StatusPublished
Early online date29/11/14
<mark>Original language</mark>English


A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver cost and congestion charge. The fuel cost required is influenced by the speed. The speed for a vehicle to travel along any road in the network varies according to the time of travel. The variation in speed is caused by congestion which is greatest during morning and evening rush hours. If a vehicle enters the congestion charge zone at any time, a fixed charge is applied. A benchmark dataset is designed to test the algorithm. The algorithm is also used to schedule a fleet of delivery vehicles operating in the London area.

Bibliographic note

The final, definitive version of this article has been published in the Journal, Computers and Operations Research 56, 2015, © ELSEVIER.