A Comparison of Chaotic Electromagnetic Field Optimization Algorithms

Abstract

This paper investigates the performance of various Electromagnetic Field Optimization (EFO) algorithms. Chaos maps are proposed to improve the performance of EFO algorithms. Ten chaotic maps are incorporated in EFO – Chebyshev, Circle, Gauss, Iterative, Logistic, Piecewise, Sine, Singer, Sinusoidal and Tent. To compare the performance of the constructed EFO algorithms, a case study of the identification of the model parameters of a cultivation process model is studied. An experimental data set from E. coli BL21(DE3)pPhyt109 fed-batch cultivation process is used. Based on the results of 30 runs of each EFO, some statistical and InterCriteria analyzes are performed. As a result, the best performing EFO algorithms are iterative EFO and tent chaotic map EFO. These algorithms gave the best objective value (best and mean value) and had a good distribution of results.

Keywords

• chaotic maps
• electromagnetic field optimization
• intercriteria analysis
• e. coli bl21(de3)pphyt109 fed-batch cultivation