Optimum path routing algorithm using ant colony optimisation to solve travelling salesman problem in wireless networks

摘要

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.