基于改进蚁群算法的农村运输路径规划  

Rural transportation route planning based on ant colony algorithm

作　　者：黄二强 代永强[1] 刘欢[1] HUANG Erqiang;DAI Yongqiang;LIU Huan(College of Information Science and Technology,Gansu Agricultural University,Lanzhou 730000,China)

机构地区：[1]甘肃农业大学信息科学技术学院,兰州730000

出　　处：《智能计算机与应用》2023年第11期88-94,共7页Intelligent Computer and Applications

基　　金：甘肃农业大学青年导师基金(GAU-QDFC-2019-02);甘肃省高等学校创新基金(2022B-107,2019A-056);甘肃省自然科学基金(20JR10RA510,1506RJZA007)。

摘　　要：随着中国的经济发展,农村的农产品收购和运输越来越重要,如何科学合理地规划运输农产品的路线,是商贸企业亟需解决的一大问题。企业收购商收购农产品时,运输车辆需要规划好到各农村收购农产品的最优路径,用最少的运输成本和时间成本完成收购工作。本文中通过改进的蚁群算法为商贸企业规划运输路径。首先,简要介绍了原始的蚁群算法、退火算法、蜜獾算法;其次,对模型构建及求解做了详细分析;最后,结合实际给出到甘肃省部分农村运输路径规划的一些安排,为今后农产品的运输给出一些运输路径规划方案以供参考,对现实的运输路径规划也有一定的实际意义。With the economic development in China,the purchase and transportation of agricultural products in rural areas are becoming more and more important.How to scientifically and reasonably plan the route of transporting agricultural products is a major problem that commercial enterprises need to solve urgently.When an enterprise purchaser purchases agricultural products,transportation vehicles need to plan the optimal path to each rural area to purchase agricultural products,and complete the purchase with the least transportation cost and time cost.In this paper,the improved ant colony algorithm is used to plan the transportation path for commercial enterprises.Firstly,the original ant colony algorithm,annealing algorithm and honey badger algorithm are introduced briefly;Secondly,the model construction and solution are analyzed in detail;Finally,some arrangements for the planning of some rural transportation routes in Gansu Province are given based on the actual situation,which provides some transportation route planning schemes for the future transportation of agricultural products for reference,and also has some practical significance for the actual transportation route planning.

关 键 词：运输路径 蚁群算法 退火算法 蜜獾算法 最优路径 

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