Mathematical Solutions for Solving Periodic Railway Transportation

Algorithm 2

Pseudocode of heuristic 1.1.

Heuristic 1.1

/^∗Limit the stations where two trains can be crossed, that is, the number of decision variables^∗/

DeterminePossibleCrossing ();

LinearSolution = SolveLinearProblem ();

Crossings = DetectCrossings (LinearSolution);

𝑛 = 0;

while (Not Solution)

Solution = SearchCrossingCombination (window,Crossings);

𝑛++;

if (Solution)

FinalSolution = SolveCrossingOrder (Solution);