2015The Open Cybernetics & Systemics JournalOpen access

The Optimization Model and Algorithm for Train Connection at Transfer Stations in Urban Rail Transit Network

Xuan Li, Yang Shi

Open full text 3 citations

Abstract

In urban rail transit network, the passenger transfer time depends on the train connection states in transfer stations, therefore, the optimization of the connection relations of arrival and departure time among trains is significant to improve the level of transfer service.Here, with the psychology of waiting passengers taken into consideration, the cost function of transfer waiting times has been established.On this basis, an optimization model for train connections at transfer stations was constructed, and a genetic algorithm was designed to solve this model.A computer program implementing this genetic algorithm was written in Microsoft VB.NET.This program was used to optimize the train operation plans of a simple network which consists of four urban rail lines in Beijing.The results show that the proposed method can effectively reduce the total waiting time cost of all transfer passengers in the network.

About this research paper

What this paper is about

In urban rail transit network, the passenger transfer time depends on the train connection states in transfer stations, therefore, the optimization of the connection relations of arrival and departure time among trains is significant to improve the level of transfer service.Here, with the psychology of waiting passengers taken into consideration, the cost function of transfer waiting times has been established.On this basis, an optimization model for train connections at transfer stations was constructed, and a genetic algorithm was designed to solve this model.A computer program implementing this genetic algorithm was written in Microsoft VB.NET.This program was used to optimize the train operation plans of a simple network which consists of four urban rail lines in Beijing.The results show that the proposed method can effectively reduce the total waiting time cost of all transfer passengers in the network.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In urban rail transit network, the passenger transfer time depends on the train connection states in transfer stations, therefore, the optimization of the connection relations of arrival and departure time among trains is significant to improve the level of transfer service.Here, with the psychology of waiting passengers taken into consideration, the cost function of transfer waiting times has been established.On this basis, an optimization model for train connections at transfer stations was constructed, and a genetic algorithm was designed to solve this model.A computer program implementing this genetic algorithm was written in Microsoft VB.NET.This program was used to optimize the train operation plans of a simple network which consists of four urban rail lines in Beijing.The results show that the proposed method can effectively reduce the total waiting time cost of all transfer passengers in the network.

Key concepts: Urban rail transit, Computer science, Connection (principal bundle), Transit (satellite), Transfer (computing), Rail transit, Algorithm, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
The Optimization Model and Algorithm for Train Connection at Transfer Stations in Urban Rail Transit Network — Research Paper | ScholarLens