Schedule-Based Passenger Assignment for High-Speed Rail Networks considering the Ticket-Booking Process

Algorithm 1

Input  high-speed rail network , space-time network , service period , train set , O-D demand ,  ,

intensity distribution functions ,  , and ,  ;

Output  passengers on every train segment, that is, ,  ,  .

Begin

  ,  ;

  for all ,   do ;

  while do

  begin

    Search for the path with the minimum cost on the network , then obtain

         ;

    If an effective path does not exist, then break;

    Obtain the optimal partition by the modified rooftops method;

    Calculate the next optimal partition node using (18);

    Calculate ,  ,   using (15);

    Calculate ,  ,   using (19);

    Load passengers on network :

     for all    do ;

    ;

  end

end