2019
DOI: 10.1145/3293317
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Baseline for Travel Time Estimation using Large-scale Trip Data

Abstract: The increased availability of large-scale trajectory data around the world provides rich information for the study of urban dynamics. For example, New York City Taxi & Limousine Commission regularly releases source/destination information about trips in the taxis they regulate [1]. Taxi data provide information about traffic patterns, and thus enable the study of urban flow -what will traffic between two locations look like at a certain date and time in the future? Existing big data methods try to outdo each o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
32
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 97 publications
(33 citation statements)
references
References 22 publications
1
32
0
Order By: Relevance
“…The travel time of a query path is estimated by summing up the travel time of road segments in it. TEMP [32], a path-based method, estimates the travel time of a given path based on the nearby historical trajectories, which have close source and destination with the query path. About 9% of the query paths can not be estimated in the original TEMP method due to the lack of nearby trajectories.…”
Section: Baseline Methods For Comparisonmentioning
confidence: 99%
See 1 more Smart Citation
“…The travel time of a query path is estimated by summing up the travel time of road segments in it. TEMP [32], a path-based method, estimates the travel time of a given path based on the nearby historical trajectories, which have close source and destination with the query path. About 9% of the query paths can not be estimated in the original TEMP method due to the lack of nearby trajectories.…”
Section: Baseline Methods For Comparisonmentioning
confidence: 99%
“…However, these approaches do not lead to good result when the extracted sub-paths do not match well with that of the query path. Based on an assumption that paths with close sources and destinations share the same/similar route and thus have similar travel time, some works find trajectories with nearby source and destination or nearby trajectories to the query path to derive the travel time distribution for estimation [17,32]. However, these approaches do not achieve good accuracy when their assumption fails.…”
Section: Related Workmentioning
confidence: 99%
“…Given a specific node v t i , the set of all paths containing v t i formulates a set P(v t i ). We define set N (v t i ) = {v c |∃P i ∈ P(v t i ), v c ∈ P i }\{v t i } as the context of node v t i , which refers to all multi-hop neighbors of v t i (i.e., nodes closely surround v t i in space and time) [29]. Specifically, the following log-probability is maximized:…”
Section: Multi-view Graph Embeddingmentioning
confidence: 99%
“…The traffic patterns on weekdays is also different from weekends. Similar to [29], we assume that the intermediate location or travel trajectory is not known and only the end locations are available. We define a query q i as a pair (origin, destination, time-ofday) i input to the system and corresponding pair (travel time, travel distance) i as an output.…”
Section: Travel Time Estimationmentioning
confidence: 99%
“…These outliers can cause huge mistakes in our estimations, so we experimentally detected the anomalous trips and removed them from the dataset. d. BTE : We also compare the performance of ST-NN with the best method introduced in [29].…”
mentioning
confidence: 99%