Name
Abstract | ||
|---|---|---|
ificial bee colony ABC optimisation algorithm is relatively a simple and recent population-based probabilistic approach for global optimisation. ABC has been outperformed over some nature inspired algorithms NIAs when tested over benchmark as well as real world optimisation problems. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the solution search equation of ABC, there is an enough chance to skip the true solution due to large step sizes. In order to balance the diversity and convergence capability of the ABC, in this paper, a power law-based local search strategy is proposed and integrated with ABC. The proposed strategy is named as power law-based local search in ABC PLABC. In the PLABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Further, to improve the exploration capability, numbers of scout bees are increased. The experiments on 24 test problems of different complexities show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest guided ABC GABC, best-so-far ABC BSFABC and modified ABC in most of the experiments. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1504/IJAISC.2014.062814 | International Journal of Artificial Intelligence and Soft Computing |
Keywords | Field | DocType |
swarm intelligence,local search,memetic algorithm | Convergence (routing),Memetic algorithm,Population,Mathematical optimization,Computer science,Swarm intelligence,Artificial intelligence,Probabilistic logic,Local search (optimization),Power law | Journal |
Volume | Issue | Citations |
4 | 2/3 | 4 |
PageRank | References | Authors |
0.44 | 36 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harish Sharma | 1 | 363 | 27.53 |
| Jagdish Chand Bansal | 2 | 651 | 52.30 |
| K. V. Arya | 3 | 289 | 28.09 |