Research Article

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

Table 6

Comparison against best known values using the best options for each problem.

Name of problemBestAvg.Worst% Best% Avg.% WorstBest known value

br17.105555.958100%102%105%55
br17.12555555100%100%100%55
ESC07212521252125100%100%100%2125
ESC1216751720.61791100%103%107%1675
ESC2523543378.43972140%201%236%1681
ESC4741605648.36628323%439%515%1288
ESC637380.988118%130%142%62
ft53.11061911537.412323141%153%164%7531
ft53.21100012092.113340132%145%160%8335
ft53.3132311379714236121%126%130%10935
ft53.41557916263.316793108%113%116%14425
ft70.14639048696.249623118%124%126%39313
ft70.24648549162.151920115%122%128%40422
p43.1288302910729685103%104%106%27990
p43.22889647979.556225102%169%198%28330
p43.32868029362.529555100%102%103%28680
p43.48296083393.583590100%101%101%82960
prob.42443530.7586182%218%241%243
rbg048a376412.6435107%118%124%351
rbg050c505528.7564108%113%121%467
ry48p.11865021732.225057118%138%159%15805
ry48p.21849922210.825969111%133%156%16666
ry48p.32248025029.228744113%126%144%19894
ry48p.43396134944.736421108%111%116%31446

Average124%141%154%ā€‰
Average excluding ESC47 and prob. 42112%121%129%ā€‰