A Fast Approach for Reoptimization of Railway Train Platforming in Case of Train Delays

Algorithm 1

A heuristic method to resolve the temporal conflicts between trains with given train order.

	For each train
	For each train
	If train conflicts with train
	Fix the arrival and departure times of train and record the weighted sum delay amount after resolving the conflicts of trains numbered before train ;
	Fix the arrival and departure times of train and record the weighted sum delay amount after resolving the conflicts of trains numbered before train ;
	If
	Adopt the adjust method by fixing the arrival and departure times of train ;
	Else
	Adopt the adjust method by fixing the arrival and departure times of train ;
	End If
	End If train conflicts with train
	End For each train
	End For each train
	Step 5. Sort all trains in descending order by their scheduled or estimated arrival times and number them from 1 to .
	Step 6. Use Algorithm 1 to resolve the temporal conflicts between any two trains in the order given in Step 1. Note that Algorithm 1 will not lead to a deadlock between trains where trains can always be delayed to resolve the temporal conflicts.
	Step 7. Calculate the weighted sum of arrival and departure delays compared to the corresponding scheduled or estimated train arrival and departure times. This operation considers all trains in set and the platform track assignment costs, and thus the value calculated during this step serves as the objective value of the chromosome.