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

Wen, Liang and Çatay, Bülent and Eglese, Richard (2014) Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. European Journal of Operational Research, 236 (3). pp. 915-923. ISSN 0377-2217

Full text not available from this repository.

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.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1802
Subjects:
ID Code:
69142
Deposited By:
Deposited On:
07 Apr 2014 15:10
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Sep 2020 02:10