Modeling network transition constraints with hypergraphs

Transportation Science

Volumn 45, Issue 1, 2011, Pages 81-97

  Harrod, Steven ^a  

^a UNIVERSITY OF DAYTON   (United States)

Author keywords

Directed hypergraphs; Discrete networks; Railway scheduling

Indexed keywords

COMPLEX NETWORKS; FLOW GRAPHS; RAILROADS; SCHEDULING; TRANSPORTATION;

CONSTRAINED RESOURCES; DIRECTED HYPERGRAPHS; DISCRETE NETWORKS; DISCRETE TIME DYNAMICS; EXPERIMENTAL PROBLEMS; INTERACTION EFFECT; MULTI-COMMODITY FLOW; RAILWAY SCHEDULING;

GRAPH THEORY;

EID: 79951897217     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0337     Document Type: Article

References (32)

1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329. (Pubitemid 128655433)
2. Brännlund, U., P. O. Lindberg, A. Nõu, J.-E. Nilsson. 1998. Railway timetabling using Lagrangian relaxation. Transportation Sci. 32(4) 358-369. (Pubitemid 128608923)
3. Cacchiani, V., A. Caprara, P. Toth. 2010. Scheduling extra freight trains on railway networks. Transportation Res. Part B 44 215-231.
4. Caimi, G., D. Burkolter, T. Herrmann, F. Chudak, M. Laumanns. 2009. Design of a railway scheduling model for dense services. Networks Spatial Econom. 9 25-46.
5. Cambini, R., G. Gallo, M. G. Scutella. 1997. Flows on hypergraphs. Math. Programming 78 195-217. (Pubitemid 127371393)
6. Caprara, A., M. Fischetti, P. Toth. 2002. Modeling and solving the train timetabling problem. Oper. Res. 50(5) 851-861.
7. Caprara, A., M. Monaci, P. Toth, P. L. Guida. 2006. A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Appl. Math. 154 738-753.
8. Carey, M. 1994. A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Res. Part B 28B(5) 333-353.
9. D'Ariano, A., F. Corman, D. Pacciarelli, M. Pranzo. 2008. Reordering and local rerouting strategies to manage train traffic in real time. Transportation Sci. 42(4) 405-419.
10. Djellab, H., K. Djellab, M. Gourgand. 2000. A new heuristic based on a hypergraph representation for the tool switching problem. Internat. J. Production Econom. 64 165-176. (Pubitemid 30557652)
11. Gallo, G., G. Longo, S. Nguyen, S. Pallottino. 1993. Directed hypergraphs and applications. Discrete Appl. Math. 42 177-201.
12. Gondran, M., M. Minoux. 1984. Graphs and Algorithms. Wiley-Interscience, Chichester, UK. [English translation of Graphes et Algorithmes, 1979.]
13. Gorman, M. F. 2009. Statistical estimation of railroad congestion delay. Transportation Res. Part E 45(3) 446-456.
14. Higgins, A., E. Kozan, L. Ferreira. 1996. Optimal scheduling of trains on a single line track. Transportation Res. Part B 30(2) 147-161. (Pubitemid 27035196)
15. Hilton, G. W. 1976. Slack. Trains 36(4) 22-28.
16. Jovanovic, D., P. T. Harker. 1990. A decision support system for train dispatching: An optimization-based methodology. J. Transportation Res. Forum 31(1) 25-37.
17. Korte, B., J. Vygen. 2008. Combinatorial Optimization, Theory and Algorithms, Algorithms and Combinatorics, Vol. 21, 4th ed. Springer, Berlin.
18. Krishnamoorthy, S., U. Catalyurek, J. Nieplocha, A. Rountev, P. Sadayappan. 2006. Hypergraph partitioning for automatic memory hierarchy management. SC '06: Proc. 2006 ACM/IEEE Conf. Supercomput., ACM Press, New York, 98.
19. Marcotte, P., S. Nguyen, A. Schoeb. 2004. A strategic flow model of traffic assignment in static capacitated networks. Oper. Res. 52(2) 191-212.
20. Martin, R. K, R. L. Rardin, B. A. Campbell. 1990. Polyhedral characterization of discrete dynamic programming. Oper. Res. 38(1) 127-138. (Pubitemid 20674481)
21. Martland, C. D. 2008. Improving on-time performance for longdistance passenger trains operating on freight routes. J. Transportation Res. Forum 47(4) 63-80.
22. Mees, A. I. 1991. Railway scheduling by network optimization. Math. Comput. Model. 15(1) 33-42.
23. Nagarajan, V., A. G. Ranade. 2008. Exact train pathing. J. Scheduling 11(4) 279-297.
24. Nguyen, S., S. Pallottino. 1988. Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 37 176-186.
25. Nõu, A. 1997. Railway timetabling-Lagrangian heuristics, trita/mat-97-os12. Technical report, Department of Mathematics, Royal Institute of Technology, Stockholm.
26. Oliveira, E., B. M. Smith. 2000. A job-shop scheduling model for the single-track railway scheduling problem. Technical report, School of Computing, University of Leeds, Leeds, UK.
27. Sahin, G., R. K. Ahuja, C. B. Cunha. 2006. Integer programming based approaches for the train dispatching problem. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville.
28. TÖrnquist, J. 2007. Railway traffic disturbance management-An experimental analysis of disturbance complexity, management objectives and limitations in planning horizon. Transportation Res. Part A 41 249-266. (Pubitemid 44824829)
29. Van Dyke, C. D., L. C. Davis. 1992. Computer dispatching simulation of high density, mixed freight and passenger train operations. T. K. S. Murthy, J. Allan, R. J. Hill, G. Sciutto, S. Sone, eds. Computers in Railways III, Vol. 2. Computational Mechanics Publications, Southhampton, UK, 119-130.
30. White, T. 2005. Alternatives for railroad traffic simulation analysis. Transportation Res. Record 1916 34-41.
31. White, T., A. Krug. 2005. Managing Railroad Transportation. VTD Rail Publishing, Mountlake Terrace, WA.
32. Zwaneveld, P. J., L. G. Kroon, H. E. Romeijn, M. Salomon, S. Dauzère-Pérès, S. P. M. Van Hoesel, H. W. Ambergen. 1996. Routing trains through railway stations: Model formulation and algorithms. Transportation Sci. 30(3) 181-194. (Pubitemid 126605103)