2014
DOI: 10.1007/s10479-014-1619-1
|View full text |Cite
|
Sign up to set email alerts
|

A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…Several papers published so far tackled the subject of automation in railway crew scheduling. One commonly used approach is to employ complete enumeration to generate all possible candidates that satisfy the given constraints and, afterward, apply integer linear programming to solve the problem [8] of crew scheduling in transit systems. Additionally, heuristic methods are widely adopted.…”
Section: Introductionmentioning
confidence: 99%
“…Several papers published so far tackled the subject of automation in railway crew scheduling. One commonly used approach is to employ complete enumeration to generate all possible candidates that satisfy the given constraints and, afterward, apply integer linear programming to solve the problem [8] of crew scheduling in transit systems. Additionally, heuristic methods are widely adopted.…”
Section: Introductionmentioning
confidence: 99%
“…According to the growing needs for high‐speed and high‐density train operations that are punctual and safe, rescheduling has become so complicated that it cannot be done without using a computer‐based support system . Reassigning of train crews is a computationally complex problem, and various algorithms for solving it by using optimization techniques incorporating heuristic methods have been reported .…”
Section: Introductionmentioning
confidence: 99%
“…To the best of the authors' knowledge, the hybrid CP/ IP approach has not been applied to the railroad crew scheduling problem for real-world applications. Nevertheless, this hybrid approach has been proved to be successful in the applications in some related fields, for example, bus driver scheduling, MRT crew scheduling, and maintenance crew scheduling (21)(22)(23). Therefore, this paper reports the first application of using CP and IP to solve the railroad crew scheduling problem with a case from the Kaohsiung depot of the Taiwan Railways Administration (TRA).…”
mentioning
confidence: 99%