时变路网下VRP准时路径的选择  

VPR Routing Selection Based on Time-Varying Network

作　　者：宋少忠[1,2] 孔繁森[2] 

机构地区：[1]吉林工商学院信息工程分院,长春130062 [2]吉林大学机械科学与工程学院,长春130022

出　　处：《吉林大学学报（理学版）》2012年第2期309-314,共6页Journal of Jilin University:Science Edition

基　　金：吉林省自然科学基金(批准号:201105064);吉林省教育厅"十一五"科技规划研究项目(批准号:2010222;2012377)

摘　　要：基于节约里程法求解多回路运输问题(VRP),得到了在时变路网下要求准时性高的路径选择问题.考虑时变路网中顺畅和拥堵概率,路径最短不一定用时最少,通过实例对距离、时间、费用等因素进行分析、拟合,对比了不同因素下路径选择和时限内的准时稳定性等情况.结果表明,优化后的配送路径可以保证配送的稳定性.Solving the problem of VRP by saving algorithm the author obtained the r outing selection with punctuality in the time-varying road network.Considering the smoo th and congestion of traffic in the time-varying road network,the shortest path does not spend the least time.The factors of distance,time limit,cost and reli ability were analyzed and fitted combined with the cases of routing selection and the punctuality under the conditions of different factors compared.The results show that optimized distribution path can ensure the stability of distribution.

关 键 词：多回路运输问题(VRP) 时变路网 节约算法 路径选择 物流 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]