A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem
The Bus Driver Rostering Problem (DRP) consists of assigning bus drivers to daily duties during a planning period. The problem considers hard constraints imposed by institutional and legal requirements. Solutions should as much as possible satisfy soft constraints that qualify rosters according to e...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.5/1432 |
| País: | Portugal |
| Oai: | oai:www.repository.utl.pt:10400.5/1432 |