基于物流金融的动态质押物配送路径优化

发布时间：2018-03-16 09:32

  本文选题：物流企业　切入点：质押物　出处：《铁道科学与工程学报》2017年08期 　论文类型：期刊论文

【摘要】：对物流金融业务中的动态存货质押物在配送和运输过程中的路径问题进行优化研究,以存货质押物在配送过程中的总线路最小为目标,将该问题看成是VRP问题并建立数学模型,通过对模拟退火算法和遗传算法2种算法优点和缺点进行对比,得出模拟退火算法能更好解决该问题,并用算例验证该算法,该算法能够避免解陷入局部最优,最终经过迭代得出最优配送路径。
[Abstract]:This paper optimizes the path problem of dynamic inventory pledge in the process of distribution and transportation in the logistics finance business. Taking the minimum of the total route of inventory pledge in the distribution process as the goal, the problem is regarded as a VRP problem and a mathematical model is established. By comparing the advantages and disadvantages of simulated annealing algorithm and genetic algorithm, it is concluded that the simulated annealing algorithm can solve the problem better, and an example is given to verify the algorithm, which can avoid the solution falling into local optimum. Finally, the optimal distribution path is obtained by iteration.
【作者单位】： 上海海事大学物流研究中心;上海金融学院工商管理学院;
【基金】：国家自然科学基金面上资助项目(71471109) 交通部应用基础研究项目(2015329810260)
【分类号】：F253;F830;TP18
，

本文编号：1619331