tsp问题，是一个很典型的NP完全问题，该程序用了遗传―退火结合算法，能优化计算-tsp problem is a typical NP-complete problem, the program is to use genetic- combined annealing algorithms that optimize computing
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001518s ]
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.090101s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001643s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001259s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001852s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003109s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000771s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003807s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014946s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001203s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 173224 [ RunTime:0.024236s ]
