Travelling salesman problem involves

Assignment Help MATLAB Programming

Reference no: EM13161698

The Travelling Salesman problem involves a salesman who has to visit a number of cities in a single closed tour. The salesman always starts and ends the tour in his home city and visits each other city on the tour exactly once. The problem is to minimise the overall amount of distance travelled. This problem arises in many other situations familiar to engineers. For instance, the design of electrical wiring in a building or in a car, the optimisation of the movement of a read-write head on a disk drive, the planning of airliners movements, the design of bus routes or garbage collection truck routes.

You are required to design and implement a GUI that demonstrates a possible solution to the problem. The optimisation procedure is described in this assignment sheet.

Write a MATLAB GUI driven program to demonstrate the solution to the TSP. The program must show a graphical display of the 2-dimensional map, with the cities suitably displayed on the map. You can observe an example of this by running the MATLAB demo program travel. Run this demo and you will see one possible approach. We will use a different approach and you may use your imaginations in designing your solution. It need not necessarily be similar to the demo.

Only one command per line is allowed
Document your functions clearly with comments
Use meaningful variable and function names
Structure your program so that functions perform small and well-defined tasks.
The user should be able to try and optimise the same set of cities multiple times. The program must therefore seed the random number generator from the system clock each time it is run. Use MATLAB help function to find out more about random numbers and seeding the random number generator.

Reference no: EM13161698

Questions Cloud

Analyze the potential readability : Analyze the potential readability problems with using closure reserved words for control statements that are the reverse of the corresponding initial reserved words

Use a define statement to create a constant : Follow these specifications: Use a define statement to create a constant that will hold your student number. You should have separate string variables for your first and last name; name these first_name and last_name.

Perform the acyclic-topological sort algorithm : Perform the acyclic-topological sort algorithm on the directed graph having vertex set a-k and edges {(j; a);(j; g);(a; b);(a; e);(b; c);(c; k);(d; e);(e; c);(e; f);(e; i);(f; k); (g; d);(g; e);(g; h);(h; e);(h; i);(i; f);(i; k)} Show the state of th..

Prove by solving the equations using laplace transform : For a RC circuit, we can use Laplace transforms to show that when we apply a step input of 5V, the voltage across the capacitor rises exponentially to a final value equal to step input.

Travelling salesman problem involves : The Travelling Salesman problem involves a salesman who has to visit a number of cities in a single closed tour. The salesman always starts and ends the tour in his home city and visits each other city on the tour exactly once.

Determine the number of bonding electrons : Determine the number of bonding electrons and the number of nonbonding electrons in the structure of BeF_2 please Enter the number of bonding electrons followed by the number of nonbonding electrons

Write a method called printlevel : Write a method called printLevel that takes an integer n as a parameter and that prints the values at level n from left to right. The values should be printed one per line.

Predict the mass of the most abundant fragment signal : Predict the mass of the most abundant fragment signal in the mass spectrum of 2,2-dimethylpentane. 85 amu 29

Identify the first character of the name and lengthof length : Write a Java application that stores the names of your family and friends in a one-dimensional array of Strings. The program should show all names in upper case and lower case, identify the first character of the name, and the lengths of the names.

User Account

All Pages