A project created as the final project for Parallel Programming Class. The two primary concepts are the Travelling Salesman Problem (TSP) & Ant Colony Optimization (ACO). TSP involves traversing all the given cities, passing every city only once. ACO involves creating several agents to solve a problem inspired by real-life Ant Colonies.The project involves solving the Travelling Salesman Problem using using Ant Colony Optimization. Ants will be spawned at each city and will traverse each other city leaving pheromones along the path traversed. With time, the shortest path will have the highest concentration of pheromones. The project has been achieved using Java Message Passing Interface.
-
Notifications
You must be signed in to change notification settings - Fork 0
A project developed as the final project for Parallel Programming Class. The two primary concepts are the Travelling Salesman Problem (TSP) & Ant Colony Optimization (ACO). TSP involves traversing all the given cities, passing every city only once. ACO involves creating several agents to solve a problem inspired by real-life Ant Colonies.The pro…
prtkgoswami/Ant-Colony-Optimization-Travelling-Salesman-Problem-Java-MPI
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A project developed as the final project for Parallel Programming Class. The two primary concepts are the Travelling Salesman Problem (TSP) & Ant Colony Optimization (ACO). TSP involves traversing all the given cities, passing every city only once. ACO involves creating several agents to solve a problem inspired by real-life Ant Colonies.The pro…
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published