{"id":"https://openalex.org/W4388531178","doi":"https://doi.org/10.1145/3630638","title":"The Influence of Noise on Multi-parent Crossover for an Island Model Genetic Algorithm","display_name":"The Influence of Noise on Multi-parent Crossover for an Island Model Genetic Algorithm","publication_year":2023,"publication_date":"2023-11-09","ids":{"openalex":"https://openalex.org/W4388531178","doi":"https://doi.org/10.1145/3630638"},"language":"en","primary_location":{"id":"doi:10.1145/3630638","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3630638","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3630638","source":{"id":"https://openalex.org/S4210221532","display_name":"ACM Transactions on Evolutionary Learning and Optimization","issn_l":"2688-299X","issn":["2688-299X","2688-3007"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Evolutionary Learning and Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3630638","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106403715","display_name":"Brahim Aboutaib","orcid":"https://orcid.org/0000-0003-1749-437X"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Brahim Aboutaib","raw_affiliation_strings":["Univ. du Littoral C\u00f4te d\u2019Opale, Calais, France, and Mohammed V University in Rabat, Rabat, Morocco"],"raw_orcid":"https://orcid.org/0000-0003-1749-437X","affiliations":[{"raw_affiliation_string":"Univ. du Littoral C\u00f4te d\u2019Opale, Calais, France, and Mohammed V University in Rabat, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["University of Minnesota Duluth, Duluth, USA","Department of Computer Science University of Minnesota Duluth, USA"],"raw_orcid":"https://orcid.org/0000-0003-1295-6715","affiliations":[{"raw_affiliation_string":"University of Minnesota Duluth, Duluth, USA","institution_ids":["https://openalex.org/I4210115145"]},{"raw_affiliation_string":"Department of Computer Science University of Minnesota Duluth, USA","institution_ids":["https://openalex.org/I4210115145"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5106403715"],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":0.3321,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66476119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"4","issue":"2","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9986000061035156,"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.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9043809175491333},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.7230141162872314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6249746084213257},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5597173571586609},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5334636569023132},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5103070139884949},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.49654561281204224},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.42516815662384033},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.42509496212005615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39631709456443787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29297304153442383},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20905879139900208},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15620821714401245}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9043809175491333},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.7230141162872314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6249746084213257},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5597173571586609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5334636569023132},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5103070139884949},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.49654561281204224},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.42516815662384033},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42509496212005615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39631709456443787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29297304153442383},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20905879139900208},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15620821714401245},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3630638","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3630638","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3630638","source":{"id":"https://openalex.org/S4210221532","display_name":"ACM Transactions on Evolutionary Learning and Optimization","issn_l":"2688-299X","issn":["2688-299X","2688-3007"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Evolutionary Learning and Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3630638","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3630638","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3630638","source":{"id":"https://openalex.org/S4210221532","display_name":"ACM Transactions on Evolutionary Learning and Optimization","issn_l":"2688-299X","issn":["2688-299X","2688-3007"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Evolutionary Learning and Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388531178.pdf","grobid_xml":"https://content.openalex.org/works/W4388531178.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W133371706","https://openalex.org/W1501622334","https://openalex.org/W1507582389","https://openalex.org/W1515201194","https://openalex.org/W1569002781","https://openalex.org/W1593495653","https://openalex.org/W1933565355","https://openalex.org/W1976379984","https://openalex.org/W2000042664","https://openalex.org/W2023709803","https://openalex.org/W2027866700","https://openalex.org/W2049628352","https://openalex.org/W2059892427","https://openalex.org/W2069137810","https://openalex.org/W2127379360","https://openalex.org/W2130501349","https://openalex.org/W2133177257","https://openalex.org/W2148379945","https://openalex.org/W2151340910","https://openalex.org/W2156106639","https://openalex.org/W2164927253","https://openalex.org/W2191941709","https://openalex.org/W2197473496","https://openalex.org/W2290719151","https://openalex.org/W2296129337","https://openalex.org/W2492282619","https://openalex.org/W2527291902","https://openalex.org/W2560124257","https://openalex.org/W2567212392","https://openalex.org/W2582743722","https://openalex.org/W2604840712","https://openalex.org/W2801805553","https://openalex.org/W2805328192","https://openalex.org/W2967587352","https://openalex.org/W2969531032","https://openalex.org/W2991460418","https://openalex.org/W2993104012","https://openalex.org/W3081439660","https://openalex.org/W3086242280","https://openalex.org/W4231916799","https://openalex.org/W4292103243"],"related_works":["https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W2014162767","https://openalex.org/W2115729582","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2809283963","https://openalex.org/W2367260997","https://openalex.org/W2626282817","https://openalex.org/W4297582752"],"abstract_inverted_index":{"Many":[0],"optimization":[1,155],"problems":[2],"tackled":[3],"by":[4],"evolutionary":[5,46],"algorithms":[6],"are":[7],"not":[8],"only":[9],"computationally":[10],"expensive":[11],"but":[12],"also":[13],"complicated,":[14],"with":[15,26,70,90,95,164],"one":[16],"or":[17],"more":[18],"sources":[19],"of":[20,44,53,59,86,101,122,136,159],"noise.":[21,60,165],"One":[22],"technique":[23],"to":[24,75,148,162],"deal":[25,163],"high":[27],"computational":[28],"overhead":[29],"is":[30],"parallelization.":[31],"However,":[32],"though":[33],"the":[34,41,57,99,114,117,150],"existing":[35],"literature":[36],"gives":[37],"good":[38],"insight":[39],"about":[40],"expected":[42],"behavior":[43],"parallelized":[45],"algorithms,":[47],"we":[48],"still":[49],"lack":[50],"an":[51,87],"understanding":[52],"their":[54],"performance":[55],"in":[56,73,98],"presence":[58,100],"This":[61],"article":[62],"considers":[63],"how":[64],"parallelization":[65],"might":[66],"be":[67],"leveraged":[68],"together":[69],"multi-parent":[71,137],"crossover":[72,138],"order":[74],"handle":[76],"noisy":[77,106],"problems.":[78],"We":[79,125,140],"present":[80],"a":[81],"rigorous":[82],"running":[83],"time":[84],"analysis":[85],"island":[88],"model":[89],"weakly":[91],"connected":[92],"topology":[93],"tasked":[94],"hill":[96],"climbing":[97],"general":[102],"additive":[103],"noise":[104,118,153],"(i.e.,":[105],"OneMax":[107],").":[108],"Our":[109],"proofs":[110],"yield":[111],"insights":[112],"into":[113,128],"relationship":[115],"between":[116,152],"intensity":[119],"and":[120,130,144,157],"number":[121],"required":[123],"parents.":[124],"translate":[126],"this":[127,146],"positive":[129],"negative":[131],"results":[132],"for":[133],"two":[134],"kinds":[135],"operators.":[139],"then":[141],"empirically":[142],"analyze":[143],"extend":[145],"framework":[147],"investigate":[149],"tradeoffs":[151],"impact,":[154],"time,":[156],"limits":[158],"computation":[160],"power":[161]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}