Bicriteria Train Scheduling for High-Speed Passenger Railroad Planning Applications

This article addresses a double-track train scheduling problem for planning applications with multiple objectives. Using the example of a high-speed passenger rail line in an existing network, the authors consider how to minimize both the expected waiting times for high-speed trains and the total travel times of high-speed and medium-speed trains. By applying two practical priority rules, the problem with the second criterion is decomposed and formulated as a series of multi-mode resource constrained project scheduling problems in order to explicitly model acceleration and deceleration times. A branch-and-bound algorithm with effective dominance rules is developed to generate Pareto solutions for the bi-criteria scheduling problem, and a beam search algorithm with utility evaluation rules is used to construct a representative set of non-dominated solutions. The authors use a case study based on Beijing-Shanghai high-speed railroad in China to illustrate this methodology and to compare the performance of the proposed algorithms.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01013509
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Dec 3 2005 7:20AM