By Topic

Towards Optimized Routing Approach for Dynamic Shortest Path Selection in Traffic Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tongyu Zhu ; State Key Lab. of Software Dev. Environ., Beihang Univ., Beijing, China ; Wang Xiang

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.

Published in:

2008 International Conference on Advanced Computer Theory and Engineering

Date of Conference:

20-22 Dec. 2008