CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Incremental Enhanced Artificial Bee Colony Algorithm with Local Search

by Neha Pathak, Manuj Mishra, Shiv Pratap Singh Kushwah
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 116 - Number 13
Year of Publication: 2015
Authors: Neha Pathak, Manuj Mishra, Shiv Pratap Singh Kushwah
10.5120/20400-2708

Neha Pathak, Manuj Mishra, Shiv Pratap Singh Kushwah . Incremental Enhanced Artificial Bee Colony Algorithm with Local Search. International Journal of Computer Applications. 116, 13 ( April 2015), 32-35. DOI=10.5120/20400-2708

@article{ 10.5120/20400-2708,
author = { Neha Pathak, Manuj Mishra, Shiv Pratap Singh Kushwah },
title = { Incremental Enhanced Artificial Bee Colony Algorithm with Local Search },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 116 },
number = { 13 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 32-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume116/number13/20400-2708/ },
doi = { 10.5120/20400-2708 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:57:04.277092+05:30
%A Neha Pathak
%A Manuj Mishra
%A Shiv Pratap Singh Kushwah
%T Incremental Enhanced Artificial Bee Colony Algorithm with Local Search
%J International Journal of Computer Applications
%@ 0975-8887
%V 116
%N 13
%P 32-35
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Swarm intelligence is the collective problem solving behavior of groups of artificial agents. These agents local interaction with each other can be negative, positive or neutral. Here positive interaction helps agents to solve a problem while negative interaction block the agents for solving problem and neutral interaction does not affect the swarm's performance. In this work, incremental enhanced ABC algorithm with local search is used for reducing negative interaction without complexifying the agent's behavior. Here in the enhanced artificial bee colony algorithm, one additional phase in the form of mutation operator is used. With the help of mutation operator, algorithm may not be trapped into local optima due to the chance of changing local best position. The experimental results show that the performance of proposed algorithm and the proposed algorithm is compared with standard ABC algorithm, Artificial Bee Colony algorithm with mutation algorithm.

References
  1. D. Karaboga," An idea based on honey bee swarm for numerical optimization" Techn. Rep. TR06,Erciyes Univ. Press, Erciyes, 2005.
  2. Shraddha Saxena, Kavita Sharma, Savita Shiwani and Harish Sharma, "Lbest Artificial Bee Colony using Structured Swarm", Advance Computing Conference (IACC), 2014 IEEE, pp-1354-1360.
  3. B. Akay and D. Karaboga," A modified artificial bee colony algorithm for real-parameter optimization" Information Sciences, doi:10. 1016/j. ins. 2010. 07. 015, 2010.
  4. M. Dorigo and G. Di Caro," Ant colony optimization: a new meta-heuristic" In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, volume 2. IEEE, 1999.
  5. J. Vesterstrom and R. Thomsen," A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems" In Evolutionary Computation, 2004. CEC2004. Congress on, volume 2, pages 1980–1987. IEEE, 2004.
  6. G. Zhu and S. Kwong," Gbest-guided artificial bee colony algorithm for numerical function optimization" Applied Mathematics and Computation, 217(7):3166–3173, 2010.
  7. D. Karaboga and B. Akay," A comparative study of artificial bee colony algorithm" Applied Mathematics and Computation, 214(1):108–132, 2009.
  8. D. Haijun F. Qingxian,"Bee colony algorithm for the function optimization". Science Paper Online,08:448–456, August 2008.
  9. Amit Singh, Neetesh Gupta and Amit Singhal, "Artificial bee colony algorithm with uniform mutation", Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011, Volume 130, 2012, pp 503-511.
  10. Montes de Oca, M. A. , St¨utzle, T. : Towards incremental social learning in optimization and multiagent systems. In: Rand, W. , et al. (eds. ) Workshop on Evolutionary Computation and Multiagent Systems Simulation of the Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 1939–1944. ACM Press, New York (2008).
  11. D. Aydin, T. Liao, Marco A. Montes De Oca and T. Stutzle, "Improving Performance via Population Growth and Local Search: The Case of the Artificial Bee Colony Algorithm" IRIDIA – Technical Report Series TR/IRIDIA/2011-015, ISSN 1781-3794, Aug 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Artificial Bee Colony ABC Genetic Algorithm Mutation incremental social learning Swarm Intelligence.

Powered by PhDFocusTM