Cart (Loading....) | Create Account
Close category search window
 

Comprehensive comparison of convergence performance of optimization algorithms based on nonparametric statistical tests

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

2 Author(s)
Shi-Zheng Zhao ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Suganthan, P.N.

In evolutionary computation, statistical tests are commonly used to improve the comparative evaluation process of the performance of different algorithms. In this paper, three state-of-the-art Differential Evolution (DE) based algorithms, namely Dynamic Memetic Differential Evolution (MOS), Self-adaptive DE hybridized with modified multi-trajectory search (MMTS) algorithm (SaDE-MMTS) and Self-adaptive Differential Evolution Algorithm using Population Size Reduction and three Strategies Algorithm (jDElscop) as well as a novel algorithm called ensemble of parameters and mutation strategies in Differential Evolution with Self-adaption and MMTS (Sa-EPSDE-MMTS), are tested on the most recent LSO benchmark problems and comparatively evaluated using nonparametric statistical analysis. Instead of using the “Value-to-Reach” as the comparison criterion, comprehensive comparison over multiple evolution points are investigated on each test problem in order to quantitatively compare convergence performance of different algorithms. Our investigations demonstrate that even though all these algorithms yield the same final solutions on a large set of problems, they possess statistically significant variations during the convergence. Hence, we propose that evolutionary algorithms can be compared statistically along the evolution paths.

Published in:

Evolutionary Computation (CEC), 2012 IEEE Congress on

Date of Conference:

10-15 June 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.