Particle swarm optimization method in multiobjective problems
Proceedings of the 2002 ACM symposium on Applied computing
Multiobjective optimization using dynamic neighborhood particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Multi-objective particle swarm optimization on computer grids
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Multi-Objective Particle Swarm Optimizers: An Experimental Comparison
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
A non-dominated sorting particle swarm optimizer for multiobjective optimization
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
An improved multi-objective particle swarm optimization algorithm
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
A MOPSO algorithm based exclusively on pareto dominance concepts
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
IEEE Transactions on Evolutionary Computation
Multiobjective Particle Swarm Algorithm With Fuzzy Clustering for Electrical Power Dispatch
IEEE Transactions on Evolutionary Computation
Interactive Particle Swarm: A Pareto-Adaptive Metaheuristic to Multiobjective Optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Particle swarm optimization with increasing topology connectivity
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
In multi-objective particle swarm optimization (MOPSO), a proper selection of local guides significantly influences detection of non-dominated solutions in the objective/solution space and, hence, the convergence characteristics towards the Pareto-optimal set. This paper presents an algorithm based on simple heuristics for selection of local guides in MOPSO, named as HSG-MOPSO (Heuristics-based-Selection-of-Guides in MOPSO). In the HSG-MOPSO, the set of potential guides (in a PSO iteration) consists of the non-dominated solutions (which are normally stored in an elite archive) and some specifically chosen dominated solutions. Thus, there are two types of local guides in the HSG-MOPSO, i.e., non-dominated and dominated guides; they are named so as to signify whether the chosen guide is a non-dominated or a dominated solution. In any iteration, a guide, from the set of available guides, is suitably selected for each population member. Some specified proportion of the current population members follow their respective nearest non-dominated guides and the rest follow their respective nearest dominated guides. The proposed HSG-MOPSO is firstly evaluated on a number of multi-objective benchmark problems along with investigations on the controlling parameters of the guide selection algorithm. The performance of the proposed method is compared with those of two well-known guide selection methods for evolutionary multi-objective optimization, namely the Sigma method and the Strength Pareto Evolutionary Algorithm-2 (SPEA2) implemented in PSO framework. Finally, the HSG-MOPSO is evaluated on a more involved real world problem, i.e., multi-objective planning of electrical distribution system. Simulation results are reported and analyzed to illustrate the viability of the proposed guide selection method for MOPSO.