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

Based on logistics financial distribution route optimization of dynamic pledge

作　　者：黎芯郁 王晓光[2] LI Xinyu;WANG Xiaoguang(Logistics Research Center, Shanghai Maritime University, Shanghai 201306, China;School of Business Administration, Shanghai Finance University, Shanghai 201209, China)

机构地区：[1]上海海事大学物流研究中心,上海201306 [2]上海金融学院工商管理学院上海201209

出　　处：《铁道科学与工程学报》2017年第8期1775-1782,共8页Journal of Railway Science and Engineering

基　　金：国家自然科学基金面上资助项目(71471109);交通部应用基础研究项目(2015329810260)

摘　　要：对物流金融业务中的动态存货质押物在配送和运输过程中的路径问题进行优化研究,以存货质押物在配送过程中的总线路最小为目标,将该问题看成是VRP问题并建立数学模型,通过对模拟退火算法和遗传算法2种算法优点和缺点进行对比,得出模拟退火算法能更好解决该问题,并用算例验证该算法,该算法能够避免解陷入局部最优,最终经过迭代得出最优配送路径。This paper focuses on the optimization of the routing problem in the distribution and transportationprocess in the logistics dynamic pledge.The total path of pledge in the distribution process was taken as theobjective function and the problem was regarded as the Vehicle Routing Problem.A mathematical model was setup,and the simulated annealing algorithm was adopted through the comparison between the genetic algorithm andthe simulated annealing algorithm.An example was calculated to verify the algorithm.The algorithm can avoidthe solution falling into local optimum solution and it can obtain the optimal distribution path through iteration.

关 键 词：物流企业 质押物 模拟退火算法 配送路径优化 

分 类 号：U116.2[交通运输工程]