The Engine Scheduling Problem in a Railway Network Part I

  • M. Florian
  • G. Guérin
  • G. Bushell
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 86)

Abstract

In this paper we present the mathematical version of a scheduling problem that is faced by any railway company that employs several engine types to provide power for its trains. Usually, a railway employs engines of several types that differ in their tractive effort capability and horsepower rating. There are two distinct but related aims in reducing the engine costs to the railway. One is to select the mix of engine types that gives the lowest capital investment and operating cost for the trains operated by the railway. The other is to provide a scheduling method that assigns available engines to trains on a short time horizon (e.g. a week ahead). We describe the practical context of the former problem below.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • M. Florian
    • 1
    • 2
    • 3
  • G. Guérin
    • 1
    • 2
    • 3
  • G. Bushell
    • 1
    • 2
    • 3
  1. 1.Université de MontréalMontréalCanada
  2. 2.Université de QuébecCanada
  3. 3.Canada Canadian National RailwaysCanada

Personalised recommendations