The real-time vehicular traffic system is an integral part of the urban vehicular traffic system, which provides effective traffic signal control for a large multifaceted traffic network and is a highly challenging distributed control problem. Coordinating vehicular traffic enables the network model to deliver an efficient service flow. Consider that there are four lanes of vehicular traffic in this situation, allowing parallel vehicle movements to occur without causing an accident. In this instance, the vehicular system’s control parameters are time and vehicle volume. In this work, vehicular traffic flow is examined, and an algorithm to estimate vehicle waiting time in each direction is estimated. The effectiveness of the proposed vehicle traffic signal distribution control system by comparing the experimental results with a real-time vehicular traffic system is verified. This is also illustrated numerically.

This paper proposes a convolutional neural network (CNN) model of the signal distribution control algorithm (SDCA) to maximize the dynamic vehicular traffic signal flow for each junction phase. The aim of the proposed algorithm is to determine the reward value and new state. It deconstructs the routing components of the current multi-directional queuing system (MDQS) architecture to identify optimal policies for every traffic scenario. Initially, the state value is divided into a function value and a parameter value. Combining these two scenarios updates the resulting optimized state value. Ultimately, an analogous criterion is developed for the current dataset. Next, the error or loss value for the present scenario is computed. Furthermore, utilizing the Deep Q-learning methodology with a quad agent enhances previous study discoveries. The recommended method outperforms all other traditional approaches in effectively optimizing traffic signal timing.

In this paper, we analyze the waiting time in two stage preemptive priority queueing system. The service time considered here is k-phase Erlang distribution. We have assign the priority server to the emergency customer without affecting the regular priority unit. It is possible only if the servers are independent. In this case, we derive the steady state probability of the waiting time customers in ordinary and priority unit. A numerical example is included.

In this paper, we analyze the system performance in FM/FM^(k)/∞ using Estimation theory. Initially, we convert Erlang queueing system into fuzzy Erlang system, using Alpha – cut method and obtain different possible values of ^α . Finally, using Robust ranking method it’s helpful to measure the defuzzification values and analyzes the unique optimization of system performance.