{"id":"https://openalex.org/W2191941709","doi":"https://doi.org/10.1162/evco_a_00153","title":"Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms","display_name":"Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2191941709","doi":"https://doi.org/10.1162/evco_a_00153","mag":"2191941709","pmid":"https://pubmed.ncbi.nlm.nih.gov/26066804"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00153","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00153","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5062610790","display_name":"Andrea Mambrini","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]},{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrea Mambrini","raw_affiliation_strings":["Department of Computer Science, University of Sheffield, Sheffield S1\u00a04DP, UK","School of Computer Science, University of Birmingham, Birmingham B15 2TT, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, Sheffield S1\u00a04DP, UK","institution_ids":["https://openalex.org/I91136226"]},{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham B15 2TT, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["Department of Computer Science, University of Sheffield, Sheffield S1\u00a04DP, UK","Department of Computer Science, University of Sheffield, Sheffield S1 4DP, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, Sheffield S1\u00a04DP, UK","institution_ids":["https://openalex.org/I91136226"]},{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, Sheffield S1 4DP, United Kingdom","institution_ids":["https://openalex.org/I91136226"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1827,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.90435063,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"4","first_page":"559","last_page":"582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","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/T11975","display_name":"Evolutionary Algorithms and Applications","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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9641000032424927,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.8494195938110352},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6646838188171387},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6089460849761963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5861997008323669},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5502583384513855},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4768439531326294},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"Interval arithmetic","score":0.4702181816101074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4442169964313507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34681928157806396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0661417543888092}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.8494195938110352},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6646838188171387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6089460849761963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5861997008323669},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5502583384513855},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4768439531326294},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.4702181816101074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4442169964313507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34681928157806396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0661417543888092},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003142","descriptor_name":"Communication","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003142","descriptor_name":"Communication","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003142","descriptor_name":"Communication","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008954","descriptor_name":"Models, Biological","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008954","descriptor_name":"Models, Biological","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008954","descriptor_name":"Models, Biological","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015233","descriptor_name":"Models, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015233","descriptor_name":"Models, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D015233","descriptor_name":"Models, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D063426","descriptor_name":"Human Migration","qualifier_ui":"Q000706","qualifier_name":"statistics & numerical data","is_major_topic":false},{"descriptor_ui":"D063426","descriptor_name":"Human Migration","qualifier_ui":"Q000706","qualifier_name":"statistics & numerical data","is_major_topic":false},{"descriptor_ui":"D063426","descriptor_name":"Human Migration","qualifier_ui":"Q000706","qualifier_name":"statistics & numerical data","is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00153","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00153","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:26066804","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/26066804","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:eprints.whiterose.ac.uk:93025","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.800000011920929}],"awards":[{"id":"https://openalex.org/G2841756755","display_name":"Evolutionary Approximation Algorithms for Optimisation: Algorithm Design and Complexity Analysis","funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5904918521","display_name":null,"funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W57797460","https://openalex.org/W1507802579","https://openalex.org/W1518987931","https://openalex.org/W1547418289","https://openalex.org/W1593495653","https://openalex.org/W1966922440","https://openalex.org/W1970025632","https://openalex.org/W1981482533","https://openalex.org/W1989350531","https://openalex.org/W1994086685","https://openalex.org/W1997367770","https://openalex.org/W2023709803","https://openalex.org/W2033992696","https://openalex.org/W2034420611","https://openalex.org/W2035300004","https://openalex.org/W2038456806","https://openalex.org/W2043858810","https://openalex.org/W2049628352","https://openalex.org/W2069137810","https://openalex.org/W2104529187","https://openalex.org/W2104805479","https://openalex.org/W2106961302","https://openalex.org/W2117471842","https://openalex.org/W2130501349","https://openalex.org/W2159653361","https://openalex.org/W2164927253","https://openalex.org/W2201552289","https://openalex.org/W2215544372","https://openalex.org/W2225559300","https://openalex.org/W2504494713","https://openalex.org/W2600130231","https://openalex.org/W2911346016","https://openalex.org/W2950350276","https://openalex.org/W4231671578"],"related_works":["https://openalex.org/W2388711968","https://openalex.org/W4384934011","https://openalex.org/W1978833960","https://openalex.org/W2132183903","https://openalex.org/W2522108822","https://openalex.org/W198981881","https://openalex.org/W1994952395","https://openalex.org/W2261061935","https://openalex.org/W3125504772","https://openalex.org/W2159030350"],"abstract_inverted_index":{"The":[0],"migration":[1,44,62,76,140],"interval":[2,45,63,77],"is":[3,18,59,64,78],"one":[4],"of":[5,13,109,114,138],"the":[6,10,43,61,70,75,96,101,106,134,139],"fundamental":[7],"parameters":[8],"governing":[9],"dynamic":[11],"behaviour":[12],"island":[14],"models.":[15],"Yet,":[16],"there":[17],"little":[19],"understanding":[20],"on":[21,95],"how":[22,28],"this":[23,115],"parameter":[24],"affects":[25],"performance,":[26],"and":[27,100,147],"to":[29,47,66,80,117,128,144],"optimally":[30],"set":[31],"it":[32],"given":[33],"a":[34,89],"problem":[35],"in":[36],"hand.":[37],"We":[38,87],"propose":[39],"schemes":[40,125],"for":[41,91],"adapting":[42],"according":[46],"whether":[48],"fitness":[49,72],"improvements":[50],"have":[51],"been":[52],"found.":[53],"As":[54],"long":[55],"as":[56,105],"no":[57],"improvement":[58],"found,":[60],"increased":[65],"minimise":[67],"communication.":[68],"Once":[69],"best":[71,83],"has":[73],"improved,":[74],"decreased":[79],"spread":[81],"new":[82],"solutions":[84],"more":[85],"quickly.":[86],"provide":[88],"method":[90,116],"obtaining":[92],"upper":[93],"bounds":[94],"expected":[97,107],"running":[98,145],"time":[99,146],"communication":[102,148],"effort,":[103],"defined":[104],"number":[108],"migrants":[110],"sent.":[111],"Example":[112],"applications":[113],"common":[118],"example":[119],"functions":[120],"show":[121],"that":[122],"our":[123],"adaptive":[124],"are":[126],"able":[127],"compete":[129],"with,":[130],"or":[131],"even":[132],"outperform,":[133],"optimal":[135],"fixed":[136],"choice":[137],"interval,":[141],"with":[142],"regard":[143],"effort.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}