Research Article
A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany
Table 3
Results for the scenarios from Table 1 with Reordering strategy (sub-problem 2).
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
The numbers in the parentheses refer to the current best feasible solution () found when the time limit of 90 seconds was exceeded without an optimal solution being verified. 2The numbers in the parentheses refer to exceed the time limit of 90 seconds. |