Python script that fetches all user information from existing chats, channels and enrolled Telegram groups then invites to your own selected group.
Travelling Salesman Problem (TSP) is an NP-complete problem which is one of the most intensively studied problems in the fields of computational mathematics. TSP is an algorithmic problem task to find the shortest possible route that visits every city exactly once and returns to the starting point.
In this project, we implemented three different heuristics to solve the TSP problem for the 4,663 cities in the Canada:
- Nearest Neighbor Algorithm
- Greedy Algorithm
- Divide and Conquer Strategy
Primary objectives of the project ordered by their importance:
- Correctness of the implemented heuristic algorithm.
- Best result for the shortest tour.
- Running speed (efficiency) of the algorithm.
- Readability of the code.
The developed program will print following information on the console upon the execution:
- Name of the used heuristic.
- Tour path.
- Total tour length.
- Execution time.
We generated a .jar file for each heuristic algorithm (nearest.jar, greedy.jar, divide.jar), since executing the Main class from the terminal was a bit problematic. Jar files stored in “out/artifacts/Workspace” directory of the project. Executing a jar file can be done by giving following command to terminal,
`cd [PROJECT_FOLDER] &&`
`Java -jar out/artifacts/Workspace/greedy.jar`
Path of the coordinates file (.tsp) hardcoded into the program, “src/com/company/ca4663_only_coordinates.tsp”.
EULA License