Laura Paola Ingolotti

Learn More
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, many problems are inherently distributed and the problem complexity can be reduced by dividing the problem into a set of subprob-lems. Nevertheless, general(More)
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms railway problems into formal mathematical models that can be solved and then plots the best possible solution available. Due to the complexity of problems of this kind, the use of(More)
The efficient use of infrastructures is a hard requirement for railway companies. Thus, the scheduling of trains should aim toward op-timality, 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(More)
We present an interactive application to assist planners in adding new trains on a complex railway network. It includes many trains with different characteristics, whose timetables cannot be modified because they are already in circulation. The application builds the timetable for new trains linking the available time slots to trains to be scheduled. A very(More)
With the aim of supporting the process of adapting railway infrastructure to present and future traffic needs, we have developed a method to build train timetables efficiently. In this work, we describe the problem in terms of constraints derived from railway infrastructure, user requirements and traffic constraints, and we propose a method to solve it(More)
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oered to its customers. In this paper, we present a software system for solving and plotting the Single-Track Railway Scheduling Problem eciently and quickly. The problem is(More)
This work is focused on the application of evolutionary algorithms to solve very complex real-world problems. For this purpose a Genetic Algorithm is designed to solve the Train Timetabling Problem. Optimizing train timetables on a single line track is known to be NP-hard with respect to the number of conflicts in the schedule. This makes it difficult to(More)