An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
Table 5
Comparison against best known values with TSPLIB problem set.
Name of problem
(%) Best value*/best known
Min
T1S1**
T1S2
T2S1
T2S2
T1S1F
T1S2F
T2S1F
T2S2F
br17.10
100%
100%
101%
103%
100%
100%
100%
100%
100%
br17.12
100%
100%
100%
103%
100%
100%
100%
100%
100%
ESC07
100%
100%
100%
103%
100%
100%
100%
100%
100%
ESC12
100%
100%
100%
100%
100%
100%
100%
100%
100%
ESC25
142%
155%
144%
150%
140%
156%
146%
146%
140%
ESC47
363%
373%
365%
351%
378%
373%
345%
323%
323%
ESC63
119%
120%
125%
122%
122%
118%
119%
122%
118%
ft53.1
152%
141%
143%
152%
145%
141%
144%
145%
141%
ft53.2
141%
138%
132%
138%
137%
134%
136%
136%
132%
ft53.3
121%
123%
123%
126%
125%
121%
122%
125%
121%
ft53.4
122%
108%
129%
128%
125%
108%
130%
111%
108%
ft70.1
128%
118%
121%
120%
125%
121%
124%
123%
118%
ft70.2
115%
123%
122%
124%
118%
118%
118%
125%
115%
p43.1
111%
104%
103%
103%
107%
103%
104%
112%
103%
p43.2
110%
103%
117%
114%
109%
102%
111%
108%
102%
p43.3
107%
101%
106%
100%
103%
102%
103%
102%
100%
p43.4
106%
101%
107%
106%
102%
100%
104%
102%
100%
prob.42
190%
182%
197%
196%
192%
187%
189%
191%
182%
rbg048a
111%
107%
112%
107%
108%
107%
111%
115%
107%
rbg050c
118%
108%
126%
118%
115%
109%
120%
117%
108%
ry48p.1
126%
121%
118%
123%
122%
122%
122%
122%
118%
ry48p.2
121%
111%
122%
115%
117%
116%
119%
124%
111%
ry48p.3
119%
113%
119%
121%
115%
115%
118%
124%
113%
ry48p.4
116%
111%
108%
108%
111%
108%
108%
112%
108%
avg
131%
128%
131%
130%
130%
128%
129%
129%
The best value obtained by the adaptive evolutionary algorithm.
**T: termination option, 1 = the first option, 2 = the second option. S: selection option of chromosomes, 1 = the first option, 2 = the second option. F: funeral option if applied.
