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

Wen, Liang and Eglese, Richard (2015) Minimum cost VRP with time-dependent speed data and congestion charge. Computers and Operations Research, 56. pp. 41-50. ISSN 0305-0548

PDF (minimum cost VRP with time-varying and congestion charge v2 submitted)
minimum_cost_VRP_with_time_varying_and_congestion_charge_v2_submitted.pdf - Submitted Version

Download (1MB)


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.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Additional Information:
The final, definitive version of this article has been published in the Journal, Computers and Operations Research 56, 2015, © ELSEVIER.
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
02 Dec 2014 16:02
Last Modified:
17 Sep 2023 01:35