Solving large scale crew scheduling problems

Solving large scale crew scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor19991311
Country: Netherlands
Volume: 97
Issue: 2
Start Page Number: 260
End Page Number: 268
Publication Date: Mar 1997
Journal: European Journal of Operational Research
Authors: , ,
Keywords: personnel & manpower planning
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.