Milling the shortest path within a travel time constraint in road network environments

Eric Hsueh Chan Lu; Chia Ching Lin; S. Tseng

doi:10.1109/ITSC.2008.4732601

Milling the shortest path within a travel time constraint in road network environments

Eric Hsueh Chan Lu, Chia Ching Lin, S. Tseng

Institute of Data Science and Engineering

Research output: Contribution to conference › Paper › peer-review

6 Scopus citations

Abstract

In recent years, a number of studies have been done on GPS (Global Positioning System) due to the wide applications. One important research issue is on the GPS navigation. In this paper, we propose a novel data mining algorithm named PA TE (Prediction-based Algorithm for Travel time Evaluation) that can efficiently predict the travel time of a navigation path and precisely recommends the navigation path to the users under a user-specified travel time constraint in road network environments. To our best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, we propose a novel search structure named NPST (Navigation Path Search Tree) for efficiently finding the shortest navigation path that meets the user-specified travel time constraint Through a series of experiments, the proposed method was shown to have excellent performance under different system conditions.

Original language	English
Pages	593-598
Number of pages	6
DOIs	https://doi.org/10.1109/ITSC.2008.4732601
State	Published - 1 Dec 2008
Event	11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008 - Beijing, China Duration: 10 Dec 2008 → 12 Dec 2008

Conference

Conference	11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008
Country	China
City	Beijing
Period	10/12/08 → 12/12/08

Keywords

Data mining
Global positioning system
Navigation paths
Shortest path

Access to Document

10.1109/ITSC.2008.4732601

Fingerprint Dive into the research topics of 'Milling the shortest path within a travel time constraint in road network environments'. Together they form a unique fingerprint.

Cite this

@conference{6820ba7571254399956f661721dfba79,

title = "Milling the shortest path within a travel time constraint in road network environments",

abstract = "In recent years, a number of studies have been done on GPS (Global Positioning System) due to the wide applications. One important research issue is on the GPS navigation. In this paper, we propose a novel data mining algorithm named PA TE (Prediction-based Algorithm for Travel time Evaluation) that can efficiently predict the travel time of a navigation path and precisely recommends the navigation path to the users under a user-specified travel time constraint in road network environments. To our best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, we propose a novel search structure named NPST (Navigation Path Search Tree) for efficiently finding the shortest navigation path that meets the user-specified travel time constraint Through a series of experiments, the proposed method was shown to have excellent performance under different system conditions.",

keywords = "Data mining, Global positioning system, Navigation paths, Shortest path",

author = "Lu, {Eric Hsueh Chan} and Lin, {Chia Ching} and S. Tseng",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/ITSC.2008.4732601",

language = "English",

pages = "593--598",

note = "null ; Conference date: 10-12-2008 Through 12-12-2008",

}

TY - CONF

T1 - Milling the shortest path within a travel time constraint in road network environments

AU - Lu, Eric Hsueh Chan

AU - Lin, Chia Ching

AU - Tseng, S.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - In recent years, a number of studies have been done on GPS (Global Positioning System) due to the wide applications. One important research issue is on the GPS navigation. In this paper, we propose a novel data mining algorithm named PA TE (Prediction-based Algorithm for Travel time Evaluation) that can efficiently predict the travel time of a navigation path and precisely recommends the navigation path to the users under a user-specified travel time constraint in road network environments. To our best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, we propose a novel search structure named NPST (Navigation Path Search Tree) for efficiently finding the shortest navigation path that meets the user-specified travel time constraint Through a series of experiments, the proposed method was shown to have excellent performance under different system conditions.

AB - In recent years, a number of studies have been done on GPS (Global Positioning System) due to the wide applications. One important research issue is on the GPS navigation. In this paper, we propose a novel data mining algorithm named PA TE (Prediction-based Algorithm for Travel time Evaluation) that can efficiently predict the travel time of a navigation path and precisely recommends the navigation path to the users under a user-specified travel time constraint in road network environments. To our best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, we propose a novel search structure named NPST (Navigation Path Search Tree) for efficiently finding the shortest navigation path that meets the user-specified travel time constraint Through a series of experiments, the proposed method was shown to have excellent performance under different system conditions.

KW - Data mining

KW - Global positioning system

KW - Navigation paths

KW - Shortest path

UR - http://www.scopus.com/inward/record.url?scp=60749120279&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2008.4732601

DO - 10.1109/ITSC.2008.4732601

M3 - Paper

AN - SCOPUS:60749120279

SP - 593

EP - 598

Y2 - 10 December 2008 through 12 December 2008

ER -