本论文建立了校园卡充值点安排方案的最优化模型
建立“0-1”模型，使用“启发式贪婪算法”，运用Lingo软件计算出三个最优点。
-In this paper, the establishment of a campus card program arrangements recharge point optimization model to establish a
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001137s ]
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.064501s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001089s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001391s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000996s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003590s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001017s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004005s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015907s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001215s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 113885 [ RunTime:0.016104s ]
