TY - GEN

T1 - Solving very large crew scheduling problems to optimality

AU - Yunes, Tallys H.

AU - Moura, Arnaldo V.

AU - De Souza, Cid C.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In this article, we present a hybrid methodology for the exact solution of large scale real world crew scheduling problems. Our approach integrates mathematical programming and constraint satisfaction techniques, taking advantage of their particular abilities in modeling and solving specific parts of the problem. An Integer Programming framework was responsible for guiding the overall search process and for obtaining lower bounds on the value of the optimal solution. Complex constraints were easily expressed, in a declarative way, using a Constraint Logic Programming language. Moreover, with an effective constraint-based model, the huge space of feasible solutions could be implicitly considered in a fairly efficient way. Our code was tested on real problem instances arising from the daily operation of an ordinary urban transit company that serves a major metropolitan area with an excess of two million inhabitants. Using a typical desktop PC, we were able find, in an acceptable running time, an optimal solution to instances with more than 1.5 billion entries.

AB - In this article, we present a hybrid methodology for the exact solution of large scale real world crew scheduling problems. Our approach integrates mathematical programming and constraint satisfaction techniques, taking advantage of their particular abilities in modeling and solving specific parts of the problem. An Integer Programming framework was responsible for guiding the overall search process and for obtaining lower bounds on the value of the optimal solution. Complex constraints were easily expressed, in a declarative way, using a Constraint Logic Programming language. Moreover, with an effective constraint-based model, the huge space of feasible solutions could be implicitly considered in a fairly efficient way. Our code was tested on real problem instances arising from the daily operation of an ordinary urban transit company that serves a major metropolitan area with an excess of two million inhabitants. Using a typical desktop PC, we were able find, in an acceptable running time, an optimal solution to instances with more than 1.5 billion entries.

KW - Column generation

KW - Constraint programming

KW - Crew scheduling

KW - Hybrid algorithms

KW - Mathematical programming

UR - http://www.scopus.com/inward/record.url?scp=4043162676&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4043162676&partnerID=8YFLogxK

U2 - 10.1145/335603.335901

DO - 10.1145/335603.335901

M3 - Conference contribution

AN - SCOPUS:4043162676

SN - 1581132409

SN - 9781581132403

T3 - Proceedings of the ACM Symposium on Applied Computing

SP - 446

EP - 451

BT - Proceedings of the 2000 ACM Symposium on Applied Computing, SAC 2000

PB - Association for Computing Machinery

T2 - 2000 ACM Symposium on Applied Computing, SAC 2000

Y2 - 19 March 2000 through 21 March 2000

ER -