基于改进型果蝇算法的联运物流揽件调度仿真  

Simulation of Intermodal Logistics Pickup Scheduling Based on Improved Drosophila Algorithm

作　　者：黄继梅 陈进强[2] HUANG Ji-mei;CHEN Jin-qiang(Science and Technology College of NCHU,Jiujiang Jiangxi 332020,China;Gongqing College,Nanchang University,Jiujiang Jiangxi 332020,China)

机构地区：[1]南昌航空大学科技学院,江西九江332020 [2]南昌大学共青学院,江西九江332020

出　　处：《计算机仿真》2022年第5期125-129,共5页Computer Simulation

摘　　要：目前联运物流揽件调度方法缺乏对车辆与用户之间冲突的自适应调整能力,导致揽件路线合理性较差,成本偏高。为解决上述问题,提出基于改进型果蝇算法的联运物流揽件调度方法。从车辆与用户两方面分析约束条件,构建约束模型。描述车辆到达揽件地点的调度策略与满足的条件,构建调度模型。引入自适应策略改善传统果蝇算法的寻优步长,使全局和局部搜索能力达到平衡状态。添加有效因子与避免局部最优因子,判断果蝇味道浓度,根据浓度值大小,确定最佳个体,经过视觉定位设置果蝇飞行方向;设定算法终止条件,若满足此条件输出最优解,得到揽件调度最佳路线。仿真结果证明,算法迭代过程稳定,可获得最佳调度路线,有效降低了物流揽件过程的成本。At present,the package scheduling method of intermodal logistics lacks the adaptive adjustment ability to the conflict between vehicles and users,which affects the rationality and cost of intermodal logistics.In this paper,an improved Drosophila algorithm-based intermodal logistics pick-up scheduling method is put forward.The constraint model was constructed via vehicle and user constraints analysis.The scheduling strategy and conditions of vehicles arriving at the pick-up location were described to build the scheduling model.Based on the adaptive strategy,the optimization step of the traditional Drosophila algorithm was improved to balance the global and local search abilities.The effective factor and avoiding local optimization factor were introduced to judge the taste concentration of Drosophila melanogaster.According to the concentration value,the best individual was determined.The flight direction of Drosophila was set through visual positioning.The termination condition of the algorithm was set.Once this condition was met,the optimal solution was output to obtain the optimal route of the pickup dispatch.The simulation results show that the algorithm has a stable iterative process and low logistics picking process cost due to the acquisition of the optimal scheduling route.

关 键 词：改进果蝇算法 联运物流 揽件调度 自适应策略 约束条件 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]