System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Personalized Path Finding in Road 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
$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)
da Silva, E.R. ; Comput. Sci. Dept., Univ. of Campina Grande, Campina Grande ; de Baptista, C. ; Menezes, L. ; Paiva, A.

Routing systems have become very attractive recently. They aim to help users on finding the optimal path to their destinations regarding travel distance,travel time, and other criteria. There are many issues to be investigated such as the multi-criteria personalization of the paths according to user preferences. This paper discusses main routing algorithms and presents the Coolest path algorithm which enables multi-criteria personalization based on travel distance, travel time, points of interest, and path simplicity. The coolest path approach allows users to set the level of importance for each of these criteria. Moreover, a prototype was built in order to validate the proposed ideas.

Published in:

Networked Computing and Advanced Information Management, 2008. NCM '08. Fourth International Conference on  (Volume:2 )

Date of Conference:

2-4 Sept. 2008