Handling energy resource management (ERM) in today’s energy systems is complex and challenging due to uncertainties arising from the high penetration of distributed energy resources. Such penetration introduces various uncertain factors, such as renewable energy, energy storage, and electric vehicles, making it difficult for traditional mathematical methods to find effective solutions. However, Evolutionary Algorithms (EAs) have shown good performance in solving this problem. Therefore, in this paper, a self-adaptive collaborative differential evolution algorithm (SADEA) is proposed to solve the ERM problem under uncertainty. In SADEA, a three-stage adaptive collaboration strategy, includes boundary randomization stage, knowledge-assisted collaboration stage, and range restructuration stage, is used to generate collaborative solutions. The collaborative solutions generated in the above stages will jointly participate in the perturbation of DE strategies to explore promising solutions. In addition, different DE strategies are selected according to count values and random factors. At the end of the algorithm, boundary control, elite selection and retention are used to ensure the legitimacy and robustness of solutions. The proposed SADEA is compared to several state-of-the-art algorithms on a real-world distribution network located in Salamanca, Spain. The results show that SADEA is superior to its competitors in terms of the objective function, ranking index, and convergence. In summary, the proposed algorithm is effective to handle the ERM problem under uncertainty.
The growing distributed energy resource (DER) penetration into distribution networks, such as through residential and commercial photovoltaics (PV), has emerged through a transition from passive to active networks, which takes the complexity of planning and operations to the next level. Optimal PV allocation (sizing and location) is challenging because it involves mixed-integer non-linear programming with three-phase non-linear unbalanced power flow equations. Meta-heuristic algorithms have proven their effectiveness in many complex engineering problems. Thus, in this study, we propose to achieve optimal PV allocation by using several basic evolutionary algorithms (EAs), particle swarm optimization (PSO), artificial bee colony (ABC), differential evolution (DE), and their variants, all of which are applied for a study of their performance levels. Two modified unbalanced IEEE test feeders (13 and 37 bus) are developed to evaluate these performance levels, with two objectives: one is to maximize PV penetration, and the other is to minimize the voltage deviation from 1.0 p.u. To handle the computational burden of the sequential power flow and unbalanced network, we adopt an efficient iterative load flow algorithm instead of the commonly used and yet highly simplified forward–backward sweep method. A comparative study of these basic EAs shows their general success in finding a near-optimal solution, except in the case of the DE, which is known for solving continuous optimization problems efficiently. From experiments run 30 times, it is observed that PSO-related algorithms are more efficient and robust in the maximum PV penetration case, while ABC-related algorithms are more efficient and robust in the minimum voltage deviation case.