How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing

Leon Rothkrantz

doi:10.1109/InfoTech.2019.8860873

How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing

Interactive Intelligence

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

Abstract

Most routing devices use real time traffic information. It proved that the first hours of a new day can be used to find a good matching day in the past. The traffic data from the matching day can be used to predict traffic streams on the current day. We designed a historic database storing traffic information from real time available public domain databases. A dynamic version of the well-known Dijkstra shortest path algorithm was used to design a dynamic routing algorithm.

Original language	English
Title of host publication	2019 International Conference on Information Technologies (InfoTech)
Subtitle of host publication	Proceedings
Place of Publication	Danvers
Publisher	IEEE
Pages	1-4
Number of pages	4
ISBN (Electronic)	978-1-7281-3274-7
ISBN (Print)	978-1-7281-3275-4
DOIs	https://doi.org/10.1109/InfoTech.2019.8860873
Publication status	Published - 2019
Event	2019 International Conference on Information Technologies, InfoTech 2019 - Sts. Constantine and Elena, Bulgaria Duration: 19 Sep 2019 → 20 Sep 2019

Conference

Conference	2019 International Conference on Information Technologies, InfoTech 2019
Country	Bulgaria
City	Sts. Constantine and Elena
Period	19/09/19 → 20/09/19

Keywords

dynamic Dijkstra algorithm
dynamic routing
experiments
historic database
shortest path algorithm

Access to Document

10.1109/InfoTech.2019.8860873

Link to publication in Scopus

Fingerprint Dive into the research topics of 'How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing'. Together they form a unique fingerprint.

Cite this

@inproceedings{556c0a34f85f4a40ac1484401547e648,

title = "How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing",

abstract = "Most routing devices use real time traffic information. It proved that the first hours of a new day can be used to find a good matching day in the past. The traffic data from the matching day can be used to predict traffic streams on the current day. We designed a historic database storing traffic information from real time available public domain databases. A dynamic version of the well-known Dijkstra shortest path algorithm was used to design a dynamic routing algorithm.",

keywords = "dynamic Dijkstra algorithm, dynamic routing, experiments, historic database, shortest path algorithm",

author = "Leon Rothkrantz",

year = "2019",

doi = "10.1109/InfoTech.2019.8860873",

language = "English",

isbn = "978-1-7281-3275-4 ",

pages = "1--4",

booktitle = "2019 International Conference on Information Technologies (InfoTech)",

publisher = "IEEE ",

address = "United States",

note = "2019 International Conference on Information Technologies, InfoTech 2019 ; Conference date: 19-09-2019 Through 20-09-2019",

}

Rothkrantz, L 2019, How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing. in 2019 International Conference on Information Technologies (InfoTech): Proceedings ., 8860873, IEEE , Danvers, pp. 1-4, 2019 International Conference on Information Technologies, InfoTech 2019, Sts. Constantine and Elena, Bulgaria, 19/09/19. https://doi.org/10.1109/InfoTech.2019.8860873

How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing. / Rothkrantz, Leon.

2019 International Conference on Information Technologies (InfoTech): Proceedings . Danvers : IEEE , 2019. p. 1-4 8860873.

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - How to Transform Real Time Traffic Information into a Historical Database Used for Dynamic Routing

AU - Rothkrantz, Leon

PY - 2019

Y1 - 2019

N2 - Most routing devices use real time traffic information. It proved that the first hours of a new day can be used to find a good matching day in the past. The traffic data from the matching day can be used to predict traffic streams on the current day. We designed a historic database storing traffic information from real time available public domain databases. A dynamic version of the well-known Dijkstra shortest path algorithm was used to design a dynamic routing algorithm.

AB - Most routing devices use real time traffic information. It proved that the first hours of a new day can be used to find a good matching day in the past. The traffic data from the matching day can be used to predict traffic streams on the current day. We designed a historic database storing traffic information from real time available public domain databases. A dynamic version of the well-known Dijkstra shortest path algorithm was used to design a dynamic routing algorithm.

KW - dynamic Dijkstra algorithm

KW - dynamic routing

KW - experiments

KW - historic database

KW - shortest path algorithm

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

U2 - 10.1109/InfoTech.2019.8860873

DO - 10.1109/InfoTech.2019.8860873

M3 - Conference contribution

SN - 978-1-7281-3275-4

SP - 1

EP - 4

BT - 2019 International Conference on Information Technologies (InfoTech)

PB - IEEE

CY - Danvers

T2 - 2019 International Conference on Information Technologies, InfoTech 2019

Y2 - 19 September 2019 through 20 September 2019

ER -