A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany

DOI10.1155/2015/289072zbMath1394.90415OpenAlexW2000475015WikidataQ59117872 ScholiaQ59117872MaRDI QIDQ1665246

Zhibin Jiang, Yuyan Tan

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/289072

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (1)

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

Cites Work

• Feasible insertions in job shop scheduling, short cycles and stable sets
• Non-cyclic train timetabling and comparability graphs
• Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
• A lower bound for the job insertion problem.
• An optimization to schedule train operations with phase-regular framework for intercity rail lines
• A fuzzy optimization model for high-speed railway timetable rescheduling
• Train stop scheduling in a high-speed rail network by utilizing a two-stage approach
• Optimization based high-speed railway train rescheduling with speed restriction
• Feasible job insertions in the multi-processor-task job shop
• A Genetic Algorithm for Railway Scheduling Problems
• Unnamed Item

This page was built for publication: A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany