Question: This problem comes from Optimization Modeling with SpreadSheets . In this problem, the traveling Salesman problem is solved using Genetic Algorithms. You are planning a
This problem comes from Optimization Modeling with SpreadSheets. In this problem, the traveling Salesman problem is solved using Genetic Algorithms.
You are planning a European trip. You would like to make one stop in each of 12 European Countries. You are interested in finding a tour through these 12 countries that minimizes the distance traveled. Assume you must start and end in Brussels.

Traveling (in the EU) Data 339 Amsterdam Athens From Berlin Brussels Copenhage Dublin Lisbon London Luxembour Madrid Paris Rome Amsterdam Athens 1 2 0 2166 2. 2166 0 3 577 1806 175 2092 5 622 2132 6 712 2817 2 1889 2899 8 339 2377 9 319 1905 10 1462 2313 11 430 2100 12 1297 Berlin 3 577 1806 0 653 348 1273 2345 912 598 1836 878 1184 Brussels Copenhager Dublin 4 5 6 175 622 712 2092 2132 2817 653 348 1273 0 768 732 768 0 1203 732 1203 0 1738 2505 1656 942 440 190 914 1293 2046 262 1027 743 1173 1849 Lisbon 7 7 1889 2899 2345 1738 2505 1656 0 1616 1747 600 1482 1907 TO London Luxembourg Madrid 8 9 10 319 1462 2377 1905 2313 912 598 1836 300 190 1293 942 797 2046 440 914 1452 1616 1747 600 0 475 1259 475 0 1254 1259 1254 0 331 293 1033 1419 987 1308 Paris 11 430 2100 878 262 1027 743 1482 331 293 1033 0 1108 Rome 12 1297 1053) 1184 1173 1527 1849 1907 1419 987 1308 1108 0 300 797 1452 1053 1527 Traveling (in the EU) Data 339 Amsterdam Athens From Berlin Brussels Copenhage Dublin Lisbon London Luxembour Madrid Paris Rome Amsterdam Athens 1 2 0 2166 2. 2166 0 3 577 1806 175 2092 5 622 2132 6 712 2817 2 1889 2899 8 339 2377 9 319 1905 10 1462 2313 11 430 2100 12 1297 Berlin 3 577 1806 0 653 348 1273 2345 912 598 1836 878 1184 Brussels Copenhager Dublin 4 5 6 175 622 712 2092 2132 2817 653 348 1273 0 768 732 768 0 1203 732 1203 0 1738 2505 1656 942 440 190 914 1293 2046 262 1027 743 1173 1849 Lisbon 7 7 1889 2899 2345 1738 2505 1656 0 1616 1747 600 1482 1907 TO London Luxembourg Madrid 8 9 10 319 1462 2377 1905 2313 912 598 1836 300 190 1293 942 797 2046 440 914 1452 1616 1747 600 0 475 1259 475 0 1254 1259 1254 0 331 293 1033 1419 987 1308 Paris 11 430 2100 878 262 1027 743 1482 331 293 1033 0 1108 Rome 12 1297 1053) 1184 1173 1527 1849 1907 1419 987 1308 1108 0 300 797 1452 1053 1527
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
