Bicriteria train scheduling for high-speed passenger railroad planning applications

Xuesong Zhou, Ming Zhong

Research output: Contribution to journalArticlepeer-review

169 Scopus citations


This paper is concerned with a double-track train scheduling problem for planning applications with multiple objectives. Focusing on a high-speed passenger rail line in an existing network, the problem is to minimize both (1) the expected waiting times for high-speed trains and (2) 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 bicriteria scheduling problem, and a beam search algorithm with utility evaluation rules is used to construct a representative set of non-dominated solutions. A case study based on Beijing-Shanghai high-speed railroad in China illustrates the methodology and compares the performance of the proposed algorithms.

Original languageEnglish (US)
Pages (from-to)752-771
Number of pages20
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Dec 16 2005
Externally publishedYes


  • Multiple objective programming
  • Railway
  • Scheduling
  • Transportation

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Bicriteria train scheduling for high-speed passenger railroad planning applications'. Together they form a unique fingerprint.

Cite this