Personalized Path Finding in Road Networks
Personalized Path Finding in Road Networks
复制标题
道路网络中的个性化路径查找
DOI：
10.1109/ncm.2008.211
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
A. Paiva
中科院分区：
文献类型：
--
作者：
E. N. D. Silva;C. Baptista;L. Menezes;A. Paiva
路由系统最近变得非常有吸引力。它们旨在帮助用户根据旅行距离、旅行时间和其他标准找到到达目的地的最佳路径。有许多问题需要研究，如根据用户偏好的路径的多标准个性化。本文讨论了主要的路由算法，并提出了最酷的路径算法，使多标准个性化的基础上的旅行距离，旅行时间，兴趣点，和路径的简单性。最酷路径方法允许用户为这些标准中的每一个设置重要性级别。此外，为了验证所提出的想法，建立了一个原型。
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.