Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
文 件 列 表
R-Opt-Lin-Kernighan src bin .classpath .project Spot.csv testfile.csv
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.000913s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.087515s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000880s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001071s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000994s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.002855s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000846s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003442s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.017377s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001575s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 183294 [ RunTime:0.036535s ]
