基于改进蚁群算法的易腐农产品配送路径规划研究  

Research on path planning of highly perishable agricultural product based on improved ant colony algorithm

作　　者：陈文卓 姜丰 刘萍 CHEN Wenzhuo;JIANG Fen;LIU Ping(Department of Electronics Engineering,North China Institute of Science and Technology,Langfang 065201,China)

机构地区：[1]华北科技学院电子信息工程系,河北廊坊065201

出　　处：《河北农业大学学报》2020年第3期130-135,共6页Journal of Hebei Agricultural University

基　　金：河北省高等教育教学改革研究与实践项目(2018GJJG477);中央高校教育改革项目(05020102090203-1029).

摘　　要：为了使易腐生鲜类农产品在复杂交通环境能够快速找到最优移动路径,进行考虑包括时间、油耗、罚没成本等因素在内的多目标配送,从而对综合成本与新鲜度保障进行平衡,提出了在传统蚁群算法的基础上改进转移规则,并加入含时间启发因子的影响函数。通过算例仿真,证明了改进蚁群算法的有效性和合理性,其降低了复杂程度,优化了传统蚁群算法容易陷入局部最优的问题,提升了迭代运算的收敛速度,同时降低了配送的综合成本。In order to find the optimal distribution path in complex traffic environment to deliver the highly perishable fresh food, factors like time, fuel consumption, forfeited cost are taken into account to make a balance between the total cost and freshness. An improved ant colony algorithm is proposed by changing transfer rules and adding function that contains time-inspired factor. The result given by simulation proves that the improved ant colony algorithm is effective and correct. It can decrease the algorithm complexity, get rid of the local optimization, largely increase convergence rate and reduce the total cost.

关 键 词：蚁群算法 时间启发因子 易腐农产品 成本 路径规划 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]