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.(undefined
The Bus Driver Scheduling Problem is a combinatorial hard problem among the most important planning ...
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based...
The goal of this paper is to propose and experimentally compare a class of hybrid metaheuristics for...
This paper presents a new decomposition model for the Bus Driver Rostering Problem and proposes the ...
Comunicação apresentada 2nd International Conference on Operations Research and Enterprise Systems, ...
The Bus Driver Rostering Problem (BDRP) aims at determining optimal work-schedules for the drivers o...
In the Bus Driver Rostering Problem (BDRP) it is intended to define work schedules for workers such t...
Tese de doutoramento, Informática (Engenharia Informática), Universidade de Lisboa, Faculdade de Ciê...
SearchCol is a recently proposed approach hybridizing column generation, problem specific algorithms...
This paper presents a new genetic algorithm included in the SearchCol++ framework. The new genetic ...
The Bus Driver Rostering Problem refers to the assignment of drivers to the daily schedules of the c...
The Bus Driver Rostering Problem (BRP) refers to the assignment of drivers to the daily crew duties ...
We present new metaheuristics for solving real crew scheduling problems in a public transportation ...
The driver rostering problem (DRP), arising in public bus transport companies, generates for each gr...
AbstractThe driver rostering problem (DRP), arising in public bus transport companies, generates for...
The Bus Driver Scheduling Problem is a combinatorial hard problem among the most important planning ...
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based...
The goal of this paper is to propose and experimentally compare a class of hybrid metaheuristics for...
This paper presents a new decomposition model for the Bus Driver Rostering Problem and proposes the ...
Comunicação apresentada 2nd International Conference on Operations Research and Enterprise Systems, ...
The Bus Driver Rostering Problem (BDRP) aims at determining optimal work-schedules for the drivers o...
In the Bus Driver Rostering Problem (BDRP) it is intended to define work schedules for workers such t...
Tese de doutoramento, Informática (Engenharia Informática), Universidade de Lisboa, Faculdade de Ciê...
SearchCol is a recently proposed approach hybridizing column generation, problem specific algorithms...
This paper presents a new genetic algorithm included in the SearchCol++ framework. The new genetic ...
The Bus Driver Rostering Problem refers to the assignment of drivers to the daily schedules of the c...
The Bus Driver Rostering Problem (BRP) refers to the assignment of drivers to the daily crew duties ...
We present new metaheuristics for solving real crew scheduling problems in a public transportation ...
The driver rostering problem (DRP), arising in public bus transport companies, generates for each gr...
AbstractThe driver rostering problem (DRP), arising in public bus transport companies, generates for...
The Bus Driver Scheduling Problem is a combinatorial hard problem among the most important planning ...
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based...
The goal of this paper is to propose and experimentally compare a class of hybrid metaheuristics for...