Abstract
Route planning has received great attention from researchers with the dramatic development of mobile localization technology and the emerging location based services. It is a trend to consider users' preferences and the budget limit for the shortest path problem. The optimal route search with user's preferences focuses on finding an optimal route from a source to a target with the given keywords and the budget constraint, such that the route can maximally satisfy the user's needs on weighted preferences. We solve the NP-hard problem by proposing an A* based route search algorithm with some effective pruning strategies and present ORSUP, a website for visual query and route display. We describe the details and functions of the system interface and demonstrate the efficiency of proposed algorithm and effectiveness on solving the route search problem via a common scenario.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
