On the Solutions to the Travelling Salesman Problem using Nature Inspired Computing Techniques
This paper attempts to bring forward various newly emerged
natural computing techniques to a common platform. Six such
techniques are compared among each other which have been
used to solve a well known classical problem, the travelling
salesman problem. The techniques discussed in this paper are
Ant Colony Optimization (ACO), Particle Swarm Optimization
(PSO), Bacterial Foraging Optimization Algorithm (BFOA),
Gravitational Search Algorithm (GSA), Intelligent Water Drops
(IWD), and River Formation Dynamics (RFD). In the end, some
important results have been tabularized.
Keywords: Ant Colony Optimization (ACO), Bacterial Foraging Optimization Algorithm (BFOA), Gravitational Search Algorithm (GSA), Intelligent Water Drops (IWD), Particle Swarm Optimization (PSO), River Formation Dynamics (RFD), Travelling Salesman Problem (TSP)
Download Full-Text
