ACO based shortest path between locations within a campus

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Modelling the behaviour of nature is the most inspiring field among researchers. Many algorithms are developed based on the behaviour of nature to solve problems including solution to very complex problems. Ant Colony Optimization - ACO is a best optimization algorithm used almost in all the fields to find solution to the difficult combinatorial problems. In our paper we are using ACO to find out the shortest path between the locations within the campus. This is used to give path direction to the visually challenged students within our campus to reach out the various places. The shortest path information will be used as a basis for the design of a voice monitoring system. This voice monitoring system guides the visually challenged students.

Cite

CITATION STYLE

APA

Wenisch, S. M., & Asha, A. A. (2018). ACO based shortest path between locations within a campus. TEM Journal, 7(4), 933–936. https://doi.org/10.18421/TEM74-34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free