FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
T. Godwin (),
Ram Gopalan () and
T. T. Narendran ()
Additional contact information T. Godwin: Marketing and Planning Systems, Chennai 600034, India
Ram Gopalan: Fox School of Business and Management, Temple University, Philadelphia, PA 19122, USA
T. T. Narendran: Department of Management Studies, Indian Institute of Technology, Madras, Chennai 600036, India
In many countries, freight trains have to share a rail network with passenger trains. In this paper, we consider a situation where passenger trains must adhere to a strict published schedule, whereas freight train movements can be inserted at any convenient time, without disrupting scheduled passenger trains. We propose an algorithm for the problem of routing and scheduling of a single freight train in a passenger rail network. However, the multiple freight train routing and scheduling problem is shown to be NP-complete, even for simplified instances. Specifically, we show that both routing and scheduling of freight trains are difficult, even when only two freight trains are considered. It is also difficult when freight train movements are restricted to reach their destinations with no idling permitted at intermediate stations. We have developed a Stepwise Dispatching Heuristic for routing and scheduling multiple freight trains in a passenger rail network. Computational results confirm the efficacy of our algorithm for single freight train routing and of the proposed Stepwise Dispatching Heuristic.