• DocumentCode
    512452
  • Title

    Shortest path algorithm for road network with traffic restriction

  • Author

    Mu Hai-Bo ; Yu Jian-ning ; Liu Lin-Zhong

  • Author_Institution
    Dept. of Traffic & Transp. Eng., LanZhou Jiaotong Univ., Lanzhou, China
  • Volume
    2
  • fYear
    2009
  • fDate
    19-20 Dec. 2009
  • Firstpage
    381
  • Lastpage
    384
  • Abstract
    Nowadays, with the increase of traffic demand, some regulation measures have been adopted to alleviate traffic congestion. The restrictions add difficulties to the search of shortest path problems of road network, and some classical algorithms can not be adopted to find a right route. Although some researchers have presented some algorithms, intelligent optimization methods are seldom seen. In this paper, in the light of the characteristic of traffic restriction network, from the perspective of algorithm, we present a general simulated annealing algorithm that can take into account all the restrictions of real network and find the optimal solution between any two nodes efficiently without changing its structure. Finally, the algorithm is applied to a given road network and shows a higher efficiency, which validates its availability.
  • Keywords
    graph theory; road traffic; simulated annealing; regulation measure; road network; shortest path algorithm; shortest path problem; simulated annealing; traffic congestion; traffic demand; traffic restriction network; Electronic mail; Intelligent transportation systems; Optimization methods; Power engineering and energy; Road safety; Road transportation; Shortest path problem; Simulated annealing; Telecommunication traffic; Traffic control; road network; simulated annealing algorithm; the shortest path; traffic restriction;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-1-4244-4544-8
  • Type

    conf

  • DOI
    10.1109/PEITS.2009.5406759
  • Filename
    5406759