Adaptive Search Range and Multi-Mutation Strategies for Differential Evolution

In this paper, an improved DE is proposed to improve optimization performance by involving four searching strategies: current-to-better mutation, real-random-mutation, sharing mutation, and focused search. When evolution speed is standstill, sharing mutation can increase the search depth; in additio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of Information Science and Engineering 2014-05, Vol.30 (3), p.749-763
Hauptverfasser: 謝昇達(Sheng-Ta Hsieh), 丘世元(Shih-Yuan Chiu), 顏士淨(Shi-Jim Yen)
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, an improved DE is proposed to improve optimization performance by involving four searching strategies: current-to-better mutation, real-random-mutation, sharing mutation, and focused search. When evolution speed is standstill, sharing mutation can increase the search depth; in addition, real-random mutation can disturb individuals and can help individuals diverge to local optimum, focused search can do largescale searches around the best particle. When the evolution progresses well, current-to-better mutation will drive individuals to the correct evolution direction. Experiments were conducted on all of CEC 2005 test functions, include unimodal, multimodal and hybrid composition functions, to present performance of the proposed method and to compare with 5 variants of DE includes JADE, jDE, SaDE, DEGL and MDE_pBX. The proposed method exhibits better performance than other five related works in solving most the test functions.
ISSN:1016-2364
DOI:10.6688/JISE.2014.30.3.13