In December 2006, Netherlands Railways introduced a completely new timetable. Its objective was to facilitate the growth of passenger and freight transport on a highly utilized railway network and improve the robustness of the timetable, thus resulting in fewer operational train delays. Modifications to the existing timetable, which was constructed in 1970, were not an option; additional growth would require significant investments in the rail infrastructure.Constructing a railway timetable from scratch for about 5,500 daily trains was a complex problem. To support this process, we generated several timetables using sophisticated operations research techniques. Furthermore, because rolling-stock and crew costs are principal components of the costs of a passenger railway operator, we used innovative operations research tools to devise efficient schedules for these two resources.The new resource schedules and the increased number of passengers resulted in an additional annual profit of E40 million ($60 million); the additional revenues generated approximately E10 million of this profit. We expect this profit to increase to E70 million ($105 million) annually in the coming years. However, the benefits of the new timetable for the Dutch society as a whole are much greater: more trains are transporting more passengers on the same railway infrastructure, and these trains are arriving and departing on schedule more than they ever have in the past. In addition, the rail transport system will be able to handle future transportation demand growth and thus allow cities to remain accessible to more people. Therefore, we expect that many will switch from car transport to rail transport, thus reducing the emission of greenhouse gases.
For a commercially operating railway company, providing a high level of service for the passengers is of utmost importance. The latter requires a high punctuality of the trains and an adequate rolling stock capacity. Unfortunately, the latter is currently (2002) one of the bottlenecks in the service provision by the main Dutch railway operator NS Reizigers. Especially during the morning rush hours, many passengers cannot be transported according to the usual service standards due to a shortage of the rolling stock capacity. On the other hand, a more effective allocation of the available rolling stock capacity seems to be feasible, since there are also a few trains with some slack capacity.The effectiveness of the rolling stock capacity is determined mainly by the allocation of the train types and subtypes to the lines. Therefore, we describe in this paper a model that can be used to find an optimal allocation of train types and subtypes to train series. This optimal allocation is more effective than the manually planned one, which is accomplished by minimizing the shortages of capacity during the rush hours.The model is implemented in the modeling language OPL Studio 3.1, solved by CPLEX 7.0, and tested on several scenarios based on the 2001-2002 timetable of NS Reizigers. The results of the model were received positively, both by the planners and by the management in practice, since these results showed that a significant service improvement over the manually planned allocation can be achieved within a shorter throughput time of the involved part of the planning process.
This paper deals with large-scale crew scheduling problems arising at the main Dutch railway operator, Netherlands Railways (NS). NS operates about 30000 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.
In this paper we describe the successful application of a sophisticated Operations Research model and the corresponding solution techniques for scheduling the 6,500+ drivers and conductors of the Dutch railway operator NS Reizigers (Netherlands Railways). In 2001 the drivers and conductors were very dissatisfied with the structure of their duties, which led to nation wide strikes. However, the application of the model described in this paper led to the development of an alternative production model ('Sharing Sweet & Sour') that both satisfied the drivers and conductors, and at the same time supported an increment of the punctuality and efficiency of the railway services. The plans produced according to the alternative production model trimmed personnel costs by about $4.8million (or1.2%) per year. Moreover, it was shown that cost reductions of over $7 million per year are also achievable. conductors were very dissatisfied with the structure of their duties, which led to nation wide strikes. However, the application of the model described in this paper led to the development of an alternative production model ('Sharing Sweet&Sour') that both satisfied the drivers and conductors, and at the same time supported an increment of the punctuality and efficiency of the railway services. The plans produced according to the alternative production model trimmed personnel costs by about $4.8 million (or 1.2%) per year. Moreover, it was shown that cost reductions of over $7 million per year are also achievable.
This paper describes a method for solving the cyclic crew rostering problem (CCRP). This is the problem of cyclically ordering a set of duties for a number of crew members, such that several complex constraints are satisfied and such that the quality of the obtained roster is as high as possible. The described method was tested on a number of instances of NS, the largest operator of passenger trains in the Netherlands. These instances involve the generation of rosters for groups of train drivers or conductors of NS. The tests show that high quality solutions for practical instances of the CCRP can be generated in an acceptable amount of computing time. Finally, we describe an experiment where we constructed rosters in an automatic way for a group of conductors. They preferred our-generated-rosters over their own manually constructed rosters.
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.