Integral cycle bases for cyclic timetabling

DOI10.1016/j.disopt.2008.09.003zbMath1160.90640OpenAlexW1976461547MaRDI QIDQ1013300

Christian Liebchen, Leon Peeters

Publication date: 17 April 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.09.003

zbMATH Keywords

railway timetablingminimum cycle basesstrictly fundamental cycle bases

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (20)

How to minimize cycle times of robot manufacturing systems ⋮ An iterative heuristic for passenger-centric train timetabling with integrated adaption times ⋮ An experimental comparison of periodic timetabling models ⋮ Classes of cycle bases ⋮ Periodic Event Scheduling for Automated Production Systems ⋮ On the approximability of the minimum strictly fundamental cycle basis problem ⋮ Forward and line-based cycle bases for periodic timetabling ⋮ On a Special Co-cycle Basis of Graphs ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Railway track allocation: Models and methods ⋮ A short-turning policy for the management of demand disruptions in rapid transit systems ⋮ Exact formulations and algorithm for the train timetabling problem with dynamic demand ⋮ Periodic railway timetabling with event flexibility ⋮ Separation of cycle inequalities in periodic timetabling ⋮ Integral cycle bases for cyclic timetabling ⋮ A combinatorial proof of the removal lemma for groups ⋮ Disjoint congruence classes and a timetabling application ⋮ Properties of Gomory-Hu co-cycle bases ⋮ Railway timetabling with integrated passenger distribution ⋮ A greedy approach to compute a minimum cycle basis of a directed graph

Uses Software

• PESPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of cycle bases
• Integral cycle bases for cyclic timetabling
• Minimum weakly fundamental cycle bases are hard to find
• A greedy approach to compute a minimum cycle basis of a directed graph
• On finding a cycle basis with a shortest maximal cycle
• Minimum cycle bases for network graphs
• Periodic network optimization with different arc frequencies
• Is every cycle basis fundamental?
• Lower-Stretch Spanning Trees
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• A Mathematical Model for Periodic Scheduling Problems
• Algorithms for Generating Fundamental Cycles in a Graph
• Benchmarks for Strictly Fundamental Cycle Bases
• Automata, Languages and Programming
• Experimental and Efficient Algorithms
• Algorithms - ESA 2003

This page was built for publication: Integral cycle bases for cyclic timetabling