Towards optimized routing approach for dynamic shortest path selection in traffic networks

Tongyu Zhu; Wang Xiang

doi:10.1109/ICACTE.2008.183

Towards optimized routing approach for dynamic shortest path selection in traffic networks

Tongyu Zhu^*
, Wang Xiang

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Abstract

This paper presents a novel heuristic method for adaptive routing policy which adopts three-step processes with state space reduction mechanism. Firstly, A* algorithm is introduced in the static road network to reduce those definitely useless states. Secondly, based on real-time traffic information and historic information, a heuristic incremental search method is applied to find the most optimal path at each information update period. Thirdly, those useless states from candidate paths are removed. Based on the real traffic data of Beijing, the experimental results illustrate the effectiveness and efficiency of our approach.

Original language	English
Title of host publication	Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008
Pages	543-547
Number of pages	5
DOIs	https://doi.org/10.1109/ICACTE.2008.183
State	Published - 2008
Event	2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 - Phuket, Thailand Duration: 20 Dec 2008 → 22 Dec 2008

Publication series

Name	Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008

Conference

Conference	2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008
Country/Territory	Thailand
City	Phuket
Period	20/12/08 → 22/12/08

Keywords

Incremental search
Routing policy
Shortest path problem
State space reduction

Access to Document

10.1109/ICACTE.2008.183

Cite this

Zhu, T., & Xiang, W. (2008). Towards optimized routing approach for dynamic shortest path selection in traffic networks. In Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 (pp. 543-547). Article 4737017 (Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008). https://doi.org/10.1109/ICACTE.2008.183

@inproceedings{440823af57a242a6a3d6804c375e1eba,

title = "Towards optimized routing approach for dynamic shortest path selection in traffic networks",

abstract = "This paper presents a novel heuristic method for adaptive routing policy which adopts three-step processes with state space reduction mechanism. Firstly, A* algorithm is introduced in the static road network to reduce those definitely useless states. Secondly, based on real-time traffic information and historic information, a heuristic incremental search method is applied to find the most optimal path at each information update period. Thirdly, those useless states from candidate paths are removed. Based on the real traffic data of Beijing, the experimental results illustrate the effectiveness and efficiency of our approach.",

keywords = "Incremental search, Routing policy, Shortest path problem, State space reduction",

author = "Tongyu Zhu and Wang Xiang",

year = "2008",

doi = "10.1109/ICACTE.2008.183",

language = "英语",

isbn = "9780769534893",

series = "Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008",

pages = "543--547",

booktitle = "Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008",

note = "2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 ; Conference date: 20-12-2008 Through 22-12-2008",

}

Zhu, T & Xiang, W 2008, Towards optimized routing approach for dynamic shortest path selection in traffic networks. in Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008., 4737017, Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008, pp. 543-547, 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008, Phuket, Thailand, 20/12/08. https://doi.org/10.1109/ICACTE.2008.183

Towards optimized routing approach for dynamic shortest path selection in traffic networks. / Zhu, Tongyu ; Xiang, Wang.
Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008. 2008. p. 543-547 4737017 (Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards optimized routing approach for dynamic shortest path selection in traffic networks

AU - Zhu, Tongyu

AU - Xiang, Wang

PY - 2008

Y1 - 2008

N2 - This paper presents a novel heuristic method for adaptive routing policy which adopts three-step processes with state space reduction mechanism. Firstly, A* algorithm is introduced in the static road network to reduce those definitely useless states. Secondly, based on real-time traffic information and historic information, a heuristic incremental search method is applied to find the most optimal path at each information update period. Thirdly, those useless states from candidate paths are removed. Based on the real traffic data of Beijing, the experimental results illustrate the effectiveness and efficiency of our approach.

AB - This paper presents a novel heuristic method for adaptive routing policy which adopts three-step processes with state space reduction mechanism. Firstly, A* algorithm is introduced in the static road network to reduce those definitely useless states. Secondly, based on real-time traffic information and historic information, a heuristic incremental search method is applied to find the most optimal path at each information update period. Thirdly, those useless states from candidate paths are removed. Based on the real traffic data of Beijing, the experimental results illustrate the effectiveness and efficiency of our approach.

KW - Incremental search

KW - Routing policy

KW - Shortest path problem

KW - State space reduction

UR - https://www.scopus.com/pages/publications/62949159533

U2 - 10.1109/ICACTE.2008.183

DO - 10.1109/ICACTE.2008.183

M3 - 会议稿件

AN - SCOPUS:62949159533

SN - 9780769534893

T3 - Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008

SP - 543

EP - 547

BT - Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008

T2 - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008

Y2 - 20 December 2008 through 22 December 2008

ER -

Zhu T , Xiang W. Towards optimized routing approach for dynamic shortest path selection in traffic networks. In Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008. 2008. p. 543-547. 4737017. (Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008). doi: 10.1109/ICACTE.2008.183

Towards optimized routing approach for dynamic shortest path selection in traffic networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this