Behavior of Evolutionary Many-Objective Optimization

Authors:
Hisao Ishibuchi;Noritaka Tsukamoto;Yusuke Nojima
Affiliations:
-;-;-
Venue:
UKSIM '08 Proceedings of the Tenth International Conference on Computer Modeling and Simulation
Year:
2008

Citing 0
Cited 5

Hybrid multiobjective estimation of distribution algorithm by local linear embedding and an immune inspired algorithm

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Hypervolume approximation using achievement scalarizing functions for evolutionary many-objective optimization

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A many-objective optimisation decision-making process applied to automotive diesel engine calibration

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Diagnostic assessment of search controls and failure modes in many-objective evolutionary optimization

Evolutionary Computation
Approximating multi-objective scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evolutionary multiobjective optimization (EMO) is one of the most active research areas in the field of evolutionary computation. Whereas EMO algorithms have been successfully used in various application tasks, it has also been reported that they do not work well on many-objective problems. In this paper, first we examine the behavior of the most well-known and frequently-used EMO algorithm on many-objective 0/1 knapsack problems. Next we briefly review recent proposals for the scalability improvement of EMO algorithms to many-objective problems. Then their effects on the search ability of EMO algorithms are examined. Experimental results show that the increase in the convergence of solutions to the Pareto front often leads to the decrease in their diversity. Based on this observation, we suggest future research directions in evolutionary many-objective optimization.