An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00169605" target="_blank" >RIV/68407700:21230/10:00169605 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts

Popis výsledku v původním jazyce

This work deals with the problem of rostering employees at an airport. There are about a hundred different shifts in order to handle the irregular coverage constraints. Together, with the strict constraints, given by the collective agreement, the problembecomes difficult to solve. Common one stage algorithms, applied to this problem, produce rosters containing too many isolated days-on and days-off which makes the roster unusable. This paper suggests a three stage approach for the employees rostering problem where a set of different shifts is needed to satisfy the coverage requirements. The solution is based on the problem transformation to a simpler problem, thereupon, an evolutionary algorithm is used to determine a rough position of the shifts in the roster. The maximal weighted matching in the bipartite graph is used as the inverse transformation of the problem and the final roster is obtained by the optimization based on a Tabu Search algorithm.

Název v anglickém jazyce

An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts

Popis výsledku anglicky

This work deals with the problem of rostering employees at an airport. There are about a hundred different shifts in order to handle the irregular coverage constraints. Together, with the strict constraints, given by the collective agreement, the problembecomes difficult to solve. Common one stage algorithms, applied to this problem, produce rosters containing too many isolated days-on and days-off which makes the roster unusable. This paper suggests a three stage approach for the employees rostering problem where a set of different shifts is needed to satisfy the coverage requirements. The solution is based on the problem transformation to a simpler problem, thereupon, an evolutionary algorithm is used to determine a rough position of the shifts in the roster. The maximal weighted matching in the bipartite graph is used as the inverse transformation of the problem and the final roster is obtained by the optimization based on a Tabu Search algorithm.

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling

ISBN

08-538-9973-3

ISSN

—

e-ISSN

—

Počet stran výsledku

16

Strana od-do

97-112

Název nakladatele

Queen's University of Belfast

Místo vydání

Belfast

Místo konání akce

Belfast

Datum konání akce

10. 8. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—