Computational Intelligence and Neuroscience / 2016 / Article / Tab 3

Research Article

Solving the Traveling Salesman’s Problem Using the African Buffalo Optimization

Table 3

Comparative experimental result.

ProblemNumber of citiesOptimaMethodBestMeanRel. err. (%)Time (s)

Berlin52ABO754276160%0.002
ACO7548.997659.311.52116.67
527542ABC9479.1110,390.2637.722.17
HA7544.377544.370.0360.64

St70ABO676678.330.150.08
ACO696.05709.164.73226.06
70675ABC1162.121230.4981.733.15
HA687.24700.583.47115.65

Eil76ABO538563.040%0.03
76538ACO554.46561.983.04271.98
ABC877.28931.4470.783.49
HA551.07557.982.31138.82

Pr76108159ABO108167108,3960.007%0.08
76ACO115,166.66116,321.227.55272.41
ABC195,198.9205,119.6189.653.50
HA113,798.56115,072.296.39138.92

Kroa10021282ABO2131122163.80.4%0.00
100ACO22,455.8922,880.127.49615.06
ABC49,519.5153,840.03152.945.17
HA22,122.7522,435.315.40311.12

Eil101629ABO6406401.7%0.027
101ACO678.04693.427.96527.42
ABC1237.311315.95104.885.17
HA672.71683.396.39267.08

Ch1506528ABO653266010.06%0.032
150ACO6648.516702.872.611387.65
ABC20,908.8921,617.48230.938.95
HA6641.696677.122.21698.61

Tsp2253916ABO391739820.030.09
225ACO4112.354176.088.224038.75
ABC16,998.4117,955.12365.279216.68
HA4090.544157.857.742037.33