Strategic Infrastructure Planning for Autonomous Vehicles

Compared with conventional human-driven vehicles (HVs), AVs have various potential benefits, such as increasing road capacity and lowering vehicular fuel consumption and emissions. Road infrastructure management, adaptation, and upgrade plays a key role in promoting the adoption and benefit realization of AVs.This dissertation investigated several strategic infrastructure planning problems for AVs. First, it studied the potential impact of AVs on the congestion patterns of transportation networks. Second, it investigated the strategic planning problem for a new form of managed lanes for autonomous vehicles, designated as autonomous-vehicle/toll lanes, which are freely accessible to autonomous vehicles while allowing human-driven vehicles to utilize the lanes by paying a toll.This new type of managed lanes has the potential of increasing traffic capacity and fully utilizing the traffic capacity by selling redundant road capacity to HVs. Last, this dissertation studied the strategic infrastructure planning problem for an infrastructure-enabled autonomous driving system. The system combines vehicles and infrastructure in the realization of autonomous driving. Equipped with roadside sensor and control systems, a regular road can be upgraded into an automated road providing autonomous driving service to vehicles. Vehicles only need to carry minimum required on-board devices to enable their autonomous driving on an automated road. The costs of vehicles can thus be significantly reduced

A Multiclass Simulation-Based Dynamic Traffic Assignment Model for Mixed Traffic Flow of Connected and Autonomous Vehicles and Human-Driven Vehicles

One of the potential capabilities of Connected and Autonomous Vehicles (CAVs) is that they can have different route choice behavior and driving behavior compared to human Driven Vehicles (HDVs). This will lead to mixed traffic flow with multiple classes of route choice behavior. Therefore, it is crucial to solve the multiclass Traffic Assignment Problem (TAP) in mixed traffic of CAVs and HDVs. Few studies have tried to solve this problem; however, most used analytical solutions, which are challenging to implement in real and large networks (especially in dynamic cases). Also, studies in implementing simulation-based methods have not considered all of CAVs' potential capabilities. On the other hand, several different (conflicting) assumptions are made about the CAV's route choice behavior in these studies. So, providing a tool that can solve the multiclass TAP of mixed traffic under different assumptions can help researchers to understand the impacts of CAVs better. To fill these gaps, this study provides an open-source solution framework of the multiclass simulation-based traffic assignment problem for mixed traffic of CAVs and HDVs. This model assumes that CAVs follow system optimal principles with rerouting capability, while HDVs follow user equilibrium principles. Moreover, this model can capture the impacts of CAVs on road capacity by considering distinct driving behavioral models in both micro and meso scales traffic simulation. This proposed model is tested in two case studies which shows that as the penetration rate of CAVs increases, the total travel time of all vehicles decreases

Modeling, Control, and Impact Analysis of The Next Generation Transportation System

This dissertation aims to develop a systematic tool designated for connected and autonomous vehicles, integrating the simulation of traffic dynamics, traffic control strategies, and impact analysis at the network level. The first part of the dissertation is devoted to the traffic flow modeling of connected vehicles. This task is the foundation step for transportation planning, optimized network design, efficient traffic control strategies, etc, of the next generation transportation system. Chapter 2 proposes a cell-based simulation approach to model the proactive driving behavior of connected vehicles. Firstly, a state variable of connected vehicle is introduced to track the trajectory of connected vehicles. Then the exit flow of cells containing connected vehicles is adjusted to simulate the proactive driving behavior, such that the traffic light is green when the connected vehicle arrives at the signalized intersection. Extensive numerical simulation results consistently show that the presence of connected vehicles contributes significantly to the smoothing of traffic flow and vehicular emission reductions in the network. Chapter 3 proposes an optimal estimation approach to calibrate connected vehicles\u27 car-following behavior in a mixed traffic environment. Particularly, the state-space system dynamics is captured by the simplified car-following model with disturbances, where the trajectory of non-connected vehicles are considered as unknown states and the trajectory of connected vehicles are considered as measurements with errors. Objective of the reformulation is to obtain an optimal estimation of states and model parameters simultaneously. It is shown that the customized state-space model is identifiable with the mild assumption that the disturbance covariance of the state update process is diagonal. Then a modified Expectation-Maximization (EM) algorithm based on Kalman smoother is developed to solve the optimal estimation problem. The second part of the dissertation is on traffic control strategies. This task drives the next generation transportation system to a better performance state in terms of safety, mobility, travel time saving, vehicular emission reduction, etc. Chapter 4 develops a novel reinforcement learning algorithm for the challenging coordinated signal control problem. Traffic signals are modeled as intelligent agents interacting with the stochastic traffic environment. The model is built on the framework of coordinated reinforcement learning. The Junction Tree Algorithm based reinforcement learning is proposed to obtain an exact inference of the best joint actions for all the coordinated intersections. The algorithm is implemented and tested with a network containing 18 signalized intersections from a microscopic traffic simulator. Chapter 5 develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only values in {-1, 0, 1}. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. Further, it shows that traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control. The third part of the dissertation moves on to the impact analysis of connected vehicles and autonomous vehicles at the network level. This task assesses the positive and negative impacts of the system and provides guidance on transportation planning, traffic control, transportation budget spending, etc. In this part, the impact of different penetration rates of connected vehicle and autonomous vehicles is revealed on the network efficiency of a transportation system. Chapter 6 sets out to model an efficient and fair transportation system accounting for both departure time choice and route choice of a general multi OD network within a dynamic traffic assignment environment. Firstly, a bi-level optimization formulation is introduced based on the link-based traffic flow model. The upper level of the formulation minimizes the total system travel time, whereas the lower level captures traffic flow propagation and the user equilibrium constraint. Then the bi-level formulation is relaxed to a linear programming formulation that produces a lower bound of an efficient and fair system state. An efficient iterative algorithm is proposed to obtain the exact solution. It is shown that the number of iterations is bounded, and the output traffic flow solution is efficient and fair. Finally, two numerical cases (including a single OD network and a multi-OD network) are conducted to demonstrate the performance of the algorithm. The results consistently show that the travel time of different departure rates of the same OD pair are identical and the algorithm converges within two iterations across all test scenarios

