By Topic

Parallel strength Pareto multi-objective evolutionary algorithm for optimization problems

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
$33 $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

2 Author(s)
S. Xiong ; Sch. of Comput. Sci. & Technol., Wuhan Univ. of Technol., China ; F. Li

Finding a good convergence and distribution of solutions near the Pareto-optimal front in a small computational time is an important issue in multiobjective evolutionary optimization. Previous studies have either demonstrated a good distribution with a large computational overhead or a not-so-good distribution quickly, Strength Pareto evolutionary algorithm (SPEA) produces a better distribution with larger computational effort. A Parallel strength Pareto multiobjective evolutionary algorithm (PSPMEA) is proposed. PSPMEA is a parallel computing model designed for solving Pareto-based multiobjective optimization problems by using an evolutionary procedure. In this procedure, both global parallelization and island parallel evolutionary algorithm models are implemented based on Java multi-threaded and distributed computation programmatic technology separately. Each subpopulation evolves separately with different crossover and mutation probability, but they exchange individuals in the elitist archive. The benchmark problems numerical experiment results demonstrate that the proposed method can rapidly converge to the Pareto optimal front and spread widely along the front.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:4 )

Date of Conference:

8-12 Dec. 2003