By Topic

An orthogonal multi-objective evolutionary algorithm with lower-dimensional crossover

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

11 Author(s)
Song Gao ; Sch. of Comput. Sci., China Univ. of Geosci., Wuhan ; Sanyou Zeng ; Bo Xiao ; Lei Zhang
more authors

This paper proposes an multi-objective evolutionary algorithm. The algorithm is based on OMOEA-II. A new linear breeding operator with lower-dimensional crossover and copy operation is used. By using the lower-dimensional crossover, the complexity of searching is decreased so the algorithm converges faster. The orthogonal crossover increase probability of producing potential superior solutions, which helps the algorithm get better results. Ten unconstrained problems are used to test the algorithm. For three problems, the obtained solutions are very close to the true Pareto front, and for one problem, the obtained solutions distribute on part of the true Pareto front.

Published in:

Evolutionary Computation, 2009. CEC '09. IEEE Congress on

Date of Conference:

18-21 May 2009