Optimal Planning of Single-Port and Multi-Port Charging Stations for Electric Vehicles in Medium Voltage Distribution Networks
This paper describes a method based on mixed-integer linear programming to cost-optimally locate and size chargers for electric vehicles (EVs) in distribution grids as a function of the driving demand. The problem accounts for the notion of single-port chargers (SPCs), where a charger can interface one EV maximum, and multi-port chargers (MPCs), where the same charger can interface multiple EVs. The advantage of MPCs is twofold. First, multiple ports allow arbitraging the charging among multiple vehicles without requiring the drivers to plug and unplug EVs. Second, the charger's power electronics is not sized for the total number of charging ports, enabling cost savings when the grid constraints are bottleneck of the problem. The proposed method can account for different charger typologies, such as slow and fast chargers, and model the drivers' flexibility of plugging and unplugging their EVs. Simulation results from a synthetic case study show that implementing MPCs is beneficial over both SPCs and drivers' flexibility in terms of total investments required for the charging infrastructure.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
SympOCnet: Solving optimal control problems with applications to high-dimensional multi-agent path planning problems
Solving high-dimensional optimal control problems in real-time is an important but challenging problem, with applications to multi-agent path planning problems, which have drawn increased attention given the growing popu…
GPUOptimal Parking Planning for Shared Autonomous Vehicles
Parking is a crucial element of the driving experience in urban transportation systems. Especially in the coming era of Shared Autonomous Vehicles (SAVs), parking operations in urban transportation networks will inevitab…
Autonomous VehiclesAgentic AI for Trip Planning Optimization Application
Trip planning for intelligent vehicles increasingly requires selecting optimal routes rather than merely producing feasible itineraries, as interacting factors such as travel time, energy consumption, and traffic conditi…
Divide and Conquer: Provably Unveiling the Pareto Front with Multi-Objective Reinforcement Learning
An important challenge in multi-objective reinforcement learning is obtaining a Pareto front of policies to attain optimal performance under different preferences. We introduce Iterated Pareto Referent Optimisation (IPRO…
Multi-Objective Reinforcement Learningreinforcement-learningReinforcement LearningMulti-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)
In this paper, we propose a novel methodology for path planning and scheduling for multi-robot navigation that is based on optimal transport theory and model predictive control. We consider a setup where $N$ robots are t…
Robot Navigation