Research Article

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

Table 5

A comparative study between LBDCOMP and HGA for asymmetric TSPLIB instances.

InstanceClustersLBDCOMPHGA
SolutionTimeBestSolError (%)AvgSolFTimeCTime

ftv33(16, 17)15845.111501−5.241502.160.121.01
(9, 24)15095.871501−0.531503.240.131.25
(3, 30)13565.0013560.001359.150.181.63
ftv35(17, 18)174711.321731−0.921739.290.411.13
(10, 25)16603.4616600.001663.340.321.26
(3, 32)152713.8915270.001533.130.421.41
ftv38(19, 19)16814.1316810.001686.060.961.35
(11, 27)16897.6516890.001692.250.221.53
(3, 35)157317.6615730.001586.000.162.11
ftv44(22, 22)193524.9219350.001940.230.171.75
(13, 31)18307.9018300.001852.120.472.01
(4, 40)167048.7116700.001689.000.402.72
ftv47(23, 24)247010.0624700.002526.240.781.93
(13, 34)234910.492257−3.922281.271.152.42
(4, 43)19575.9319570.002006.311.523.17
ftv55(27, 28)22996.002219−3.482248.240.712.60
(16, 39)19378.1519370.001982.122.073.06
(5, 50)176332.0617630.001788.241.164.48
ftv64(32, 32)265828.5426580.002686.152.153.68
(19, 45)238365.2723830.002494.112.984.37
(6, 58)2006110.9320060.002048.212.246.38
ftv70(35, 35)2308135.8623080.002341.301.304.11
(21, 49)2244102.6922440.002267.242.724.79
(7, 63)2134323.3121340.002163.324.607.37
ftv90(45, 45)175617.7117560.001833.785.286.93
(27, 63)171056.7117100.001784.805.558.46
(9, 81)157968.2415790.001653.225.7914.43
ftv100(50, 50)200824.1320080.002084.174.898.90
(30, 70)1903143.5119030.001969.667.5911.88
(10, 90)1788187.4917880.001904.1511.7219.27
ftv110(29, 27, 27, 27)2410289.1924110.042490.806.087.48
ftv120(30, 30, 30, 30)257183.9625710.002596.235.669.04
ftv130(34, 32, 32, 32)2747331.6727510.152817.565.9511.20
ftv140(35, 35, 35, 35)2941571.4429470.203071.2610.0213.23
ftv150(39, 37, 37, 37)311981.4231200.033265.267.9415.79
ftv160(40, 40, 40, 40)3561754.5435800.533696.1812.5118.34
ftv170(44, 42, 42, 42)3927297.713891−0.923992.0115.3622.39

Average105.48−0.383.566.35