Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria
Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. ex...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia Press
2021
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/28787/1/JICT%2020%2001%202021%2041-56.pdf |
| _version_ | 1803629521531830272 |
|---|---|
| author | Zamli, Kamal Zuhairi Din, Fakhrud Nasser, Abdullah Ramli, Nazirah Mohamed, Noraini |
| author_facet | Zamli, Kamal Zuhairi Din, Fakhrud Nasser, Abdullah Ramli, Nazirah Mohamed, Noraini |
| author_sort | Zamli, Kamal Zuhairi |
| collection | UUM |
| description | Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. However, FPA still suffers from variability of its performance as there is no one size that fits all values for pa, depending on the characteristics of the optimisation function. This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. Adopting the problem of t-way test suite generation as the case study and with the comparative evaluation with the original FPA, FPA-MH gave promising results owing to its dynamic and adaptive selection of search operators based on the need of the current search. |
| first_indexed | 2024-07-04T06:39:10Z |
| format | Article |
| id | uum-28787 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:39:10Z |
| publishDate | 2021 |
| publisher | Universiti Utara Malaysia Press |
| record_format | dspace |
| spelling | uum-287872022-08-07T02:50:46Z https://repo.uum.edu.my/id/eprint/28787/ Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria Zamli, Kamal Zuhairi Din, Fakhrud Nasser, Abdullah Ramli, Nazirah Mohamed, Noraini QA75 Electronic computers. Computer science Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. However, FPA still suffers from variability of its performance as there is no one size that fits all values for pa, depending on the characteristics of the optimisation function. This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. Adopting the problem of t-way test suite generation as the case study and with the comparative evaluation with the original FPA, FPA-MH gave promising results owing to its dynamic and adaptive selection of search operators based on the need of the current search. Universiti Utara Malaysia Press 2021 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/28787/1/JICT%2020%2001%202021%2041-56.pdf Zamli, Kamal Zuhairi and Din, Fakhrud and Nasser, Abdullah and Ramli, Nazirah and Mohamed, Noraini (2021) Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria. Journal of Information and Communication Technology, 20 (01). pp. 41-56. ISSN 2180-3862 |
| spellingShingle | QA75 Electronic computers. Computer science Zamli, Kamal Zuhairi Din, Fakhrud Nasser, Abdullah Ramli, Nazirah Mohamed, Noraini Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria |
| title | Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria |
| title_full | Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria |
| title_fullStr | Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria |
| title_full_unstemmed | Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria |
| title_short | Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria |
| title_sort | dynamic probability selection for flower pollination algorithm based on metropolis hastings criteria |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/28787/1/JICT%2020%2001%202021%2041-56.pdf |
| work_keys_str_mv | AT zamlikamalzuhairi dynamicprobabilityselectionforflowerpollinationalgorithmbasedonmetropolishastingscriteria AT dinfakhrud dynamicprobabilityselectionforflowerpollinationalgorithmbasedonmetropolishastingscriteria AT nasserabdullah dynamicprobabilityselectionforflowerpollinationalgorithmbasedonmetropolishastingscriteria AT ramlinazirah dynamicprobabilityselectionforflowerpollinationalgorithmbasedonmetropolishastingscriteria AT mohamednoraini dynamicprobabilityselectionforflowerpollinationalgorithmbasedonmetropolishastingscriteria |