New heuristics to solve the "CSOP" railway timetabling problem

  • Ingolotti L
  • Lova A
  • Barber F
 et al. 
  • 18


    Mendeley users who have this article in their library.
  • 6


    Citations of this article.


The efficient use of infrastructures us a hard requirement for railway companies. Thus, the scheduling of trains should aim toward optimality, which is an NP-hard problem. The paper presents a friendly and flexible computer-based decision support system for railway timetabling. It implements an efficient method, based on meta-heuristic techniques, which provides railway timetables that satisfy a realistic set of constraints and, that optimize a multi-criteria objective function. © Springer-Verlag Berlin Heidelberg 2006.

Author-supplied keywords

  • Constraint Satisfaction
  • Decision Support
  • Planning and Scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free