Author(s): Barbosa, Vítor ; Alvelos, Filipe Pereira e ; Respício, Ana
Date: 2016
Persistent ID: http://hdl.handle.net/1822/53384
Origin: RepositóriUM - Universidade do Minho
Project/scholarship: info:eu-repo/grantAgreement/FCT/5876-PPCDTI/100645/PT ; info:eu-repo/grantAgreement/FCT/5876/135968/PT;
In the Bus Driver Rostering Problem (BDRP) it is intended to define work schedules for workers such that costs are minimized. This problem has been addressed before by combining column generation and an evolutionary algorithm. In this paper, we show how this approach can be improved by including additional random constraints and limiting the time spent in column generation. Both approaches follow a general framework entitled SearchCol, Metaheuristic search by column generation, recently proposed for decomposable integer programming / combinatorial optimization problems.
This work is financed by Fundac¸a˜o para a Cieˆncia e a Tecnologia (Portuguese Foundation for Science and Technology) within projects “SearchCol: Metaheuristic search by column generation” (PTDC/EIAEIA/100645/2008) and PEst-OE/EEI/UI0319/2014.
info:eu-repo/semantics/publishedVersion
