Abstract
Web Service Composition (WSC) can be defined as the problem of consolidating the services regarding the complex user requirements. These requirements can be represented as a workflow. This workflow consists of a set of abstract task sequence where each sub-task represents a definition of some user requirements. In this work, we propose a more efficient neighboring selection process and multi-pheromone distribution method named Enhanced Flying Ant Colony Optimization (EFACO) to solve this problem. The WSC problem has a challenging issue, where the optimization algorithms search the best combination of web services to achieve the functionality of the workflow's tasks. We aim to improve the computation complexity of the Flying Ant Colony Optimization (FACO) algorithm by introducing three different enhancements. We analyze the performance of EFACO against six of existing algorithms and present a summary of our conclusions.
| Original language | English |
|---|---|
| Article number | 9361655 |
| Pages (from-to) | 34098-34111 |
| Number of pages | 14 |
| Journal | IEEE Access |
| Volume | 9 |
| DOIs | |
| State | Published - 2021 |
Keywords
- Service-oriented computing (SOC)
- ant colony optimization (ACO)
- discrete optimization
- enhanced flying ant colony optimization (EFACO)
- meta-heuristic algorithms
- nature-inspired algorithms