Title :
MD-MOEA : A new MOEA based on the maximin fitness function and Euclidean distances between solutions
Author :
Menchaca-Mendez, Adriana ; Coello Coello, Carlos
Author_Institution :
Dept. de Comput., CINVESTAV- IPN, Mexico City, Mexico
Abstract :
In this paper, we propose a new selection mechanism based on the maximin fitness function and a technique based on Euclidean distances between solutions to improve the diversity of the population in objective function space. Our new selection mechanism is incorporated into a multi-objective evolutionary algorithm (MOEA) which uses the operators of NSGA-II (crossover and mutation) to generate new individuals, giving rise to the so-called “Maximin-Distances Multi-Objective Evolutionary Algorithm (MD-MOEA)”. Our MD-MOEA is validated using standard test functions taken from the specialized literature, having three to six objective functions. MD-MOEA is compared with respect to MC-MOEA (which is based on the maximin fitness function and a clustering technique), MOEA/D using Penalty Boundary Intersection (PBI), which is based on decomposition, and SMS-EMOA-HYPE (a version of SMS-EMOA that uses a fitness assignment based on the use of an approximation of the hypervolume indicator). Our preliminary results indicate that our MD-MOEA is a good alternative to solve multi-objective optimization problems having both low dimensionality and high dimensionality in objective function space because it obtains better results than MC-MOEA and MOEA/D in most cases and it is competitive with respect to SMS-EMOA-HYPE (in fact, it outperforms SMS-EMOA-HYPE in problems of high dimensionality) but at a much lower computational cost.
Keywords :
evolutionary computation; Euclidean distance; MC-MOEA; MD-MOEA; PBI; clustering technique; crossover operator; maximin fitness function; maximin-distances multiobjective evolutionary algorithm; mutation operator; objective function space; penalty boundary intersection; population diversity; selection mechanism; Approximation methods; Evolutionary computation; Linear programming; Pareto optimization; Sociology;
Conference_Titel :
Evolutionary Computation (CEC), 2014 IEEE Congress on
Conference_Location :
Beijing
Print_ISBN :
978-1-4799-6626-4
DOI :
10.1109/CEC.2014.6900301