Nash Equilibrium and Stackelberg Approach for Traffic Flow Optimization in Road Transportation Networks—A Case Study of Warsaw

Abstract

The article discusses the issue of modelling traffic flows and the transport network. Faced with an increase in the number of vehicles in road networks, the problem of congestion and the need to optimise traffic and adapt the transport infrastructure to changing demand are growing, especially in large cities. With this in mind, the authors of this publication developed a model of the road network in the north-eastern part of the Warsaw agglomeration based on the proposed algorithm. Two methods were used to optimise the distribution of traffic flows: the Nash equilibrium and the Stackelberg approach. The Nash equilibrium assumes the aim of achieving equal average times on all roads for each origin–destination (O-D) pair. This describes the state pursued by a decentralised system guided by the individual benefits of the traffic users. On the contrary, the Stackelberg approach aims to achieve optimal travel times for the entire system. The study was carried out for three scenarios that differed in the assumed traffic demand on the road network. The basic scenario assumed the average hourly traffic demand during the morning peak hour based on traffic measurements. On the other hand, the two alternative scenarios were developed as a 10% variation in traffic volumes from the baseline scenario. On the basis of the results, it was concluded that an increase in traffic volumes for all O-D pairs could result in a decrease in traffic volumes on some links of the road network. This means that the transport network is a complex system and any change in parameters can cause significant and difficult to predict changes. Therefore, the proposed approach is useful in terms of traffic forecasting for road networks under conditions of changing traffic flow volumes. Additionally, the total travel time for the entire system differed for each scenario by a percentage difference of 0.67–1.07% between the optimal solution according to the Nash equilibrium and the Stackelberg approach.

An efficient algorithm for optimal route node sensing in smart tourism Urban traffic based on priority constraints

“…To direct cars, references [14,32] employed pricing strategy and a dynamic toll policy. The extended anti-Stackelberg game was used in reference [15] to help the traffic centre direct the motorist towards the system's ideal path. Reference [33] looked for an efficient path allocation strategy that collaborates with road network administrators, information centers, and vehicles to fully use the capacity of the road network in space and time.…”

“…Some researchers choose a selection of roads with comparable driving times based on past vehicle path data and propose them to driving cars based on probability [13] in order to spread vehicles on various paths to relieve traffic congestion. Alternatively, a charge dependent on the level of path congestion might direct the vehicle's choice of route [14] or by choosing the vehicle's route through the interactive game with the road network center [15].…”

Improving the Maritime Traffic Evaluation with the Course and Speed Model

“…This method involves surveying observation points, either manually or with machines, to extract data samples. The collected data are then compared with screen line survey results and household interviews to validate the survey's accuracy [2,3].…”

High-Profile Convoy Disruptions: Exploring Socioeconomic and Environmental Ramifications of Road Closures

“…Various researchers have studied optimizing traffic flow in road networks, using, for example, the Nash equilibrium and Stackelberg competition, where traffic forecasting requires considering complex system dynamics and changing demand [13]. One of the most preferred solutions is a policy measure implementing road pricing and link-based congestion charging.…”