摘要
降低运输成本的关键是车辆最短路径优化,为此研究基于局部搜索的逆向物流车辆最短路径优化,提升车辆最短路径优化效果,降低运输成本与CO_(2)排放量。以车辆最短路径为目标函数,以车辆容量、车辆服务回收点的次数与时间为约束条件,构建逆向物流车辆短路径优化模型;通过结合局部搜素与果蝇算法求解该模型,利用果蝇算法生成果蝇路径飞行方案,通过局部搜索策略获取最优飞行方案,利用最优飞行方案更新最短路径的轨迹强度,获取最优解,完成最短路径优化。仿真结果表明,上述模型引入局部搜索策略可有效缩短最短路径总长度,提高最优解质量;上述模型优化的最短路径显著短于原始最短路径,且求解过程中收敛速度较快;应用上述模型后可有效降低运输成本与CO_(2)排放量。
The key to reduce the transportation cost is the optimization of the shortest path of vehicles.Therefore, this paper studied the optimization of the shortest path of reverse logistics vehicles based on local search to improve the efficiency of the optimization of the shortest path of vehicles and reduced the transportation cost and CO2 emissions.Taking the shortest path of vehicles as the objective function, and the vehicle capacity, the number and time of vehicle service recovery points as the constraint conditions, the optimization model of reverse logistics vehicle short path was established.The model was solved by combining local search and fruit fly algorithm, and the fruit fly algorithm was used to generate the flight plan of fruit fly path.The optimal flight plan was obtained through the local search strategy, and the trajectory strength of the shortest path was updated with the optimal flight plan, so as to obtain the optimal solution and complete the shortest path optimization.The simulation results show that the local search strategy can effectively shorten the total length of shortest path and improve the quality of optimal solution.The optimized shortest path of this model is significantly shorter than the original shortest path, and the convergence speed is faster in the solution process.The application of this model can effectively reduce transportation cost and CO2 emission.
作者
赵娆
陈志华
ZHAO Rao;CHEN Zhi-hua(Taiyuan University,Taiyuan Shanxi,030032,China;Network Information Center of Guangdong Polytechnic Normal University,Guangzhou Guangdong 510665,China)
出处
《计算机仿真》
北大核心
2022年第11期215-219,234,共6页
Computer Simulation
关键词
局部搜索
逆向物流
车辆最短路径
车辆容量
回收点
果蝇算法
Local search
Reverse logistics
Vehicle shortest path
Vehicle capacity
Collection points
Fruit flies algorithm
