1999
DOI: 10.1007/978-3-642-85970-0_1
|View full text |Cite
|
Sign up to set email alerts
|

Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
31
0
1

Year Published

2001
2001
2016
2016

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 40 publications
(32 citation statements)
references
References 9 publications
0
31
0
1
Order By: Relevance
“…Major kinds of rolling stock include locomotives with cars and train units. When trains and rolling stock schedules are given, the next step would be crew scheduling (Caprara et al, 1999;Kroon and Fischetti, 2001;Kwan, 2010;Shen et al, 2013) assigning duties to transport staff in accordance with train and rolling stock planning. Rescheduling (recovery) on the above three stages is also important for realtime disturbance and disruption management.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Major kinds of rolling stock include locomotives with cars and train units. When trains and rolling stock schedules are given, the next step would be crew scheduling (Caprara et al, 1999;Kroon and Fischetti, 2001;Kwan, 2010;Shen et al, 2013) assigning duties to transport staff in accordance with train and rolling stock planning. Rescheduling (recovery) on the above three stages is also important for realtime disturbance and disruption management.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, developments in hard-and software nowadays enable the application of such models in the railway industry as well [2,3,8,9,10,11]. A typical instance of NS Reizigers related to the planning of a single duty type (driver or conductor) on a single workday involves about 14,000 time-tabled trips to be assigned to 1,000+ duties in 29 crew depots.…”
Section: Turnimentioning
confidence: 99%
“…[20,21,22]) construct new shifts incrementally as their need is recognised within the process, using shortest path, dynamic programming or constraint programming methods. We have avoided this approach, as in our experience, the costs of individual shifts are not incremental and cannot be determined until the whole shift is evaluated.…”
Section: User Interfacementioning
confidence: 99%