城市环卫车调度系统建模与路径规划研究  

Research on Modeling and Path Planning of Urban Sanitary Vehicle Dispatching System

作　　者：陈梅[1] 李炳辉 潘旺洋 CHEN Mei;LI Bing-hui;PAN Wang-yang(School of Electrical and Automation Engineering,Hefei University of Technology,Hefei 230009,China)

机构地区：[1]合肥工业大学电气与自动化工程学院

出　　处：《控制工程》2019年第9期1751-1755,共5页Control Engineering of China

基　　金：智能制造新模式应用项目(JZ2016GQBK0983);合肥市研究院研发资金项目(IMICN2015113)

摘　　要：为改善城市环卫车运行路线和降低总成本,以垃圾元、分拣中心、回收企业、焚烧厂和填埋场为模型背景建立城市环卫车调度系统路径规划数学模型。将遗传算法与禁忌搜索算法的混合算法应用到环卫车路径规划中,以总成本最小化为目标函数。依据实际案例进行算法设计与仿真。仿真结果表明该算法收敛性好,具有良好的可行性与可操作性。本文所得结论对改善城市环卫车运行路线和降低总成本具有十分重要的意义。In order to improve the running route of urban sanitary vehicle and reduce the total cost,this paper builds a mathematical model of path planning for urban sanitation vehicle dispatching system with garbage,sorting center,recycling enterprises,incineration plant and landfill.The hybrid algorithm of genetic algorithm and tabu search algorithm was applied to the path planning of sanitation vehicle,and the total cost was minimized as the objective function.The algorithm was designed and simulated according to the actual case.The simulation result shows that the algorithm has good convergence and good feasibility and operability.The conclusion of this paper is of great significance to improve the operation route of urban sanitation vehicles and reduce the total cost.

关 键 词：环卫车调度 路径规划 遗传算法 禁忌搜索算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] U469.691[自动化与计算机技术—控制科学与工程]