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

Research

Electronic data

  • MinCostPath-Rev2_v2

    Accepted author manuscript, 687 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

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 Journal/Magazine › Journal article › peer-review

Published
<mark>Journal publication date</mark>1/08/2014
<mark>Journal</mark>European Journal of Operational Research
Issue number3
Volume236
Number of pages9
Pages (from-to)915-923
Publication StatusPublished
Early online date30/11/13
<mark>Original language</mark>English

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.