Journal article 722 views 173 downloads
Beetle Colony Optimization Algorithm and its Application
Heng Zhang,
Ziming Li,
Xiangyuan Jiang,
Xiaojing Ma,
Jiyang Chen,
Shuai Li ,
Yizhong Luan,
Zhenyi Lv,
Sile Ma
IEEE Access, Volume: 8, Pages: 128416 - 128425
Swansea University Author: Shuai Li
-
PDF | Version of Record
Released under the terms of a Creative Commons Attribution 4.0 License (CC-BY).
Download (1.54MB)
DOI (Published version): 10.1109/access.2020.3008692
Abstract
Massive data sets and complex scheduling processes have high-dimensional and non-convex features bringing challenges on various applications. With deep insight into the bio-heuristic opinion, we propose a novel Beetle Colony Optimization (BCO) being able to adapt NP-hard issues to meet growing appli...
Published in: | IEEE Access |
---|---|
ISSN: | 2169-3536 |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa54990 |
Abstract: |
Massive data sets and complex scheduling processes have high-dimensional and non-convex features bringing challenges on various applications. With deep insight into the bio-heuristic opinion, we propose a novel Beetle Colony Optimization (BCO) being able to adapt NP-hard issues to meet growing application demands. Two important mechanisms are introduced into the proposed BCO algorithm. The first one is Beetle Antennae Search (BAS), which is a mechanism of random search along the gradient direction but not use gradient information at all. The second one is swarm intelligence, which is a collective mechanism of decentralized and self-organized agents. Both of them have reached a performance balance to elevate the proposed algorithm to maintain a wide search horizon and high search efficiency. Finally, our algorithm is applied to traveling salesman problem, and quadratic assignment problem and possesses excellent performance, which also shows that the algorithm has good applicability from the side. The effectiveness of the algorithm is also substantiated by comparing the results with the original ant colony optimization (ACO) algorithm in 3D simulation model experimental path planning. |
---|---|
College: |
Faculty of Science and Engineering |
Start Page: |
128416 |
End Page: |
128425 |