论文，:从应用的角度讨论了基于遗传算法的旅行商问题( Travelling Salesman Problem ,简称TSP) 的求解方
法,并结合实例给出了求解过程和计算机仿真结果-Solution of Travel ing Salesman Problem Based on Genetic Algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001143s ]
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.085126s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001075s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001998s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001092s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003532s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000942s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003196s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015752s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001703s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 158040 [ RunTime:0.001691s ]
