采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001081s ]
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.072569s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001023s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001197s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001021s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003231s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000896s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003727s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015054s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001071s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 135788 [ RunTime:0.010974s ]
