About: A Boosting Algorithm for the Classifiers in the Nurse Rostering Problems

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

About: A Boosting Algorithm for the Classifiers in the Nurse Rostering Problems 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	Nurse rostering problem is a well-known combinatorial problem. It can be solved by many (meta/hyper) heuristics while these methods are based on two usual steps: generate new solutions first and then determine their quality using an objective function. Unfortunately, this process is very expensive in terms of the computational complexity. Thus, we propose a faster evaluation of the objective function based on the solution structure. The idea is to mimic the human mind because the human schedulers are able to quickly recognize an obviously bad roster using only their own experience instead of complex computing. For this purpose, a neural network as a classifier can be used not only to distinguish between good and bad solutions but also to determine how much good or bad the solutions are. We apply an adaptive boosting algorithm to achieve more precise classification rates too. The results from the experiments show that the proposed approaches can reduce the runtime of the scheduling algorithm in comparison with standard cost-oriented evaluation of the objective function with equivalent solution quality. Nurse rostering problem is a well-known combinatorial problem. It can be solved by many (meta/hyper) heuristics while these methods are based on two usual steps: generate new solutions first and then determine their quality using an objective function. Unfortunately, this process is very expensive in terms of the computational complexity. Thus, we propose a faster evaluation of the objective function based on the solution structure. The idea is to mimic the human mind because the human schedulers are able to quickly recognize an obviously bad roster using only their own experience instead of complex computing. For this purpose, a neural network as a classifier can be used not only to distinguish between good and bad solutions but also to determine how much good or bad the solutions are. We apply an adaptive boosting algorithm to achieve more precise classification rates too. The results from the experiments show that the proposed approaches can reduce the runtime of the scheduling algorithm in comparison with standard cost-oriented evaluation of the objective function with equivalent solution quality. (en)
Title	A Boosting Algorithm for the Classifiers in the Nurse Rostering Problems A Boosting Algorithm for the Classifiers in the Nurse Rostering Problems (en)
skos:prefLabel	A Boosting Algorithm for the Classifiers in the Nurse Rostering Problems A Boosting Algorithm for the Classifiers in the Nurse Rostering Problems (en)
skos:notation	RIV/68407700:21230/13:00208850!RIV14-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(7H12008), S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Václavík, Roman
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	58437
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00208850
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Nurse rostering problem; classifier; neural network; AdaBoos; tabu search (en)
http://linked.open.../riv/klicoveSlovo	AdaBoos Nurse rostering problem classifier neural network tabu search
http://linked.open...ontrolniKodProRIV	[62F05A07160E]
http://linked.open...v/mistoKonaniAkce	Prague
http://linked.open...i/riv/mistoVydani	Prague
http://linked.open...i/riv/nazevZdroje	POSTER 2013 - 17th International Student Conference on Electrical Engineering
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Design, Monitoring and Operation of Adaptive Networked Embedded Systems
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Václavík, Roman
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2013-05-16 (xsd:date)
number of pages	5 (xsd:int)
http://purl.org/ne...btex#hasPublisher	České vysoké učení technické v Praze
https://schema.org/isbn	978-80-01-05242-6
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