The train frequency compatibility problem

DOI10.1016/J.DAM.2018.10.046zbMATH Open1429.90041OpenAlexW2902361423WikidataQ128875418 ScholiaQ128875418MaRDI QIDQ2328084FDOQ2328084

Authors: Pedro C. Silva, Jorge Orestes Cerdeira, C. Iglesias 

Publication date: 9 October 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.046

Recommendations

• Non-cyclic train timetabling and comparability graphs
• Periodic network optimization with different arc frequencies
• Modeling and Solving the Train Timetabling Problem
• A fast heuristic for the train scheduling problem
• Periodic metro scheduling

zbMATH Keywords

optimizationcomputational complexitymixed integer linear programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Matching theory
• Optimal schedules for periodically recurring events
• Title not available (Why is that?)
• Scheduling periodic events
• Line planning with user-optimal route choice

Cited In (5)

• Constant delay lattice train schedules
• Disjoint congruence classes and a timetabling application
• Title not available (Why is that?)
• Alternative in Harmonic Train Design
• Non-cyclic train timetabling and comparability graphs

This page was built for publication: The train frequency compatibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328084)