An Improved Multi-elitist Artificial Bee Colony Algorithm Based on Nelder-Mead Simplex Method
[1]Jin Ye,Sun Yuehongang Jiacui,Wang Dan.An Improved Multi-elitist Artificial Bee Colony Algorithm Based on Nelder-Mead Simplex Method[J].Journal of Zhengzhou University (Engineering Science),2018,39(06):36-42.[doi:10.13705/j.issn.1671-6833.2018.06.008]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
39
Number of periods:
2018 06
Page number:
36-42
Column:
Public date:
2018-10-24
- Title:
- An Improved Multi-elitist Artificial Bee Colony Algorithm Based on Nelder-Mead Simplex Method
- Keywords:
- Artificial bee colony algorithm; Targeted update strategy; Elite solution set; selection probability; simplex
- CLC:
- -
- Abstract:
- There were some problems in the Artificial Bee Colony (ABC) algorithm, such as the slow convergence speed, low solution precision and easy to fall in local optimum. Inspired by particle swarm optimization algorithm, multi-elitist artificial bee colony algorithm for real-parameter optimization use of global best solution and an elitist randomly selected from the elitist set were adopted to enhance the exploitation of the global best solution. In this paper, we the elitist to guide the nectar search during the employed bee process was introduced. And the selection probability formula of food source was reconstructed by using the quality of food source. In the onlooker bee stage, the best food source was selected to guide the swarm to enhance the exploitation of the global best solution, and the and the neighbor food source was selected to be the optimally directional choice. As the same time, a simplex method was used on elitist solution set to balance the exploration and exploitation ability of the algorithm. The numerical experiment results showed that the proposed algorithm had higher searching precision and faster convergence speed.
- References:
- -
- Similar References:
Memo
-
Last Update:
2018-10-26