Assessing the chaotic map population initializations for sine cosine algorithm using the case study of pairwise test suite generation

• Main Authors: Din, Fakhrud, Kamal Zuhairi, Zamli, Abdullah, Nasser
• Format: Conference or Workshop Item
• Language: English; English
• Published: Springer Science and Business Media Deutschland GmbH 2022
• Subjects: QA75 Electronic computers. Computer science; QA76 Computer software; T Technology (General); TA Engineering (General). Civil engineering (General)
• Online Access: http://umpir.ump.edu.my/id/eprint/39552/1/Assessing%20the%20Chaotic%20Map%20Population%20Initializations%20for%20Sine%20Cosine.pdf; http://umpir.ump.edu.my/id/eprint/39552/2/Assessing%20the%20chaotic%20map%20population%20initializations%20for%20sine%20cosine%20algorithm%20using%20the%20case%20study%20of%20pairwise%20test%20suite%20generation_ABS.pdf; http://umpir.ump.edu.my/id/eprint/39552/; https://doi.org/10.1007/978-981-16-8690-0_34

Sine Cosine Algorithm (SCA) is a new population based meta-heuristic algorithm that exploits both the sine and cosine functions for its update operators. The main strength of SCA is its simplicity and straightforward implementation as well as provides no parameter control adjustment. For these reasons, SCA can be adopted in many optimization problems quickly and without much tuning. Despite the aforementioned advantages, SCA convergence can still be problematic depending on the initial starting positions of initial populations. In this work, we propose to assess the effectiveness of pseudo random (i.e., Random) as well as three chaotic map initializations (i.e., sine map, circle map, and logistic map) for SCA using the pairwise test case generation as our case study. The original SCA with random initialization (R_SCA) is outperformed on the adopted experiments by the proposed logistic map SCA (LM_SCA), circle map SCA (CM_SCA) and singer map SCA (SM_SCA).