{"id":"https://openalex.org/W2061706745","doi":"https://doi.org/10.1145/1143997.1144203","title":"Combining genetic algorithms with squeaky-wheel optimization","display_name":"Combining genetic algorithms with squeaky-wheel optimization","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W2061706745","doi":"https://doi.org/10.1145/1143997.1144203","mag":"2061706745"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144203","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th 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/A5023975375","display_name":"Justin Terada","orcid":null},"institutions":[{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Justin Terada","raw_affiliation_strings":["Seattle University, Seattle, WA","Seattle University, Seattle, WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Seattle University, Seattle, WA","institution_ids":["https://openalex.org/I58610484"]},{"raw_affiliation_string":"Seattle University, Seattle, WA#TAB#","institution_ids":["https://openalex.org/I58610484"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070361035","display_name":"Hoa Vo","orcid":null},"institutions":[{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hoa Vo","raw_affiliation_strings":["Seattle University, Seattle, WA","Seattle University, Seattle, WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Seattle University, Seattle, WA","institution_ids":["https://openalex.org/I58610484"]},{"raw_affiliation_string":"Seattle University, Seattle, WA#TAB#","institution_ids":["https://openalex.org/I58610484"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080726484","display_name":"David Joslin","orcid":null},"institutions":[{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Joslin","raw_affiliation_strings":["Seattle University, Seattle, WA","Seattle University, Seattle, WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Seattle University, Seattle, WA","institution_ids":["https://openalex.org/I58610484"]},{"raw_affiliation_string":"Seattle University, Seattle, WA#TAB#","institution_ids":["https://openalex.org/I58610484"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023975375"],"corresponding_institution_ids":["https://openalex.org/I58610484"],"apc_list":null,"apc_paid":null,"fwci":2.7944,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90827363,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1329","last_page":"1336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9936000108718872,"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/computer-science","display_name":"Computer science","score":0.6212701201438904},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5982505083084106},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5518263578414917},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5435805320739746},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5421188473701477},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5378984212875366},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5369654893875122},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5182232856750488},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.48677730560302734},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4532696604728699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40117520093917847},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32616597414016724},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.27958929538726807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1819801926612854}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6212701201438904},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5982505083084106},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5518263578414917},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5435805320739746},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5421188473701477},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5378984212875366},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5369654893875122},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5182232856750488},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.48677730560302734},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4532696604728699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40117520093917847},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32616597414016724},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.27958929538726807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1819801926612854},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1143997.1144203","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.9004","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.9004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2006/docs/p1329.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W125880459","https://openalex.org/W158064858","https://openalex.org/W1497809492","https://openalex.org/W1530482293","https://openalex.org/W1569963106","https://openalex.org/W1598982666","https://openalex.org/W1853782596","https://openalex.org/W1993901877","https://openalex.org/W2050440701","https://openalex.org/W2103794354","https://openalex.org/W2143908245","https://openalex.org/W6629894132"],"related_works":["https://openalex.org/W2061323558","https://openalex.org/W2358162608","https://openalex.org/W2384380565","https://openalex.org/W2053239556","https://openalex.org/W2355503583","https://openalex.org/W2346752270","https://openalex.org/W2961151660","https://openalex.org/W2182912710","https://openalex.org/W2729115982","https://openalex.org/W2369553523"],"abstract_inverted_index":{"The":[0],"AI":[1],"optimization":[2,106],"algorithm":[3,99],"called":[4],"\"Squeaky-Wheel":[5],"Optimization\"":[6],"(SWO)":[7],"has":[8],"proven":[9],"very":[10],"effective":[11],"in":[12,35],"a":[13,54,102,120],"variety":[14],"of":[15,29,42,50,56,67,80,87,104],"real-world":[16],"applications.":[17],"Although":[18],"the":[19,64,78],"ideas":[20,116],"behind":[21],"SWO":[22,38,52,83,118],"are":[23,60,91],"more":[24,121],"closely":[25],"tied":[26],"to":[27,93],"those":[28],"local":[30],"search":[31],"such":[32],"as":[33,43],"hill-climbing,":[34],"some":[36,110,126],"ways":[37],"can":[39],"be":[40,94],"thought":[41],"an":[44],"evolutionary":[45,68],"algorithm.":[46],"From":[47],"that":[48,59,90,114],"point":[49],"view":[51],"makes":[53],"number":[55],"design":[57],"decisions":[58],"at":[61],"odds":[62],"with":[63,119],"conventional":[65],"wisdom":[66],"algorithms,":[69],"but":[70],"not":[71],"for":[72],"any":[73],"clear":[74],"reasons.":[75],"This":[76],"suggests":[77],"possibility":[79],"improving":[81],"on":[82,101],"by":[84],"incorporating":[85],"aspects":[86],"Genetic":[88],"Algorithms":[89],"known":[92],"effective.":[95],"We":[96],"compare":[97],"several":[98],"variants":[100],"set":[103],"constrained":[105],"benchmarks,":[107],"and":[108],"present":[109],"preliminary":[111],"results":[112],"suggesting":[113],"combining":[115],"from":[117],"standard":[122],"GA":[123],"approach":[124],"yields":[125],"significant":[127],"improvements":[128],"over":[129],"both.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}