C++ Neural Networks and Fuzzy Logic: Preface

DistanceTourComment

49.050−3−2−1−4−0worst case

47.590−3−1−2−4−0

45.330−2−1−4−3−0

44.860−2−3−1−4−0

44.430−3−1−4−2−0tour given by the program

44.300−2−1−3−4−0

43.290−1−4−2−3−0

43.160−1−2−3−4−0

42.730−1−2−4−3−0

42.260−1−3−2−4−0

40.000−1−4−3−2−0

38.540−2−4−3−1−0optimal tour

There are 12 different distances you can get for tours with these cities by hand calculation, and four of these

are higher and seven are lower than the one you find from this program. The worst case tour (0 [rarr] 3 [rarr] 2

C++ Neural Networks and Fuzzy Logic:Preface

Other Approaches to Solve the Traveling Salesperson Problem

373

---

[rarr] 1 [rarr] 4 [rarr] 0) gives a distance of 49.05, and the best, as you saw above, 38.54. The solution from

the program is at about the middle of the best and worst, in terms of total distance traveled.

The output of the program being all computer generated is given below as follows:

d: 0   1   2   3   4

d: 1   0   1   2   3

d: 2   1   0   1   2

d: 3   2   1   0   1

d: 4   3   2   1   0

input : 7   3

input : 4   6

input : 14  13

input : 0   12

input : 5   10

weight: 1.595769   2.393654

weight: 3.289125e−09   4.933688e−09

weight: 2.880126e−35   4.320189e−35

weight: 1.071429e−78   1.607143e−78

weight: 1.693308e−139  2.539961e−139

weight: 1.595769   2.393654

weight: 5.585192   5.18625

weight: 2.880126e−35   4.320189e−35

weight: 1.071429e−78   1.607143e−78

weight: 1.693308e−139  2.539961e−139

weight: 1.595769   2.393654

weight: 5.585192   5.18625

weight: 5.585192   5.18625

weight: 1.071429e−78   1.607143e−78

weight: 1.693308e−139  2.539961e−139

weight: 1.595769   2.393654

weight: 5.585192   5.18625

weight: 5.585192   5.18625

weight: 5.585192   5.18625

weight: 1.693308e−139   2.539961e−139

weight: 1.595769   2.393654

weight: 5.585192   5.18625

weight: 5.585192   5.18625

weight: 5.585192   5.18625

weight: 5.585192   5.18625

tour : 0 –> 3–> 1 –> 4 –> 2–> 0

(7, 3) –> (0, 12) –> (4, 6) –> (5, 10) –> (14, 13) –> (7, 3)