A branch-and-cut approach for solving railway line-planning problems

Transportation Science

Volumn 38, Issue 3, 2004, Pages 379-393

  Goossens, Jan Willem ^a   van Hoesel, Stan ^a   Kroon, Leo ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b ERASMUS UNIVERSITY   (Netherlands)

Author keywords

Branch and cut; Combinatorial optimization; Integer programming; Rail transportation

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; RESOURCE ALLOCATION; STRATEGIC PLANNING;

BRANCH AND CUT; COMBINATORIAL OPTIMIZATION; COST MINIMIZING LINE PLANNING PROBLEM;

RAILROAD TRANSPORTATION;

EID: 4544336693     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0051     Document Type: Article

References (20)

1. ABACUS. 1998. ABACUS, A Branch-And-CUt System. Universität zu Köln, Universität Heidelberg, Germany.
2. Bussieck, M. R. 1998. Optimal lines in public rail transport. Ph.D. thesis, University of Braunschweig, Braunschweig, Germany.
3. Bussieck, M. R., P. Kreuzer, U. T. Zimmermann. 1996. Optimal lines for railway systems. Eur. J. Oper. Res. 96(1) 54-63.
4. Bussieck, M. R., T. Lindner, M. E. Lübbecke. 2002. Cost optimal line planning: A combined linear/nonlinear integer programming approach. Technical report, Department of Mathematical Optimization, Braunschweig University of Technology, Braunschweig, Germany.
5. Caprara, A., M. Fischetti, P. Toth, D. Vigo, P. L. Guida. 1997. Algorithms for railway crew management. Math. Programming 79 125-141.
6. Claessens, M. T., N. M. van Dijk, P. J. Zwaneveld. 1998. Cost optimal allocation of rail passenger lines. Eur. J. Oper. Res. 110 474-489.
7. Dietrich, B. L., L. F. Escudero. 1994. Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts. Eur. J. Oper. Res. 73 539-546.
8. Gallo, G., F. Di Miele. 2001. Dispatching busses in parking depots. Transportation Sci. 79 322-330.
9. Goossens, J. H. M., C. P. M. van Hoesel, L. G. Kroon. 2002. On solving multi-type line planning problems. METEOR Research Memorandum RM/02/009, University of Maastricht, Maastricht, The Netherlands.
10. Härte, F. L. 1995. Het verbeteren van dienstregelingen en het opstellen van lijnvoeringen. Master's thesis, Free University Amsterdam, Amsterdam, The Netherlands (in Dutch).
11. Linderoth, J. T., M. W. P. Savelsbergh. 1999. A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2) 173-187.
12. Lindner, T. 2000. Train schedule optimization in public rail transport. Ph.D. thesis, Braunschweig University of Technology, Braunschweig, Germany.
13. Martello, S., P. Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, New York.
14. Nachtigall, K. 1999. Periodic network optimization and fixed interval timetables. Ph.D. thesis, Deutsches Zentrum für Luft- und Raumfahrt, Braunschweig, Germany.
15. Odijk, M. A. 1997. Railway timetable generation. Ph.D. thesis, Delft University of Technology, Delft, The Netherlands.
16. Oltrogge, C. 1994. Liniënplanung für mehrstufige Bedienungssysteme im öffentlichen Personenverkehr. Ph.D. thesis, Technical University of Braunschweig, Braunschweig, Germany (in German).
17. Schrijver, A. 1993. Minimum circulation of railway stock. CWI Quart. 3 205-217.
18. Schrijver, A., A. Steenbeek. 1994. Dienstregelingontwikkeling voor Railned (timetable construction for Railned). Technical report, CWI, Center for Mathematics and Computer Science, Amsterdam, The Netherlands (in Dutch).
19. Thienel, S. 1995. ABACUS, A Branch-And-CUt System. Ph.D. thesis, Universität zu Köln, Köln, Germany.
20. Zwaneveld, P. J. 1997. Railway planning, routing of trains and allocation of passenger lines. Ph.D. thesis, Erasmus Universiteit Rotterdam, Rotterdam, The Netherlands.