A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
From MaRDI portal
Publication:1721527
DOI10.1155/2018/8394397zbMath1427.90317OpenAlexW2895454818MaRDI QIDQ1721527
Ziyan Feng, Yutong Liu, Chengxuan Cao, Yaling Zhou
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/8394397
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Routing trains through railway stations: Complexity issues
- Routing trains through a railway station based on a node packing model
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
- Future paths for integer programming and links to artificial intelligence
- Nominal and robust train timetabling problems
- Bicriteria train scheduling for high-speed passenger railroad planning applications
This page was built for publication: A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm