DocumentCode
2691980
Title
Quasi-oppositional Differential Evolution
Author
Rahnamayan, Shahryar ; Tizhoosh, Hamid R. ; Salama, Magdy M A
Author_Institution
Pattern Anal. & Machine Intelligence (PAMI), Waterloo
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
2229
Lastpage
2236
Abstract
In this paper, an enhanced version of the opposition-based differential evolution (ODE) is proposed. ODE utilizes opposite numbers in the population initialization and generation jumping to accelerate differential evolution (DE). Instead of opposite numbers, in this work, quasi opposite points are used. So, we call the new extension quasi- oppositional DE (QODE). The proposed mathematical proof shows that in a black-box optimization problem quasi- opposite points have a higher chance to be closer to the solution than opposite points. A test suite with 15 benchmark functions has been employed to compare performance of DE, ODE, and QODE experimentally. Results confirm that QODE performs better than ODE and DE in overall. Details for the proposed approach and the conducted experiments are provided.
Keywords
evolutionary computation; black-box optimization; global optimization algorithm; quasioppositional differential evolution; Acceleration; Benchmark testing; Biomedical engineering; Convergence; Genetic mutations; Instruments; Machine intelligence; Optimization methods; Pattern analysis; Robust control;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424748
Filename
4424748
Link To Document