...
首页> 外文期刊>Journal of Computers >Research on Heuristics Logistics Distribution Algorithm Based on Parallel Multi-ant Colonies
【24h】

Research on Heuristics Logistics Distribution Algorithm Based on Parallel Multi-ant Colonies

机译:基于并行多蚁群的启发式物流配送算法研究

获取原文
           

摘要

Logistics distribution problem is an important part of the modern logistics system. Suppliers need to plan a route scheme for each customer in goods distribution, which is a multi-point to multi-point problem. It is NP-hard. Through analysis of characteristics of the existing logistics system, mathematical models are constructed, by introducing the order request and the return request with multiple suppliers. With these models, we present multivendor logistics distribution optimized algorithm and heuristic logistics distribution algorithm based on parallel multi-colonies. The first algorithm takes into account customer requests, make full use of vehicle loading and reasonably choose delivery route, so that transportation costs are lower, but the time cost is higher. The second algorithm add heuristic factor and introduce metrizable ratio, which get a faster convergence rate and higher-quality global optima. Simulation results show that both of the proposed algorithms can be adapted to this problem, but the heuristic logistics distribution algorithm based on parallel multi-colonies is more effective, which can keep balance between the time overhead and the best route.
机译:物流配送问题是现代物流体系的重要组成部分。供应商需要为商品分销中的每个客户计划一个路线方案,这是一个多点到多点的问题。这是NP难的。通过分析现有物流系统的特征,通过向多个供应商介绍订单请求和退货请求来构建数学模型。利用这些模型,我们提出了基于并行多菌落的多供应商物流配送优化算法和启发式物流配送算法。第一种算法考虑了客户的需求,充分利用了车辆的装载量并合理地选择了运送路线,因此运输成本较低,但时间成本较高。第二种算法增加了启发式因子并引入了可量化的比率,从而获得了更快的收敛速度和更高质量的全局最优解。仿真结果表明,两种算法都可以适用于此问题,但是基于并行多殖民地的启发式物流配送算法更有效,可以在时间开销和最佳路线之间保持平衡。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号