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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Earliest-Deadline-Based Scheduling to Reduce Urban Traffic Congestion


    Contributors:


    Publication date :

    2014-08-01


    Size :

    2547646 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Evaluation of Earliest Deadline based schedulers for reduction of traffic congestion in dense urban areas

    Ahmed, Asif / Arshad, Rabia / Mahmud, Sahibzada Ali et al. | IEEE | 2013




    Urban traffic-congestion problem

    MacDonald, H.A. | Engineering Index Backfile | 1946