A heuristic approach to solving the train traffic re-scheduling problem in real time

DOI10.3390/a11040055zbMath1461.90048OpenAlexW2801282164WikidataQ129924068 ScholiaQ129924068MaRDI QIDQ2331466

Johanna Törnquist Krasemann, O. Gholami

Publication date: 29 October 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11040055

zbMATH Keywords

optimizationjob-shop schedulingdisturbance managementalternative graphreal-time re-schedulingrailway traffic

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (2)

Effective train routing selection for real-time traffic management: improved model and ACO parallel computing ⋮ Editorial. Special issue on algorithms for scheduling problems

Uses Software

• Gurobi

Cites Work

• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany
• Handbook of optimization in the railway industry
• Job-shop scheduling with blocking and no-wait constraints
• A sequencing approach for creating new train timetables
• A branch and bound algorithm for scheduling trains in a railway network
• A bilevel rescheduling framework for optimal inter-area train coordination
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem

This page was built for publication: A heuristic approach to solving the train traffic re-scheduling problem in real time