Project Abstract

ACO's to solve TSP problem

Abstract

In general, the class of NP problems are not possible to solve using traditional deterministic methods.Of these problems, the Travelling Salesperson problem is a classic example, where the solution space becomes exponentially large even for a problem of moderate size. In this paper, we use Ant Colony optimisationtechniques to attack the TSP problem, using the stochastic Ant System metaheuristic. In the paper, we will show how the AS metaheuristic converges to near-optimal results within a bounded time, outperforming deterministic greedy heuristics.

By

Akshay Joshi (9765971060)(BEIT)

C G Nitash (BEIT)

Anish Sawkar (BEIT)