{"id":"https://openalex.org/W1971716807","doi":"https://doi.org/10.1109/socpar.2010.5685868","title":"A PSO algorithm to solve a real anaesthesiology nurse scheduling problem","display_name":"A PSO algorithm to solve a real anaesthesiology nurse scheduling problem","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W1971716807","doi":"https://doi.org/10.1109/socpar.2010.5685868","mag":"1971716807"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2010.5685868","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2010.5685868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference of Soft Computing and Pattern Recognition","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082483792","display_name":"Leopoldo Altamirano-Robles","orcid":"https://orcid.org/0000-0003-0965-6420"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"Leopoldo Altamirano","raw_affiliation_strings":["Universidad Tecnica Federico Santa Maria (UTFSM), Valparaiso, Chile","Universidad T\u00e9cnica Federico Santa Mar\u00eda, Computer Science Department, Valpara\u00edso, Chile"],"affiliations":[{"raw_affiliation_string":"Universidad Tecnica Federico Santa Maria (UTFSM), Valparaiso, Chile","institution_ids":["https://openalex.org/I75778554"]},{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Computer Science Department, Valpara\u00edso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006195699","display_name":"Mar\u00eda-Cristina Riff","orcid":"https://orcid.org/0000-0003-1676-266X"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Maria-Cristina Riff","raw_affiliation_strings":["Universidad Tecnica Federico Santa Maria (UTFSM), Valparaiso, Chile","Universidad T\u00e9cnica Federico Santa Mar\u00eda, Computer Science Department, Valpara\u00edso, Chile"],"affiliations":[{"raw_affiliation_string":"Universidad Tecnica Federico Santa Maria (UTFSM), Valparaiso, Chile","institution_ids":["https://openalex.org/I75778554"]},{"raw_affiliation_string":"Universidad T\u00e9cnica Federico Santa Mar\u00eda, Computer Science Department, Valpara\u00edso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050462803","display_name":"Lorraine Trilling","orcid":"https://orcid.org/0000-0002-2333-4279"},"institutions":[{"id":"https://openalex.org/I48430043","display_name":"Institut National des Sciences Appliqu\u00e9es de Lyon","ror":"https://ror.org/050jn9y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I203339264","https://openalex.org/I48430043"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lorraine Trilling","raw_affiliation_strings":["France","D\u00e9partement G\u00e9nie Industriel, LIESP Laboratory, INSA of Lyon, France"],"affiliations":[{"raw_affiliation_string":"France","institution_ids":[]},{"raw_affiliation_string":"D\u00e9partement G\u00e9nie Industriel, LIESP Laboratory, INSA of Lyon, France","institution_ids":["https://openalex.org/I48430043"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082483792"],"corresponding_institution_ids":["https://openalex.org/I75778554"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.11859963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":null,"first_page":"139","last_page":"144"},"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.9853000044822693,"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.9465000033378601,"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/nurse-scheduling-problem","display_name":"Nurse scheduling problem","score":0.7575908899307251},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6587187647819519},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5783628225326538},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5406714081764221},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5327921509742737},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4884130358695984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46942952275276184},{"id":"https://openalex.org/keywords/anesthesiology","display_name":"Anesthesiology","score":0.4617820382118225},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4171803593635559},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2952233850955963},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.18517568707466125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14512953162193298},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.12292003631591797}],"concepts":[{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.7575908899307251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6587187647819519},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5783628225326538},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5406714081764221},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5327921509742737},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4884130358695984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46942952275276184},{"id":"https://openalex.org/C2779526319","wikidata":"https://www.wikidata.org/wiki/Q615057","display_name":"Anesthesiology","level":2,"score":0.4617820382118225},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4171803593635559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2952233850955963},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.18517568707466125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14512953162193298},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.12292003631591797},{"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/C42219234","wikidata":"https://www.wikidata.org/wiki/Q131130","display_name":"Anesthesia","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/socpar.2010.5685868","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2010.5685868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference of Soft Computing and Pattern Recognition","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W86878369","https://openalex.org/W188762910","https://openalex.org/W315572163","https://openalex.org/W1972839725","https://openalex.org/W1976380858","https://openalex.org/W2016721869","https://openalex.org/W2029018013","https://openalex.org/W2029414468","https://openalex.org/W2057865045","https://openalex.org/W2076715315","https://openalex.org/W2080463510","https://openalex.org/W2081228243","https://openalex.org/W2091650525","https://openalex.org/W2117300664","https://openalex.org/W2123696861","https://openalex.org/W2143867203","https://openalex.org/W2155207871","https://openalex.org/W3125132395","https://openalex.org/W4230073927","https://openalex.org/W6670479783"],"related_works":["https://openalex.org/W2188917685","https://openalex.org/W2895904586","https://openalex.org/W2035346226","https://openalex.org/W2110698131","https://openalex.org/W2924122445","https://openalex.org/W1553364762","https://openalex.org/W2031485694","https://openalex.org/W2069371627","https://openalex.org/W4221148221","https://openalex.org/W2017703544"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"an":[5],"approach":[6],"especially":[7],"designed":[8],"to":[9,43,69],"solve":[10,44],"the":[11,26,32,45,64,73],"real":[12],"world":[13],"problem":[14],"of":[15,31,72],"Anesthesiology":[16],"Nurse":[17],"Scheduling":[18],"(ANSP)":[19],"at":[20],"a":[21,38],"French":[22],"public":[23],"hospital,":[24],"where":[25],"anesthesiology":[27],"nurses":[28],"are":[29],"one":[30],"most":[33],"shared":[34],"resources.":[35],"We":[36,47],"propose":[37],"Particle":[39],"Swarm":[40],"Optimization":[41],"algorithm":[42],"ANSP.":[46],"compare":[48],"our":[49],"technique":[50],"with":[51],"previous":[52],"results":[53],"obtained":[54],"using":[55],"Integer":[56],"Programming":[57],"and":[58],"Constraint":[59],"Programming.":[60],"The":[61],"objective":[62],"is":[63],"same":[65],"for":[66],"all":[67],"methods:":[68],"maximize":[70],"fairness":[71],"schedule.":[74]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}