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

Associated organisational unit

Electronic data

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

Minimum cost VRP with time-dependent speed data and congestion charge. / Wen, Liang; Eglese, Richard.

In: Computers and Operations Research, Vol. 56, 04.2015, p. 41-50.

Research output: Contribution to journalJournal articlepeer-review

Harvard

APA

Vancouver

Author

Wen, Liang ; Eglese, Richard. / Minimum cost VRP with time-dependent speed data and congestion charge. In: Computers and Operations Research. 2015 ; Vol. 56. pp. 41-50.

Bibtex

@article{62c008d1b04040f4a49db7455cdd6fba,
title = "Minimum cost VRP with time-dependent speed data and congestion charge",
abstract = "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. ",
keywords = "Vehicle Routing, Heuristic, Time-Dependent Data, Congestion Charge",
author = "Liang Wen and Richard Eglese",
note = "The final, definitive version of this article has been published in the Journal, Computers and Operations Research 56, 2015, {\textcopyright} ELSEVIER.",
year = "2015",
month = apr,
doi = "10.1016/j.cor.2014.10.007",
language = "English",
volume = "56",
pages = "41--50",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",

}

RIS

TY - JOUR

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

AU - Wen, Liang

AU - Eglese, Richard

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

PY - 2015/4

Y1 - 2015/4

N2 - 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.

AB - 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.

KW - Vehicle Routing

KW - Heuristic

KW - Time-Dependent Data

KW - Congestion Charge

U2 - 10.1016/j.cor.2014.10.007

DO - 10.1016/j.cor.2014.10.007

M3 - Journal article

VL - 56

SP - 41

EP - 50

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -