An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line

DOI10.1016/j.ejor.2014.04.025zbMath1338.90235OpenAlexW2029475443MaRDI QIDQ296903

Yu-Hsiung Ku, Dung-Ying Lin

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.025

zbMATH Keywords

implicit enumerationOR in service industriespassenger railwayservice planning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (1)

How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analytical approach to calculate the capacity of a railway system
• Line planning in public transportation: models and methods
• Nominal and robust train timetabling problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

This page was built for publication: An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line