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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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 problem becomes 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. 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 problem becomes 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. (en)
Title	An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts (en)
skos:prefLabel	An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts An Evolutionary Algorithm in a Multistage Approach for an Employee Rostering Problem with a High Diversity of Shifts (en)
skos:notation	RIV/68407700:21230/10:00169605!RIV12-MSM-21230___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Bäumelt, Zdeněk Hanzálek, Zdeněk Šůcha, Přemysl
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	246213
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00169605
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	high diversity of shifts; multistage approach; evolutionary algorithm; employee rostering (en)
http://linked.open.../riv/klicoveSlovo	evolutionary algorithm employee rostering high diversity of shifts multistage approach
http://linked.open...ontrolniKodProRIV	[91A0550E3809]
http://linked.open...v/mistoKonaniAkce	Belfast
http://linked.open...i/riv/mistoVydani	Belfast
http://linked.open...i/riv/nazevZdroje	Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Bäumelt, Zdeněk Hanzálek, Zdeněk Šůcha, Přemysl
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-08-10 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Decision Making and Control for Manufacturing III
number of pages	16 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Queen's University of Belfast
https://schema.org/isbn	08-538-9973-3
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software