Evaluating the performance of SHADE on CEC 2013 benchmark problems

Author

Tanabe, Ryo ; Fukunaga, Akira

Author_Institution

Grad. Sch. of Arts & Sci., Univ. of Tokyo, Tokyo, Japan

fYear

2013

fDate

20-23 June 2013

Firstpage

1952

Lastpage

1959

Abstract

This paper evaluates the performance of Success-History based Adaptive DE (SHADE) on the benchmark set for the CEC2013 Competition on Real-Parameter Single Objective Optimization. SHADE is an adaptive differential algorithm which uses a history-based parameter adaptation scheme. Experimental results on 28 problems from the CEC2013 benchmarks for 10, 30, and 50 dimensions are presented, including measurements of algorithmic complexity. In addition, we investigate the parameter adaptation behavior of SHADE on these instances.

Keywords

benchmark testing; computational complexity; evolutionary computation; performance evaluation; CEC 2013 benchmark problems; SHADE performance evaluation; adaptive differential algorithm; algorithmic complexity measurements; history-based parameter adaptation scheme; parameter adaptation behavior; real-parameter single objective optimization; success-history based adaptive differential evolution; Benchmark testing; Complexity theory; Optimization; Sociology; Statistics; Thyristors; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation (CEC), 2013 IEEE Congress on

Conference_Location

Cancun

Print_ISBN

978-1-4799-0453-2

Electronic_ISBN

978-1-4799-0452-5

Type

conf

DOI

10.1109/CEC.2013.6557798

Filename

6557798