Keyword-Aware Optimal Route Search for Efficient Trip Planning
This study presents a Keyword-Aware Optimal Route Search (KOR) solution for planning city trips efficiently. It involves pre-processing techniques, algorithm development, and route optimization for finding the best routes based on keywords like shopping, dining, and entertainment venues. The approach aims to enhance trip planning experiences by considering unique preferences and time constraints within a city. The research also outlines future improvements to the current methodology to further enhance route optimization and user satisfaction.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Keyword-aware Optimal Route Search Xin Cao, Lisi Chen, Gao Cong, Xiaokui Xiao School of Computer Engineering, Nanyang Technological University, Singapore
Outline Introduction Problem Statement Algorithm Conclusion And Future Work
Introduction Keyword-aware Optimal Route (KOR) Plan a trip within a city Keyword Shopping mall, restaurant, and pub Travel time To and from his hotel is within 4 hours
Problem Statement The KOR query: To find a route: Example:
Pre-processing Use Floyd-Warshall to find all pairs shortest path . . . Use an inverted file to organize the word information of nodes B+-tree
Definition Node Label : Label Domination Label Treatment Label Order
Analysis Lemma 1: Complexity: Lemma 2: OSScaling finds the smallest OS from feasible routes Theorem:
Lemma and Definition Lemma 3: = Definition: Label Buckets . Lemma 4: If all buckets (i = 0 to r) are empty, and no feasible solution is found yet. :
Conclusion And Future Work Conclusion They devise two approximation algorithms to answer KOR queries efficiently. Future Work Improve the current preprocessing approach They compute and store the best objective and budget score between every pair of border nodes Discovering popular routes from trajectories (2011)
