The Road Network Design Problem for the Deployment of Automated Vehicles (RNDP-AVs): A Nonlinear Programming Mathematical Model

Abstract

Once trusted, automated vehicles (AVs) will gradually appear in urban areas. Such a transition is an opportunity in transport planning to control undesired impacts and possibly mitigate congestion at a time when both conventional vehicles (CVs) and AVs coexist. This paper deals with the complex transport decision problem of designing part of the network that is exclusive for AVs through a nonlinear programming model. The objective function minimises the costs of travel times where vehicles circulate under user equilibrium. The model evaluates the benefits of having an AVs-dedicated infrastructure and the associated costs from the detouring of CVs. Three planning strategies are explored: incremental, long-term and hybrid planning. The first creates a subnetwork evolving incrementally over time. The second reversely designs a subnetwork from the optimal solution obtained at a ratio of 90% AVs. The third limits the incremental planning towards that optimal long-term solution. The model is applied to the city of Delft, in the Netherlands. Two scenarios are analysed, with and without AV-dedicated roads, at several AV penetration rates. We find that implementing dedicated roads for AVs reduces the overall costs and congestion up to 16%. However, CV detouring is inevitable at later network stages, increasing the total distance travelled (up to 8%) and congestion in the surroundings of AV subnetworks. Concerning the planning strategies, incremental planning is appropriate for starting in the initial stages and is the strategy that most tackles CV detouring. The hybrid or the long-term strategies are more suitable to be applied after a ratio of 50% AVs, and the hybrid planning is the strategy that most reduces delay.

Keywords

• automated vehicles
• mathematical programming
• optimisation
• road network design problem