Computer Science ›› 2011, Vol. 38 ›› Issue (12): 110-112.

Previous Articles     Next Articles

Routing Mechanism Based Algorithm for Fast Path Generation in Variable-Weight Network

  

  • Online:2018-12-01 Published:2018-12-01

Abstract: There are a mass of redundant calculations when vast vehicles generate their pathes in the large-scale traffic flow simulation. In order to reduce the redundant calculation and improve the speed of path generation, a routing mechanism based algorithm for fast path generation in variable-weight network was proposed. The algorithm introduced the routing mechanism of network into traffic flow simulation system and took each road intersection as a muter. It disassembled and stored the calculated shortest path tree into each relevant muter as the guiding information like the next direction from A to B is C. Each vehicle got its next driving direction by visiting the current muter when it drove to an intersection. As historical data, the stored guiding information would also improve the speed of future path generation. Furthermore, the algorithm would update the relative region on time when the weight of road network was changed and thus the path of each vehicle is still reasonable and considerable. hhe experimental results show that this algorithm can reduce the repetitive calculation and improve the speed of path generation.

Key words: Traffic flow simulation, Path generation, Routing mechanism, Dynamic road network

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!