15,934 research outputs found

    Solving Large Scale Crew Scheduling Problems in Practice

    Get PDF
    This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of guards. Some labor rules restrict the duties of a certain crew base over the complete week. Therefore splitting the problem in several subproblems per day leads to suboptimal solutions. In this paper, we present an algorithm, called LUCIA, which can solve such huge instances without splitting. This algorithm combines Lagrangian heuristics, column generation and fixing techniques. We compare the results with existing practice. The results show that the new method significantly improves the solution

    NICE: Robust Scheduling through Reinforcement Learning-Guided Integer Programming

    Full text link
    Integer programs provide a powerful abstraction for representing a wide range of real-world scheduling problems. Despite their ability to model general scheduling problems, solving large-scale integer programs (IP) remains a computational challenge in practice. The incorporation of more complex objectives such as robustness to disruptions further exacerbates the computational challenge. We present NICE (Neural network IP Coefficient Extraction), a novel technique that combines reinforcement learning and integer programming to tackle the problem of robust scheduling. More specifically, NICE uses reinforcement learning to approximately represent complex objectives in an integer programming formulation. We use NICE to determine assignments of pilots to a flight crew schedule so as to reduce the impact of disruptions. We compare NICE with (1) a baseline integer programming formulation that produces a feasible crew schedule, and (2) a robust integer programming formulation that explicitly tries to minimize the impact of disruptions. Our experiments show that, across a variety of scenarios, NICE produces schedules resulting in 33\% to 48\% fewer disruptions than the baseline formulation. Moreover, in more severely constrained scheduling scenarios in which the robust integer program fails to produce a schedule within 90 minutes, NICE is able to build robust schedules in less than 2 seconds on average.Comment: Accepted in 36th AAAI Conference. 7 pages + 2 pages appendix, 1 figure. Code available at https://github.com/nsidn98/NIC

    Solving large scale crew scheduling problems by using iterative partitioning

    Get PDF
    This paper deals with large-scale crew scheduling problems arisingat the Dutch railway operator, Netherlands Railways (NS). NSoperates about 30,000 trains a week. All these trains need a driverand a certain number of conductors. No available crew schedulingalgorithm can solve such huge instances at once. A common approachto deal with these huge weekly instances, is to split them intoseveral daily instances and solve those separately. However, wefound out that this can be rather inefficient.In this paper, we discuss several methods to partition hugeinstances into several smaller ones. These smaller instances arethen solved with the commercially available crew schedulingalgorithm TURNI. We compare these partitioning methods with eachother, and we report several results where we applied differentpartitioning methods after each other. The results show that allmethods significantly improve the solution. With the best approach,we were able to cut down crew costs with about 2\\% (about 6 millioneuro per year).crew scheduling;large-scale optimization;partitioning methods

    Solving a robust airline crew pairing problem with column generation

    Get PDF
    In this study, we solve a robust version of the airline crew pairing problem. Our concept of robustness was partially shaped during our discussions with small local airlines in Turkey which may have to add a set of extra flights into their schedule at short notice during operation. Thus, robustness in this case is related to the ability of accommodating these extra flights at the time of operation by disrupting the original plans as minimally as possible. We focus on the crew pairing aspect of robustness and prescribe that the planned crew pairings incorporate a number of predefined recovery solutions for each potential extra flight. These solutions are implemented only if necessary for recovery purposes and involve either inserting an extra flight into an existing pairing or partially swapping the flights in two existing pairings in order to cover an extra flight. The resulting mathematical programming model follows the conventional set covering formulation of the airline crew pairing problem typically solved by column generation with an additional complication. The model includes constraints that depend on the columns due to the robustness consideration and grows not only column-wise but also row-wise as new columns are generated. To solve this dicult model, we propose a row and column generation approach. This approach requires a set of modifications to the multi-label shortest path problem for pricing out new columns (pairings) and various mechanisms to handle the simultaneous increase in the number of rows and columns in the restricted master problem during column generation. We conduct computational experiments on a set of real instances compiled from a local airline in Turkey

    A solution approach for dynamic vehicle and crew scheduling

    Get PDF
    In this paper, we discuss the dynamic vehicle and crew schedulingproblem and we propose a solution approach consisting of solving asequence of optimization problems. Furthermore, we explain why itis useful to consider such a dynamic approach and compare it witha static one. Moreover, we perform a sensitivity analysis on ourmain assumption that the travel times of the trips are knownexactly a certain amount of time before actual operation.We provide extensive computational results on some real-world datainstances of a large public transport company in the Netherlands.Due to the complexity of the vehicle and crew scheduling problem,we solve only small and medium-sized instances with such a dynamicapproach. We show that the results are good in the case of asingle depot. However, in the multiple-depot case, the dynamicapproach does not perform so well. We investigate why this is thecase and conclude that the fact that the instance has to be splitin several smaller ones, has a negative effect on the performance.transportation;vehicle and crew scheduling;large-scale optimization;dynamic planning

    Crew Scheduling for Netherlands Railways: "destination: customer"

    Get PDF
    : In this paper we describe the use of a set covering model with additional constraints for scheduling train drivers and conductors for the Dutch railway operator NS Reizigers. The schedules were generated according to new rules originating from the project "Destination: Customer" ("Bestemming: Klant" in Dutch). This project is carried out by NS Reizigers in order to increase the quality and the punctuality of its train services. With respect to the scheduling of drivers and conductors, this project involves the generation of efficient and acceptable duties with a high robustness against the transfer of delays of trains. A key issue for the acceptability of the duties is the included amount of variation per duty. The applied set covering model is solved by dynamic column generation techniques, Lagrangean relaxation and powerful heuristics. The model and the solution techniques are part of the TURNI system, which is currently used by NS Reizigers for carrying out several analyses concerning the required capacities of the depots. The latter are strongly influenced by the new rules.crew scheduling;dynamic column generation;lagrange relaxation;railways;set covering model

    Algorithmic Support for Railway Disruption Management

    Get PDF
    Disruptions of a railway system are responsible for longer travel times and much discomfort for the passengers. Since disruptions are inevitable, the railway system should be prepared to deal with them effectively. This paper explains that, in case of a disruption, rescheduling the timetable, the rolling stock circulation, and the crew duties is so complex that solving them manually is too time consuming in a time critical situation where every minute counts. Therefore, algorithmic support is badly needed. To that end, we describe models and algorithms for real-time rolling stock rescheduling and real-time crew rescheduling that are currently being developed and that are to be used as the kernel of decision support tools for disruption management. Furthermore, this paper argues that a stronger passenger orientation, facilitated by powerful algorithmic support, will allow to mitigate the adverse effects of the disruptions for the passengers. The latter will contribute to an increased service quality provided by the railway system. This will be instrumental in increasing the market share of the public transport system in the mobility market.
    • 

    corecore