Advertisement

A Hybridised Integer Programming and Local Search Method for Robust Train Driver Schedules Planning

  • Ignacio Laplagne
  • Raymond S. K. Kwan
  • Ann S. K. Kwan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3616)

Abstract

When a train arrives at a station, it often stops for some time before continuing, giving rise to a window of relief opportunities (WRO), during which the train may be handed over between drivers. Incorporating these windows into the scheduling model may help improve the robustness and efficiency of driver schedules. However, if it is formulated as a set covering problem, the incorporation of WROs would cause the resulting model to be too big to be solved in realistic times with current technology.

In this paper, we propose a combined integer programming and local search approach. In the first step, WROs are approximated, and the problem is solved using integer programming. Using the solution thus obtained as a starting point, WROs are restored and a multi-neighbourhood local search algorithm takes over. We also investigate the possibility of deriving a new set of approximations from the local search solution, and loop back to the integer programming phase.

The algorithm is tested using real-life data from a large rail network in Scotland, producing improved, operational schedules for this network.

Keywords

Local Search Schedule Model Infeasible Solution Local Search Phase Train Driver 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ageeva, Y.: Approaches to Incorporating Robustness into Airline Scheduling. Master’s Thesis. Massachusetts Institute of Technology (2000)Google Scholar
  2. 2.
    Ehrgott, M., Ryan, D.M.: Constructing Robust Crew Schedules with Bicriteria Optimization. J. Multi-Criteria Decision Anal. 11, 139–150 (2002)Google Scholar
  3. 3.
    Fores, S., Proll, L., Wren, A.: Experiences with a Flexible Driver Scheduler. In: Voss, S., Daduna, J.R. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 137–152. Springer, Berlin (2001)CrossRefGoogle Scholar
  4. 4.
    Glover, F.: Tabu Search—Part I. ORSA J. Comput. 1, 190–206 (1989)Google Scholar
  5. 5.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)Google Scholar
  6. 6.
    Kwan, A.S.K., Parker, M.E., Kwan, R.S.K., Fores, S., Proll, L., Wren, A.: Recent Advances in TRACS. In: Proc. 9th Int. Conf. on Computer-Aided Scheduling of Public Transport (2004)Google Scholar
  7. 7.
    Kwan, R.S.K.: Bus and Train Driver Scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 51, CRC Press, Boca Raton (2004)Google Scholar
  8. 8.
    Shen, Y.: Tabu Search for Bus and Train Driver Scheduling with Time Windows. Ph.D. Thesis. School of Computing, University of Leeds (2001)Google Scholar
  9. 9.
    Shen, Y., Kwan, R.S.K.: Tabu Search for Driver Scheduling. In: Voss, S., Daduna, J.R. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 121–135. Springer, Berlin (2001)CrossRefGoogle Scholar
  10. 10.
    Wren, A., Fores, S., Kwan, A., Kwan, R., Parker, M., Proll, L.: A Flexible System for Scheduling Drivers. J. Scheduling 6, 437–455 (2003)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ignacio Laplagne
    • 1
  • Raymond S. K. Kwan
    • 1
  • Ann S. K. Kwan
    • 1
  1. 1.School of ComputingUniversity of LeedsLeedsUK

Personalised recommendations