write in python ..

the text file :

Reminder: the traveling salesman's problem is as follows: let N cities each separated by a distance D(i, j); find the shortest path passing through all the towns and returning to its starting point. In other words, it is a question of determining the shortest Hamiltonian path on a given graph. The size of the solution space is 1/2 (N-1) The use of a genetic algorithm is particularly suited to this example given the independence of potential solutions, the simplicity of creating potential solutions and given its 'relatively simple formalization. Question 1. A text file containing a list of 25 Omani cities with their latitude and longitude geolocations. 2. Solve the problem using the genetic algorithm. 2.1. Implement two different crossing techniques. 2.2. Implement two different mutation techniques. 3. Compare the different results in terms of the time consumed by each solution. 3.1. Discuss the results. 4. Change the size of the chromosome population and discuss its effect on the results. 4.1.1. Show the plot, population size versus time needed. As-sib 23.670 Salalah 17.020 Bawsar 23.530 Suhar 24.340 Eibri 23.250 As-suwaya Ruwi 23.590 Saham 24.180 Nizwa 22.920 Arrustaq Matrah 23.410 Barka 23.710 Sur 22.570 Alburaymi Bahla 22.970 Sinas 24.730 Almudaybi Masqat 23.610 Qabus 23.630 Alhaburah Almasnaah Sumail 23.300 Qurayyat Alqurm 23.600 Ibra 22.720 Hasab 26.200 58.190 54.090 58.390 56.700 56.500 23.850 57.430 58.530 56.880 57.530 23.400 57.430 58.490 57.880 59.550 24.250 55.800 57.300 56.460 22.570 58. 120 58.540 58.540 23.990 57.100 23.780 57.630 57.980 23.250 58.900 58.520 58.530 56.250 Reminder: the traveling salesman's problem is as follows: let N cities each separated by a distance D(i, j); find the shortest path passing through all the towns and returning to its starting point. In other words, it is a question of determining the shortest Hamiltonian path on a given graph. The size of the solution space is 1/2 (N-1) The use of a genetic algorithm is particularly suited to this example given the independence of potential solutions, the simplicity of creating potential solutions and given its 'relatively simple formalization. Question 1. A text file containing a list of 25 Omani cities with their latitude and longitude geolocations. 2. Solve the problem using the genetic algorithm. 2.1. Implement two different crossing techniques. 2.2. Implement two different mutation techniques. 3. Compare the different results in terms of the time consumed by each solution. 3.1. Discuss the results. 4. Change the size of the chromosome population and discuss its effect on the results. 4.1.1. Show the plot, population size versus time needed. As-sib 23.670 Salalah 17.020 Bawsar 23.530 Suhar 24.340 Eibri 23.250 As-suwaya Ruwi 23.590 Saham 24.180 Nizwa 22.920 Arrustaq Matrah 23.410 Barka 23.710 Sur 22.570 Alburaymi Bahla 22.970 Sinas 24.730 Almudaybi Masqat 23.610 Qabus 23.630 Alhaburah Almasnaah Sumail 23.300 Qurayyat Alqurm 23.600 Ibra 22.720 Hasab 26.200 58.190 54.090 58.390 56.700 56.500 23.850 57.430 58.530 56.880 57.530 23.400 57.430 58.490 57.880 59.550 24.250 55.800 57.300 56.460 22.570 58. 120 58.540 58.540 23.990 57.100 23.780 57.630 57.980 23.250 58.900 58.520 58.530 56.250