This paper presents a novel auction-based traffic signal control mechanism aimed at optimizing multimodal traffic flow at signalized intersections through \textcolor{red}{connected vehicles}. The proposed framework, which utilizes a second price sealed bid auction mechanism, allocates green time dynamically based on user bids, incorporating policy-oriented modal priority. This approach addresses the limitations of current signal control systems by providing a computationally fast and distributable method that considers the priority hierarchy of traffic modes, thereby enhancing the efficiency and equity of intersection management.

Key innovations include a dynamic bid distance determination method and a modified bidding scheme that prioritize certain traffic modes according to predefined policies. The effectiveness of these methods is demonstrated through a case study focusing on bicycle prioritization at a real-world intersection in Bordeaux, France.

Simulation results indicate significant improvements in service levels for prioritized modes without substantially increasing delays for other users. The methods' flexibility for adaptation to different intersection configurations and computational feasibility ensure their applicability to a wide range of intersection types and traffic conditions. Our findings suggest that the sealed bid second price auction mechanism can be a useful tool for policymakers aiming to implement multimodal traffic priorities, contributing to reduced travel delays and more effective control at intersections.@en

Rerouting drivers from selfish route choices to system-optimal traffic patterns has the potential to improve the performance of existing infrastructure. Previous research has looked into assessing the potential of rerouting through the empirical price of anarchy, a measure of network efficiency. However, studies using real-world measurements have been limited by methodological accuracy and network size. Also, they have lacked understanding of the spatial distribution of benefits from rerouting and the relationship with marginal external cost road charges that can be used for implementation. In this article, we create an accurate data-driven traffic assignment model of England's Strategic Road Network. We use it to calculate the national price of anarchy, which is found to be almost 1 implying gains from rerouting at the national scale are minimal and smaller than in other studies. The results show the distribution of rerouting benefits varies strongly with different network zones and demand profiles. This did not match the distribution of marginal external cost charges. Some zones have noticeable benefits from rerouting although the overall network benefit is small, however, these zones do not coincide with where the largest road charges have to be applied for system-optimal rerouting. These results have implications for rerouting implementation.@en

Accurate static traffic assignment models are important tools for the assessment of strategic transportation policies. In this article we present a novel approach to partition road networks through network modularity to produce data-driven static traffic assignment models from loop detector data on large road systems. The use of partitioning allows the estimation of the key model input of Origin–Destination demand matrices from flow counts alone. Previous network tomography-based demand estimation techniques have been limited by the network size. The amount of partitioning changes the Origin–Destination estimation optimisation problems to different levels of computational difficulty. Different approaches to utilising the partitioning were tested, one which degenerated the road network to the scale of the partitions and others which left the network intact. Applied to a subnetwork of England’s Strategic Road Network and other test networks, our results for the degenerate case showed flow and travel time errors are reasonable with a small amount of degeneration. The results for the non-degenerate cases showed that similar errors in model prediction with lower computation requirements can be obtained when using large partitions compared with the non-partitioned case. This work could be used to improve the effectiveness of national road systems planning and infrastructure models. @en

The ability to build accurate traffic assignment models on large-scale major road networks is essential for effective infrastructure planning. Static traffic assignment models often utilize standard formulations of congestion functions which suffer from various inaccuracies. Conversely, newer approaches in the literature rely on inverse optimisation to provide enhanced accuracy but incur significantly heavy computational costs. The work in this article develops density-based congestion function fitting in order to compute traffic assignment patterns. Computational efficiency makes the method amenable to be used on real-world networks at national scale. The methodology is applied on the motorway network connecting the primary metropolitan areas in England using Motorway Incident Detection and Automatic Signalling system data. The results demonstrate that the use of density-based congestion functions provides significant improvement in terms of computational runtime in the order of 11,000 times (22 secs vs 68 hours). Correspondingly, prediction error from this method (3.9 to 6.9% for time prediction and 10.4 to 10.7% for flow prediction) slightly outperforms the state-of-the-art Inv-Opt method (5.3 to 8.8% for time prediction and 10.5 to 11% for flow prediction). The increased accuracy provides greater confidence in modelling results for applications such as cost-benefit analysis and price of anarchy calculations.@en