{"id":"https://openalex.org/W2758947602","doi":"https://doi.org/10.15439/2017f237","title":"An Integer Programming based Ant Colony Optimisation Method for Nurse Rostering","display_name":"An Integer Programming based Ant Colony Optimisation Method for Nurse Rostering","publication_year":2017,"publication_date":"2017-09-24","ids":{"openalex":"https://openalex.org/W2758947602","doi":"https://doi.org/10.15439/2017f237","mag":"2758947602"},"language":"en","primary_location":{"id":"doi:10.15439/2017f237","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2017f237","pdf_url":"https://annals-csis.org/proceedings/2017/drp/pdf/237.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2017/drp/pdf/237.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097100217","display_name":"Joe Bunton","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Joe Bunton","raw_affiliation_strings":["School of Mathematical Sciences, Monash University, Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037240301","display_name":"Andreas Ernst","orcid":"https://orcid.org/0000-0002-1101-8359"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Andreas Ernst","raw_affiliation_strings":["School of Mathematical Sciences, Monash University, Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066852324","display_name":"Mohan Krishnamoorthy","orcid":"https://orcid.org/0000-0002-3805-4819"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mohan Krishnamoorthy","raw_affiliation_strings":["Department of Mechanical and Aerospace Engineering, Monash University, Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Aerospace Engineering, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5097100217"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":1.6514,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82613511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":null,"first_page":"407","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9083999991416931,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6891223788261414},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6828614473342896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.67765212059021},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6334749460220337},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6255247592926025},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5992013812065125},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5368431806564331},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4359106719493866},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.43441325426101685},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42241692543029785},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3694635033607483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21435794234275818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1581423580646515}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6891223788261414},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6828614473342896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.67765212059021},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6334749460220337},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6255247592926025},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5992013812065125},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5368431806564331},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4359106719493866},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.43441325426101685},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42241692543029785},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3694635033607483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21435794234275818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1581423580646515},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.15439/2017f237","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2017f237","pdf_url":"https://annals-csis.org/proceedings/2017/drp/pdf/237.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:monash.edu:publications/c2da1d93-8d62-48f6-aaa8-9907abc60601","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/c2da1d93-8d62-48f6-aaa8-9907abc60601","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bunton , J D , Ernst , A T & Krishnamoorthy , M 2017 , An integer programming based ant colony optimisation method for nurse rostering . in Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017 . vol. 11 , IEEE, Institute of Electrical and Electronics Engineers , Piscataway NJ USA , pp. 407-414 , International Workshop on Computational Optimization, 2017 , Prague , Czechia , 3/09/17 . https://doi.org/10.15439/2017F237","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:b627c8c","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"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 Paper"}],"best_oa_location":{"id":"doi:10.15439/2017f237","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2017f237","pdf_url":"https://annals-csis.org/proceedings/2017/drp/pdf/237.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2758947602.pdf","grobid_xml":"https://content.openalex.org/works/W2758947602.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W38451756","https://openalex.org/W48791587","https://openalex.org/W1499471591","https://openalex.org/W1532860030","https://openalex.org/W1572130003","https://openalex.org/W1748133846","https://openalex.org/W2016721869","https://openalex.org/W2022595823","https://openalex.org/W2028284140","https://openalex.org/W2029745941","https://openalex.org/W2057865045","https://openalex.org/W2076715315","https://openalex.org/W2084743556","https://openalex.org/W2093305464","https://openalex.org/W2109176535","https://openalex.org/W2117300664","https://openalex.org/W2119732494","https://openalex.org/W2123696861","https://openalex.org/W2149929637","https://openalex.org/W2155207871","https://openalex.org/W2166338255","https://openalex.org/W2171615581","https://openalex.org/W2231411611","https://openalex.org/W2261570667","https://openalex.org/W2429530424","https://openalex.org/W2767925358","https://openalex.org/W3125132395","https://openalex.org/W4301248396","https://openalex.org/W6903266930"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W4245157707","https://openalex.org/W1547053391","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W1521781013","https://openalex.org/W2369428395","https://openalex.org/W1997193297","https://openalex.org/W2462483068"],"abstract_inverted_index":{"Nurse":[0],"rostering":[1,150],"problems":[2],"are":[3,24],"typically":[4],"too":[5],"large":[6],"and":[7,101,138],"hard":[8],"to":[9,15,19,55,63,98,124],"be":[10,64,142],"solved":[11,65],"exactly.":[12],"In":[13],"order":[14],"achieve":[16],"quality":[17],"solutions":[18,71],"these":[20,53],"difficult":[21],"problems,":[22],"meta-heuristics":[23],"often":[25],"employed.":[26],"One":[27],"such":[28],"meta-heuristic":[29],"is":[30,66,72],"Ant":[31],"Colony":[32],"Optimisation":[33],"(ACO),":[34],"inspired":[35],"by":[36,41,45,51],"the":[37,61,119,154,157],"pheromone":[38],"trails":[39],"left":[40],"ants.":[42],"ACO":[43,88],"works":[44],"guiding":[46],"a":[47,104,112,126],"heuristic":[48],"solution":[49,95,114],"construction":[50,96],"using":[52,90],"pheromones":[54],"direct":[56],"weighted":[57],"random":[58],"choices.":[59],"When":[60],"problem":[62,151],"highly":[67,147],"constrained,":[68],"finding":[69],"feasible":[70],"difficult,":[73],"which":[74],"can":[75],"result":[76],"in":[77,135],"poor":[78],"performance":[79],"for":[80],"ACO.":[81],"To":[82],"address":[83],"this,":[84],"we":[85],"propose":[86],"an":[87,91],"algorithm":[89],"integer":[92],"programming":[93],"based":[94],"method":[97],"ensure":[99],"feasibility":[100],"select":[102],"from":[103,121,153],"collection":[105],"of":[106,159],"schedules.":[107],"The":[108],"approach":[109],"also":[110],"uses":[111],"novel":[113],"merging":[115],"step":[116],"that":[117],"combines":[118],"information":[120],"multiple":[122],"ants":[123],"generate":[125],"better":[127],"final":[128],"roster.":[129],"We":[130],"discuss":[131],"several":[132],"challenges":[133],"inherent":[134],"this":[136],"approach,":[137],"how":[139],"they":[140],"may":[141],"overcome.":[143],"Computational":[144],"results":[145],"on":[146],"constrained":[148],"nurse":[149],"instances":[152],"literature":[155],"demonstrate":[156],"effectiveness":[158],"our":[160],"proposed":[161],"new":[162],"hybrid":[163],"metaheuristic.":[164]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}