Computer Science 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...


Computer Science



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.



C<br>A<br>20<br>12<br>14<br>В<br>3<br>10<br>15<br>30<br>D<br>E<br>23<br>F<br>18/<br>4<br>H<br>LO<br>

Extracted text: C A 20 12 14 В 3 10 15 30 D E 23 F 18/ 4 H LO

Jun 09, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here