Search

Particle swarm optimization algorithms (PSOA) is a metaheuristic algorithm used to optimize computational problems using candidate solutions or particles based on selected quality measures. Despite the extensive research published, studies that critically examine its recent scientific developments and research impact are lacking. Therefore, the publication trends and research landscape on PSOA research were examined. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) and bibliometric analysis techniques were applied to identify and analyze the published documents indexed in Scopus from 2001 to 2021. The published documents on PSOA increased from 8 to 1,717 (21,362.50%) due to the growing applications of PSOA in solving computational problems. "Conference papers" is the most common document type, whereas the most prolific researcher on PSOA is Andries P. Engelbrecht (South Africa). The most active affiliation (Ministry of Education) and funding organization (National Natural Science Foundation) are based in China. The research landscape on PSOA revealed high levels of publications, citations, and collaborations among the top authors, institutions, and countries worldwide. Keywords co-occurrence analysis revealed that "particle swarm optimization (PSO)" occurred more frequently than others. The findings of the study could provide researchers and policymakers with insights into the prospects and challenges of PSOA research relative to similar algorithms in the literature. [ABSTRACT FROM AUTHOR]

This paper presents a new methodology for the optimal integrated planning of medium- and low-voltage distribution systems, considering the location and sizing of distributed generation. The integrated problem is formulated as a mixed-integer nonlinear model and, to solve it, two well-known optimization algorithms (simulated annealing and iterated local search) are used. The intensification and diversification processes are usually the bottleneck of metaheuristic techniques for solving complex problems. To overcome such complexity, a new neighborhood search method based on the Zbus matrix (NSZM) is proposed, to explore the solution space more efficiently and effectively for both algorithms. The proposed methodology is validated and tested on a real distribution system taken from the literature. The results obtained are better than those reported in the literature. To verify the efficiency of the new NSZM method, the Wilcoxon signed ranks test is used to measure the performance behavior of the NSZM method in the two optimization algorithms used. The numerical results demonstrate that the NSZM method enhances both algorithms equally. [ABSTRACT FROM AUTHOR]