检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李婷 LI Ting(Party School of Shaanxi Provincial Committee of C.P.C(Shaanxi Academy of Governance),Xi’an 710061,China)
机构地区:[1]中共陕西省委党校(陕西行政学院),西安710061
出 处:《湖北农业科学》2024年第3期255-259,共5页Hubei Agricultural Sciences
基 金:陕西省2021年度政务公开第三方评估项目(SCZC2021-CS-1289/001)。
摘 要:为了减少农村垃圾治理的运输费用,通过引入节约因子、将蚂蚁分为探索蚁和确定蚁两种分工合作模式、保留父代最优路径3个方面对蚁群算法进行改进,并将其应用于农村垃圾车回收最优路径的确定中,从而减少运输路程。将改进后的蚁群算法与最大最小蚂蚁系统进行性能对比试验,结果显示,改进后的蚁群算法在迭代次数为132次时趋于稳定,且其最优值为623.157 9,均优于最大最小蚂蚁系统。该结果说明改进后的蚁群算法的寻找最优路径性能更优,可以利用其对农村垃圾回收路径进行确定,为农村垃圾治理领域提供一个新思路。In order to reduce the transportation cost of rural garbage treatment,the ant colony algorithm was improved by introducing the saving factor,dividing the ants into two modes of labor division and cooperation of exploration ants and determining ants,and re-taining the optimal path of the parent.And it was applied to the determination of the optimal path for the recycling of rural garbage trucks,thereby reducing the transportation distance.The performance comparison experiment of the improved ant colony algorithm and the maximum and minimum ant system showed that the improved ant colony algorithm tended to be stable when the number of itera-tions was 132,and its optimal value was 623.1579,which was better than the maximum and minimum ants system.The results showed that the improved ant colony algorithm had better performance in finding the optimal path,and it could be used to determine the rural garbage recycling path,which provided a new idea for the field of rural garbage treatment.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.110.206