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. © 2013 Elsevier B.V. All rights reserved.
https://doi.org/10.1016/j.ejor.2013.10.044Cite as:
@article{Wen_2014,
doi = {10.1016/j.ejor.2013.10.044},
url = {https://doi.org/10.1016%2Fj.ejor.2013.10.044},
year = 2014,
month = {aug},
publisher = {Elsevier {BV}},
volume = {236},
number = {3},
pages = {915--923},
author = {Liang Wen and Bülent {c{C}}atay and Richard Eglese},
title = {Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge},
journal = {European Journal of Operational Research}
}