Improved multi-objective particle swarm optimization with preference strategy for optimal DG integration into the distribution system

2015 ◽  
Vol 148 ◽  
pp. 23-29 ◽  
Author(s):  
Shan Cheng ◽  
Min-You Chen ◽  
Peter J. Fleming
Energies ◽  
2019 ◽  
Vol 12 (7) ◽  
pp. 1295 ◽  
Author(s):  
Javier Leiva ◽  
Rubén Carmona Pardo ◽  
José Aguado

A growing presence of distributed energy resources (DER) and the increasingly diverse nature of end users at low-voltage (LV) networks make the operation of these grids more and more challenging. Particularly, congestion and voltage management strategies for LV grids have usually been limited to some elemental criteria based on human experience, asset oversizing, or grid reinforcement. However, with the current massive deployment of sensors in modern LV grids, new approaches are feasible for distribution network assets operation. This article proposes a multi-objective particle swarm optimization (MOPSO) approach, combined with data analytics through affinity propagation clustering, for congestion threshold determination in LV grids. A real case study from the smart grid of Smartcity Malaga Living Lab is used to illustrate the proposed approach. Within this approach, distribution system operators (DSOs) can take decisions in order to prevent situations of risk or potential failure at LV grids.


Water ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1334
Author(s):  
Mohamed R. Torkomany ◽  
Hassan Shokry Hassan ◽  
Amin Shoukry ◽  
Ahmed M. Abdelrazek ◽  
Mohamed Elkholy

The scarcity of water resources nowadays lays stress on researchers to develop strategies aiming at making the best benefit of the currently available resources. One of these strategies is ensuring that reliable and near-optimum designs of water distribution systems (WDSs) are achieved. Designing WDSs is a discrete combinatorial NP-hard optimization problem, and its complexity increases when more objectives are added. Among the many existing evolutionary algorithms, a new hybrid fast-convergent multi-objective particle swarm optimization (MOPSO) algorithm is developed to increase the convergence and diversity rates of the resulted non-dominated solutions in terms of network capital cost and reliability using a minimized computational budget. Several strategies are introduced to the developed algorithm, which are self-adaptive PSO parameters, regeneration-on-collision, adaptive population size, and using hypervolume quality for selecting repository members. A local search method is also coupled to both the original MOPSO algorithm and the newly developed one. Both algorithms are applied to medium and large benchmark problems. The results of the new algorithm coupled with the local search are superior to that of the original algorithm in terms of different performance metrics in the medium-sized network. In contrast, the new algorithm without the local search performed better in the large network.


Sign in / Sign up

Export Citation Format

Share Document