An exploration-enhanced elephant herding optimization. Issue 9 (11th November 2019)

• Record Type: Journal Article
• Authors: ElShaarawy, Islam A.; Houssein, Essam H.; Ismail, Fatma Helmy; Hassanien, Aboul Ella
• Is Part Of: Engineering computations. Volume 36:Issue 9(2019)
• Page Start: 3029
• Page End: 3046
• Publication Date: 2019-11-11
• Subjects: Exploration -- Exploitation -- Biased convergence -- Elephant herding optimization (EHO) -- Evolutionary algorithms -- Star discrepancy; Computer-aided engineering -- Periodicals; Computer graphics -- Periodicals; 620.00285
• DOI: 10.1108/EC-09-2018-0424
• Languages: English
• ISSNs: 0264-4401

Abstract

Abstract : Purpose: The purpose of this paper is to propose an enhanced elephant herding optimization (EEHO) algorithm by improving the exploration phase to overcome the fast-unjustified convergence toward the origin of the native EHO. The exploration and exploitation of the proposed EEHO are achieved by updating both clan and separation operators. Design/methodology/approach: The original EHO shows fast unjustified convergence toward the origin specifically, a constant function is used as a benchmark for inspecting the biased convergence of evolutionary algorithms. Furthermore, the star discrepancy measure is adopted to quantify the quality of the exploration phase of evolutionary algorithms in general. Findings: In experiments, EEHO has shown a better performance of convergence rate compared with the original EHO. Reasons behind this performance are: EEHO proposes a more exploitative search method than the one used in EHO and the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Operator γ is added to EEHO assists to escape from local optima, which commonly exist in the search space. The proposed EEHO controls the convergence rate and the random walk independently. Eventually, the quantitative and qualitative results revealed that the proposed EEHO outperforms the original EHO. Research limitations/implications: Therefore, the pros and cons are reported as follows: pros of EEHO compared to EHO – 1) unbiased exploration of the whole search space thanks to the proposed update operator that fixed the unjustified convergence of the EHO toward the origin and the proposed separating operator that fixed the tendency of EHO to introduce new elephants at the boundary of the search space; and 2) the ability to control exploration–exploitation trade-off by independently controverting the convergence rate and the random walk using different parameters – cons EEHO compared to EHO: 1) suitable values for three parameters (rather than two only) have to be found to use EEHO. Originality/value: As the original EHO shows fast unjustified convergence toward the origin specifically, the search method adopted in EEHO is more exploitative than the one used in EHO because of the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Further, the star discrepancy measure is adopted to quantify the quality of exploration phase of evolutionary algorithms in general. Operator γ that added EEHO allows the successive local and global searching (exploration and exploitation) and helps escaping from local minima that commonly exist in the search space.