The transit network design and frequency setting problem is related to the generation of transit routes with corresponding frequency schedule. Considering not only the influence of transfers but also the delay caused by congestion on passengers’ travel time, a multi-objective transit network design model is developed. The model aims to minimize the travel time of passengers and minimize the number of vehicles used in the network. To solve the model belongs to a NP-Hard problem and is intractable due to the high complexity and strict constraints. In order to obtain the better network schemes, a multi-population genetic algorithm is proposed based on NSGA-II framework. With the algorithm, network generation, mode choice, demand assignment, and frequency setting are all integrated to be solved. The effectiveness of the algorithm which includes the high global convergence and the applicability for the problem is verified by comparison with previous works and calculation of a real-size case. The model and algorithm can be used to provide candidates for the sustainable policy formulation of urban transit network scheme.
In the process of urban rail transit network design, the urban road network, urban trips and land use are the key factors to be considered. At present, the subjective and qualitative methods are usually used in most practices. In this paper, a quantitative model is developed to ensure the matching between the factors and the urban rail transit network. In the model, a basic network, which is used to define the roads that candidate lines will pass through, is firstly constructed based on the locations of large traffic volume and main passenger flow corridors. Two matching indexes are proposed: one indicates the matching degree between the network and the trip demand, which is calculated by the deviation value between two gravity centers of the stations’ importance distribution in network and the traffic zones’ trip intensity; the other one describes the matching degree between the network and the land use, which is calculated by the deviation value between the fractal dimensions of stations’ importance distribution and the traffic zones’ land-use intensity. The model takes the maximum traffic turnover per unit length of network and the minimum average volume of transfer passengers between lines as objectives. To solve the NP-hard problem in which the variables increase exponentially with the increase of network size, a neighborhood search algorithm is developed based on simulated annealing method. A real case study is carried out to show that the model and algorithm are effective.
The construction of urban rail transit (URT) guides and promotes urban development. Different URT line construction schedule, including construction sequence (priority order of line construction) and construction timing (when to build), will have different effects on urban traffic and development. Therefore, the planning of construction schedule is an important part of URT network planning. At present, the determination of construction schedule is mainly based on qualitative analysis methods (i.e., experience, comparisons with other cities, and expert opinion) in engineering practice. In this study, based on an analysis of the main factors affecting the construction sequence and the construction timing data of existing URT lines, a quantitative double-level model of a construction schedule is proposed. The model consists of construction sequence and construction timing sub-models. The construction sequence sub-model employs an improved Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) with Rough Set method; the construction timing sub-model takes the results of the construction sequence model and the factors associated with urban development characteristics into account and presents an improved Logistic-β method. The model is verified using the Chengdu rail transit network as the case study. The results of the study show that the double-level calculation model could provide quantitative theoretical support for the construction schedule planning of URT network.
The passenger flow assignment in the rail transit network is the basis for determining the passenger spatiotemporal distribution and train operation organization plan. In previous studies, the passenger flow assignment problem mainly focused on lines within the same rail system. Few studies focus on lines with the integrated mode of cross-line and skip-stop operation between state and suburban railway due to fewer cases in practice. In this study, passenger congestion and fare policy are taken into account in the generalized travel cost function, and a passenger flow assignment model based on the path-sized logit (PSL) model considering train capacity is proposed. Meanwhile, a schedule-based spatiotemporal digraph is established to search for the shortest spatiotemporal travel path. Furthermore, an improved method of successive averages (MSA) algorithm is designed to solve the proposed model. The proposed model is verified by a numerical example. The sensitivities of three main parameters which influence the results are also analyzed. The results show that the assignment model based on PSL is practicable in integrated operation mode. The higher the passenger’s familiarity with network information, the more accurate the assignment results. State trains are more attractive when the fare is lower than 0.5 CNY/km or the hourly wage is higher than 50 CNY/h.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.