The week's pick
Reseach Article
A Survey on Ant Inspired Metaheuristic Algorithm-Parallel Approaches
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 128 - Number 15 |
| Year of Publication: 2015 |
| Authors: Shobhit N. Sharma, Vikram Garg |
10.5120/ijca2015906295
|
Shobhit N. Sharma, Vikram Garg . A Survey on Ant Inspired Metaheuristic Algorithm-Parallel Approaches. International Journal of Computer Applications. 128, 15 ( October 2015), 18-20. DOI=10.5120/ijca2015906295
Abstract
Although ant is not one of those smart creatures, when swarm, however co-operate with each other while foraging(in search of food) they have this great ability to unearth an optimal solution to their problem thus coming up with the shortest path from their nest to the food source in case of foraging. Ants grant excellent efficiency while solving combinatorial problems and also have the potential of combining with other algorithms with ease. This survey includes: 1) Generalized ant inspired algorithm and different applications of ant Colony Optimization (ACO). 2) Proposed parallel approaches to those applications. As ACO is intrinsically parallel so in this survey GPU implementation using OpenCL is proposed to parallel approaches and only those application areas are explored whose parallel approaches are discussed.
References
- M. Islam, P. Thulasiraman, and R. Thulasiram, “A parallel ant colony optimization algorithm for all-pair routing in manets,” in Parallel and Distributed Processing Symposium, 2003. Proceedings. International, pp. 8 pp.–, 2003.
- A. Munshi, B. Gaster, T. G. Mattson, J. Fung, and D. Ginsburg, OpenCL Programming Guide. Addison-Wesley Professional, 1 ed., July 2011.
- K. M. Sim and W. H. Sun, “Ant colony optimization for routing and load-balancing: survey and new directions,” Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on, vol. 33, no. 5, pp. 560–572, 2003.
- M. Dorigo and T. Stutzle,¨ Ant Colony Optimization. Scituate, MA, USA: Bradford Company, 2004.
- M. Dorigo, M. Birattari, and T. Stutzle, “Ant colony optimization,” Computational Intelligence Magazine, IEEE, vol. 1, no. 4, pp. 28–39, 2006.
- M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1990.
- R.-M. Chen, S.-T. Lo, C.-L. Wu, and T.-H. Lin, “An effective ant colony optimization-based algorithm for flow shop scheduling,” in Soft Computing in Industrial Applications, 2008. SMCia ’08. IEEE Conference on, pp. 101–106, 2008.
- D. Martens, M. De Backer, R. Haesen, J. Vanthienen, M. Snoeck, and B. Baesens, “Classification with ant colony optimization,” Evolutionary Computation, IEEE Transactions on, vol. 11, no. 5, pp. 651–665, 2007.
- B. Jin and L. Zhang, “An improved ant colony algorithm for path opti-mization in emergency rescue,” in Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on, pp. 1–5, 2010.
- Y. Lin, J. Zhang, H.-H. Chung, W. H. Ip, Y. Li, and Y. hui Shi, “An ant colony optimization approach for maximizing the lifetime of heteroge-neous wireless sensor networks,” Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, vol. 42, no. 3, pp. 408–420, 2012.
Index Terms
Keywords