A zone-based traffic assignment algorithm for scalable congestion reduction
Author(s) -
Taylor S. Cox,
Parimala Thulasiraman
Publication year - 2017
Publication title -
ict express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.733
H-Index - 22
ISSN - 2405-9595
DOI - 10.1016/j.icte.2017.11.003
Subject(s) - scalability , computer science , enhanced data rates for gsm evolution , reduction (mathematics) , speedup , traffic congestion , path (computing) , network topology , algorithm , computer network , distributed computing , engineering , mathematics , transport engineering , parallel computing , artificial intelligence , geometry , database
Traffic assignment networks are networks with pseudo-static behavior: the network topology is constant but the cost of each edge changes in real-time. Extensive work has been completed in the literature to develop efficient traffic assignment algorithms in order to reduce traffic congestion. While some of these algorithms have proven to be effective, little attention has been paid to the matter of scalability in traffic networks. In this paper, we use zones to develop a hybrid approach to traffic assignment. We divide a traffic network into zones where the path within each zone is proactively stored, and paths between zones are reactively evaluated. This reduces the cost of route discovery. Using the Simulator of Urban MObility (SUMO), experiments were conducted to compare the zone-based system coined Z-BAR against a zone-free system. Between Z-BAR and a zone-free system, initial results showed Z-BAR introduces a speedup factor of up to 1.22
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom