Evaluating the Applicability of Advanced Techniques for Practical Real-time Train Scheduling

AbstractThis paper reports on the practical applicability of published techniques for real-time train scheduling. The final goal is the development of an advanced decision support system for supporting dispatchers’ work and for guiding them toward near-optimal real-time re-timing, re-ordering and re-routing decisions. The paper focuses on the optimization system AGLIBRARY that manages trains at the microscopic level of block sections and block signals and at a precision of seconds. The system outcome is a detailed conflict-free train schedule, being able to avoid deadlocks and to minimize train delays. Experiments on a British railway nearby London demonstrate that AGLIBRARY can quickly compute near-optimal solutions

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

Mixed integer-linear formulations of cumulative scheduling constraints - A comparative study

This paper introduces two MILP models for the cumulative scheduling constraint and associated pre-processing filters. We compare standard solver performance for these models on three sets of problems and for two of them, where tasks have unitary resource consumption, we also compare them with two models based on a geometric placement constraint. In the experiments, the solver performance of one of the cumulative models, is clearly the best and is also shown to scale very well for a large scale industrial transportation scheduling problem

Robust Aircraft Squadron Scheduling in the Face of Absenteeism

Air Force fighter aircraft squadrons the world over share a unique problem. Each requires complex training schedules coupling aircraft to pilots, the duo to missions and airspaces, and then the entire combination to a feasible time slot. Creating daily and weekly flight schedules that include shifts around the clock every day of the year with a set number of pilots is a time consuming job for manual schedulers within a squadron. Complicating matters is absenteeism. If one or more pilots are unable to perform their previously assigned tasks, due to sickness, aircraft failure, or reassignment, those tasks must be performed by pilots that were not previously scheduled. These changes can not conflict with the rules of Air Force regulations, squadron policy, the squadron commander, operations officer or flight training officer’s direction. Given these constraints, the goal of a new re-rostered schedule, in the event of absenteeism, should be to affect the previous schedule as little as possible. This research will develop a weekly flight schedule. The goal of this reformulated schedule is robustness to absenteeism. In order to find a robust schedule, a comparison will be done to select the most robust schedule from among 17 candidate schedules. The expected values for the number of changes for each schedule are compared, and a general conclusion will be provided using a new objective function to create a model that yields a robust schedule on the first attempt

The 1990 progress report and future plans

This document describes the progress and plans of the Artificial Intelligence Research Branch (RIA) at ARC in 1990. Activities span a range from basic scientific research to engineering development and to fielded NASA applications, particularly those applications that are enabled by basic research carried out at RIA. Work is conducted in-house and through collaborative partners in academia and industry. Our major focus is on a limited number of research themes with a dual commitment to technical excellence and proven applicability to NASA short, medium, and long-term problems. RIA acts as the Agency's lead organization for research aspects of artificial intelligence, working closely with a second research laboratory at JPL and AI applications groups at all NASA centers

Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms

This paper provides an overview of the research in railway scheduling and dispatching. A distinction is made between tactical scheduling, operational scheduling and re-scheduling. Tactical scheduling refers to master scheduling, whereas operational scheduling concerns scheduling at a later stage. Re-scheduling focuses on the re-planning of an existing timetable when deviations from it have occurred. 48 approaches published between 1973 and 2005 have been reviewed according to a framework that classifies them with respect to problem type, solution mechanism, and type of evaluation. 26 of the approaches support the representation of a railway network rather than a railway line, but the majority has been experimentally evaluated for traffic on a line. 94 % of the approaches have been subject to some kind of experimental evaluation, while approximately 4 % have been implemented. The solutions proposed vary from myopic, priority-based algorithms, to traditional operations research techniques and the application of agent technology.This paper provides an overview of the research in railway scheduling and dispatching. A distinction is made between tactical scheduling, operational scheduling and re-scheduling. Tactical scheduling refers to master scheduling, whereas operational scheduling concerns scheduling at a later stage. Re-scheduling focuses on the re-planning of an existing timetable when deviations from it have occurred. 48 approaches published between 1973 and 2005 have been reviewed according to a framework that classifies them with respect to problem type, solution mechanism, and type of evaluation. 26 of the approaches support the representation of a railway network rather than a railway line, but the majority has been experimentally evaluated for traffic on a line. 94 % of the approaches have been subject to some kind of experimental evaluation, while approximately 4 % have been implemented. The solutions proposed vary from myopic, priority-based algorithms, to traditional operations research techniques and the application of agent technology

Real-time train driver rescheduling by actor-agent techniques

Passenger railway operations are based on an extensive planning process for generating the timetable, the rolling stock circulation, and the crew duties for train drivers and conductors. In particular, crew scheduling is a complex process. After the planning process has been completed, the plans are carried out in the real-time operations. Preferably, the plans are carried out as scheduled. However, in case of delays of trains or large disruptions of the railway system, the timetable, the rolling stock circulation and the crew duties may not be feasible anymore and must be rescheduled. This paper presents a method based on multi-agent techniques to solve the train driver rescheduling problem in case of a large disruption. It assumes that the timetable and the rolling stock have been rescheduled already based on an incident scenario. In the crew rescheduling model, each train driver is represented by a driver-agent. A driver-agent whose duty has become infeasible by the disruption starts a recursive task exchange process with the other driver-agents in order to solve this infeasibility. The task exchange process is supported by a route-analyzer-agent, which determines whether a proposed task exchange is feasible, conditionally feasible, or not feasible. The task exchange process is guided by several cost parameters, and the aim is to find a feasible set of duties at minimal total cost. The train driver rescheduling method was tested on several realistic disruption instances of Netherlands Railways (NS), the main operator of passenger trains in the Netherlands. In general the rescheduling method finds an appropriate set of rescheduled duties in a short amount of time. This research was carried out in close cooperation by NS and the D-CIS Lab

Modelling single line train operations

Scheduling of trains on a single line involves using train priorities for the resolution of conflicts. The mathematical programming model described in the first part of this paper schedules trains over a single line track when the priority of each train in a conflict depends on an estimate of the remaining crossing and overtaking delay. This priority is used in a branch and bound procedure to allow the determination of optimal solutions quickly. This is demonstrated with the use of an example. Rail operations over a single line track require the existence of a set of sidings at which trains can cross and/ or overtake each other. Investment decisions on upgrading the number and location of these sidings can have a significant impact on both customer service and rail profitability. Sidings located at insufficient positions may lead to high operating costs and congestion. The second part of this paper puts forward a model to determine the optimal position of a set of sidings on a single track rail corridor. The sidings are positioned to minimise the total delay and train operating costs of a given cyclic train schedule. The key feature of the model is the allowance of non-constant train velocities and non-uniform departure times

Space Network Control Conference on Resource Allocation Concepts and Approaches

The results are presented of the Space Network Control (SNC) Conference. In the late 1990s, when the Advanced Tracking and Data Relay Satellite System is operational, Space Network communication services will be supported and controlled by the SNC. The goals of the conference were to survey existing resource allocation concepts and approaches, to identify solutions applicable to the Space Network, and to identify avenues of study in support of the SNC development. The conference was divided into three sessions: (1) Concepts for Space Network Allocation; (2) SNC and User Payload Operations Control Center (POCC) Human-Computer Interface Concepts; and (3) Resource Allocation Tools, Technology, and Algorithms. Key recommendations addressed approaches to achieving higher levels of automation in the scheduling process