{"id":"https://openalex.org/W2103204887","doi":"https://doi.org/10.1109/cec.2003.1299938","title":"A Bayesian optimization algorithm for the nurse scheduling problem","display_name":"A Bayesian optimization algorithm for the nurse scheduling problem","publication_year":2004,"publication_date":"2004-07-09","ids":{"openalex":"https://openalex.org/W2103204887","doi":"https://doi.org/10.1109/cec.2003.1299938","mag":"2103204887"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11343/241015","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078385256","display_name":"Jingpeng Li","orcid":"https://orcid.org/0000-0002-6758-0084"},"institutions":[{"id":"https://openalex.org/I139894009","display_name":"University of Bradford","ror":"https://ror.org/00vs8d940","country_code":"GB","type":"education","lineage":["https://openalex.org/I139894009"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jingpeng Li","raw_affiliation_strings":["Department of Computing, University of Bradford, Bradford, UK","[Dept. of Comput., Bradford Univ., UK]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, University of Bradford, Bradford, UK","institution_ids":["https://openalex.org/I139894009"]},{"raw_affiliation_string":"[Dept. of Comput., Bradford Univ., UK]","institution_ids":["https://openalex.org/I139894009"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002768704","display_name":"Uwe Aickelin","orcid":"https://orcid.org/0000-0002-2679-2275"},"institutions":[{"id":"https://openalex.org/I139894009","display_name":"University of Bradford","ror":"https://ror.org/00vs8d940","country_code":"GB","type":"education","lineage":["https://openalex.org/I139894009"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"U. Aickelin","raw_affiliation_strings":["Department of Computing, University of Bradford, Bradford, UK","[Dept. of Comput., Bradford Univ., UK]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, University of Bradford, Bradford, UK","institution_ids":["https://openalex.org/I139894009"]},{"raw_affiliation_string":"[Dept. of Comput., Bradford Univ., UK]","institution_ids":["https://openalex.org/I139894009"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.608,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.92459559,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"2149","last_page":"2156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bayesian-network","display_name":"Bayesian network","score":0.7010915279388428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6927982568740845},{"id":"https://openalex.org/keywords/nurse-scheduling-problem","display_name":"Nurse scheduling problem","score":0.5478082895278931},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4775151312351227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4229917526245117},{"id":"https://openalex.org/keywords/conditional-probability","display_name":"Conditional probability","score":0.42161065340042114},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4195699095726013},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.38110214471817017},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35850703716278076},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.33250725269317627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19288328289985657},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.11657163500785828},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07955634593963623}],"concepts":[{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.7010915279388428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6927982568740845},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.5478082895278931},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4775151312351227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4229917526245117},{"id":"https://openalex.org/C44492722","wikidata":"https://www.wikidata.org/wiki/Q327069","display_name":"Conditional probability","level":2,"score":0.42161065340042114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4195699095726013},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.38110214471817017},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35850703716278076},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.33250725269317627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19288328289985657},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.11657163500785828},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07955634593963623},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cec.2003.1299938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/241015","is_oa":true,"landing_page_url":"http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000221532900289&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c","pdf_url":"http://hdl.handle.net/11343/241015","source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS","raw_type":"Conference Paper"},{"id":"pmh:oai:dspace.stir.ac.uk:1893/31391","is_oa":false,"landing_page_url":"http://hdl.handle.net/1893/31391","pdf_url":null,"source":{"id":"https://openalex.org/S4306400268","display_name":"Stirling Online Research Repository (University of Stirling)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I12093191","host_organization_name":"University of Stirling","host_organization_lineage":["https://openalex.org/I12093191"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:eprints.nottingham.ac.uk:1247","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1299938","pdf_url":null,"source":{"id":"https://openalex.org/S4306402013","display_name":"Nottingham ePrints (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:nottingham-repository.worktribe.com:1022430","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/1022430","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/241015","is_oa":true,"landing_page_url":"http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000221532900289&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c","pdf_url":"http://hdl.handle.net/11343/241015","source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS","raw_type":"Conference Paper"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320314707","display_name":"Government of the United Kingdom","ror":"https://ror.org/05wnh3t63"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2103204887.pdf","grobid_xml":"https://content.openalex.org/works/W2103204887.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W37880335","https://openalex.org/W107452617","https://openalex.org/W110644715","https://openalex.org/W1494413412","https://openalex.org/W1615454278","https://openalex.org/W1659842140","https://openalex.org/W1659907664","https://openalex.org/W1746680969","https://openalex.org/W1936375030","https://openalex.org/W1980913658","https://openalex.org/W2004217556","https://openalex.org/W2021010829","https://openalex.org/W2078523791","https://openalex.org/W2152150600","https://openalex.org/W2155207871","https://openalex.org/W2159080219","https://openalex.org/W2468462628","https://openalex.org/W2904250082","https://openalex.org/W3023540311","https://openalex.org/W3103464856","https://openalex.org/W3125132395","https://openalex.org/W4211064163","https://openalex.org/W6604361150","https://openalex.org/W6604549162","https://openalex.org/W6640650409","https://openalex.org/W6719982585"],"related_works":["https://openalex.org/W3204654320","https://openalex.org/W2137256417","https://openalex.org/W4285084075","https://openalex.org/W4322208577","https://openalex.org/W2365680718","https://openalex.org/W4366608229","https://openalex.org/W4253015880","https://openalex.org/W4234586272","https://openalex.org/W3026737558","https://openalex.org/W3112648901"],"abstract_inverted_index":{"A":[0],"Bayesian":[1,58,71,166],"optimization":[2,59],"algorithm":[3,41,60],"for":[4,21,102,161,207],"the":[5,36,39,74,86,109,158,165,172,187,197,201],"nurse":[6],"scheduling":[7,16,209],"problem":[8],"is":[9,42,61,88,105,193],"presented,":[10],"which":[11,143],"involves":[12],"choosing":[13],"a":[14,19,70,123],"suitable":[15,206],"rule":[17,125,133,177],"from":[18,181],"set":[20,94,131,174],"each":[22,83,99,103],"nurse's":[23],"assignment.":[24],"Unlike":[25],"our":[26,121],"previous":[27,146],"work":[28],"that":[29,196],"used":[30],"GAs":[31],"to":[32,50,63,91],"implement":[33,64],"implicit":[34],"learning,":[35],"learning":[37,67,198],"in":[38,85,120,138,164,200],"proposed":[40,202],"explicit,":[43],"i.e.":[44,119],"eventually,":[45],"we":[46],"will":[47,135,144],"be":[48,136,205],"able":[49],"identify":[51],"and":[52],"mix":[53],"building":[54,69],"blocks":[55],"directly.":[56],"The":[57,79],"applied":[62],"such":[65],"explicit":[66],"by":[68,107],"network":[72,87,167],"of":[73,77,82,95,132,142,175,189],"joint":[75],"distribution":[76],"solutions.":[78,97],"conditional":[80,111,159],"probability":[81],"variable":[84,104],"computed":[89],"according":[90],"an":[92],"initial":[93],"promising":[96,176],"Subsequently,":[98],"new":[100,124],"instance":[101],"generated":[106,137],"using":[108,171],"corresponding":[110],"probabilities,":[112],"until":[113],"all":[114,162],"variables":[115],"have":[116],"been":[117,128],"generated,":[118],"case,":[122],"string":[126],"has":[127],"obtained.":[129],"Another":[130],"strings":[134,147],"this":[139,190],"way,":[140],"some":[141],"replace":[145],"based":[148],"on":[149],"fitness":[150],"selection.":[151],"If":[152],"stopping":[153],"conditions":[154],"are":[155,168],"not":[156],"met,":[157],"probabilities":[160],"nodes":[163],"updated":[169],"again":[170],"current":[173],"strings.":[178],"Computational":[179],"results":[180],"52":[182],"real":[183],"data":[184],"instances":[185],"demonstrate":[186],"success":[188],"approach.":[191],"It":[192],"also":[194],"suggested":[195],"mechanism":[199],"approach":[203],"might":[204],"other":[208],"problems.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}