doi: 10.7763/IJCTE.2010.V2.178
Finding Optimal Paths on Terrain Maps using Ant Colony Algorithm
Vinay Rishiwal1
,
Mano Yadav2 ,
K. V. Arya3
- 1MJP Rohilkhand University, Bareilly, UP, India.
- 2ITS Engineering College, Greater Noida, UP, India.
- 3ABV- Indian Institute of Information Technology, Gwalior, India.
Abstract
This paper presents the meta-heuristic method of ant colony optimization (ACO) to find optimal paths on terrain map images. The procedure simulates decision-making process of ant colonies as they forage for food. Modifications have been made to the ACO algorithm to solve the optimal path finding problem by optimizing multiple constraints. The number of constraints considered here is two. However, it can effectively be used for more than two constraints.
Keywords
- Ant Algorithms
- Meta-heuristic
- Multiple Objective Optimization
How to Cite
Vinay Rishiwal, Mano Yadav, and K. V. Arya, "Finding Optimal Paths on Terrain Maps using Ant Colony Algorithm," International Journal of Computer Theory and Engineering, vol. 2, no. 3, pp. 416-419, 2010. https://doi.org/10.7763/IJCTE.2010.V2.178
Copyright & License
Copyright © 2010 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).