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.

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

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.

The Research of First and Last Trip Optimization under the Network of Urban Mass Transit

2013 ◽  
Vol 409-410 ◽  
pp. 1311-1314 ◽  
Author(s):  
Yong Feng Shang ◽  
Lei Shan Zhou ◽  
Lu Tong ◽  
Chang Jun Cai
Keyword(s):  
Optimal Solution ◽  
Mass Transit ◽  
Time Range ◽  
Feasible Region ◽  
Rail Network ◽  
Urban Mass Transit ◽  
Time Quantum ◽  
Network Operation ◽  
Local Optimal Solution ◽  
Transfer Stations

Under the background of the urban mass transit becoming network increasingly, time coordination of the first and last trains becomes the important part of urban mass transit network operation, and has special significance. This paper firstly ascertains the time range of first and last running of trains and analyzes from two aspects. Then find the time quantum that the passengers and companies all accept. The paper analyzes the departed principle of networked first and last running time of trains, the target is the minimum of the passengers total loss of time at the transfer stations, setting up a multiple-direction trains transfer mathematical model that achieves attainability and rationality for transferring among different lines and getting a local optimal solution by using the method of iteration, and the optimal solution is within the feasible region and fits actual situations. Lastly a specific urban rail network is taken as an example to check the model and algorithm.

Research of Emergency Passenger Flow Guidance for Urban Rail Transit

2014 ◽  
Vol 543-547 ◽  
pp. 4069-4072
Author(s):  
Ming Mei Jiang ◽  
Jun Fang Jia
Keyword(s):  
Urban Rail Transit ◽  
Guidance System ◽  
Rail Transit ◽  
Transit System ◽  
Factors Affecting ◽  
Transit Network ◽  
Passenger Flow ◽  
Urban Rail ◽  
Urban Mass Transit ◽  
Urban Rail Transit Network

Emergency is one of the main factors affecting the operation security and reliability of urban mass transit system. In order to improve the ability to copy with sudden accident, the Emergency Passenger Flow Guidance System was adopted, which can realize the effective guide of passenger flow under the emergency. On the basic of the study of passenger guidance technology and the design of the passenger guidance system, this paper takes Beijing urban rail transit network as an example to simulate the process of emergency passenger flow guidance. The result shows that the passenger guidance can ensure the security and open of the urban rail transit network to some extent through effecting passengers' travel plans.

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.

Sign in / Sign up

Export Citation Format

Share Document