Dynamic multi-objective optimization using PSO

Abstract

Dynamic multi-objective optimisation problems (DMOOPs) occur in many situations in the real world. These optimisation problems do not have a single goal to solve, but many goals that are in conflict with one another - improvement in one goal leads to deterioration of another. Therefore, when solving DMOOPs, an algorithm attempts to find the set of optimal solutions, referred to as the Paretooptimal front (POF). Each DMOOP also has a number of boundary constraints that limits the search space. When the particles of a particle swarm optimisation (PSO) algorithm moves outside the search space, an approach should be followed to manage violation of the boundary constraints. This chapter investigates the effect of various approaches to manage boundary constraint violations on the performance of the Dynamic Vector Evaluated Particle Swarm Optimisation (DVEPSO) algorithm when solving DMOOPs. Furthermore, the performance of DVEPSO is compared against the performance of three other state-of-the-art dynamic multi-objective optimisation (DMOO) algorithms.