By Topic

A novel Differential Evolution algorithm based on simulated annealing

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

4 Author(s)
PeiChong Wang ; Sch. of Inf. Eng., China Univ. of Min. & Technol. (Beijing), Beijing, China ; Xu Qian ; Yu Zhou ; Ning Li

Differential Evolution (DE) which has been focused on computation intelligence is a new swarm intelligent algorithm by simulating intelligence of population after GA and PSO etc. It is more robust and efficient. Because the differential degree of individuals is minimized in the last, the diversity of population will be reduced and DE will converge ahead of schedule. It is well known that simulated annealing(SA) can accept both better solution and worse solution according to definite probability. This mechanism can maintain the diversity of the population so that can avoid appearing premature convergence. This paper proposes a novel hybrid DE (DESA) by combining original DE algorithm and simulated annealing strategy. At last, it is proved that the DESA algorithm is effective in solving global optimization problem by testing on five Benchmark functions.

Published in:

Control and Decision Conference (CCDC), 2010 Chinese

Date of Conference:

26-28 May 2010