基于时间依赖的物联网络模型的路径规划  

Path Planning Based on Time-dependent Logistics Networks Model

作　　者：杨俊瑶[1] 蒙祖强[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《广西师范大学学报（自然科学版）》2013年第3期152-156,共5页Journal of Guangxi Normal University:Natural Science Edition

基　　金：国家自然科学基金资助项目(61063032);广西自然科学基金资助项目(2012GXNSFAA053225)

摘　　要：本文针对基于物联网的物流网络中路径代价的时变性,建立一种时间依赖的物联网络模型,并在此基础上研究物流路径规划问题。针对现实中预测准确性随时间推移而降低,以及在预知程度较低时无法获得较好的路径规划等问题,提出一种带弧代价预知程度参数的最小时间路径算法SW PL以及基于SW PL的逐步规划解决方案。该算法考虑了预测的精度问题,在传统Dijkstra算法的基础上引入一种与时间相关的弧代价计算方法。实验表明,在预知程度较高和在预知程度较低但采用逐步规划的解决方案2种情况下,都能取得良好的路径规划效果。For the cost of path in logistics networks based on Internet in which things are always varying with time,this paper proposes a time-dependent networks,and studies the logistics path planning prob-lem based on it. For the accuracy of predict decreasing with time in reality,and when the predict level is low it is hard to get a good path planning result,a minimum-time path algorithm with arc cost predict level parameter （SWPL） and a solution with step by step strategy based on SWPL. In this algorithm,the accuracy of predict is taken into consideration,and an arc cost computing method based on traditional Di-jkstra algorithm. The experimental result shows that a good path planning result can be obtained when the predict level is high or when the predict level is low but step by step solution is applied.

关 键 词：物联网 路径规划 时间依赖网络 最小时间路径算法 

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