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...
Main Author: | |
---|---|
Other Authors: | , |
Format: | workingPaper |
Language: | eng |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/10400.5/1432 |
Country: | Portugal |
Oai: | oai:www.repository.utl.pt:10400.5/1432 |