Multi-Objective Particles Swarm Optimization Approaches
IGI Global eBooksPublished 24 May 2011
Konstantinos E. Parsopoulos, Michael N. Vrahatis
Citations70
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This chapter aims at providing a review and discussion of the most established results on this field, as well as exposing the most active research topics that can give initiative for future research.
Abstract
The multiple criteria nature of most real world problems has boosted research on multi-objective algorithms that can tackle such problems effectively, with the smallest possible computational burden. Particle Swarm Optimization has attracted the interest of researchers due to its simplicity, effectiveness and efficiency in solving numerous single-objective optimization problems. Up-to-date, there are a significant number of multi-objective Particle Swarm Optimization approaches and applications reported in the literature. This chapter aims at providing a review and discussion of the most established results on this field, as well as exposing the most active research topics that can give initiative for future research.
Keywords
Computer Science
Swarm IntelligenceParticle swarm optimization
21,351 Citations2007Riccardo Poli, James Kennedy +1 more
A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
A new optimizer using particle swarm theory
14,870 Citations2002R.C. Eberhart, James Kennedy
The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
IEEE Transactions on Evolutionary ComputationThe particle swarm - explosion, stability, and convergence in a multidimensional complex space
8,768 Citations2002Maurice Clerc, James Kennedy
Evolutionary ComputationMuiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
6,869 Citations1994N. Srinivas, Kalyanmoy Deb
Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously are investigated and suggested to be extended to higher dimensional and more difficult multiobjective problems.
Evolutionary Algorithms for Solving Multi-Objective Problems
5,697 Citations2007Gary B. Lamont
IEEE Transactions on Evolutionary ComputationHandling multiple objectives with particle swarm optimization
4,262 Citations2004Carlos A. Coello Coello, Gregorio Toscano‐Pulido +1 more
An approach in which Pareto dominance is incorporated into particle swarm optimization (PSO) in order to allow this heuristic to handle problems with several objective functions and indicates that the approach is highly competitive and that can be considered a viable alternative to solve multiobjective optimization problems.
A niched Pareto genetic algorithm for multiobjective optimization
2,423 Citations2002Jeffrey Horn, N. Nafpliotis +1 more
The Niched Pareto GA is introduced as an algorithm for finding the Pare to optimal set and its ability to find and maintain a diverse "Pareto optimal population" on two artificial problems and an open problem in hydrosystems is demonstrated.
MOPSO: a proposal for multiple objective particle swarm optimization
2,389 Citations2002Carlos A. Coello Coello, M.S. Lechuga
This paper introduces a proposal to extend the heuristic called "particle swarm optimization" (PSO) to deal with multiobjective optimization problems and it maintains previously found nondominated vectors in a global repository that is later used by other particles to guide their own flight.
Evolutionary ComputationApproximating the Nondominated Front Using the Pareto Archived Evolution Strategy
2,271 Citations2000Joshua Knowles, David Corne
It is argued that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set and provides strong evidence thatPAES performs consistently well on a range of multiobjective optimization tasks.
Lecture notes in computer scienceComparison between genetic algorithms and particle swarm optimization
1,600 Citations1998Russell C. Eberhart, Yuhui Shi
This paper compares two evolutionary computation paradigms: genetic algorithms and particle swarm optimization, and suggests ways in which performance might be improved by incorporating features from one paradigm into the other.
Evolutionary ComputationMulti-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
1,441 Citations1999Kalyanmoy Deb
The problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging to the true Pareto-optimal front are studied to enable researchers to test their algorithms for specific aspects of multi- objective optimization.
Natural ComputingRecent approaches to global optimization problems through Particle Swarm Optimization
1,406 Citations2002Konstantinos E. Parsopoulos, Michael N. Vrahatis
A Composite PSO, in which the heuristic parameters of PSO are controlled by a Differential Evolution algorithm during the optimization, is described, and results for many well-known and widely used test functions are given.
International Journal of Computational Intelligence ResearchMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
1,351 Citations2006Carlos A. Coello Coello, Margarita Reyes-Sierra
This paper presents a comprehensive review of the vari- ous MOPSOs reported in the specialized literature, and includes a classification of the approaches, and identifies the main features of each proposal.
Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance
1,056 Citations2003James Kennedy
The study manipulated the neighborhood topologies of particle swarms optimizing four test functions and Sociometric structure and the small-world manipulation interacted with function to produce a significant effect on performance.
Lecture notes in computer scienceImproving PSO-Based Multi-objective Optimization Using Crowding, Mutation and ∈-Dominance
773 Citations2005Margarita Reyes Sierra, Carlos A. Coello Coello
A new Multi-Objective Particle Swarm Optimizer is proposed, which is based on Pareto dominance and the use of a crowding factor to filter out the list of available leaders and incorporates the ∈-dominance concept to fix the size of the set of final solutions produced by the algorithm.
IEEE Transactions on Evolutionary ComputationOn the Computation of All Global Minimizers Through Particle Swarm Optimization
686 Citations2004Konstantinos E. Parsopoulos, Michael N. Vrahatis
The approaches include transformations of the objective function through the recently proposed deflection and stretching techniques, as well as a repulsion source at each detected minimizer, resulting in an efficient algorithm which has the ability to avoid previously detected solutions and, thus, detect all global minimizers of a function.
Particle swarm optimization method in multiobjective problems
651 Citations2002Konstantinos E. Parsopoulos, Michael N. Vrahatis
Critical aspects of the VEGA approach for Multiobjective Optimization using Genetic Algorithms are adapted to the PSO framework in order to develop a multi-swarm PSO that can cope effectively with MO problems.
Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO)
643 Citations2004Sanaz Mostaghim, Jürgen Teich
The Sigma method is introduced as a new method for finding best local guides for each particle of the population from a set of Pareto-optimal solutions and the results are compared with the results of a multi-objective evolutionary algorithm (MOEA).
Multiobjective optimization using dynamic neighborhood particle swarm optimization
609 Citations2003Xiaohui Hu, R.C. Eberhart
This paper presents a particle swarm optimization algorithm modified by using a dynamic neighborhood strategy, new particle memory updating, and one-dimension optimization to deal with multiple objectives for multiobjective optimization problems.
Lecture notes in computer scienceA Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
532 Citations2003Xiaodong Li
This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization by making a better use of particles' personal bests and offspring for more effective nondomination comparisons.
Engineering OptimizationA Swarm Metaphor for Multiobjective Design Optimization
425 Citations2002Tapabrata Ray, K.M. Liew
A new optimization algorithm to solve multiobjective design optimization problems based on behavioral concepts similar to that of a real swarm is presented, indicating that the swarm algorithm is capable of generating an extended Pareto front with significantly fewer function evaluations when compared to the nondominated sorting genetic algorithm (NSGA).
Open Research Exeter (University of Exeter)A multi-objective algorithm based upon particle swarm optimisation, an efficient data structure and turbulence
292 Citations2002Jonathan E. Fieldsend, Sameer Singh
Lecture notes in computer scienceA MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts
287 Citations2005Julio E. Alvarez-Benitez, Richard Everson +1 more
This work proposes and evaluates methods for confining particles to the feasible region, and finds that allowing particles to explore regions close to the constraint boundaries is important to ensure convergence to the Pareto front.
IEEE Transactions on Evolutionary ComputationUsing unconstrained elite archives for multiobjective optimization
246 Citations2003Jonathan E. Fieldsend, Richard Everson +1 more
It is demonstrated thatMOEAs using the new data structures run significantly faster than standard, unconstrained archive MOEAs, and result in estimated Pareto fronts significantly ahead of MOE as using a constrained archive.
Particle swarm with extended memory for multiobjective optimization
238 Citations2004Xiaohui Hu, R.C. Eberhart +1 more
This paper presents a modified dynamic neighborhood particle swarm optimization (DNPSO) algorithm that is modified by using a dynamic neighborhood strategy, new particle memory updating, and one-dimension optimization to deal with multiple objectives.
Dynamic Weighted Aggregation for evolutionary multi-objective optimization: why does it work and how?
214 Citations2001Yaochu Jin, Markus Olhofer +1 more
A theory on why CWA fails for multi-objective problems with a concave Pareto front is provided schematically and it can easily be explained why EDWA has worked well for both convex and concave multi- objective problems.
MULTIOBJECTIVE OPTIMIZATION USING PARALLEL VECTOR EVALUATED PARTICLE SWARM OPTIMIZATION
189 Citations2003Konstantinos E. Parsopoulos
This paper studies a parallel version of the Vector Evaluated Particle Swarm Optimization (VEPSO) method for multiobjective problems, investigating both the efficiency and the advantages of the parallel implementation.
Lecture notes in computer scienceThe Niched Pareto Genetic Algorithm 2 Applied to the Design of Groundwater Remediation Systems
187 Citations2001Mark Erickson, Alex Mayer +1 more
This work is a first attempt to apply EMO to the long-term remediation of contaminated water, and an improved version of the Niched Pareto GA (NPGA 2) is applied to determine the pumping rates for up to fifteen fixed-location wells.
IEEE Transactions on MagneticsPareto Optimality and Particle Swarm Optimization
176 Citations2004Ulrike Baumgartner, Christian Magele +1 more
The particle swarm algorithm is modified to detect the pareto-optimal front, and this paper shows how this can be used to solve multiobjective optimization problems.
Mathematical and Computer ModellingParameter selection and adaptation in Unified Particle Swarm Optimization
142 Citations2007Konstantinos E. Parsopoulos, Michael N. Vrahatis
The performance of the recently proposed Unified Particle Swarm Optimization method is investigated under different schemes for the determination and adaptation of the unification factor, which is the main parameter of the method, controlling its exploration and exploitation properties.
The role of e-dominance in multi objective particle swarm optimization methods
115 Citations2004Sanaz Mostaghim, Jürgen Teich
The results show that the /spl epsi/-dominance method can find solutions much faster than the clustering technique with comparable and even in some cases better convergence and diversity.
Lecture notes in computer scienceBetter Spread and Convergence: Particle Swarm Multiobjective Optimization Using the Maximin Fitness Function
113 Citations2004Xiaodong Li
This paper demonstrates that on the ZDT test function series, maximinPSO produces an almost perfect convergence and spread of solutions towards and along the Pareto-optimal front respectively, outperforming one of the state-of-art multiobjective EA algorithms, NSGA II, in all the performance measures used.
Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization
113 Citations2005Sanaz Mostaghim, Jürgen Teich
A method using multiobjective particle swarm optimization to cover the Pareto-optimal front is proposed and compared with an existing covering method using a real world example in antenna design.
Lecture notes in computer scienceA Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems
97 Citations2004Stefan Janson, Martin Middendorf
Different methods for determining the time when to rejoin the hierarchy and how to handle the topmost sub-swarm are discussed and a new type of hierarchical PSO, called Partitioned H-PSO (PH- PSO), is proposed.
Lecture notes in computer scienceAbout Selecting the Personal Best in Multi-Objective Particle Swarm Optimization
82 Citations2006Jürgen Branke, Sanaz Mostaghim
This paper proposes a new idea of allowing each particle to memorize all non-dominated personal best particles it has encountered, so that if the updated personal best position be indifferent to the old one, it keeps both in the personal archive.
Particle Swarm Optimization and Fitness Sharing to solve Multi-Objective Optimization Problems
80 Citations2005M. Salazar‐Lechuga, Jonathan E. Rowe
This paper introduces an algorithm that makes use of two main concepts, particle swarm optimization and fitness sharing to tackle multi-objective optimization problems.
Particle swarm optimizers for Pareto optimization with enhanced archiving techniques
72 Citations2004Thomas Bartz–Beielstein, Philipp Limbourg +4 more
DOPS integrates well-known archiving techniques from evolutionary algorithms into particle swarm optimization and results are presented, showing the usability of the proposed approach and a statistical analysis of the obtained results.
Lecture notes in computer scienceAdaptive Weighted Particle Swarm Optimisation for Multi-objective Optimal Design of Alloy Steels
64 Citations2004Mahdi Mahfouf, Minyou Chen +1 more
A modified Particle Swarm Optimisation (PSO) algorithm is presented to improve the performance of multi-objective optimisation and can locate the constrained optimal design with a very good accuracy.
Autonomous agent response learning by a multi-species particle swarm optimization
44 Citations2004Chi-kin Chow, Hung-Tat Tsui
An autonomous agent response learning (AARL) algorithm is presented to decompose the award function into a set of local award functions and shows that it returns a more accurate response set within shorter duration by comparing with other PSO methods.
Vector evaluated particle swarm optimization (VEPSO): optimization of a radiometer array antenna
40 Citations2004Dennis Gies, Yahya Rahmat‐Samii
A study of the vector evaluated PSO (VEPSO), a multi-objective PSO paradigm, by applying it to a complex multi- objective electromagnetic design problem.
Lecture notes in computer scienceParticle Evolutionary Swarm for Design Reliability Optimization
17 Citations2005Ángel Eduardo Muñoz Zavala, Enrique R. Villa Diharce +1 more
This papers proposes an enhanced Particle Swarm Optimization algorithm with multi-objective optimization concepts to handle constraints, and operators to keep diversity and exploration, and incorporates a new concept called Distribution Optimization.
Lecture notes in computer scienceA Smart Particle Swarm Optimization Algorithm for Multi-objective Problems
6 Citations2006Xiaohua Huo, Lincheng Shen +1 more
A Smart Particle Swarm Optimization algorithm for MOP(SMOPSO) is proposed, which can find many Pareto optimal solutions in less iteration steps by setting the cooperative action of all the objective functions as the global best guide of swarm.
Bi-criteria model for locating a semi-desirable facility on a plane using particle swarm optimization
6 Citations2005Haluk Yapıcıoğlu, Gerry Dozier +1 more
The proposed model solved by particle swarm optimization provides better results than a previously proposed heuristic.