Dissertation > Excellent graduate degree dissertation topics show

Research on Problem of Efficient Paths for Urban Rail Transit

Author: GuoYanYun
Tutor: MaoBaoHua；SunQuanXin
School: Beijing Jiaotong University
Course: Transportation Planning and Management
Keywords: Urban Rail Transit Generalized cost function Valid path BFS algorithm Ride comfort
CLC: U239.5
Type: Master's thesis
Year: 2011
Downloads: 156
Quote: 1
Read: Download Dissertation

Abstract

With the accelerated pace of urban rail transit construction, the expansion of the route network and improve the structure of the rail transit network coupled degrees higher and higher, the different station transfer will be more frequent, using the \the inevitable result of the development of the rail transport network in the future. At the same time, due to the diversity of the people understand the cost differences and the path of travel path, leading to passenger travel path more difficult to master. Therefore, in-depth analysis of the impact of passenger route choice factors determine Passenger Route collection will become particularly important. Only a scientific and rational grasp passenger travel route choice behavior, in order to accurately grasp the laws of passenger travel, to determine passengers travel path, and ticket settlement between the forecast on the future of urban rail transit operators organization management and different carriers to provide the basis and support. Based on the passenger travel behavior of urban rail transit, take full account of the main factors affect passenger route choice, expand the generalized cost function. Restrictions by increasing the number of transfers to redefine a valid path, and to design effective path algorithm. The main contents and conclusions of the paper are as follows: (1) for the special nature of the urban rail transit network, transfer node special treatment to build a rail transit network topology. The network topology based on the mathematical modeling of the relationship between the basic elements of the rail transport network, including the station relations, section relationship between line relationship for valid path solution and elements stored in the computer mathematics foundation. (2) on the basis of fully consider the passengers Ride Comfort Improved Passenger Route Choice generalized cost function. The path selected by analyzing the impact on passenger travel time, transfer time, such as the main factor for determining passenger travel valid path range premise. Due to the sensitive travelers transfer costs, restrictions by increasing the number of transfers, re-definition of a valid path. The decrease in the definition does not meet the actual travel path. (3) Based on the definition of a valid path, BFS-based path search algorithms. BFS algorithm is a path enumeration algorithm, lower efficiency, the improved algorithm proposed by BFS key node to determine the effective path, and the example verification. Example studies have shown that the BFS path search algorithm relative both algorithms with high operating efficiency, saving storage space to meet the conditions will not be missing a valid path for the belt loop network. (4) travel costs for different categories of passengers understand the difference and set different parameters and comparative analysis of the effective path selection results. The results showed that the increased transfer times to limit conditions makes effective path more in line with the scope of the actual situation. Effective path by solving the OD point, based on the generalized cost model Ride Comfort validation and model parameter sensitivity analysis. The results of the survey data transfer traffic comparative analysis, indicating the Ride comfort is an important factor to affect the choice of the path, and some of the transfer station, consider transfer to the the Comfort Ride flow results closer to the actual data.

Related Dissertations

CLC: > Transportation > Rail transport > Special railway > Urban railway, suburban railway
© 2012 www.DissertationTopic.Net Mobile