Comparative Study of Adaptive Elitism and Mutation Operators in Flower Pollination Algorithm for Combinatorial Testing Problem
The performance of meta-heuristic search algorithms highly depends on their intensification and diversification abilities. Different algorithms adopt intensification and diversification strategies in order to obtain better results. Elitism and mutation are common operators that are used for increasi...
Main Authors: | Abdullah, Nasser, Kamal Z., Zamli |
---|---|
Format: | Article |
Language: | English |
Published: |
American Scientific Publisher
2018
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/19740/1/32.%20Comparative%20Study%20of%20Adaptive%20Elitism%20and%20Mutation%20Operators%20in%20Flower%20Pollination%20Algorithm%20for%20Combinatorial%20Testing1.pdf |
Similar Items
-
Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
by: Abdullah, Nasser, et al.
Published: (2019) -
Comparative Study between Flower Pollination Algorithm and Cuckoo Search Algorithm for t-way Test Data Generation
by: Abdullah, Nasser, et al.
Published: (2018) -
Self-adaptive Population Size Strategy Based on Flower Pollination Algorithm for T-Way
Test Suite Generation
by: Abdullah, Nasser, et al.
Published: (2019) -
A kidney algorithm with elitism for combinatorial testing problem
by: Bahomaid, Ameen A., et al.
Published: (2020) -
An adaptive flower pollination algorithm for minimizing software testing redundancy
by: M. N., Kabir, et al.
Published: (2017)