Show how to apply genetic algorithm to generate a path for traveling from city A to city D in a shortest distance from the following map. Each number denotes the distance between two cities. You just provide the following details: (1) how to encode the cities in forms of chromosomes, (2) the steps of genetic algorithm specifically used for this problem, (3) cost function or some process to check that the traveling path is shortest. You do not have to show the actual distance.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here