Traveling Salesman Problem

$10-30 USD

Closed

Posted

almost 3 years ago

$10-30 USD

Paid on delivery

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.

Machine Learning (ML)

Project ID: 30554341

About the project

4 proposals

Remote project

Active 3 yrs ago

Looking to make some money?

Email address

Benefits of bidding on Freelancer

Set your budget and timeframe

Get paid for your work

Outline your proposal

It's free to sign up and bid on jobs

4 freelancers are bidding on average $42 USD for this job

@baltickriscoder

Dear Client, Nice to meet you.I have checked your requirement and very interested in your Algorithm job. ----------------------------------- My experience is 8+years and jobs are as follow: 1. Development Language: C/C++, C#, Java and Python. 2. Data Structure and Algorithm BST(Binary Search Tree), LinkedList, Queue, PriorityQueue, Double LinkedList, Hash, ... 3. Search Algorithm(BFS, DFS, A*, TSP) Directed, undirected Graph Algorithm 4. Sort Algorithm QuickSort, BubbleSort, RadixSort, ... 5. Cryptology Cryptology, RSA, DES, CAESAR... Hope to discuss with you. Thank you. ★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

$100 USD in 3 days