Research on Traffic Assignment Problem in a Multimodal Hyper-Graph

Based the theory of hyper-graph, a multimodal hyper-graph is given in this work. Taking into account many factors such as route travel time, transfer times and comfort, route generalized cost function is established. On this basis, the meaning of effective route is redefined, and combined with the search algorithm in graph theory, an improved Dial algorithm is proposed. In this work, the improved Dial algorithm is used to solve the problem of urban multimodal traffic assignment. At the end of the work, an example is given to verify the feasibility and effectiveness of the algorithm. The results show that the improved Dial algorithm is suitable for solving the urban multimodal traffic assignment problem, and avoided the abnormal results that may appeared when use the original Dial algorithm to solve the problem.