Travelling salesperson problem with the minimum spanning tree heuristic.

The traveling salesperson problem (TSP)

can be solved with the minimum- spanning-tree (MST) heuristic, which estimates the

cost of completing a tour, given that a partial tour has already been constructed. The MST

cost of a set of cities is the smallest sum of the link costs of any tree that connects all the


1 Model this problem as a search problem, including, how to define the state space,

start states, operators, path cost and goal state. Show that how the MST heuristic can

be derived from a relaxed version of the TSP, and it is admissible.

2 Write a problem generator for instances of the TSP where cities are represented by

random points in the unit square.

3 Find an efficient algorithm for constructing the MST, and use it with the A * graph

search to solve instances of the TSP.

4 Implement an A* search algorithm to solve the problem. How far can you go with the

A* approach, as the problem size (#cities increases) increases, record the time

(measured by the number of nodes explored) and space (measured by the maximum

number of nodes stored in the open list during the program execution) needed for a

certain size of problem.

5 When the problem size increase, A* runs out of memory. So implement the SMA* to

solve the memory limit problem. Put a fixed limit on the number of nodes that you

can store in open list, show that with the same amount of memory available, SMA* is

able to solve larger size of problem while A* cannot solve. What is the solution found

by SMA*, is it optimal?

6 Sometimes you need find a solution within limited amount of time, you need trade off

the computation time with the solution quality. Modify the A* to an anytime A* and

try it with different w values, record the results you get. Show the multiple different

solutions found by the anytime A* as search time increases.

7 Implement a GUI that allows the choices of #cities, memory size (#nodes) and the

algorithm to run, and demonstrate the solution both graphically and numerically.

Skills: PHP, Software Architecture

See more: show heuristic can derived relaxed version tsp, minimum traveling salesperson, problem generator cities random points unit square, traveling salesperson smallest increase algorithm, mst heuristic, minimum spanning tree problem, anytime, smallest increase heuristic tsp, what is the algorithm, what is an algorithm, what is algorithm, tree of a graph, tree in algorithm, tree graph java, tree graph, tree and graph, to the maximum, the limited, the graph, the algorithm is, the algorithm, sum tree, sum of the solutions, solution algorithm, smallest amount of time

About the Employer:
( 0 reviews ) United States

Project ID: #2566568

3 freelancers are bidding on average $192 for this job


Custom software development: w w w . The Administrator removed this message for containing contact details which breaches our Terms of Service . i o

$250 USD in 1 day
(0 Reviews)

Sir, I can do this.Thanks.

$100 USD in 15 days
(0 Reviews)

Hi, I have made this project using different algorithms using java swing. It took me 2 years to develop this project and I can assure you that this calculates very accurately the shortest path between the number of More

$225 USD in 2 days
(0 Reviews)