A hybrid metaheuristic for the bus driver rostering problem
This paper presents a new decomposition model for the Bus Driver Rostering Problem and proposes the hybridization of column generation and genetic algorithms to achieve good quality rosters in short time. The decomposition model is based on the definition of a subproblem for each driver, which is re...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/26848 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/26848 |
| Resumo: | This paper presents a new decomposition model for the Bus Driver Rostering Problem and proposes the hybridization of column generation and genetic algorithms to achieve good quality rosters in short time. The decomposition model is based on the definition of a subproblem for each driver, which is responsible for the creation of valid work-schedules for the rostering period. Column generation is used to obtain an optimal linear solution. This solution and the subproblems’ solutions obtained during the column generation are then used by the genetic algorithm to find good quality combinations of drivers’ schedules, i.e. good quality rosters. Computational tests show the efficiency and effectiveness of the proposed approach. |
|---|