An Integrated Vehicle-Crew-Roster Problem with Days-Off Pattern

Marta Mesquita (), Margarida Moz (), Ana Paias () and Margarida Pato ()
Additional contact information
Marta Mesquita: ISA-UTL / CIO
Margarida Moz: ISEG-UTL / CIO
Ana Paias: DEIO-FCUL / CIO
Margarida Pato: ISEG-UTL / CIO

A chapter in Operations Research Proceedings 2010, 2011, pp 245-250 from Springer

Abstract: Abstract The integrated vehicle-crew-roster problem with days-off pattern aims to simultaneously determine minimum cost sets of 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 modeled as a mixed binary linear programming problem. A heuristic approach with embedded column generation and branch-and-bound techniques within a Benders decomposition is proposed. The new methodology was tested on real instances and the computational results are promising.

Keywords: Planning Horizon; Master Problem; Bender Decomposition; Crew Schedule; Vehicle Schedule (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_39

Ordering information: This item can be ordered from
http://www.springer.com/9783642200090

DOI: 10.1007/978-3-642-20009-0_39

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().