A fruit fly optimization algorithm with a traction mechanism and its applications
The original fruit fly optimization algorithm, as well as some of its improved versions, may fail to find the function extremum when it falls far from the origin point or in the negative range. To address this problem, in this article, we propose a new fruit fly optimization algorithm, named as the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-11-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717739831 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547241696428032 |
|---|---|
| author | Xing Guo Jian Zhang Wei Li Yiwen Zhang |
| author_facet | Xing Guo Jian Zhang Wei Li Yiwen Zhang |
| author_sort | Xing Guo |
| collection | DOAJ |
| description | The original fruit fly optimization algorithm, as well as some of its improved versions, may fail to find the function extremum when it falls far from the origin point or in the negative range. To address this problem, in this article, we propose a new fruit fly optimization algorithm, named as the traction fruit fly optimization algorithm, which is mainly based on the combination of “traction population” and dynamic search radius. In traction fruit fly optimization algorithm, traction population consists of the worst individual recorded in the iterative process, the individual in the center of the interval, and the best fruit flies individual through different transformations, which is used to avoid the algorithm stopping at a local optimal. Moreover, our dynamic search radius strategy will ensure a wide search range in the early stage and enhance the local search capability in the latter part of the algorithm. Extensive experiment results show that traction fruit fly optimization algorithm is superior to fruit fly optimization algorithm and its other improved versions in the optimization of extreme values of continuous functions. In addition, through solving the service composition optimization problem, we prove that traction fruit fly optimization algorithm can also obtain a better performance in the discrete environment. |
| format | Article |
| id | doaj-art-9a90fa0cbca24453a72e717e2acbc993 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2017-11-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-9a90fa0cbca24453a72e717e2acbc9932025-02-03T06:45:33ZengWileyInternational Journal of Distributed Sensor Networks1550-14772017-11-011310.1177/1550147717739831A fruit fly optimization algorithm with a traction mechanism and its applicationsXing Guo0Jian Zhang1Wei Li2Yiwen Zhang3Key Laboratory of Intelligent Computing & Signal Processing, Anhui University, Hefei, ChinaSchool of Computer Science and Technology, Anhui University, Hefei, ChinaSchool of Computer Science and Technology, Anhui University, Hefei, ChinaSchool of Computer Science and Technology, Anhui University, Hefei, ChinaThe original fruit fly optimization algorithm, as well as some of its improved versions, may fail to find the function extremum when it falls far from the origin point or in the negative range. To address this problem, in this article, we propose a new fruit fly optimization algorithm, named as the traction fruit fly optimization algorithm, which is mainly based on the combination of “traction population” and dynamic search radius. In traction fruit fly optimization algorithm, traction population consists of the worst individual recorded in the iterative process, the individual in the center of the interval, and the best fruit flies individual through different transformations, which is used to avoid the algorithm stopping at a local optimal. Moreover, our dynamic search radius strategy will ensure a wide search range in the early stage and enhance the local search capability in the latter part of the algorithm. Extensive experiment results show that traction fruit fly optimization algorithm is superior to fruit fly optimization algorithm and its other improved versions in the optimization of extreme values of continuous functions. In addition, through solving the service composition optimization problem, we prove that traction fruit fly optimization algorithm can also obtain a better performance in the discrete environment.https://doi.org/10.1177/1550147717739831 |
| spellingShingle | Xing Guo Jian Zhang Wei Li Yiwen Zhang A fruit fly optimization algorithm with a traction mechanism and its applications International Journal of Distributed Sensor Networks |
| title | A fruit fly optimization algorithm with a traction mechanism and its applications |
| title_full | A fruit fly optimization algorithm with a traction mechanism and its applications |
| title_fullStr | A fruit fly optimization algorithm with a traction mechanism and its applications |
| title_full_unstemmed | A fruit fly optimization algorithm with a traction mechanism and its applications |
| title_short | A fruit fly optimization algorithm with a traction mechanism and its applications |
| title_sort | fruit fly optimization algorithm with a traction mechanism and its applications |
| url | https://doi.org/10.1177/1550147717739831 |
| work_keys_str_mv | AT xingguo afruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT jianzhang afruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT weili afruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT yiwenzhang afruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT xingguo fruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT jianzhang fruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT weili fruitflyoptimizationalgorithmwithatractionmechanismanditsapplications AT yiwenzhang fruitflyoptimizationalgorithmwithatractionmechanismanditsapplications |