Dpb-Mopso: A Dynamic Pareto Bi-Level Multi-Objective Particle Swarm Optimization Algorithm
Authors:
Preprint
- 1 January 2022
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
Particle Swarm Optimization (PSO) system based on the distributed architecture over multiple sub-swarms is very efficient for static multi-objective optimization, but has not been considered for solving dynamic multi-objective problems (DMOPs). Tracking the most effective solutions over time and ensuring good exploitation and exploration are the main challenges of solving DMOP. This study proposes a Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm including two parallel optimization levels. At the first level, all solutions are managed in a single search space. When a dynamic change is successfully detected in the objective values, the Pareto ranking operator is used to enable a multiple sub-swarm’ subdivisions and processing which drives the second level of enhanced exploitation. A dynamic handling strategy based on random detectors is used to track the changes of the objective function due to time-varying parameters. A response strategy consisting in re-evaluate all unimproved solutions and replacing them with newly generated ones is also implemented. The DPb-MOPSO system is tested on a set of DMOPs with different types of time-varying Pareto Optimal Set (POS) and Pareto Optimal Front (POF). Inverted generational distance (IGD), mean inverted generational distance (MIGD), and hypervolume difference (HVD) metrics are used to assess the DPb-MOPSO performances. Quantitative results are analyzed using Friedman's analysis of variance, while stability is analyzed using Lyapunov's theorem. The DPb-MOPSO is more robust than several dynamic multi-objective evolutionary algorithms in solving 21 complex problems over a range of changes in both the POS and POF. On IGD and HVD, DPb-MOPSO can solve 8/13 and 7/13 of the 13 UDF and ZJZ functions with moderate changes. DPb-MOPSO is able to resolve 4/8 FDA and DMOP benchmarks with severe changes to the MIGD, and 5/8 with moderate changes. DPb-MOPSO assumes 4/8 of the solving function on IGD and HVD metrics when taking into account 3 kinds of environmental changes.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- A dynamic multi-objective evolutionary algorithm using a change severity-based adaptive population management strategySoft Computing, 2015
- Multi-objective Optimization with Dynamic Constraints and Objectives2015
- Particle swarm optimization2014
- A Population Prediction Strategy for Evolutionary Dynamic Multiobjective OptimizationIEEE Transactions on Cybernetics, 2013
- jMetal: A Java framework for multi-objective optimizationAdvances in Engineering Software, 2011
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse controlApplied Soft Computing, 2008
- Dynamic Multiobjective Optimization Problems: Test Cases, Approximations, and ApplicationsIEEE Transactions on Evolutionary Computation, 2004
- Combining Convergence and Diversity in Evolutionary Multiobjective OptimizationEvolutionary Computation, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002