| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 328.19 KB | Adobe PDF |
Advisor(s)
Abstract(s)
The integrated vehicle-crew-roster problem with days-off pattern aims to simultaneously determine minimum cost vehicle and daily crew schedules that cover all timetabled trips and a minimum cost roster covering all daily crew duties according to a pre-defined days-off pattern. This problem is formulated as a new integer linear programming model and is solved by a heuristic approach based on Benders decom- position that iterates between the solution of an integrated vehicle-crew scheduling problem and the solution of a rostering problem. Computational experience with data from two bus companies in Portugal and data from benchmark vehicle scheduling instances shows the ability of the approach for producing a variety of solutions within reason able computing times as well as the advantages of integrating the three problems.
Description
Keywords
Transportation Vehicle and Crew Scheduling Driver Rostering Benders Decomposition
Pedagogical Context
Citation
Marta Mesquita … [et al.] .(2013). “A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern”, European Journal of Operational Research, Vol. 229. 2013.
Publisher
Elsevier