No self-introduction
Loading
Profile
Follow
codes (1)
Ant colony optimization for TSP
4.0
It has been borrowed from a website .In this article, we study a possibility of solving the well-known Travelling Salesman
Problem (TSP), which ranges among NP-hard problems, and offer a implementation of theoretical overview of some methods used for solving this problem. The Ant Colony Optimization (ACO), which belongs to the group of evolutionary techniques and presents the approach used in the application of ACO to the TSP. We consider study the impact of some control parameters by implementing this algorithm. It is basically a GUI based code and alos it can take inuput of TSP or it can even randomly generate it provided few parameters are given .
rudrani 0 0
1
No more~
Follows0
Fans0