Research on Multi-Source and Multi-Point Optimal Path Algorithm in Dynamic Logistics
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In the multi-source and multi-point environment, the path optimization involving dynamic loading and product distribution in dynamic logistics is a very complicated problem. Aiming at the diversification of goods demand in the actual distribution process and the path optimization problem of multi-vehicle delivery and high idling rate, this study proposes a new scheduling and distribution method. By establishing a vehicle loading and distribution path model, using the multi-source point multi-destination, weight correction, path optimization, etc. as constraints, a new way of simulating cell division is used to generate the next generation and improved the existing genetic algorithm to solve the problem. This method optimizes the generation of the initial population can quickly obtain the global optimal solution, jump out of the genetic premature convergence, get the best path, reduce the distribution cost and improve the distribution efficiency.

    Reference
    Related
    Cited by
Get Citation

毕明华,何利力.动态物流中多源多点最佳路径算法研究.计算机系统应用,2019,28(2):253-258

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 10,2018
  • Revised:September 06,2018
  • Adopted:
  • Online: January 28,2019
  • Published: February 15,2019
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063