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 (Sl), 236 (3). pp. 915-923. ISSN 0377-2217 (Print) 1872-6860 (Online)
Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1016/j.ejor.2013.10.044
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: | Article |
|---|---|
| Uncontrolled Keywords: | Heuristic, minimum cost path, time-varying, congestion charge |
| Subjects: | T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis |
| Divisions: | Faculty of Engineering and Natural Sciences Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng. |
| Depositing User: | Bülent Çatay |
| Date Deposited: | 17 Dec 2013 16:19 |
| Last Modified: | 01 Aug 2019 11:39 |
| URI: | https://research.sabanciuniv.edu/id/eprint/22078 |
Actions (login required)
- View Item