Skip to content
2000
Volume 14, Issue 6
  • ISSN: 2666-2558
  • E-ISSN: 2666-2566

Abstract

Objectives: The modern science applications have non-continuous and multivariate nature due to which the traditional optimization methods suffer a lack of efficiency. Flower pollination is a natural interesting procedure in the real world. The novel optimization algorithms can be designed by employing the evolutionary capability of the flower pollination to optimize resources. Methods: This paper introduces the hybrid algorithm named Hybrid Hyper-Heuristic Flower Pollination Algorithm, HHFPA. It uses a combination of Flower Pollination Algorithm (FPA) and Hyper- Heuristic Evolutionary Algorithm (HypEA). This paper compares the basic FPA with the proposed algorithm named HHFPA. FPA is inspired by the pollination process of flowers whereas the hyper-heuristic evolutionary algorithm operates on the heuristics search space that contains all the heuristics to find a solution for a given problem. The proposed algorithm is implemented to solve the Quality of Service (QoS) based Service Composition Problem (SCoP) in Internet of Things (IoT). With increasing services with same functionality on the web, selecting a suitable candidate service based on non-functional characteristics such as QoS has become an inspiration for optimization. Results: This paper includes experimental results showing better outcomes to find the best solution using the proposed algorithm as compared to Basic FPA. Conclusion: The empirical analysis also reveals that HHFPA outperformed basic FPA in solving the SCoP with more convergence rates.

Loading

Article metrics loading...

/content/journals/rascs/10.2174/2666255813666191220152741
2021-08-01
2025-09-04
Loading full text...

Full text loading...

/content/journals/rascs/10.2174/2666255813666191220152741
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test