Abstract
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
Cite
CITATION STYLE
Ingolotti, L., Lova, A., Barber, F., Tormos, P., Salido, M. A., & Abril, M. (2006). New heuristics to solve the “CSOP” railway timetabling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 400–409). Springer Verlag. https://doi.org/10.1007/11779568_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
