Locating optimal timetables and vehicle schedules in a transit line
From MaRDI portal
Publication:490235
DOI10.1007/s10479-013-1393-5zbMath1303.90069OpenAlexW1992743441MaRDI QIDQ490235
Francisco A. Ortega, Miguel A. Pozo, Juan A. Mesa
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/104177
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (4)
Complexity, bounds and dynamic programming algorithms for single track train scheduling ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Managing customer arrivals with time windows: a case of truck arrivals at a congested container terminal ⋮ A short-turning policy for the management of demand disruptions in rapid transit systems
Cites Work
- Closest assignment constraints in discrete location problems
- Computing delay resistant railway timetables
- A fast heuristic for the train scheduling problem
- Scheduling multimodal transportation systems.
- An optimization based approach to the train operator scheduling problem at Singapore MRT
- Integration of timetable planning and rolling stock in rapid transit networks
- The planning of headways in urban public transit
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- Railway Timetabling Using Lagrangian Relaxation
- Modeling and Solving the Train Timetabling Problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Locating optimal timetables and vehicle schedules in a transit line
