By Topic

A Hybrid Simplex Multi-objective Evolutionary Algorithm Based on Preference Order Ranking

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

1 Author(s)
Guo Xiaofang ; Sch. of Sci., Xi'an Technol. Univ., Xi'an, China

It could be concluded that all multi-objective evolutionary algorithms draw their strength from two aspects: convergence and diversity. In order to achieve these goals, This paper proposes a hybrid methods that combines GA with simplex search method for multi-objective optimization using preference order ranking. Preference order ranking is used as fitness assignment methodology to accelerate the performance of convergence, especially when the number of objectives is very large. The proposed algorithm also uses three subsets to evolve simultaneous and each subset is divided on the basis of different criterion. In every generation, We carry out simplex-based local search in the first two subsets to achieve faster convergence and better diversity, and the individuals in third subset execute ordinary genetic operator to avoid premature convergence. The proposed algorithm has been compared with other MOEAs in high dimensional problems. The experimental results indicate that our algorithm produces better convergence and diversity performance.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011