A Hybrid Approach for Solving Large Scale Crew Scheduling Problems

Authors:
Tallys H. Yunes;Arnaldo V. Moura;Cid C. de Souza
Affiliations:
-;-;-
Venue:
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Year:
2000

Citing 5
Cited 3

Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Solving Crew Scheduling Problems bu Constraint Programming

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Properties of Some Combinatorial Optimization Problemsand Their Effect on the Performance of Integer Programming and Constraint Logic Programming

INFORMS Journal on Computing
Dynamic backtracking

Journal of Artificial Intelligence Research

Constraint Logic Programming

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Dantzig-Wolfe decomposition and branch-and-price solving in G12

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particularly, in efficiently searching the very large space of feasible solutions. The code was tested on real problem instances, containing an excess of 1:8 × 109 entries, which were solved to optimality in an acceptable running time when executing on a typical desktop PC.