Enhanced Moth-flame Optimization Based on Cultural Learning and Gaussian Mutation

This paper presents an Enhanced Moth-Flame Optimization (EMFO) technique based on Cultural Learning (CL) and Gaussian Mutation (GM). The mechanism of CL and the operator of GM are incorporated to the original algorithm of Moth-Flame Optimization (MFO). CL plays an important role in the inheritance o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of bionics engineering Jg. 15; H. 4; S. 751 - 763
Hauptverfasser: Xu, Liwu, Li, Yuanzheng, Li, Kaicheng, Beng, Gooi Hoay, Jiang, Zhiqiang, Wang, Chao, Liu, Nian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Singapore Springer Singapore 01.07.2018
Schlagworte:
Artificial Intelligence
Biochemical Engineering
Bioinformatics
Biomaterials
Biomedical Engineering and Bioengineering
Biomedical Engineering/Biotechnology
Engineering
moth-flame optimization
cultural learning
benchmark functions
bioinspired computing
Gaussian mutation
ISSN:1672-6529, 2543-2141
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an Enhanced Moth-Flame Optimization (EMFO) technique based on Cultural Learning (CL) and Gaussian Mutation (GM). The mechanism of CL and the operator of GM are incorporated to the original algorithm of Moth-Flame Optimization (MFO). CL plays an important role in the inheritance of historical experiences and stimulates moths to obtain information from flames more effectively, which helps MFO enhance its searching ability. Furthermore, in order to overcome the disadvantage of trapping into local optima, the operator of GM is introduced to MFO. This operator acts on the best flame in order to generate several variant ones, which can increase the diversity. The proposed algorithm of EMFO has been comprehensively evaluated on 13 benchmark functions, in comparison with MFO. Simulation results verify that EMFO shows a significant improvement on MFO, in terms of solution quality and algorithmic reliability.
ISSN:1672-6529
2543-2141
DOI:10.1007/s42235-018-0063-3