A Heuristic for Routing and Scheduling Freight Trains in a Passenger Rail Network

The authors discuss routing and scheduling freight trains in a rail network where freight train movements can be inserted on demand or at any time, so that there is no disruption to a strict passenger train schedule. Indian Railways is an example of such a system. A 0-1 mixed integer program formula is presented for freight train routing and scheduling to minimize freight train travel time in a passenger rail network, for which a lower bound is developed. The authors propose identifying routes and schedules for individual freight trains in a passenger rail network using a hierarchical permutation heuristic. Proposals for identifying the best train schedule hierarchy are given through a number of dispatching rules. Using real data to computationally report solutions to various problems is given.

  • Availability:
  • Authors:
    • Godwin, T
    • Gopalan, Ram
    • Narendran, T T
  • Publication Date: 2007


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01046896
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 30 2007 7:59AM