Train scheduling: hardness and algorithms

DOI10.1007/978-3-030-39881-1_30MaRDI QIDQ782209zbMATH OpenOpenAlexFDO

Authors Christian Scheffer

Publication date 22 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39881-1_30

zbMATH Keywords

motion planningpath coordinationreparametrization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Train scheduling on a unidirectional path
• A fast heuristic for the train scheduling problem
• Exact train pathing
• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• Fastest, average and quantile schedule

Cited in

(6)

• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• Nominal and robust train timetabling problems
• The problem of trains formation and scheduling: integer statements
• Optimal algorithms for train shunting and relaxed list update problems
• Constant delay lattice train schedules
• On flipping the Fréchet distance

This page was built for publication: Train scheduling: hardness and algorithms

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