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 several daily instances and solve those separately. However, we found out that this can be rather inefficient. In this paper, we discuss several methods to partition huge instances into several smaller ones. These smaller instances are then solved with the commercially available crew scheduling algorithm TURNI. We compare these partitioning methods with each other, and we report several results where we applied different partitioning methods after each other. The results show that all methods significantly improve the solution. With the best approach, we were able to cut down crew costs with about 2\\% (about 6 million euro per year).
|Erasmus School of Economics|
|Econometric Institute Research Papers|
|Report / Econometric Institute, Erasmus University Rotterdam|
|Organisation||Erasmus School of Economics|
Abbink, E.J.W. (2008). Solving large scale crew scheduling problems by using iterative partitioning (No. EI 2008-03). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–15). Erasmus School of Economics. Retrieved from http://hdl.handle.net/1765/11701