Network Maintenance and Capacity Management with Applications in Transportation

abstract: This research develops heuristics to manage both mandatory and optional network capacity reductions to better serve the network flows. The main application discussed relates to transportation networks, and flow cost relates to travel cost of users of the network. Temporary mandatory capacity reductions are required by maintenance activities. The objective of managing maintenance activities and the attendant temporary network capacity reductions is to schedule the required segment closures so that all maintenance work can be completed on time, and the total flow cost over the maintenance period is minimized for different types of flows. The goal of optional network capacity reduction is to selectively reduce the capacity of some links to improve the overall efficiency of user-optimized flows, where each traveler takes the route that minimizes the traveler’s trip cost. In this dissertation, both managing mandatory and optional network capacity reductions are addressed with the consideration of network-wide flow diversions due to changed link capacities. This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule. Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.Dissertation/ThesisDoctoral Dissertation Industrial Engineering 201

Nested Game for Coupled Power System with Energy Sharing and Transportation System

The wide deployment of distributed renewable energy sources and electric vehicles can help mitigate climate change. This necessitates new business models in the power sector to hedge against uncertainties while imposing a strong coupling between the connected power and transportation networks. To address these challenges, this paper first proposes an energy sharing mechanism considering AC power network constraints to encourage local energy exchange in the power system. Under the proposed mechanism, all prosumers play a generalized Nash game. We prove that the energy sharing equilibrium exists and is social optimal. Furthermore, a nested game is built to characterize the interactions both inside and between the power and transportation systems. Externally, the two systems are engaged in a Nash game because traffic flows serve as electric demands as a result of charging behaviors, and each driver pays the energy sharing price for charging. The nested game is then converted into a mixed-integer linear program (MILP) with the help of optimality conditions and linearization techniques. Numerical experiments validate the theoretical results and show the mutual impact between the two systems.Comment: 12 pages, 15 figure

Pricing transport networks with fixed residential location

We consider a congestible static traffic network which is used by different households and analyse the conditions for optimal congestion taxes on network links, when not all links in the network can be taxed (partial network pricing). This is done under two assumptions about the toll revenues. First, lump sum transfers are assumed to be available. It is shown that social welfare maximisation leads to unequal treatment of equal households, because of differences in transport costs, and that constraints on network pricing imply complex deviations from marginal social cost pricing, because of network interactions. The second assumption is that the congestion tax revenue is redistributed to households according to predetermined shares. In that case, the optimal link taxes consist of a Pigouvian component, a Ramsey-Mirrlees component and a network interaction component. The taxes will deviate from marginal external congestion costs, even in the absence of network pricing constraints. This result is qualitatively different from the partial equilibrium analysis. Stylised examples of two networks are used to illustrate (a) the impact of unequal treatment of equals and of tax redistribution rules on optimal link taxes and on their effectiveness in terms of social welfare, and (b) the effect of network pricing constraints. The results suggest that (1) the effectiveness of congestion taxes is strongly reduced when not all links in the network can be taxed, (2) assignment inefficiencies are of less importance than excess demand levels when no taxes are present, and (3) that optimal parking charges may outperform partial pricing schemes when the assignment inefficiencies are small.congestion; road transport; pricing; networks

Interdependence between transportation system and power distribution system: a comprehensive review on models and applications

The rapidly increasing penetration of electric vehicles in modern metropolises has been witnessed during the past decade, inspired by financial subsidies as well as public awareness of climate change and environment protection. Integrating charging facilities, especially high-power chargers in fast charging stations, into power distribution systems remarkably alters the traditional load flow pattern, and thus imposes great challenges on the operation of distribution network in which controllable resources are rare. On the other hand, provided with appropriate incentives, the energy storage capability of electric vehicle offers a unique opportunity to facilitate the integration of distributed wind and solar power generation into power distribution system. The above trends call for thorough investigation and research on the interdependence between transportation system and power distribution system. This paper conducts a comprehensive survey on this line of research. The basic models of transportation system and power distribution system are introduced, especially the user equilibrium model, which describes the vehicular flow on each road segment and is not familiar to the readers in power system community. The modelling of interdependence across the two systems is highlighted. Taking into account such interdependence, applications ranging from long-term planning to short-term operation are reviewed with emphasis on comparing the description of traffic-power interdependence. Finally, an outlook of prospective directions and key technologies in future research is summarized.fi=vertaisarvioitu|en=peerReviewed