| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 216.13 KB | Adobe PDF |
Advisor(s)
Abstract(s)
The problem addressed in this paper is the integrated vehicle-crew-rostering problem (VCRP) aiming to define the schedules for the buses and the rosters for the drivers of a public transit company. The VCRP is described by a bi-objective mixed binary linear programming model with one objective function aggregating vehicle and crew scheduling costs and the other the rostering features. The VCRP is solved by a heuristic approach based on Benders decomposition where the master problem is partitioned into daily integrated vehicle-crew scheduling problems and the sub-problem is a rostering problem. Computational experience with data from a bus company in Lisbon shows the ability of the decomposition approach for producing a variety of potentially efficient solutions for the VCRP within low computing times.
Description
Keywords
integrated vehicle-crew-rostering problem Benders decomposition multi-objective optimization
Pedagogical Context
Citation
Mesquita, Marta ... [et al.]. 2009. "A decomposition approach to the integrated vehicle-crew-rostering problem". Universidade de Lisboa - Centro de Investigação Operacional - CIO - Working paper nº 3/2009
Publisher
Centro de Investigação Operacional - Universidade de Lisboa