Optimal Allocation of Depots for Electric Bus Charging: Cost Minimization and Power System Impact Mitigation Using Mixed Integer Nonlinear Programming

This paper proposes a novel approach for the optimal allocation of a depot for electric buses (EBs) charging in a specific transit service, considering the impact on the power system. The main objective is to minimize the total cost, achieved by minimizing the cost of the new cables connecting the depot station to the distribution system and the upgrade cost of existing lines to meet the additional loads. The outcomes are the optimal location of the depot, the optimal electric node bus in the distribution system to supply it, and the required system upgrades. The optimization problem is formulated as a Mixed Integer Nonlinear Programming (MINLP) model and solved using the General Algebraic Modeling System (GAMS). The methodology is tested on the H16 EB service line in Barcelona, Spain, and a typical electrical distribution system. Three case studies are presented in this paper. In the first case, the impact of a single service on the distribution network is analyzed, and in the second case, three H16 EB services are assumed to serve the network. The third case handles a multi-route, multi-terminal bus service to allocate and supply a depot capable of accommodating all the routes. This case will also include sensitivity analysis to test the robustness and reliability of the model. Results show that for a single H16 EB service, no line upgrades were needed, and the total cost per phase was $120,000. For three H16 EB services, three lines required upgrades, and the total cost per phase increased to $718,000. In the third case, the sensitivity analysis revealed that higher demand factors lead to increased costs due to more update requirements and voltage deviations. The results demonstrate that the minimum distance between the depot and node is not always the optimal or feasible solution that would prevent the depot load installation at a weak spot and meet the power flow constraints.