首页> 中文期刊> 《计算机仿真》 >粒子群算法的物流配送路径优化研究

粒子群算法的物流配送路径优化研究

         

摘要

Logistics and distribution require timely goods delivery and lowest cost of transport, and the distribu-tion path selection is the core problem. The traditional optimization algorithm has low searching efficiency, and is dif-ficult to obtain the global optimal path, which leads to high cost of logistics distribution. In order to improve the effi-ciency of vehicle route optimization, the paper put forward a logistics and distribution routing optimization method u-sing improved particle swarm algorithm. Firstly, it built the mathematical model of logistics distribution routing. Then, particle swarm optimization algorithm was used for solving the model. The simulation results show that the im-proved particle swarm algorithm can improve the path search efficiency, find the optimal route of logistics, and reduce the logistics costs.%研究物流配送路径优化问题,物流配送路径优化要找到一条配送车辆少,路径总长度最短的最优配送路线,并具有配送快速性.传统算法搜索最优路线时间长,难以找到最优配送路线,导致物流配送成本高.为了提高快速找到物流配送路径最优配送路线,提高物流服务质量,提出一种粒子群算法的物流配送路径优化方法.首先根据物流配送路径问题的数学模型,然后全局搜索速度快的粒子群算法对模型进行求解,找到物流最优配送路线,最后通过具体实例进行仿真测试,结果表明,粒子群算法不仅能够快速找到物流配送路径最优配送路线,同时获得的路长总长度最短,有效降低物流配送成本.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号