Optimum path routing algorithm using ant colony optimisation to solve travelling salesman problem in wireless networks
by Ankit Verma; Jay Shankar Prasad
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 13, No. 2, 2017

Abstract: This paper proposes an enhanced clustering ant colony routing modified algorithm for use in solving standard difficulties of travelling salesman problem of wireless networks while keeping quality parameters like optimum time, optimum distance and optimum path, designed for comparison with other algorithms. The algorithm works on the field of ant colony optimisation which is a vast area in swarm intelligence, that is widespread for solving complex problems of information technology. The algorithm selects the optimum route by keeping optimum time and optimum distance as major parameters and solves the principles of optimum path routing.

Online publication date: Mon, 20-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com