Discrete optimization in public rail transport
From MaRDI portal
Publication:1365068
DOI10.1007/BF02614327zbMath0887.90055OpenAlexW1978828718MaRDI QIDQ1365068
Michael R. Bussieck, Uwe T. Zimmermann, Thomas Winter
Publication date: 28 August 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614327
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (28)
Stability evaluation of a railway timetable at station level ⋮ Solving a real-world train-unit assignment problem ⋮ Simultaneous disruption recovery of a train timetable and crew roster in real time ⋮ Discrete optimization in public rail transport ⋮ Nominal and robust train timetabling problems ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions ⋮ Cost optimal periodic train scheduling ⋮ The Steiner connectivity problem ⋮ Scheduling multimodal transportation systems. ⋮ The vehicle routing problem with coupled time windows ⋮ Railway track allocation: Models and methods ⋮ On designing connected rapid transit networks reducing the number of transfers ⋮ On single courier problem ⋮ A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing ⋮ A general rapid network design, line planning and fleet investment integrated model ⋮ A short-turning policy for the management of demand disruptions in rapid transit systems ⋮ Line planning on tree networks with applications to the Quito Trolebús system ⋮ Metric inequalities for routings on direct connections with application to line planning ⋮ Exact formulations and algorithm for the train timetabling problem with dynamic demand ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Spectral analysis for performance evaluation in a bus network ⋮ A MIP-based local search method for the railway rescheduling problem ⋮ Integrated rolling stock deadhead routing and timetabling in urban rail transit lines ⋮ Integrated optimization of train formation plan and rolling stock scheduling under time-dependent demand ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor
Uses Software
Cites Work
- Schedule synchronization for public transit networks
- Linear and combinatorial optimization in ordered algebraic structures
- An interactive graphic approach for the integrated design of intercity transportation timetables and vehicle operations
- A procedure to adjust transit trip departure times through minimizing the maximum headway
- Optimal lines for railway systems
- Routing trains through railway stations: Complexity issues
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks
- Scheduling trams in the morning
- Cost optimal allocation of rail passenger lines
- An exact algorithm for multiple depot bus scheduling
- Algorithms for railway crew management
- Discrete optimization in public rail transport
- Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987
- Computer-aided transit scheduling. Proceedings of the 6th international workshop on computer-aided scheduling of public transport, Lisbon, Portugal, July 6-9, 1993
- Periodic network optimization with different arc frequencies
- Cyclic schedules for r irregularity occurring events
- On some matching problems arising in vehicle scheduling models
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A Mathematical Model for Periodic Scheduling Problems
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Overcoming the (Apparent) Problem of Inconsistency in Origin-Destination Matrix Estimations
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- The Reactive Tabu Search
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Discrete optimization in public rail transport
