A Set Partitioning Approach to the Crew Scheduling Problem

Authors:
A. Mingozzi;M. A. Boschetti;S. Ricciarde;L. Bianco
Affiliations:
-;-;-;-
Venue:
Operations Research
Year:
1999

Citing 0
Cited 9

VRP with backhauls

The vehicle routing problem
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows

Computers and Operations Research
A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation

Computers and Operations Research
A dual ascent procedure for the set partitioning problem

Discrete Optimization
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price

Computers and Operations Research
Management of Bus Driver Duties Using Data Mining

International Journal of Applied Metaheuristic Computing
Dynamic Assignment of Crew Reserve in Airlines

International Journal of Applied Metaheuristic Computing
A model of resilient supply chain network design: A two-stage programming with fuzzy shortest path

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The crew scheduling problem (CSP) appears in many mass transport systems (e.g., airline, bus, and railway industry) and consists of scheduling a number of crews to operate a set of transport tasks satisfying a variety of constraints. This problem is formulated as a set partitioning problem with side constraints (SP), where each column of the SP matrix corresponds to a feasible duty, which is a subset of tasks performed by a crew. We describe a procedure that, without using the SP matrix, computes a lower bound to the CSP by finding a heuristic solution to the dual of the linear relaxation of SP. Such dual solution is obtained by combining a number of different bounding procedures. The dual solution is used to reduce the number of variables in the SP in such a way that the resulting SP problem can be solved by a branch-and-bound algorithm. Computational results are given for problems derived from the literature and involving from 50 to 500 tasks.