W-edge: Weighing the edges of the road network

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Understanding link travel times (LTT) has received significant attention in transportation and spatial computing literature but they often remain behind closed doors, primarily because the data used for capturing them is considered confidential. Consequently, free and open maps such as OpenStreetMap (OSM) or TIGER, while being remarkably accurate in capturing geometry and topology of the road network are oblivious to actual travel times. Without LTTs computing the optimal routes or estimated time of arrival is challenging and prone to substantial errors. In this work we set to enrich the underlying map information with LTT by using a most basic data about urban trajectories, which also becomes increasingly available for public use: set of origin/destination location/timestamp pairs. Our system, W-edge utilizes such basic trip information to calculate LTT to each individual road segment, effectively assigning a weight to individual edges of the underlying road network. We demonstrate that using appropriately trained edge weights, the errors in estimating travel times are up to 60% lower than the errors observed in OSRM or GraphHopper, two prominent OSM-based, traffic-oblivious, routing engines.

Original languageEnglish
Title of host publication26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018
EditorsLi Xiong, Roberto Tamassia, Kashani Farnoush Banaei, Ralf Hartmut Guting, Erik Hoel
PublisherAssociation for Computing Machinery
Pages424-428
Number of pages5
ISBN (Electronic)9781450358897
DOIs
Publication statusPublished - 6 Nov 2018
Event26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018 - Seattle, United States
Duration: 6 Nov 20189 Nov 2018

Other

Other26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018
CountryUnited States
CitySeattle
Period6/11/189/11/18

Fingerprint

Road Network
Travel Time
Travel time
Weighing
travel time
Open Map
Time of Arrival
Timestamp
Computing
routing
topology
engine
Routing
Engine
trajectory
Trajectories
Topology
road network
Traffic
Trajectory

Keywords

  • Link travel times
  • Maps
  • Ridge regression

ASJC Scopus subject areas

  • Earth-Surface Processes
  • Computer Science Applications
  • Modelling and Simulation
  • Computer Graphics and Computer-Aided Design
  • Information Systems

Cite this

Stanojevic, R., Abbar, S., & Mokbel, M. (2018). W-edge: Weighing the edges of the road network. In L. Xiong, R. Tamassia, K. F. Banaei, R. H. Guting, & E. Hoel (Eds.), 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018 (pp. 424-428). Association for Computing Machinery. https://doi.org/10.1145/3274895.3274916

W-edge : Weighing the edges of the road network. / Stanojevic, Rade; Abbar, Sofiane; Mokbel, Mohamed.

