Freight train routing and scheduling in a passenger rail network: Computational complexity and the stepwise dispatching heuristic

Asia-Pacific Journal of Operational Research

Volumn 24, Issue 4, 2007, Pages 499-533

  Godwin, T ^a   Gopalan, Ram ^b   Narendran, T T ^c  

^a Marketing and Planning Systems   (India)

^b TEMPLE UNIVERSITY   (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Computational complexity; Freight train scheduling; Passenger rail network; Stepwise dispatching heuristic

Indexed keywords

COMPUTATIONAL COMPLEXITY; FREIGHT TRANSPORTATION; PROBLEM SOLVING; SCHEDULING ALGORITHMS; TRANSPORTATION ROUTES;

FREIGHT TRAIN ROUTING; FREIGHT TRAIN SCHEDULING; PASSENGER RAIL NETWORKS; STEPWISE DISPATCHING HEURISTICS;

PASSENGER CARS;

EID: 34748880023     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595907001358     Document Type: Article

References (11)

1. Cordeau, J-F, P Toth and D Vigo (1998). A survey of optimization models for train routing and scheduling. Transportation Science, 32(4), 380-404.
2. Dahlhaus, E, P Horak, M Miller and JF Ryan (2000). The train marshalling problem. Discrete Applied Mathematics, 103, 41-54.
3. Dorfman, MJ and J Medanic (2004). Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research Part B, 38(1), 81-98.
4. Garey, MR, DS Johnson and R Sethi (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117-129.
5. Ghoseiri, K, F Szidarovszky and MJ Asgharpour (2004). A multi objective train scheduling model and solution. Transportation Research Part B, 38(10), 927-952.
6. Handler, GY and I Zang (1980). A dual algorithm for the constrained shortest path problem. Networks, 10, 293-310.
7. Kroon, LG, HE Romeijn and PJ Zwaneveld (1997). Routing trains through railway stations: complexity issues. European Journal of Operational Research, 98, 485-498.
8. Papadimitriou, CH and K Steiglitz (1982). Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ, USA: Prentice-Hall Inc.
9. Orda, A and R Rom (1990). Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the Association for Computing Machinery, 37(3), 607-625.
10. Sahni, S and Y Cho (1979). Complexity of scheduling shops with no wait in process. Mathematics of Operations Research, 4(4), 448-457.
11. Zhou, X and M Zhong (2005). Bicriteria train scheduling for high-speed passenger railroad planning applications. European Journal of Operational Research, 167(3), 752-771.