An improved artificial bee colony algorithm for minimal time cost reduction
| Autor: | Jin-Ling Cai(#), Fan Min, Hai-Jun Ding, William Zhu |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
education.field_of_study
Computer science business.industry Population Particle swarm optimization Computational intelligence Machine learning computer.software_genre Reduction (complexity) Artificial bee colony algorithm Artificial Intelligence Pattern recognition (psychology) Local search (optimization) Computer Vision and Pattern Recognition Artificial intelligence business education computer Software Bees algorithm |
| Zdroj: | International Journal of Machine Learning and Cybernetics. 5:743-752 |
| ISSN: | 1868-808X 1868-8071 |
| DOI: | 10.1007/s13042-013-0219-8 |
| Popis: | The artificial bee colony (ABC) is a popular heuristic optimization algorithm. Although it has fewer control parameters, it shows competitive performance compared with other population-based algorithms. The ABC algorithm is good at exploration, but poor at exploitation. Recently, a global best-guided ABC (GABC) algorithm, inspired by particle swarm optimization, has been developed to tackle this issue. However, GABC cannot be applied to binary optimization problems. In this paper, we develop an improved ABC (IABC) algorithm with a new food source update strategy. IABC employs information about the global best solution as well as personal best solutions, thus enhancing the local search abilities of the bees. The new algorithm is adjusted to solve the binary optimization problem of minimal time cost reduction. We conduct a series of experiments on four UCI datasets, and our results clearly indicate that our algorithm outperforms the existing ABC algorithms, especially on the medium-sized Mushroom dataset. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink