A Line Planning Approach for High-Speed Rail Networks with Time-Dependent Demand and Capacity Constraints

Algorithm 1

Input high-speed rail network , and candidate sets and , time-dependent demand .

Output an optimized line plan .

Begin

 Generate an initial solution (see Detail 1), denoted as ;

 Check the constraints and adjust (see Detail 2);

 Assign passengers on by SPAM-TBP;

 Calculate the objective ;

 Let the current solution be and ;

 Let the optimized solution be and ;

 Generate the initial temperature, denoted as

 ;

 While the outer loop condition is satisfied do

 Begin1

  While the inner loop condition is satisfied do

  Begin2

   Search for a neighborhood solution of the current solution (see Detail 3);

   Check the constraints and adjust (see Detail 2);

   Assign passengers on by SPAM-TBP;

   Calculate the objective ;

   If , then let ;

   If “accepting condition” is satisfied, then let ;

  End2

  Drop the temperature, let , ;

 End1

End