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.

An Adaptive Particle Swarm Optimization With Multiple Adaptive Methods

Abstract: Particle swarm optimization (PSO) has attracted much attention and has been applied to many scientific and engineering applications in the last decade. Most recently, an intelligent augmented particle swarm optimization with multiple adaptive methods (PSO-MAM) was proposed and was demonstrated to be effective for diverse functions. However, inherited from PSO, the performance of PSO-MAM heavily depends on the settings of three parameters: the two learning factors and the inertia weight. In this paper, we propose a parameter control mechanism to adaptively change the parameters and thus improve the robustness of PSO-MAM. A new method, adaptive PSO-MAM (APSO-MAM) is developed that is expected to be more robust than PSO-MAM. We comprehensively evaluate the performance of APSO-MAM by comparing it with PSO-MAM and several state-of-the-art PSO algorithms and evolutionary algorithms. The proposed parameter control method is also compared with several existing parameter control methods. The experimental results demonstrate that APSO-MAM outperforms the compared PSO algorithms and evolutionary algorithms, and is more robust than PSO-MAM.

Biogeography-based learning particle swarm optimization

Abstract: This paper explores biogeography-based learning particle swarm optimization (BLPSO). Specifically, based on migration of biogeography-based optimization (BBO), a new biogeography-based learning strategy is proposed for particle swarm optimization (PSO), whereby each particle updates itself by using the combination of its own personal best position and personal best positions of all other particles through the BBO migration. The proposed BLPSO is thoroughly evaluated on 30 benchmark functions from CEC 2014. The results are very promising, as BLPSO outperforms five well-established PSO variants and several other representative evolutionary algorithms.

Data-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System

Abstract: Most existing work on evolutionary optimization assumes that there are analytic functions for evaluating the objectives and constraints. In the real world, however, the objective or constraint values of many optimization problems can be evaluated solely based on data and solving such optimization problems is often known as data-driven optimization. In this paper, we divide data-driven optimization problems into two categories, i.e., offline and online data-driven optimization, and discuss the main challenges involved therein. An evolutionary algorithm is then presented to optimize the design of a trauma system, which is a typical offline data-driven multiobjective optimization problem, where the objectives and constraints can be evaluated using incidents only. As each single function evaluation involves a large amount of patient data, we develop a multifidelity surrogate-management strategy to reduce the computation time of the evolutionary optimization. The main idea is to adaptively tune the approximation fidelity by clustering the original data into different numbers of clusters and a regression model is constructed to estimate the required minimum fidelity. Experimental results show that the proposed algorithm is able to save up to 90% of computation time without much sacrifice of the solution quality.

Solving multiobjective problems using cat swarm optimization

Abstract: Highlights? A new multiobjective cat swarm optimization (MOCSO) algorithm is proposed. ? MOCSO is more efficient than MOPSO and NSGA-II. ? This algorithm is tested using benchmark functions. ? Sensitivity analysis of different parameters of MOCSO algorithm is carried out. This paper proposes a new multiobjective evolutionary algorithm (MOEA) by extending the existing cat swarm optimization (CSO). It finds the nondominated solutions along the search process using the concept of Pareto dominance and uses an external archive for storing them. The performance of our proposed approach is demonstrated using standard test functions. A quantitative assessment of the proposed approach and the sensitivity test of different parameters is carried out using several performance metrics. The simulation results reveal that the proposed approach can be a better candidate for solving multiobjective problems (MOPs).