An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line
DOI10.1016/J.EJOR.2014.04.025zbMATH Open1338.90235OpenAlexW2029475443MaRDI QIDQ296903FDOQ296903
Authors: Dung-Ying Lin, Yu-Hsiung Ku 
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
Recommendations
- Cost optimal allocation of rail passenger lines
- How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks
- An integer linear programming model for integrated train stop planning and timetabling with time-dependent passenger demand
- Optimising the travel time of a line plan
- Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Nominal and robust train timetabling problems
- An analytical approach to calculate the capacity of a railway system
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Line planning in public transportation: models and methods
Cited In (1)
This page was built for publication: An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296903)
