𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving large scale crew scheduling problems

✍ Scribed by Hai D. Chu; Eric Gelman; Ellis L. Johnson

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
572 KB
Volume
97
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

The crew pairing problem is posed as a set partitioning zero-one integer program. Variables are generated as legal pairings meeting all work rules. Dual values obtained from solving successive large linear program relaxations are used to prune the search tree. In this paper we present a graph based branching heuristic applied to a restricted set partitioning problem representing a collection of ' best' pairings. The algorithm exploits the natural integer properties of the crew pairing problem. Computational results are presented to show realized crew cost savings.

πŸ“œ SIMILAR VOLUMES

Solving problems in production schedulin
Solving problems in production scheduling
✍ Robin Lane; Stephen Evans πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 1012 KB

Traditionally, production scheduling has been viewed as a problem-solving task that involves a single problem -generation of a suitable schedule. This paper presents an alternative model in which individual difficulties are viewed as problems, and the task is to maintain a suitable schedule by resol

Decomposition and parallelization strate
Decomposition and parallelization strategies for solving large-scale MDO problems
✍ M. Grauer; Hans A. Eschenauer πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

## Abstract During previous years, structural optimization has been recognized as a useful tool within the discriptines of engineering and economics. However, the optimization of large‐scale systems or structures is impeded by an immense solution effort. This was the reason to start a joint researc