High performance integer optimization for crew scheduling

Sanders, Peter; Takkula, Tuomo; Wedelin, Dag

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

High performance integer optimization for crew scheduling

MPS-Authors

/persons/resource/persons45344

Sanders, Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Sanders, P., Takkula, T., & Wedelin, D. (1999). High performance integer optimization for crew scheduling. In P. Sloot, M. Bubak, A. Hoekstra, & B. Hertzberger (Eds.), Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99) (pp. 3-12). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-35D2-3

Abstract

Performance aspects of a Lagrangian relaxation based heuristic for solving large 0-1 integer linear programs are discussed. In particular, we look at its application to airline and railway crew scheduling problems. We present a scalable parallelization of the original algorithm used in production at Carmen Systems AB, G\"oteborg, Sweden, based on distributing the variables and a new sequential \emph{active set strategy} which requires less work and is better adapted to the memory hierachy properties of modern RISC processors. The active set strategy can even be parallelized on networks of workstations.