Multi-swarm optimization

About: Multi-swarm optimization is a research topic. Over the lifetime, 19162 publications have been published within this topic receiving 549725 citations.

Swarm Intelligence: Principles, Advances, and Applications

Abstract: Swarm Intelligence: Principles, Advances, and Applications delivers in-depth coverage of bat, artificial fish swarm, firefly, cuckoo search, flower pollination, artificial bee colony, wolf search, and gray wolf optimization algorithms. The book begins with a brief introduction to mathematical optimization, addressing basic concepts related to swarm intelligence, such as randomness, random walks, and chaos theory. The text then: Describes the various swarm intelligence optimization methods, standardizing the variants, hybridizations, and algorithms whenever possible Discusses variants that focus more on binary, discrete, constrained, adaptive, and chaotic versions of the swarm optimizers Depicts real-world applications of the individual optimizers, emphasizing variable selection and fitness function design Details the similarities, differences, weaknesses, and strengths of each swarm optimization method Draws parallels between the operators and searching manners of the different algorithms Swarm Intelligence: Principles, Advances, and Applications presents a comprehensive treatment of modern swarm intelligence optimization methods, complete with illustrative examples and an extendable MATLAB package for feature selection in wrapper mode applied on different data sets with benchmarking using different evaluation criteria. The book provides beginners with a solid foundation of swarm intelligence fundamentals, and offers experts valuable insight into new directions and hybridizations.

A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

Abstract: This paper proposes a novel multi-objective model for an unrelated parallel machine scheduling problem considering inherent uncertainty in processing times and due dates. The problem is characterized by non-zero ready times, sequence and machine-dependent setup times, and secondary resource constraints for jobs. Each job can be processed only if its required machine and secondary resource (if any) are available at the same time. Finding optimal solution for this complex problem in a reasonable time using exact optimization tools is prohibitive. This paper presents an effective multi-objective particle swarm optimization (MOPSO) algorithm to find a good approximation of Pareto frontier where total weighted flow time, total weighted tardiness, and total machine load variation are to be minimized simultaneously. The proposed MOPSO exploits new selection regimes for preserving global as well as personal best solutions. Moreover, a generalized dominance concept in a fuzzy environment is employed to find locally Pareto-optimal frontier. Performance of the proposed MOPSO is compared against a conventional multi-objective particle swarm optimization (CMOPSO) algorithm over a number of randomly generated test problems. Statistical analyses based on the effect of each algorithm on each objective space show that the proposed MOPSO outperforms the CMOPSO in terms of quality, diversity and spacing metrics.

Particle swarm optimization based K-means clustering approach for security assessment in power systems

Abstract: Security assessment is a major concern in planning and operation studies of a power system. Conventional method of security evaluation performed by simulation involves long computer time and generates voluminous results. This paper presents a K-means clustering approach for classifying power system states as secure/insecure under a given operating condition and contingency. This paper demonstrates how the traditional K-means clustering algorithm can be profitably modified to be used as a classifier algorithm. The proposed algorithm combines particle swarm optimization (PSO) with the traditional K-means algorithm to satisfy the requirements of a classifier. The proposed PSO based K-means clustering technique is implemented in IEEE 30 Bus, 57 Bus, 118 Bus and 300 Bus standard test systems for static security and transient security evaluation. The simulation results of the proposed algorithm are compared with unsupervised K-means clustering, which uses different methods for cluster center initialization.

Particle swarm optimization with an aging leader and challengers algorithm for the solution of optimal power flow problem

Abstract: Graphical abstract for application of ALC-PSO algorithm for solution of OPF problem. ALC-PSO is applied for the solution of OPF problem of power systems.OPF is formulated as a non-linear constrained optimization problem.The study is implemented on two IEEE standard test power systems.The presented results demonstrate the potential of the proposed approach. Solution of optimal power flow (OPF) problem aims to optimize a selected objective function such as fuel cost, active power loss, total voltage deviation (TVD) etc. via optimal adjustment of the power system control variables while at the same time satisfying various equality and inequality constraints. In the present work, a particle swarm optimization with an aging leader and challengers (ALC-PSO) is applied for the solution of the OPF problem of power systems. The proposed approach is examined and tested on modified IEEE 30-bus and IEEE 118-bus test power system with different objectives that reflect minimization of fuel cost or active power loss or TVD. The simulation results demonstrate the effectiveness of the proposed approach compared with other evolutionary optimization techniques surfaced in recent state-of-the-art literature. Statistical analysis, presented in this paper, indicates the robustness of the proposed ALC-PSO algorithm.