Optimal Design for Urban Mass Transit Network Based on Evolutionary Algorithms

2005 ◽  
pp. 1089-1100 ◽  
Author(s):  
Jianming Hu ◽  
Xi Shi ◽  
Jingyan Song ◽  
Yangsheng Xu
Keyword(s):  
Optimal Design ◽  
Evolutionary Algorithms ◽  
Mass Transit ◽  
Transit Network ◽  
Urban Mass Transit

Research on Optimization of Urban Mass Transit Network Schedule Based on Coordination of Connecting Time Between Different Lines

2010 ◽  
Author(s):  
Xiaohong Fang ◽  
Leishan Zhou ◽  
Ming Xia
Keyword(s):  
Waiting Times ◽  
Mass Transit ◽  
Service Level ◽  
Small Time ◽  
Optimization Techniques ◽  
Transit System ◽  
Transit Network ◽  
Schedule Coordination ◽  
Urban Mass Transit ◽  
Transfer Stations

On urban mass transit network, some connections inherently exist between trains on different lines through transfer stations. Schedule coordination for different lines, especially optimizing the arriving and departure times at transfer stations, may significantly reduce transfer waiting times at stations where various routes are interconnected, so as to improve the passenger service level. Based on the passengers flow characters of urban mass transit (UMT), both the convenience and rationality of connection between different lines were considered, and then an optimization model, with the aims of the minimal total waiting time of transfer passengers and inboard passengers, was set up. Combining the inner coordination of arriving and departure time sequence of trains in transfer nodes with the exterior coordination of transfer nodes on whole urban mass transit network, a multi-layers coordination policy was proposed, and the integrated optimization of the urban mass transit system was realized through taking some small time shifts of the proposed singleline timetables. In order to verify the validity and feasibility of the model and algorithm, we conducted an experimental study. The result turns out that improvement on UMT network can be determined by such optimization techniques.

scholarly journals Cooperative Passenger Inflow Control in Urban Mass Transit Network with Constraint on Capacity of Station

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Jianyuan Guo ◽  
Limin Jia ◽  
Yong Qin ◽  
Huijuan Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Waiting Time ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Mass Transit ◽  
Constrained Optimization Problem ◽  
Swarm Optimization ◽  
Transit Network ◽  
Urban Mass Transit ◽  
Transfer Stations

In urban mass transit network, when passengers’ trip demands exceed capacity of transport, the numbers of passengers accumulating in the original or transfer stations always exceed the safety limitation of those stations. It is necessary to control passenger inflow of stations to assure the safety of stations and the efficiency of passengers. We define time of delay (TD) to evaluate inflow control solutions, which is the sum of waiting time outside of stations caused by inflow control and extra waiting time on platform waiting for next coming train because of insufficient capacity of first coming train. We build a model about cooperative passenger inflow control in the whole network (CPICN) with constraint on capacity of station. The objective of CPICN is to minimize the average time of delay (ATD) and maximum time of delay (MTD). Particle swarm optimization for constrained optimization problem is used to find the optimal solution. The numeral experiments are carried out to prove the feasibility and efficiency of the model proposed in this paper.

Modeling on Dynamic Passenger Flow Distribution in Urban Mass Transit Network

LISS 2012 ◽  
2013 ◽  
pp. 469-476 ◽  
Author(s):  
Xiang-ming Yao ◽  
Peng Zhao ◽  
Ke Qiao ◽  
Wei-jia Li
Keyword(s):  
Flow Distribution ◽  
Mass Transit ◽  
Transit Network ◽  
Passenger Flow ◽  
Urban Mass Transit

scholarly journals An Improved Prim Algorithm for Connection Scheme of Last Train in Urban Mass Transit Network

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 681
Author(s):  
Xiaoxu Zeng ◽  
Qinglei Liu ◽  
Song Yao
Keyword(s):  
Solution Process ◽  
Mass Transit ◽  
Important Work ◽  
Transit Network ◽  
Scheme Optimization ◽  
Passenger Flow ◽  
Urban Mass Transit ◽  
Network Operation ◽  
Data Source ◽  
Accessible Form

In the network operation stage of urban mass transit, the connection relations between lines can effectively improve travel accessibility. As the last opportunity to travel on the same day, whether the last train can achieve transfer will directly affect passengers’ travel experiences. It is an important work to make the connection scheme of the last train, which needs to take the network structure, the trend, and the volume of passenger flow into overall consideration. This paper analyzes the characters of the last train connection, including the connection structure and the accessible form. Then, we establish a scheme model and define the objectives, the constraints, and the decision data source, and transform it into a graph theory problem. Taking an urban mass transit network as an example, we demonstrate the solution process by using an improved Prim algorithm. Finally, the main aspects and methods of initial scheme optimization are proposed.

