Multi-objective Pareto genetic algorithms using fast elite updating

Authors:
Guanqi Guo;Zhumei Tan;Guanci Yang
Affiliations:
College of Information and Communication Engineering, Hunan Institute of Science and Technology, Yueyang, P.R. China;College of Mechnism Engineering, Hunan Institute of Science and Technology, Yueyang, P.R. China;Chengdu Institute of Computer Applications of Chinese Academy of Science, Chengdu, P.R. China
Venue:
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Year:
2009

Citing 4
Cited 0

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
An overview of evolutionary algorithms in multiobjective optimization

Evolutionary Computation
Niche distributions on the pareto optimal front

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Multi-objective PSO algorithm based on fitness sharing and online elite archiving

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the multi-objective optimization Pareto genetic algorithms (MOPGA) for searching alternative non-dominated Pareto-optimal solutions. A kind of niching approach using clustering crowding and fast elite updating is designed to maintain population diversity and uniform distribution of non-dominated solutions. The time complexity analysis shows clustering crowding and fast elite updating is a cost-efficient niching method. The simulation optimization on various multi-objective 0/1 knapsack problems shows MOPGA is capable of approximating to Pareto front evenly and cost efficiently, and the convergence rate and the distribution uniformity are consistently superior to that of the strength Pareto evolutionary approach (SPEA).