Exact train pathing

Journal of Scheduling

Volumn 11, Issue 4, 2008, Pages 279-297

  Nagarajan, Viswanath ^a   Ranade, Abhiram G ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Dynamics; Signaling; Train pathing; Train scheduling; Train simulation

Indexed keywords

ACCELERATION AND DECELERATION; DYNAMICS; EXPONENTIAL TIME; FIXED NUMBERS; LONG TIME; MAXIMUM ACCELERATION; NP-COMPLETE; POLYNOMIAL-TIME; RAIL NETWORKS; SIGNALING; TRAIN PATHING; TRAIN SCHEDULING; TRAIN SIMULATION;

ACCELERATION; ACCELERATION CONTROL; AEROSPACE VEHICLES; ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; LOCOMOTIVES; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SCHEDULING ALGORITHMS; STANDARDS;

RAILROAD CARS;

EID: 49549101075     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0056-x     Document Type: Article

References (15)

1. Blendinger, C., Mehrmann, V., Steinbrecher, A., & Unger, R. (2002). Numerical simulation of train traffic in large networks via time-optimal control. Technical Report, Institute of Mathematics, Technical university of Berlin, February 2002.
2. Cai, X., & Goh, C. J. (1994). A fast heuristic for the train scheduling problem. Computers in Operations Research, 21(5), 499-510.
3. Carey, M., & Lockwood, D. (1995). A model, algorithms and strategy for train pathing. Journal of the Operational Research Society, 46, 988-1005.
4. Higgins, A., Kozan, E., & Ferreira, L. (1996). Optimal scheduling of trains on a single line track. Transportation Research B, 30(2), 147-161.
5. Kraay, D., Harker, P. T., & Chen, B. (1991) Optimal pacing of trains in freight railroads: model formulation and solution. Operations Research 39(1).
6. Lu, Q. Dessouky, M., & Leachman, R. (2004). Modelling train movements through complex rail networks. ACM Transactions on Modelling and Computer Simulation, 14(1), 48-75.
7. Madhusudan, K., & Gopi Singh, B. (2002). Personal communication.
8. Malde, S. (2001). Train scheduling. BTech Project Report, Department of Computer Science and Engineering, I.I.T. Bombay.
9. Mees, A. I. (1991). Railway scheduling by network optimization. Mathematical and Computer Modelling, 15(1), 33-42.
10. Moreira, A. B. S., & Oliveira, R. C. (2000). A decision support system for operational planning in railway networks. In 8th conference on computer-aided scheduling of public transport, June 2000.
11. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics Operation Research, 1, 117-129.
12. Olivera, E., & Smith, B. M. (2000). A job-shop scheduling model for the single track railway scheduling model. Research Report, School of Computer Studies, University of Leeds, August 2000.
13. Papadimitriou, C. H., & Kanellakis, P. C. (1980). Flowshop scheduling with limited temporary storage. Journal of the ACM, 27, 533-549.
14. Raghuram, G., & Rao, V. (1991). A decision support system for improving railway line capacity. Public Enterprise, 11, 64-72.
15. Rangaraj, N., Ranade, A., Moudgalya, K., Naik, R., Konda, C., & Johri, M. (2003). A simulator for estimating railway line capacity. In Proceedings of the sixth international conference of the association of Asia-Pacific operational research societies within IFORS (pp. 347-355).