Mathematical Solutions for Solving Periodic Railway Transportation

Algorithm 3

Pseudocode of heuristic 2.

Generate-RunningMap (Frequency, Information of Stations, Information of Trains)

 SetOfPatterns = GenerateTheBestPatterns ();

 RunningMap = GenerateTheRunningMap (SetOfPatterns);

GenerateTheBestPatterns ();

  𝑛 = CalculateStationsOfBeginning ();

 for 𝑖=1 to 𝑛

   RemainingTime = PatternGeneration (𝑖);

   SelectBetterPattern ();

   𝑖=𝑖+1;

GenerateTheRunningMap (SetOfPatterns)

 for each CrossingStation

   Schedule = CalculateSchedule(𝑖);

   SelectBetterSchedule();