A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany

Procedure 2

Local search and iterative step.

Input: , and critical path

Output: best solution found

(1) while (time limit not reached) & (consecutive delay 0)   do

(2)  Reorder the permutation of operations on critical path according to the dispatching rules (ARI) in Section 2.3.2,

    get

(3)  Do Procedure 1 Lowerbound & Criticalpath, get and

(4)  if     then

(5)   , , ,

(6)  end if

(7) end while

(8) calculate   according to the current

(9) Return