CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Earliest-deadline-based scheduling to reduce urban traffic congestion
Authors
A Ahmad
HS Al-Raweshidy
+3 more
R Arshad
GM Khan
SA Mahmud
Publication date
1 August 2014
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
Abstract
One of the major problems, caused by traffic congestion, owes its existence to the unwanted delay experienced by the priority vehicles. The evaluation of two scheduling algorithms as adaptive traffic control algorithms has been proposed here to reduce this unwanted delay. One of these algorithms is the earliest deadline first (EDF) algorithm, whereas the other is the fixed priority (FP) algorithm. The performance of both algorithms as adaptive traffic light control algorithms is evaluated for isolated traffic intersections. A comparative study is performed here, where the performance of these algorithms is compared against a fixed static traffic light controller. Moreover, their performance is also compared against each other. Conclusive results from the simulation of the algorithms reveal that the number of stops, average delay, and mean trip time of the priority vehicles is significantly reduced by the implementation of these algorithms. Furthermore, it has been shown that the overall performance of EDF is much better than FP in terms of improvement of different performance measures for congestion reduction of priority vehicles. © 2014 IEEE
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1109%2Ftits.2014.2...
Last time updated on 23/04/2021
Sustaining member
Brunel University Research Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:bura.brunel.ac.uk:2438/145...
Last time updated on 18/12/2020