Path Planning Based on Time-dependent Logistics Networks Model
Yang Jun-ya · Journal of Guangxi Normal University · 2013
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 problem 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 Dijkstra 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.