Optimizing average vehicle delay times at signalized intersection

Due to the increase in traffic volume in cities and on interurban roads, it causes an increase in road networks. The increase in road networks causes different types of traffic flows to collide. In order to prevent these collisions, at-grade and different-level intersections are made. The intersections are organized as signalized and non-signalized intersections. Signaling is needed on roads with high traffic density. After safety in general, one of the most important performance criteria of an intersection is average vehicle delays. It is the reduction of average vehicle delays that affect the performance of the intersection. In this thesis, the Badamdar-Ismayil Qutqaşanlı junction in Baku, the capital of Azerbaijan, was examined. With the data obtained from this intersection, intersection analyzes were made using the Webster method and as a result of reductions, the circuit time of the intersection was determined as the current circuit time. According to this circuit time, the performance criteria of the intersection, capacity, green time, queue length and average vehicle delays were calculated. Then, the average vehicle delays and capacity values were estimated using the particle swarm optimization algorithm and the analysis results were compared. As a result of this comparison, the average vehicle delays and intersection capacity values calculated with the particle swarm optimization algorithm gave the best solutions according to the Webster method. Keywords: Signalized Junctions, Webster (British) method, PSO, Junction Capacity and Average Vehicle Delay