J4 ›› 2013, Vol. 26 ›› Issue (5): 78-83.doi: 10.3976/j.issn.1002-4026.2013.05.015

• Tranfic and Transportation • Previous Articles     Next Articles

Hypergraph based stochastic multimodal  traffic network assignment problem

 ZHENG Li-Xiang, SI Bing-Feng   

  1. School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
  • Received:2013-05-10 Online:2013-10-20 Published:2013-10-20

Abstract:

      We constructed a multimodal traffic network model based on the theory of hypergraph.Generalized route cost function was established with such influential factors as route travel time, transfer times and congestion. The concept of an effective route was further redefined. We presented the searching algorithm of all viable routes with depthfirst ergodic algorithm and backtracking algorithm. We also implemented stochastic network assignment of traffic flow in multimodal traffic network with improved Dial algorithm. The feasibility and effectiveness of the improved Dial algorithm were verified with the multimodal traffic network. Results show that the algorithm is applicable for solving stochastic network assignment of traffic flow in multimodal traffic network, and for avoiding the unreasonable results that may appear in original Dial algorithm.

Key words: hypergraph, multimodal travel, generalized route cost, traffic assignment, Dial algorithm

CLC Number: 

  • U121