Periodic network optimization with different arc frequencies
From MaRDI portal
Publication:1923597
DOI10.1016/0166-218X(95)00073-ZzbMath0856.90118MaRDI QIDQ1923597
Publication date: 23 February 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
branch-and-bound; waiting time; railway system; timetable; periodic scheduling; lexicographic best solution; periodic network optimization
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
Related Items
Periodic Event Scheduling for Automated Production Systems, A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems, An experimental comparison of periodic timetabling models, Cycle bases in graphs characterization, algorithms, complexity, and applications, Railway track allocation: Models and methods, Integral cycle bases for cyclic timetabling, Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks, Discrete optimization in public rail transport, Integration of timetable planning and rolling stock in rapid transit networks, A genetic algorithm approach to periodic railway synchronization, Strategic timetable scheduling for last trains in urban railway transit networks, Simultaneous disruption recovery of a train timetable and crew roster in real time, Analysing stability and investments in railway networks using advanced evolutionary algorithms, The demand-dependent optimization of regular train timetables, Minimum Cycle Bases and Their Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax algebra
- Optimal schedules for periodically recurring events
- Dioïds and semirings: Links to fuzzy sets and other applications
- Cyclic schedules for r irregularity occurring events
- A railway scheduling problem
- A Mathematical Model for Periodic Scheduling Problems
- Matroids and the greedy algorithm
