基于改进混合蛙跳和GIS的城市垃圾车回收路径优化设计

Design for Optimization of City Rubbish Collection Route Planning Based on Improved Compound Frog Hop and GIS

摘要:

针对城市生活垃圾由于回收不及时带来的二次污染加剧和现有的垃圾回收路径方案仍然成本过高的问题,设计了一种基于GIS和改进混合蛙跳算法的城市生活垃圾回收路径设计方法。首先引入了基于GIS的回收路径规划模型,以最小化垃圾回收总路径长度、车辆总费用和惩罚成本为目标建立了城市生活垃圾回收路径规划的数学模型。然后,对基本混合蛙跳算法进行了改进,提出了基于Tent映射和混沌扰动的初始种群生成方式,将规划的目标函数转换为适应度函数,为了加快算法的收敛速度,设计了一种自定义距离度量方式以衡量解之间的差异,从而实现最差解的自适应更新,以实现全局最优,最后,定义了基于GIS和改进混合蛙跳算法实现垃圾回收路径规划的具体算法。仿真实验表明：文中设计的算法能有效地实现城市垃圾回收路径规划,较其它算法相比,具有收敛速度快和寻优能力强的优点,是一种解决城市垃圾回收路径规划的可行方法。

Abstract:

Aiming at the city rubbish not in time collecting and the given rubbish collection route method still has high cost, a collection route design method based on GIS and improved shuffle frog leaping is proposed. Firstly, the collection route planning model is introduced, using minimizing the rubbish collection route distance, all the cost for vehicle, and punishment cost as the goals, the mathematical model for collection route planning is built. Then the classic shuffle frog leaping algorithm is improved, the initial population for frogs based on Tent and chaos interrupt is proposed, the goal function of planning is transformed to the fitness function. In order to improve the algorithm convergence effect, a distance measure method based on self-defined distance is designed to assure the distance between solutions, therefore, the worst solution can be renewed adaptively. Finally, the specific algorithm based on GIS and improved shuffle frog leaping algorithm to realize the rubbish collection route planning. The simulation experiment shows: the method in this paper can effectively realize the city rubbish collection, compared with the other methods, has the quick convergence rate and strong optimizing ability, therefore, it is a feasible method for solving the city rubbish collection problem.