Implement a genetic algorithm to find a solution to the Traveling Salesman Problem for the following distance matrix:

Instructions:

• there are 15 cities indicated by 1-15. the distance from city 1 to city 1 is nothing. the distance from city 2 to city 1 is 1. the distance from city 3 to city 1 is 10and so forth.
• write the algorithm in pseudo code or in any notation you want that finds the shortest route to take between the cities.
• you do not need to implement the algorithm in a programming language.
• you are just defining and describing a solution

Answer 1

[Image Analyst]

Is this homework? If so, read this

The algorithm is described in Wikipedia:

https://en.wikipedia.org/wiki/Travelling_salesman_problem

and in 91 posts here in Answers : http://www.mathworks.com/matlabcentral/answers/?term=tsp

and here http://www.mathworks.com/help/gads/examples/custom-data-type-optimization-using-the-genetic-algorithm.html?s_tid=answers_rc2-1_p4_MLT

Have you tried searching the web???