Reinventing Crew Scheduling at Netherlands Railways
نویسندگان
چکیده
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. 5001-6182 Business 5201-5982 Business Science Library of Congress Classification (LCC) HE 147.7 Mathematical models, transportation M Business Administration and Business Economics M 11 R 4 Production Management Transportation Systems Journal of Economic Literature (JEL) C 61 Optimization Techniques 85 A Business General 260 K 240 B Logistics Information Systems Management European Business Schools Library Group (EBSLG) 260 Q Operations research, Transportation Gemeenschappelijke Onderwerpsontsluiting (GOO) 85.00 Bedrijfskunde, Organisatiekunde: algemeen 85.34 85.20 Logistiek management Bestuurlijke informatie, informatieverzorging Classification GOO 85.03 Methoden en technieken, operations research Bedrijfskunde / Bedrijfseconomie Bedrijfsprocessen, logistiek, management informatiesystemen
منابع مشابه
Generalized Algorithms for Crew Planning: Survey and Future Directions for Railways
This paper studies the crew planning problem as observed in the transportation industry. We first survey the existing literature on crew scheduling applications in railways and airlines. Next, we identify the synergies in the two domains and propose new directions for railway crew scheduling inspired from the applications in airlines.
متن کاملSolving Large Scale Crew Scheduling Problems by using Iterative Partitioning
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 conductors. No available crew scheduling algorithm can solve such huge instances at once. A common approach to deal with these huge weekly instances, is to split them into sever...
متن کاملTPO: A System for Scheduling and Managing Train Crew in Norway
This paper reports some results of a long-term work in application of AI techniques whose ultimate goal is the development of tools for resource scheduling. Most of the efforts so far have been devoted to crew scheduling in railways and the resulting tool is called CREWS. CREWS contains the basic knowledge for crew scheduling, remains constant across companies, and only needs to be extended wit...
متن کاملScheduling Train Crews: a case study for the Dutch Railways
In this paper the problem of scheduling train crew is considered. We discuss a general framework of which the method for solving the train crew scheduling problem is a special case. In particular, our method is a heuristic branch-and-price algorithm suitable for large scale crew scheduling problems. This algorithm is applied to a real life train guard scheduling problem which is provided to us ...
متن کاملCREWS_NS: Scheduling Train Crew in The Netherlands
long-term scheduling of drivers and guards for the Dutch Railways. CREWS_NS schedules the work of about 5000 people. CREWS_NS is built on top of CREWS, a scheduling tool for speeding the development of scheduling applications. CREWS heavily relies on the use of AI techniques and has been built as a white-box system, in the sense that the planner can perceive what is going on, can interact with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Interfaces
دوره 35 شماره
صفحات -
تاریخ انتشار 2005