Optimal Sizing of Electric Vehicle Charging Stations Considering Urban Traffic Flow for Smart Cities

Abstract

Achieving high penetration of electric vehicles (EVs) is one of the objectives proposed by the scientific community to mitigate the negative environmental impact caused by conventional mobility. The limited autonomy and the excessive time to recharge the battery discourage the final consumer from opting for new environmentally friendly mobility alternatives. Consequently, it is essential to provide the urban road network with charging infrastructure (CI) to ensure that the demand generated by EV users is met. The types of terminals to be considered in charging stations (CS) are fast and ultra-fast. The high energy requirements in these types of terminals could stress the electrical systems, reducing the quality of service. To size and forecast the resources needed in CI, it is of great interest to model and predict the maximum number of EVs, in each hour, that each CS will have to serve according to the geographic area in which they are located. Our proposal is not based on an assumed number of vehicles to be served by each CS, but rather it is based on the analysis of vehicular traffic in geo-referenced areas, so that the load managers can design the topology of the CS. The maximum vehicular concentration is determined by some considerations such as the road system, direction of the route, length of the road segment, the intersections, and the economic zone to which it belongs. The topology of the road map is freely extracted from OpenStreetMap to know the latitude and longitude coordinates. Vehicular traffic will be modeled through the topology obtained from OpenStreetMap and other microscopic variables to understand the traffic engineering constraints. In addition, the Hungarian algorithm is used as a minimum cost decision tool to allocate demand to the CS by observing vehicular traffic as a cost variable. The multi commodity flow problem (MCFP) algorithm aims to make commodities flow through the road network with the minimum cost without exceeding the capacities of the road sections. Therefore, it is proposed to solve the transportation problem by directing the vehicular flow to the CS while minimizing the travel time. This situation will contribute significantly to the design of the topology of each CS, which will be studied in future research.