Discrete Benchmark Functions - Self-Adaptive Heuristics for Evolutionary Computation - page 145

B Discrete Benchmark Functions

B.1 Traveling Salesman Problems

Ulysses16

TSP problem of TSPlib from Reinelt [117]: coordinates of 16 locations of
Odysseus' journey home to Ithaca, also known as Homer's Odyssey; geographical
distances; length of optimal tour f ( x ∗ ) = 6859.

Table B.1. Coordinates of problem ulysses16 , geographical distances

city latitude longitude city latitude longitude
1 38.24 20.42 9 41.23 9.10

2 39.57 26.15 10 41.17 13.05

3 40.56 25.32 11 36.08 -5.21

4 36.26 23.12 12 38.47 15.13

5 33.48 10.54 13 38.15 15.35

6 37.56 12.19 14 37.51 15.17

7 38.42 13.11 15 35.49 14.32

8 37.52 20.44 16 39.36 19.56

Berlin52

TSP problem of TSPlib from Reinelt [117]: coordinates of 52 locations in Berlin,
Germany; Euclidean distances; length of optimal tour f ( x ∗ ) = 7542.