Solving vehicle routing problems with time window by using simulated annealing, tabu search, variable neighborhood search, greedy randomized adaptive search procedure and ant colony algorithms.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002787s ]
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.178919s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001244s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002099s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001497s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.006062s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000896s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003641s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015452s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001077s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 256192 [ RunTime:0.013752s ]
