This specific Traveling Salesman Problem problem you will attempt to solve contains 4,663 Cities in Canada.
You are required to implement (either using C++ or Java but Java is preferred, you can use Python for visualizations) three heuristics given below:
1. Nearest Neighbor Algorithm
2. Greedy Algorithm
3. Divide and Conquer Strategy
There will be 3 algorithms.
Details are written in a pdf file. I will send you.
Code structure should be clear, I also need an explanation report about the logic behind the program, and comments near codes would be nice.
I am a PhD in Operations Research with 12 years of experience in developing and deploying TSP solutions for various organisations and institutions using Java. I am deeply expertised in the usage of Java and I can solve your assignment in quick time. I am the best person for the job. please refer my previous work in Freelancer and also search me on Google Scholar to know more about my OR/TSP/VRP expertise