Parameters Tuning of Adaptive Firefly Algorithm based Strategy for t-way Testing
Abdulkarim S. M. Ali1, Rozmie R. Othman2, Yacob, Y.M3, Jalal M Alkanaani4
1Rozmie R. Othman*, School of Computer and Communication Engineering, Universiti Malaysia Perlis, Kangar, Perlis, Malaysia.
2Abdulkarim S. M. Ali, School of Computer and Communication Engineering, Universiti Malaysia Perlis, Kangar, Perlis, Malaysia.
3Yacob, Y.M, School of Computer and Communication Engineering, Universiti Malaysia Perlis, 01000 Kangar, Perlis, Malaysia.
4Jalal Mohammed Hachim School of Computer and Communication Engineering, Universiti Malaysia Perlis, Kangar, Perlis, Malaysia.
Manuscript received on October 11, 2019. | Revised Manuscript received on 23 October, 2019. | Manuscript published on November 10, 2019. | PP: 4191-4195 | Volume-9 Issue-1, November 2019. | Retrieval Number: A6111119119/2019©BEIESP | DOI: 10.35940/ijitee.A6111.119119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The adaptive firefly algorithm (AFA) is developed based on an elitism operator. Elitism operators can perform the function of updating the effectiveness of diversification in a search algorithm. In this study, a strategy was proposed to upgrade the FA concerning static issues. Most traditionally, for evolutionary algorithms, elitism suggests that the best solution found is utilized to work for the next generation. Elitism involves the replication of a small set of the fittest candidate solutions, which remain unaltered, into succeeding generations. The condition can radically impact execution time by ensuring that the El waste no time on re-finding newly-disposed partial solutions. Candidates who stay protected and unmodified via elitism all meet the requirements for parent selection in terms of rearing the remainder of the succeeding generation. This study used different tuning parameters, such as the number of fireflies, iterations and switching probability. To ensure that AFA could perform for t-way testing as useful as other strategies to generate the best performance. Considering the standard covering array (N, 2,𝟓 𝟕 ) it demonstrates the tuning parameters for AFA to improve elitism. In this paper, the Findings show that AFA, as well as t-way testing, can deliver the minimum requirements and sufficient results
Keywords: T-way Testing Problem, Combinatorial Test, Firefly Algorithm, Elitism, Tuning Parameters
Scope of the Article: Algorithm Engineering