| 城市垃圾收集车辆弧路径问题研究 |
| |
| 引用本文： | 刘洁,何彦锋.城市垃圾收集车辆弧路径问题研究[J].成都大学学报(自然科学版),2013,32(4):423-426. |
| |
| 作者姓名： | 刘洁 何彦锋 |
| |
| 作者单位： | 成都大学城乡建设学院,四川成都,610106;中国水电顾问集团成都院,四川成都,610072 |
| |
| 基金项目： | 四川省教育厅自然科学基金（13ZB0339）、成都大学校科技基金（2013xJz02）资助项目. |
| |
| 摘 要： | 考虑部分街道单行及转向限制等状况，采用带有转向禁忌条件的垃圾收集车辆弧路径问题模型对城市垃圾收远路线进行优化．通过建立将其转换为对应的点路径问题的求解模型以减少问题规模，并利用一种聚类蚁群算法对该问题进行求解．优化实例结果表明：有、无转向约束的路线优化后，总路程分别减少了89984．96m和92330．04m，分别节约了31．1％和31．9％，优化效果明显；优化后减少了需求车辆数，降低了车辆使用成本和人员雇佣成本．
|
| 关 键 词： | 城市垃圾收运 车辆弧路径问题(VARP) 蚁群算法 |
Research on Arc Routing Problem of Waste Collection Vehicles |
| |
| LIU fie,HE Yanfeng.Research on Arc Routing Problem of Waste Collection Vehicles[J].Journal of Chengdu University (Natural Science),2013,32(4):423-426. |
| |
| Authors: | LIU fie HE Yanfeng |
| |
| Institution: | 1 .School d Urban and Rural Construction, Chenlu Univeity, Chengdu 610106, China; 2. HydroChina Chengdu Engineering Corporation, Chengdu 610072, China) |
| |
| Abstract: | Considering some street conditions such as one-way and turn constraints, this paper proposes an arc routing problem model of waste collection vehicles with turn constraints to optimize municipal solid waste （MSW） collection routes. In order to reduce the size of the problem,we establish new solving model by converting it to the corresponding point path problem. Then, we use this new solving model and the ant colony clustering algorithm to solve it. The results of optimization in shuangnan district of chengdu indicate that the length of saving routes is 89 984.96 m and 92 330.04 m respectively with or without turn con- straints, representing savings of 31.1% and 31.9% respectively.The effect of optimization is obvious.After optimization, vehicle demands decrease, and operating costs of vehicle and hiring costs of personnel de- |
| |
| Keywords: | conection and transportation of MSW vehicle arc routing problem ant colony clustering algo-rithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
