By Topic

Multi-objective optimal route search for road networks by dynamic programming

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
$31 $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

4 Author(s)
Mainali, M.K. ; Grad. Sch. of Inf., Production & Syst., Waseda Univ., Kitakyushu ; Shimada, K. ; Mabu, S. ; Hirasawa, K.

One of the most important functions of car navigation systems is to assist drivers to travel to destinations. Minimum traveling distance or time is often considered to find the optimal route to the destination. However, when searching for the optimal route, it is essential to consider userspsila preference in the search. In this paper, we propose a new dynamic programming method to find the optimal route to the destination considering multiple criteria. The proposed method is an extension of our previous route search algorithm, Q method. In this study, we will define the Q values for the pair of road sections. A general index will be introduced, which takes multiple criteria into consideration. Q values are updated based on the local information available including other Q values at the adjacent road sections. When the traveling time changes, we use the already obtained Q values to find the new optional route. We applied the proposed method to a very simple artificial road network. Simulation results show that we can find better routes when considering multiple criteria compared to the optimization using the traveling time only.

Published in:

SICE Annual Conference, 2008

Date of Conference:

20-22 Aug. 2008