Study on Connection Optimization of Last Train Departure Time on Urban Mass Transit Network

2014 ◽  
Vol 1030-1032 ◽  
pp. 2211-2214 ◽  
Author(s):  
Chun Ge Kou ◽  
Shi Wei He ◽  
Bi Sheng He
Keyword(s):  
Numerical Analysis ◽  
Waiting Time ◽  
Mass Transit ◽  
Volume Distribution ◽  
Distribution Method ◽  
Transit Network ◽  
Departure Time ◽  
Urban Mass Transit ◽  
Passenger Volume ◽  
Operation And Management

The operation and management of urban mass transit network put forward higher requirements for last trains‘ transfer connection. Based on the analysis of coordination relationship and timeliness of accessible routes, this paper puts forward a dynamic passenger volume distribution method according to the generalized travel cost. Then the connection optimization model of last train departure time is built to increase accessible passenger volume and reduce passengers’ transfer waiting time of all OD pairs for last trains. Finally, the validity and rationality of this model and algorithm is verified with numerical analysis.

Urban Mass Transit Network Project Selection Using the Fuzzy Expandable Engineering Optimization Model

2012 ◽  
Vol 178-181 ◽  
pp. 1824-1828
Author(s):  
Qian Li ◽  
Liang Feng Shen
Keyword(s):  
Optimization Model ◽  
System Analysis ◽  
Fuzzy Optimization ◽  
Mass Transit ◽  
Transit Network ◽  
Urban Mass Transit ◽  
Network Evaluation ◽  
Appraisal Index ◽  
Line Network ◽  
Network Project

Abstract. Mass transit line network’s option is a fuzzy optimization problem. Its line network evaluation is multi-objective and multi-hierarchy and the evaluation subsystems are incompatible. First, considering the urban development coordination, construction implementation, rationality of urban mass transit line network structure and comprehensive effect, researches established the appraisal index system of urban mass transit network using an assistant decision-making tool of system-analysis. Second, the study established extension and fuzzy optimization model with a vague idea of fuzzy mathematics, the knowledge of extenics and TOPSIS, explored the fuzzy and incompatibility issues on urban mass transit line network evaluation. The study introduced negotiation theory into weight construction, expanded single AHP to multi-experts weighting methods and combined it with entropy theory to form a new weight construction method. Last, as a validation, Changsha urban mass transit line network were evaluated and verified the feasibility and practicality of the model and method mentioned above.

Evaluation of Urban Mass Transit Network Based on Gray Correlation—TOPPSIS

CICTP 2012 ◽  
2012 ◽  
Author(s):  
Shaofang Wen ◽  
Haining Liu ◽  
Lijuan Wang ◽  
Tongyin Han
Keyword(s):  
Mass Transit ◽  
Transit Network ◽  
Gray Correlation ◽  
Urban Mass Transit

scholarly journals A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs

2016 ◽  
Vol 11 (2) ◽  
pp. 170-177 ◽  
Author(s):  
Jianyuan Guo ◽  
Limin Jia
Keyword(s):  
Major Part ◽  
Shortest Paths ◽  
Past Research ◽  
Mass Transit ◽  
Time Schedule ◽  
Transit Network ◽  
Label Algorithm ◽  
Urban Mass Transit ◽  
Beijing China ◽  
Schedule Network

Time-schedule network with constraints on arcs (TSNCA) means network with a list of pre-defined departure times for each arc. Compared to past research on finding the K shortest paths in TSNCA, the algorithm in this paper is suitable for networks having parallel arcs with the same direction between two nodes. A node label algorithm for finding the K shortest paths between two nodes is proposed. Temporal-arcs are put into the labels of nodes and arranged by ascending order. The number of temporal-arcs is limited to K in every label of node to improve the effectiveness of the algorithm. The complexity of this algorithm is [Formula: see text], where [Formula: see text] is the maximum number of departure times from a node, [Formula: see text] is the number of arcs in network, and [Formula: see text] is the number of nodes in network. Experiments are carried out on major part of real urban mass transit network in Beijing, China. The result proves that the algorithm is effective and practical.

Sign in / Sign up

Export Citation Format

Share Document