A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
type: Item
instance of: scholarly article
title: A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
zbMATH Open document ID: 1427.90317
DOI: 10.1155/2018/8394397
author: Ziyan Feng
author: Chengxuan Cao
author: Yutong Liu
author: Yaling Zhou
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers' transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains' departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7019602
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8394397
OpenAlex ID: W2895454818
cites work: Routing trains through a railway station based on a node packing model
cites work: Nominal and robust train timetabling problems
cites work: Bicriteria train scheduling for high-speed passenger railroad planning applications
cites work: Routing trains through railway stations: Complexity issues
cites work: A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
cites work: Future paths for integer programming and links to artificial intelligence
Recommended article: Optimizing schedules of rail train circulations by tabu search algorithm
Recommended article: Q3306865
Recommended article: Optimization of multiperiod mixed train schedule on high-speed railway
Recommended article: A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
Recommended article: Optimization based high-speed railway train rescheduling with speed restriction
Recommended article: How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks
description: scientific article; zbMATH DE number 7019602