A Scheduling Order-Based Method to Solve Timetabling Problems
We propose an efficient method that obtains train timetables. It solves conflicts among trains by assigning priorities for each track section of their journey. The heuristic used to determine the priority for each train, takes into account the objective function of the problem. With this method, we try to explore different regions of the same search space as soon as possible so that the final user obtains a feasible solution in a reasonable computation time.
KeywordsSearch Tree Railway Line Timetabling Problem Train Schedule Railway Infrastructure
Unable to display preview. Download preview PDF.
- 2.Lova, A., Tormos, P., Barber, F., Ingolotti, L., Salido, M.A., Abril, M.: Intelligent Train Scheduling on a High-Loaded Railway Network. In: ATMOS 2004: Algorithmic Methods and Models for Optimization of Railways. LNCS, Springer Verlag, Heidelberg (2005) (to appear)Google Scholar
- 3.Nachtigall, K., Voget, S.: Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks 103, 610–627 (1997)Google Scholar
- 4.Schrijver, A., Steenbeek, A.: Timetable construction for railned. Technical Report, CWI, Amsterdam, The Netherlands (in Dutch) (1994)Google Scholar
- 5.Schirmer, A., Riesenberg, S.: Parameterized heuristics for project scheduling-Biased random sampling methods. Technical Report 456. Institute fr Betriebswirtschaftslehre der UNIVERSITT KIEL (1997)Google Scholar
- 7.de Oliveira, S.E.: Solving Single-Track Railway Scheduling Problem Using Constraint Programming. Phd Thesis. Univ. of Leeds, School of Computing (2001)Google Scholar