Research Article

Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach

Algorithm 1

Descriptive model/algorithm for computing train stop schedule for lower-classification trains.
 - Set sequence of the input trains in set (ht) (including selected non-stop direct trains
  (e.g., short-distance trains with running sections covering high passenger density) in set
   (gt))
repeat
    for train ( to ( (ht) )) do
    - Enumerate all passenger OD pairs that can be covered
    - Calculate the maximum remaining stop times that can be added on train
     in set (ht), notated as
    Repeat
     for ( ) do
      - Enumerate all station group(s) with combined station(s) of the
       third classification ( (tc)), notated as (sg, ), where is index symbol
      - Calculate total passenger traffic of all combined passenger OD pairs
       among station(s) in (sg, ) together with existing stop(s) and OD on train
       , notated as TP( (sg, )) , where both and or at least
       one of them belong to (sg, )
     - Select the group (sg, ) with the maximum TP( (sg, ))
     if train has a cost-efficient frequency to be operated with assigned
       TP( (sg, )) on it, do
       - Add station(s) in the selected group on train as additional stop(s),
        and update passenger flow, go to Step  7
     else do
       - Update , go to Step  7
    end for
   until
  end for
until assigning the remaining passengers on trains is completed, then set of (lt)
  is obtained
*From the perspective of the rail operator, a cost-efficient train operating frequency is defined as
at least one train per day for a given train OD with a rational loading factor (e.g., ≥0.70).