Indian Journal of Economics and Development

Open Access Open Access  Restricted Access Subscription Access

Path Identification Between Locations Within a Campus Using ACO


Affiliations
1 Loyola College, Chennai, India
2 Presidency College, Chennai, India
 

Objectives: To identify the paths between locations within the college campus. The paths were stored to create a voice guidance system for the visually challenged students studying in our institution.

Methods: We have allotted number for locations, and each location has its neighbor’s detail. A graph was generated by this information which gives a complete outline of connection among the locations. We have generated an algorithm based on Ant Colony. The algorithm was tested first with 9 locations and it was able to exactly list out all possible paths between sources and the destination.

Findings: Once the edge between vertices has been identified by an ant, then the pheromone level is maintained in that edge should be high. The pheromone level is kept above a value called threshold value. If pheromone level on a particular edge is below the threshold value then that path was omitted by other ants. The high pheromone level makes the other ants to proceed through that path. The current vertex is checked with the destination vertex to check whether the algorithm process has identified a path. Tests were conducted by considering all the locations within our campus, where our visually challenged students will go for their classes.

Application: All paths between the source and destinations are identified correctly and recorded. The voice guidance system is its incubation stage and surely this would help the visually challenged students to reach their destinations without others help.


Keywords

ACO, Path Identification, Ant Colonies, Ant System, Swarm Intelligence, All Possible Paths.
User
Notifications

  • M. Dorigo, V. Maniezzo, A. Colorni, Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics. 1996; 26(1), 1-10.

  • M. Dorigo, C. Blumb. Ant colony optimization theory: A survey. Theoretical computer Science. 2005; 344 (2-3), 243-278.

  • Marco Dorigo, Thomas Stutzle. Ant Colony Optimization. The MIT Press. 2004.

  • Amali Asha, S.P. Victor, A. Lourdusamy. Performance of ant system over other convolution masks in extracting edge. International Journal of Computer Applications (0975 – 8887). 2011; 16(4), 1-6.

  • W. Peng, X. Hu. A fast algorithm to find all-pairs shortest paths in complex networks. Procedia Computer Science. 2012; 9, 557-566.

  • C.L.Azevedo, J.L. Cardoso. Vehicle tracking using the k-shortest paths algorithm and dual graphs. Transportation Research Procedia. 2014; 1(1), 3-11.

  • AAljanaby, K.R. Ku-Mahamud, N.M Norwawi. Optimizing large scale problems using multiple ant colonies algorithm based on pheromone evaluation technique. International Journal of Computer Science and Network Security (IJCSNS). 2008; 8(10), 54-58.

  • N.Aljanaby, K.R. Ku-Mahamud, N.M. Norwawi. A new multiple ant colonies optimization algorithm utilizing average pheromone evaluation mechanism. Proceedings of the Knowledge Management International Conference, Langkawi, Malaysia. 2008; 531-534.

  • Dilpreetkaur, P.S. Mundra. Ant colony optimization: a technique used for finding shortest path. International Journal of Engineering and Innovative Technology (IJEIT). 2012; 1(5), 1-3.


Abstract Views: 255

PDF Views: 128




  • Path Identification Between Locations Within a Campus Using ACO

Abstract Views: 255  |  PDF Views: 128

Authors

A. Amali Asha
Loyola College, Chennai, India
T. Pramananda Perumal
Presidency College, Chennai, India

Abstract


Objectives: To identify the paths between locations within the college campus. The paths were stored to create a voice guidance system for the visually challenged students studying in our institution.

Methods: We have allotted number for locations, and each location has its neighbor’s detail. A graph was generated by this information which gives a complete outline of connection among the locations. We have generated an algorithm based on Ant Colony. The algorithm was tested first with 9 locations and it was able to exactly list out all possible paths between sources and the destination.

Findings: Once the edge between vertices has been identified by an ant, then the pheromone level is maintained in that edge should be high. The pheromone level is kept above a value called threshold value. If pheromone level on a particular edge is below the threshold value then that path was omitted by other ants. The high pheromone level makes the other ants to proceed through that path. The current vertex is checked with the destination vertex to check whether the algorithm process has identified a path. Tests were conducted by considering all the locations within our campus, where our visually challenged students will go for their classes.

Application: All paths between the source and destinations are identified correctly and recorded. The voice guidance system is its incubation stage and surely this would help the visually challenged students to reach their destinations without others help.


Keywords


ACO, Path Identification, Ant Colonies, Ant System, Swarm Intelligence, All Possible Paths.

References