{"id":"https://openalex.org/W2112046982","doi":"https://doi.org/10.1145/1068009.1068046","title":"Ant colony optimization for power plant maintenance scheduling optimization","display_name":"Ant colony optimization for power plant maintenance scheduling optimization","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2112046982","doi":"https://doi.org/10.1145/1068009.1068046","mag":"2112046982"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","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/A5027858796","display_name":"Wai Kuan Foong","orcid":null},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Wai Kuan Foong","raw_affiliation_strings":["University of Adelaide, Australia","the University of Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"University of Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"the University of Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010973652","display_name":"Holger R. Maier","orcid":"https://orcid.org/0000-0002-0277-6887"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Holger R. Maier","raw_affiliation_strings":["University of Adelaide, Australia","the University of Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"University of Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"the University of Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051380741","display_name":"Angus R. Simpson","orcid":"https://orcid.org/0000-0003-1633-0111"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Angus R. Simpson","raw_affiliation_strings":["University of Adelaide, Australia","the University of Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"University of Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"the University of Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027858796"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":3.6566,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.93215299,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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/T11941","display_name":"Power System Reliability and Maintenance","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10424","display_name":"Electric Power System Optimization","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8595831394195557},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7565346956253052},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7257230281829834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6524462103843689},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6053040623664856},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5741921663284302},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5517494678497314},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4839935302734375},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46290433406829834},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.4265872836112976},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4261317551136017},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.32016584277153015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30037587881088257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18206369876861572},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.08966848254203796}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8595831394195557},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7565346956253052},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7257230281829834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6524462103843689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6053040623664856},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5741921663284302},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5517494678497314},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4839935302734375},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46290433406829834},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.4265872836112976},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4261317551136017},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.32016584277153015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30037587881088257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18206369876861572},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08966848254203796},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1068009.1068046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.324.2234","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.2234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.york.ac.uk/rts/docs/GECCO_2005/Conference proceedings/docs/p249.pdf","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/29292","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/29292","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1068009.1068046","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W125869453","https://openalex.org/W362876216","https://openalex.org/W363798256","https://openalex.org/W1557288165","https://openalex.org/W1573676079","https://openalex.org/W1602076081","https://openalex.org/W1801849579","https://openalex.org/W1969258409","https://openalex.org/W1970945222","https://openalex.org/W2045954562","https://openalex.org/W2086241571","https://openalex.org/W2099240939","https://openalex.org/W2107941094","https://openalex.org/W2115322778","https://openalex.org/W2118051273","https://openalex.org/W2135026061","https://openalex.org/W2135256307","https://openalex.org/W2154487696","https://openalex.org/W2154929945","https://openalex.org/W2167920923","https://openalex.org/W2208170515","https://openalex.org/W4200169276","https://openalex.org/W4299608958","https://openalex.org/W4299796063","https://openalex.org/W6635910384"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W2109336245","https://openalex.org/W2462483068","https://openalex.org/W2038644949","https://openalex.org/W2358796234","https://openalex.org/W3143526786","https://openalex.org/W4386961012","https://openalex.org/W2010872976"],"abstract_inverted_index":{"In":[0,20,144],"order":[1],"to":[2,32,35,138,158],"maintain":[3],"a":[4,23,49,87,122],"reliable":[5],"and":[6,46,58,81,86,131],"economic":[7],"electric":[8],"power":[9,14,37],"supply,":[10],"the":[11,36,63,94,97,108,111,139,148,163],"maintenance":[12,39],"of":[13,69,100,110,121,124,147,171],"plants":[15],"is":[16,44,56,65,74,91,116,156],"becoming":[17],"increasingly":[18],"important.":[19],"this":[21],"paper,":[22],"formulation":[24,55],"that":[25,107,120],"enables":[26],"ant":[27],"colony":[28],"optimization":[29,41],"(ACO)":[30],"algorithms":[31,73,114,130],"be":[33],"applied":[34,137],"plant":[38],"scheduling":[40],"(PPMSO)":[42],"problem":[43,64],"developed":[45],"tested":[47],"on":[48,93],"21-unit":[50],"case":[51,141,164],"study.":[52],"A":[53],"heuristic":[54],"introduced":[57],"its":[59],"effectiveness":[60],"in":[61],"solving":[62],"investigated.":[66],"The":[67,103],"performance":[68,109,161],"two":[70,112],"different":[71],"ACO":[72,101,113,155],"compared,":[75],"including":[76],"Best":[77],"Ant":[78,83],"System":[79,84],"(BAS)":[80],"Max-Min":[82],"(MMAS),":[85],"detailed":[88],"sensitivity":[89],"analysis":[90],"conducted":[92],"parameters":[95],"controlling":[96],"searching":[98],"behavior":[99],"algorithms.":[102],"results":[104],"obtained":[105],"indicate":[106],"investigated":[115],"significantly":[117,150],"better":[118],"than":[119],"number":[123],"other":[125],"metaheuristics,":[126],"such":[127],"as":[128],"genetic":[129],"simulated":[132],"annealing,":[133],"which":[134],"have":[135,159],"been":[136],"same":[140],"study":[142,165],"previously.":[143],"addition,":[145],"use":[146],"heuristics":[149],"improves":[151],"algorithm":[152],"performance.":[153],"Also,":[154],"found":[157],"similar":[160],"for":[162],"considered":[166],"across":[167],"an":[168],"identified":[169],"range":[170],"parameter":[172],"values.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
