Research Article

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

Table 6

A comparative study between LSA and HGA for symmetric TSPLIB instances.

InstanceClustersLSAHGA
SolutionTimeBestSolError (%)AvgSolFTimeCTime

burma14(6, 7)36210.0036210.003621.000.000.25
ulysses16(7, 8)73030.0073030.007303.000.000.30
gr17(8, 8)25170.0025170.002517.000.000.32
gr21(10, 10)34650.0034650.003465.000.000.48
ulysses22(10, 11)81900.1781900.008190.000.000.54
gr24(11, 12)15580.1415580.001558.000.320.63
fri26(12, 13)9570.059570.00957.000.000.62
bayg29(14, 14)214421.0321440.002144.000.070.93
(9, 9, 10)240835.2224080.002408.000.000.65
bays29(14, 14)270227.3327020.002702.000.000.94
(9, 9, 10)299124.8929910.002991.000.000.66
dantzig42(20, 21)699446.566990.00699.000.001.51
(13, 14, 14)6991.026990.00699.000.021.26
(10, 10, 10, 11)6995.176990.00699.000.001.12
swiss42(20, 21)160514400.0016050.001612.330.772.75
(13, 14, 14)191914400.0019190.001923.000.531.59
(10, 10, 10, 11)194414400.0019440.001945.420.151.15
gr48(23, 24)665614400.006433−3.356433.000.072.01
(15, 16, 16)746614400.0074660.007504.720.041.58
(11, 12, 12, 12)855414400.0085540.008554.000.381.43
eil51(25, 25)57014400.00564−1.05564.000.732.27
(16, 17, 17)68914400.00681−1.16681.000.151.73
(12, 12, 13, 13)71414400.007140.00714.000.121.62

Average5659.20−0.240.151.15