J4 ›› 2012, Vol. 50 ›› Issue (02): 309-314.

Previous Articles     Next Articles

VPR Routing Selection Based on TimeVarying Network

SONG Shaozhong1,2, KONG Fan sen2   

  1. 1. Department of Information Engineering, Jilin Business and Technology College, Changchun 130062, China;2. College of Mechanical Science and Engineering, Jilin University, Changchun 130022, China
  • Received:2011-09-07 Online:2012-03-26 Published:2012-03-21
  • Contact: SONG Shaozhong E-mail:shshry@163.com

Abstract:

Solving the problem of VRP by saving algorithm the author obtained the  routing selection with  punctuality in the timevarying road network. Considering the smooth 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 reliability 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.

Key words: vehicle roiting problem(VRP); , timevarying network; saving algorithm; route choice; logistics

CLC Number: 

  • TP39