ENGINE SCHEDULING PROBLEM IN A RAILWAY NETWORK

The mathematical version of a scheduling problem faced by a railway company that employs several engine types to provide power for its trains is presented. Each train has motive power requirements that are determined by the weight and length of the train, and the route it travels. The operating constraint is to provide a train with sufficient engines to meet its motive power requirements. The authors give a mathematical formulation of selecting the mix of engine types that gives the lowest capital investment and operating cost and explore a method of solution based on the decomposition method of Benders. The computational results obtained are satisfactory for medium size problems and unsatisfactory for large size problems.

• Authors:
  • Florian, M
  • BUSHELL, G
  • Ferland, J
  • Guerin, G
  • NASTANSKY, L
• Publication Date: 1976-6

Media Info

• Features: References;
• Pagination: p. 121-138
• Serial:
  • INFOR
  • Volume: 14
  • Issue Number: 2
  • Publisher: Canadian Operational Research Society

Subject/Index Terms

• TRT Terms: Economic analysis; Information processing; Locomotive utilization; Mathematical models; Operations research; Programming (Mathematics); Scheduling; Utilization
• Subject Areas: Data and Information Technology; Economics; Railroads; Research;

Filing Info

• Accession Number: 00156219
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Jul 19 1977 12:00AM