Fitness evaluation for nurse scheduling problems

When applying evolutionary algorithms to difficult real-world problems, the fitness function routinely needs evaluating for a very high number of intermediary cases. The paper is concerned with real-world nurse rostering problems with highly constrained resources. We consider a particular approach,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Burke, E.K., De Causmaecker, P., Petrovic, S., Berghe, G.V.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1146 vol. 2
container_issue
container_start_page 1139
container_title
container_volume 2
creator Burke, E.K.
De Causmaecker, P.
Petrovic, S.
Berghe, G.V.
description When applying evolutionary algorithms to difficult real-world problems, the fitness function routinely needs evaluating for a very high number of intermediary cases. The paper is concerned with real-world nurse rostering problems with highly constrained resources. We consider a particular approach, which allows for a quick evaluation and is general enough to deal with other kinds of resource planning problems with time-related constraints. The model developed for this approach handles the constraints in a modular way and the addition of new constraints is relatively straightforward. Simple constraints (such as those affecting the personal wishes of employees) and global constraints (such as balancing the workload among people) can be formulated easily using this approach. Our approach can also handle very complex time-related constraints as well as conditions that are related to previously planned work. Moreover, it provides clear feedback about violation of constraints. The approach has been implemented successfully in a nurse rostering program entitled "Plane" which is used in hospitals all over Belgium. It can tackle a high number of specific and modifiable constraints of a very different nature. The benefits from this approach (in terms of software requirements) are small memory use and a computationally simple, single evaluation function allowing for the simultaneous rostering of several hospital wards at the same time.
doi_str_mv 10.1109/CEC.2001.934319
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_934319</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>934319</ieee_id><sourcerecordid>934319</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-89e368fdef04c11fa5c9c336974c1af31fd2969756acc3bcd76d4bd90ec7cfce3</originalsourceid><addsrcrecordid>eNotj8FKxDAURQMiqOOsBVf9gdaXeWnSLKXM6MCAG10P6cuLRjrtkLSCf29hPJvL2Vw4QjxIqKQE-9Ru22oDICuLCqW9EndgGkCta4M3Yp3zNyygVQbxVsAuTgPnXPCP62c3xXEowpiKYU6Zi0xf7Oc-Dp_FOY1dz6d8L66D6zOv_3clPnbb9_a1PLy97NvnQxklqKlsLKNugucAiqQMriZLiNqaRV1AGfzGLlZrR4QdeaO96rwFJkOBGFfi8fIbmfl4TvHk0u_x0oR_fnRCmw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fitness evaluation for nurse scheduling problems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Burke, E.K. ; De Causmaecker, P. ; Petrovic, S. ; Berghe, G.V.</creator><creatorcontrib>Burke, E.K. ; De Causmaecker, P. ; Petrovic, S. ; Berghe, G.V.</creatorcontrib><description>When applying evolutionary algorithms to difficult real-world problems, the fitness function routinely needs evaluating for a very high number of intermediary cases. The paper is concerned with real-world nurse rostering problems with highly constrained resources. We consider a particular approach, which allows for a quick evaluation and is general enough to deal with other kinds of resource planning problems with time-related constraints. The model developed for this approach handles the constraints in a modular way and the addition of new constraints is relatively straightforward. Simple constraints (such as those affecting the personal wishes of employees) and global constraints (such as balancing the workload among people) can be formulated easily using this approach. Our approach can also handle very complex time-related constraints as well as conditions that are related to previously planned work. Moreover, it provides clear feedback about violation of constraints. The approach has been implemented successfully in a nurse rostering program entitled "Plane" which is used in hospitals all over Belgium. It can tackle a high number of specific and modifiable constraints of a very different nature. The benefits from this approach (in terms of software requirements) are small memory use and a computationally simple, single evaluation function allowing for the simultaneous rostering of several hospital wards at the same time.</description><identifier>ISBN: 0780366573</identifier><identifier>ISBN: 9780780366572</identifier><identifier>DOI: 10.1109/CEC.2001.934319</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automation ; Evolutionary computation ; Feedback ; Genetics ; Hospitals ; Information technology ; Personnel ; Processor scheduling ; Software systems ; Software tools</subject><ispartof>Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), 2001, Vol.2, p.1139-1146 vol. 2</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/934319$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/934319$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Burke, E.K.</creatorcontrib><creatorcontrib>De Causmaecker, P.</creatorcontrib><creatorcontrib>Petrovic, S.</creatorcontrib><creatorcontrib>Berghe, G.V.</creatorcontrib><title>Fitness evaluation for nurse scheduling problems</title><title>Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546)</title><addtitle>CEC</addtitle><description>When applying evolutionary algorithms to difficult real-world problems, the fitness function routinely needs evaluating for a very high number of intermediary cases. The paper is concerned with real-world nurse rostering problems with highly constrained resources. We consider a particular approach, which allows for a quick evaluation and is general enough to deal with other kinds of resource planning problems with time-related constraints. The model developed for this approach handles the constraints in a modular way and the addition of new constraints is relatively straightforward. Simple constraints (such as those affecting the personal wishes of employees) and global constraints (such as balancing the workload among people) can be formulated easily using this approach. Our approach can also handle very complex time-related constraints as well as conditions that are related to previously planned work. Moreover, it provides clear feedback about violation of constraints. The approach has been implemented successfully in a nurse rostering program entitled "Plane" which is used in hospitals all over Belgium. It can tackle a high number of specific and modifiable constraints of a very different nature. The benefits from this approach (in terms of software requirements) are small memory use and a computationally simple, single evaluation function allowing for the simultaneous rostering of several hospital wards at the same time.</description><subject>Automation</subject><subject>Evolutionary computation</subject><subject>Feedback</subject><subject>Genetics</subject><subject>Hospitals</subject><subject>Information technology</subject><subject>Personnel</subject><subject>Processor scheduling</subject><subject>Software systems</subject><subject>Software tools</subject><isbn>0780366573</isbn><isbn>9780780366572</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8FKxDAURQMiqOOsBVf9gdaXeWnSLKXM6MCAG10P6cuLRjrtkLSCf29hPJvL2Vw4QjxIqKQE-9Ru22oDICuLCqW9EndgGkCta4M3Yp3zNyygVQbxVsAuTgPnXPCP62c3xXEowpiKYU6Zi0xf7Oc-Dp_FOY1dz6d8L66D6zOv_3clPnbb9_a1PLy97NvnQxklqKlsLKNugucAiqQMriZLiNqaRV1AGfzGLlZrR4QdeaO96rwFJkOBGFfi8fIbmfl4TvHk0u_x0oR_fnRCmw</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Burke, E.K.</creator><creator>De Causmaecker, P.</creator><creator>Petrovic, S.</creator><creator>Berghe, G.V.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2001</creationdate><title>Fitness evaluation for nurse scheduling problems</title><author>Burke, E.K. ; De Causmaecker, P. ; Petrovic, S. ; Berghe, G.V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-89e368fdef04c11fa5c9c336974c1af31fd2969756acc3bcd76d4bd90ec7cfce3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Automation</topic><topic>Evolutionary computation</topic><topic>Feedback</topic><topic>Genetics</topic><topic>Hospitals</topic><topic>Information technology</topic><topic>Personnel</topic><topic>Processor scheduling</topic><topic>Software systems</topic><topic>Software tools</topic><toplevel>online_resources</toplevel><creatorcontrib>Burke, E.K.</creatorcontrib><creatorcontrib>De Causmaecker, P.</creatorcontrib><creatorcontrib>Petrovic, S.</creatorcontrib><creatorcontrib>Berghe, G.V.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Burke, E.K.</au><au>De Causmaecker, P.</au><au>Petrovic, S.</au><au>Berghe, G.V.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fitness evaluation for nurse scheduling problems</atitle><btitle>Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546)</btitle><stitle>CEC</stitle><date>2001</date><risdate>2001</risdate><volume>2</volume><spage>1139</spage><epage>1146 vol. 2</epage><pages>1139-1146 vol. 2</pages><isbn>0780366573</isbn><isbn>9780780366572</isbn><abstract>When applying evolutionary algorithms to difficult real-world problems, the fitness function routinely needs evaluating for a very high number of intermediary cases. The paper is concerned with real-world nurse rostering problems with highly constrained resources. We consider a particular approach, which allows for a quick evaluation and is general enough to deal with other kinds of resource planning problems with time-related constraints. The model developed for this approach handles the constraints in a modular way and the addition of new constraints is relatively straightforward. Simple constraints (such as those affecting the personal wishes of employees) and global constraints (such as balancing the workload among people) can be formulated easily using this approach. Our approach can also handle very complex time-related constraints as well as conditions that are related to previously planned work. Moreover, it provides clear feedback about violation of constraints. The approach has been implemented successfully in a nurse rostering program entitled "Plane" which is used in hospitals all over Belgium. It can tackle a high number of specific and modifiable constraints of a very different nature. The benefits from this approach (in terms of software requirements) are small memory use and a computationally simple, single evaluation function allowing for the simultaneous rostering of several hospital wards at the same time.</abstract><pub>IEEE</pub><doi>10.1109/CEC.2001.934319</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0780366573
ispartof Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), 2001, Vol.2, p.1139-1146 vol. 2
issn
language eng
recordid cdi_ieee_primary_934319
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Automation
Evolutionary computation
Feedback
Genetics
Hospitals
Information technology
Personnel
Processor scheduling
Software systems
Software tools
title Fitness evaluation for nurse scheduling problems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T06%3A44%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Fitness%20evaluation%20for%20nurse%20scheduling%20problems&rft.btitle=Proceedings%20of%20the%202001%20Congress%20on%20Evolutionary%20Computation%20(IEEE%20Cat.%20No.01TH8546)&rft.au=Burke,%20E.K.&rft.date=2001&rft.volume=2&rft.spage=1139&rft.epage=1146%20vol.%202&rft.pages=1139-1146%20vol.%202&rft.isbn=0780366573&rft.isbn_list=9780780366572&rft_id=info:doi/10.1109/CEC.2001.934319&rft_dat=%3Cieee_6IE%3E934319%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=934319&rfr_iscdi=true