By Topic

An Experimental Comparison of Multiobjective Algorithms: NSGA-II and OMOPSO

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

3 Author(s)
Adriana Cortes Godinez ; Inst. Tecnol. de Leon, Guanajuato, Mexico ; Luis Ernesto Mancilla Espinosa ; Efren Mezura Montes

The optimization of multi objective problems is currently an area of important research and development. The importance of type of problems has allowed the development of multiple metaheuristics for their solution. To determine which multi objective metaheuristic has the best performance with respect to a problem, in this article an experimental comparison between two of them: Sorting Genetic Algorithm No dominated-II (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPS) using ZDT test functions is made. The results obtained by both algorithms are compared and analyzed based on different performance metrics that evaluate both the dispersion of the solutions on the Pareto front, and its proximity to it.

Published in:

Electronics, Robotics and Automotive Mechanics Conference (CERMA), 2010

Date of Conference:

Sept. 28 2010-Oct. 1 2010