Consider the Traveling Salesman Problem which is NP-complete…
Consider the Traveling Salesman Problem which is NP-complete. In this problem, you are given a list of cities and the distance between each pair of cities. Typically, this is represented by a complete graph G(V,E) of vertices V representing the cities and edge lengths E representing the distance between each pair of cities. The goal of this problem is to find the shortest path that visits each city exactly once and returns to the origin city. How would you design a fitness function to use in a genetic algorithm for the Traveling Salesman Problem? You may assume that paths that do not meet the requirements of the problem have fitness zero.
Read Details