Search

Rapid adoption of electric vehicles (EVs) requires the development of a highly flexible charging network. The design and management of the charging infrastructure for EV‐dominated transportation systems are intertwined with power grid operations both economically and technically. High penetration of EVs in the future can increase the charging loads and cause a wide range of operational issues in power distribution networks (PDNs). This paper aims to design an EV charging network with an embedded PDN layout to account for energy dispatch and underlying traffic flows in urban transportation networks supporting electric mobility in the near future. A mixed‐integer bilevel model is proposed with the EV charging facility location and PDN energy decisions in the upper level and user equilibrium traffic assignment in the lower level considering an uncertain charging demand. The objective is to minimize the cost of PDN operations, charging facility deployments, and transportation. The proposed problem is solved using a column and constraint generation (C&CG) algorithm, while a macroscopic fundamental diagram concept is implemented to estimate the arc travel times. The methodology is applied to a hypothetical and two real‐world case study networks, and the solutions are compared to a Benders decomposition benchmark. The east‐coast analysis results indicate a 77.3% reduction in the computational time. Additionally, the benchmark technique obtains an optimality gap of 1.15%, while the C&CG algorithm yields a 0.61% gap. The numerical experiments show the robustness of the proposed methodology. Besides, a series of sensitivity analyses has been conducted to study the impact of input parameters on the proposed methodology and draw managerial insights. [ABSTRACT FROM AUTHOR]

Establishment of effective cooperation between vehicles and transportation infrastructure improves travel reliability in urban transportation networks. Lack of collaboration, however, exacerbates congestion due mainly to frequent stops at signalized intersections. It is beneficial to develop a control logic that collects basic safety message from approaching connected and autonomous vehicles and guarantees efficient intersection operations with safe and incident free vehicle maneuvers. In this paper, a signal-head-free intersection control logic is formulated into a dynamic programming model that aims to maximize the intersection throughput. A stochastic look-ahead technique is proposed based on Monte Carlo tree search algorithm to determine the near-optimal actions (i.e., acceleration rates) over time to prevent movement conflicts. Our numerical results confirm that the proposed technique can solve the problem efficiently and addresses the consequences of existing traffic signals. The proposed approach, while completely avoids incidents at intersections, significantly reduces travel time (ranging between 59.4% and 83.7% when compared to fixed-time and fully-actuated control strategies) at intersections under various demand patterns. [ABSTRACT FROM AUTHOR]

Highlights: [•] We optimize freight facility locations under traffic congestion and pavement damage. [•] We develop a bi-level mixed-integer model to capture subsystem interdependencies. [•] The model accommodates pavement rehabilitation and network traffic equilibrium. [•] A customized reformulation and solution approach is proposed for the problem. [Copyright &y& Elsevier]