SPV and Mutation based Artificial Bee Colony Algorithm for Travelling Salesman Problem

Print
International Journal of Computer Applications
© 2015 by IJCA Journal
Volume 116 - Number 14
Year of Publication: 2015
Authors:
Ashay Shrivastava
Manish Gupta
Shashank Swami
10.5120/20405-2753

Ashay Shrivastava, Manish Gupta and Shashank Swami. Article: SPV and Mutation based Artificial Bee Colony Algorithm for Travelling Salesman Problem. International Journal of Computer Applications 116(14):19-22, April 2015. Full text available. BibTeX

@article{key:article,
	author = {Ashay Shrivastava and Manish Gupta and Shashank Swami},
	title = {Article: SPV and Mutation based Artificial Bee Colony Algorithm for Travelling Salesman Problem},
	journal = {International Journal of Computer Applications},
	year = {2015},
	volume = {116},
	number = {14},
	pages = {19-22},
	month = {April},
	note = {Full text available}
}

Abstract

Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself. . In this proposed work, enhanced ABC algorithm with SPV for travelling salesman problem is used. In this modified bee colony algorithm, additional phase in the form of mutation is used after the scout bee phase and the SPV rule is used in this work for improving local search. After modification, proposed algorithm is implemented on standard travelling salesman problem for checking the efficiency of proposed work. The experimental results are compared with ABC algorithm and ABC with SPV algorithm.

References

  • D. Karaboga," An idea based on honey bee swarm for numerical optimization" Techn. Rep. TR06,Erciyes Univ. Press, Erciyes, 2005.
  • 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.
  • 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.
  • 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.
  • 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.
  • G. Zhu and S. Kwong," Gbest-guided artificial bee colony algorithm for numerical function optimization" Applied Mathematics and Computation, 217(7):3166–3173, 2010.
  • D. Karaboga and B. Akay," A comparative study of artificial bee colony algorithm" Applied Mathematics and Computation, 214(1):108–132, 2009.
  • D. Haijun and F. Qingxian,"Bee colony algorithm for the function optimization". Science Paper Online,08:448–456, August 2008.
  • 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.
  • Nishant Pathak and Sudhanshu Tiwari , " Travelling salesman problem using bee colony with SPV", Proceedings of the International Journal of soft computing and Engineering (IJSCE), Vol. – 02, Issue – 3, July 2012.
  • Hemant Nagpure and Rohit Raja , "RBGCA- Bee Genetic Colony Algorithm for Travelling Salesman Problem", (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (6), 2012,5384-5389.