Home > Research > Publications & Outputs > Finding a minimum cost path between a pair of n...
View graph of relations

Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. / Wen, Liang; Çatay, Bülent; Eglese, Richard.

In: European Journal of Operational Research, Vol. 236, No. 3, 01.08.2014, p. 915-923.

Research output: Contribution to journalJournal articlepeer-review

Harvard

APA

Vancouver

Author

Wen, Liang ; Çatay, Bülent ; Eglese, Richard. / Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. In: European Journal of Operational Research. 2014 ; Vol. 236, No. 3. pp. 915-923.

Bibtex

@article{0689526ded934da5bc56095d56f737e1,
title = "Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge",
abstract = "The minimum cost path problem in a time-varying road network is a complicated problem. The paper proposes two heuristic methods to solve the minimum cost path problem between a pair of nodes with a time-varying road network and a congestion charge. The heuristic methods are compared with an alternative exact method using real traffic information. Also, the heuristic methods are tested in a benchmark dataset and a London road network dataset. The heuristic methods can achieve good solutions in a reasonable running time.",
keywords = "Heuristic, Minimum cost path, Time-varying , Congestion charge",
author = "Liang Wen and B{\"u}lent {\c C}atay and Richard Eglese",
year = "2014",
month = aug,
day = "1",
doi = "10.1016/j.ejor.2013.10.044",
language = "English",
volume = "236",
pages = "915--923",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "3",

}

RIS

TY - JOUR

T1 - Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

AU - Wen, Liang

AU - Çatay, Bülent

AU - Eglese, Richard

PY - 2014/8/1

Y1 - 2014/8/1

N2 - The minimum cost path problem in a time-varying road network is a complicated problem. The paper proposes two heuristic methods to solve the minimum cost path problem between a pair of nodes with a time-varying road network and a congestion charge. The heuristic methods are compared with an alternative exact method using real traffic information. Also, the heuristic methods are tested in a benchmark dataset and a London road network dataset. The heuristic methods can achieve good solutions in a reasonable running time.

AB - The minimum cost path problem in a time-varying road network is a complicated problem. The paper proposes two heuristic methods to solve the minimum cost path problem between a pair of nodes with a time-varying road network and a congestion charge. The heuristic methods are compared with an alternative exact method using real traffic information. Also, the heuristic methods are tested in a benchmark dataset and a London road network dataset. The heuristic methods can achieve good solutions in a reasonable running time.

KW - Heuristic

KW - Minimum cost path

KW - Time-varying

KW - Congestion charge

U2 - 10.1016/j.ejor.2013.10.044

DO - 10.1016/j.ejor.2013.10.044

M3 - Journal article

VL - 236

SP - 915

EP - 923

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -