Bitonic Travelling Salesman Problem
$30-5000 USD
Pago na entrega
Implement a Bitonic Travelling Salesman program; the tour of cities will go left to right (increasing X coordinate), followed by a pass from right to left (decreasing X coordinate). Use dynamic programming to find the Optimal length of the tour, and print out what tour you use. For example, if the cities are as shown below, an optimal tour would be 0->1->3->4->2->0. City Number X Y 0 0 0 1 10 10 2 15 0 3 20 10 4 30 0 Chapter 16 has some discussion of this problem. Read through that carefully, and I'll also answer some questions in class. The input files consist of a series of lines, each with two integers (separated by a space). The first line is city 0, the second is city 1, etc. The cities will be listed by increasing X coordinate, an your tour should begin and end with city 0 (the leftmost city). No two cities will have the same X coordinate. There will be at most 200 cities in your tour. Calculate the distance between a pair of cities as their Euclidean distance (DX = x1 - x2; DY = y1 - y2; distance = sqrt(DX*DX + DY*DY)).
## Deliverables
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Platform
Needs to run on Sun Solaris machines or plain old Unix machines, and Windows 2000.
ID do Projeto: #2839702
Sobre o projeto
11 freelancers estão ofertando em média $64 nesse trabalho
