Data Structure and Algorithms C++ - repost
$30-250 AUD
Pagado a la entrega
Introduction
The Travelling Salesman Problem (TSP) is one of the most studied problems in computer
science.
C++ Programing
The aim of the problem is to find the shortest route which visits all members of a collection
of locations returning to the starting point.
Task
Your program will do the following:
1. Randomly select a number of points on a Cartesian plane with x and y co-ordinates
between 0 and 100 inclusive to be the cities for the TSP tour.
2. From the points, create a fully connected graph where the points are the vertices of the
graph. A fully connected graph has an edge from each vertex to every other vertex.
The edges will be undirected. Each edge weight will be the Euclidean distance (d)
between the two vertices for the edge:
√( ) ( )
3. Optional: The result for an optimal tour could be calculated.
a. A recursive brute force solution has a limit of 10 to 12 vertices. Implementing
this solution if you cannot get the approximation solution working will earn
some marks.
b. A dynamic programming solution has a limit of around 20 to 23 vertices.
Implementing this algorithm for comparison with the approximate solution will
enable you to earn the top marks for this assignment.
Algorithms for these two optimal approaches are presented below.
4. Calculate an approximation of the distance for the TSP tour of the randomly
generated cities using the Minimum Spanning Tree/Depth First Search algorithm
presented below.
5. Output the results of the optimal and/or approximation of the tour.
6. The program must also be able to read test files from the command line (as for
Attached is the criteria in which this project is be completed against, please peruse this before you make your bid. I will allow 1 hour of bids minimum before awarding project.
I will need to receive your first complete draft minimum 24 hours before the final delivery date. I will then provide feedback and suggestions to the first draft and send back to you for you to make appropriate amendments and resubmit to me no later than the final delivery date.
.
I will send you the original criteria sheet after I have awarded the project! Thanks
Nº del proyecto: #4571876
Sobre el proyecto
10 freelancers están ofertando un promedio de $155 por este trabajo
I'm a computing science graduate with 5+ years experience in software development. I've studied advance algorithmics and would be keen to help you with this project
I can help you with this assignment. To solve 1 we'll make a City type, then randomly generate n cities and fill them into the City array. To solve 2 we'll represent graph as a 2d-array of distances between cities. Más
I have extensive experience with algorithms and search methods, having a MSc in AI, and having TAd on these subjects. I will be able to do this quickly, implementing all 3 methods.
