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

3 次查看(过去 30 天)
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

回答(1 个)

Image Analyst
Image Analyst 2016-12-25
编辑:Image Analyst 2016-12-25

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by