26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018. ed. / Li Xiong; Roberto Tamassia; Kashani Farnoush Banaei; Ralf Hartmut Guting; Erik Hoel. Association for Computing Machinery, 2018. p. 424-428.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stanojevic, R, Abbar, S & Mokbel, M 2018, W-edge: Weighing the edges of the road network. in L Xiong, R Tamassia, KF Banaei, RH Guting & E Hoel (eds), 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018. Association for Computing Machinery, pp. 424-428, 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018, Seattle, United States, 6/11/18. https://doi.org/10.1145/3274895.3274916
Stanojevic R, Abbar S, Mokbel M. W-edge: Weighing the edges of the road network. In Xiong L, Tamassia R, Banaei KF, Guting RH, Hoel E, editors, 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018. Association for Computing Machinery. 2018. p. 424-428 https://doi.org/10.1145/3274895.3274916
Stanojevic, Rade ; Abbar, Sofiane ; Mokbel, Mohamed. / W-edge : Weighing the edges of the road network. 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018. editor / Li Xiong ; Roberto Tamassia ; Kashani Farnoush Banaei ; Ralf Hartmut Guting ; Erik Hoel. Association for Computing Machinery, 2018. pp. 424-428
@inproceedings{65032b0a584f4bbdbe6a0585bf7ab88f,
title = "W-edge: Weighing the edges of the road network",
abstract = "Understanding link travel times (LTT) has received significant attention in transportation and spatial computing literature but they often remain behind closed doors, primarily because the data used for capturing them is considered confidential. Consequently, free and open maps such as OpenStreetMap (OSM) or TIGER, while being remarkably accurate in capturing geometry and topology of the road network are oblivious to actual travel times. Without LTTs computing the optimal routes or estimated time of arrival is challenging and prone to substantial errors. In this work we set to enrich the underlying map information with LTT by using a most basic data about urban trajectories, which also becomes increasingly available for public use: set of origin/destination location/timestamp pairs. Our system, W-edge utilizes such basic trip information to calculate LTT to each individual road segment, effectively assigning a weight to individual edges of the underlying road network. We demonstrate that using appropriately trained edge weights, the errors in estimating travel times are up to 60{\%} lower than the errors observed in OSRM or GraphHopper, two prominent OSM-based, traffic-oblivious, routing engines.",
keywords = "Link travel times, Maps, Ridge regression",
author = "Rade Stanojevic and Sofiane Abbar and Mohamed Mokbel",
year = "2018",
month = "11",
day = "6",
doi = "10.1145/3274895.3274916",
language = "English",
pages = "424--428",
editor = "Li Xiong and Roberto Tamassia and Banaei, {Kashani Farnoush} and Guting, {Ralf Hartmut} and Erik Hoel",
booktitle = "26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - W-edge

T2 - Weighing the edges of the road network

AU - Stanojevic, Rade

AU - Abbar, Sofiane

AU - Mokbel, Mohamed

PY - 2018/11/6

Y1 - 2018/11/6

N2 - Understanding link travel times (LTT) has received significant attention in transportation and spatial computing literature but they often remain behind closed doors, primarily because the data used for capturing them is considered confidential. Consequently, free and open maps such as OpenStreetMap (OSM) or TIGER, while being remarkably accurate in capturing geometry and topology of the road network are oblivious to actual travel times. Without LTTs computing the optimal routes or estimated time of arrival is challenging and prone to substantial errors. In this work we set to enrich the underlying map information with LTT by using a most basic data about urban trajectories, which also becomes increasingly available for public use: set of origin/destination location/timestamp pairs. Our system, W-edge utilizes such basic trip information to calculate LTT to each individual road segment, effectively assigning a weight to individual edges of the underlying road network. We demonstrate that using appropriately trained edge weights, the errors in estimating travel times are up to 60% lower than the errors observed in OSRM or GraphHopper, two prominent OSM-based, traffic-oblivious, routing engines.

AB - Understanding link travel times (LTT) has received significant attention in transportation and spatial computing literature but they often remain behind closed doors, primarily because the data used for capturing them is considered confidential. Consequently, free and open maps such as OpenStreetMap (OSM) or TIGER, while being remarkably accurate in capturing geometry and topology of the road network are oblivious to actual travel times. Without LTTs computing the optimal routes or estimated time of arrival is challenging and prone to substantial errors. In this work we set to enrich the underlying map information with LTT by using a most basic data about urban trajectories, which also becomes increasingly available for public use: set of origin/destination location/timestamp pairs. Our system, W-edge utilizes such basic trip information to calculate LTT to each individual road segment, effectively assigning a weight to individual edges of the underlying road network. We demonstrate that using appropriately trained edge weights, the errors in estimating travel times are up to 60% lower than the errors observed in OSRM or GraphHopper, two prominent OSM-based, traffic-oblivious, routing engines.

KW - Link travel times

KW - Maps

KW - Ridge regression

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

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

U2 - 10.1145/3274895.3274916

DO - 10.1145/3274895.3274916

M3 - Conference contribution

AN - SCOPUS:85058639377

SP - 424

EP - 428

BT - 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2018

A2 - Xiong, Li

A2 - Tamassia, Roberto

A2 - Banaei, Kashani Farnoush

A2 - Guting, Ralf Hartmut

A2 - Hoel, Erik

PB - Association for Computing Machinery

ER -