UGC Approved Journal no 63975

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 9 | Issue 1 | January 2022

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 6 Issue 2
February-2019
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIRAE06105


Registration ID:
198753

Page Number

449-452

Share This Article


Jetir RMS

Title

Optimal Route Search Using Bounded Cost Informative Routes

Abstract

As travel is taking more significant part in our life, route recommendation service becomes user interested to visit new spots and the new short rout as well as long route with the interesting new places, a big business and attracts many major players in IT industry. Given a user specified origin and destination, a route recommendation service aims to provide users the routes with the best travelling experience according to criteria such as travelling distance, travelling time, etc. However, previous research shows that even the routes recommended by the big-thumb service providers can deviate significantly from the routes travelled by experienced drivers. It means travelers’ preferences on route selection are influenced by many latent and dynamic factors that are hard to be modeled exactly with pre-defined formulas. In this work the approach to this challenging problem is with a completely different perspective – leveraging crowds’ knowledge to improve the recommendation quality. The widespread location-aware applications produce a vast amount of spatio-textual data that contains both spatial and textual attributes. To make use of this enriched information for users to describe their preferences for travel routes, a Bounded-Cost Informative Route (BCIR) query is proposed to retrieve the routes that are the most textually relevant to the user-specified query keywords subject to a travel cost constraint. BCIR query is particularly helpful for tourists and city explorers to plan their travel routes. The proposed system will show that BCIR query is an NP-hard problem. To answer BCIR query efficiently, the exact solution is explained with effective pruning techniques and two approximate solutions with performance guarantees. Extensive experiments over real data sets demonstrate that the proposed solutions achieve the expected performance.

Key Words

Route query, Query keywords, Informative routes, Bounded cost.

Cite This Article

"Optimal Route Search Using Bounded Cost Informative Routes", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.449-452, February-2019, Available :http://www.jetir.org/papers/JETIRAE06105.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"Optimal Route Search Using Bounded Cost Informative Routes", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp449-452, February-2019, Available at : http://www.jetir.org/papers/JETIRAE06105.pdf

Publication Details

Published Paper ID: JETIRAE06105
Registration ID: 198753
Published In: Volume 6 | Issue 2 | Year February-2019
DOI (Digital Object Identifier):
Page No: 449-452
Country: -, -, - .
Area: Engineering
ISSN Number: 2349-5162


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0002638

Print This Page

Current Call For Paper

Jetir RMS