{"id":"https://openalex.org/W2732766938","doi":"https://doi.org/10.1145/3071178.3071309","title":"Parallel evolutionary algorithm with interleaving generations","display_name":"Parallel evolutionary algorithm with interleaving generations","publication_year":2017,"publication_date":"2017-06-30","ids":{"openalex":"https://openalex.org/W2732766938","doi":"https://doi.org/10.1145/3071178.3071309","mag":"2732766938"},"language":"en","primary_location":{"id":"doi:10.1145/3071178.3071309","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3071178.3071309","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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/A5082108573","display_name":"Martin Pil\u00e1t","orcid":"https://orcid.org/0000-0003-1239-1566"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Martin Pil\u00e1t","raw_affiliation_strings":["Charles University, Prague, Czech republic"],"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czech republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037011091","display_name":"Roman Neruda","orcid":"https://orcid.org/0000-0003-2364-5357"},"institutions":[{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Roman Neruda","raw_affiliation_strings":["Institute of Computer Science, Prague, Czech republic"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Prague, Czech republic","institution_ids":["https://openalex.org/I4210155092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082108573"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.4673,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72095808,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"865","last_page":"872"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9785000085830688,"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.9785000085830688,"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.965499997138977,"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.9254999756813049,"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/interleaving","display_name":"Interleaving","score":0.883712649345398},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7838016748428345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6812794208526611},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5606325268745422},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5604875683784485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5443434715270996},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.53218674659729},{"id":"https://openalex.org/keywords/cultural-algorithm","display_name":"Cultural algorithm","score":0.4860747158527374},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4380406439304352},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4112327992916107},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.32654064893722534},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3198149502277374},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.24029290676116943}],"concepts":[{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.883712649345398},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7838016748428345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6812794208526611},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5606325268745422},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5604875683784485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5443434715270996},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.53218674659729},{"id":"https://openalex.org/C5536111","wikidata":"https://www.wikidata.org/wiki/Q5193250","display_name":"Cultural algorithm","level":4,"score":0.4860747158527374},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4380406439304352},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4112327992916107},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.32654064893722534},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3198149502277374},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.24029290676116943},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3071178.3071309","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3071178.3071309","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0477041","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0273439","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1541691514","https://openalex.org/W1763200058","https://openalex.org/W2022605100","https://openalex.org/W2144942212","https://openalex.org/W2332546559","https://openalex.org/W2492826144","https://openalex.org/W2579591092","https://openalex.org/W4250883340"],"related_works":["https://openalex.org/W2126796113","https://openalex.org/W2077550316","https://openalex.org/W4360996914","https://openalex.org/W2085064126","https://openalex.org/W2115794623","https://openalex.org/W2946917459","https://openalex.org/W2130687803","https://openalex.org/W4249580621","https://openalex.org/W2082741271","https://openalex.org/W2148471033"],"abstract_inverted_index":{"We":[0],"present":[1,108],"a":[2,12,59],"parallel":[3],"evolutionary":[4,62,93,111],"algorithm":[5,10,63,74,86],"with":[6],"interleaving":[7],"generations.":[8],"The":[9,72],"uses":[11],"careful":[13],"analysis":[14],"of":[15,50,78],"genetic":[16],"operators":[17],"and":[18,58,95],"selection":[19],"in":[20,41,56,81,109],"order":[21],"to":[22,65,70,90],"evaluate":[23],"individuals":[24],"from":[25],"following":[26],"generations":[27],"while":[28],"the":[29,52,85,91],"current":[30],"generation":[31],"is":[32,87,106],"still":[33],"not":[34,99],"completely":[35],"evaluated.":[36],"This":[37],"brings":[38],"significant":[39],"advantages":[40],"cases":[42],"where":[43],"each":[44],"fitness":[45],"evaluation":[46,102],"takes":[47],"different":[48],"amount":[49],"time,":[51],"evaluations":[53,69],"are":[54],"performed":[55],"parallel,":[57],"traditional":[60],"generational":[61,92],"has":[64],"wait":[66],"for":[67],"all":[68],"finish.":[71],"proposed":[73],"provides":[75],"better":[76],"utilization":[77],"computational":[79],"resources":[80],"these":[82],"cases.":[83],"Moreover,":[84],"functionally":[88],"equivalent":[89],"algorithm,":[94],"thus":[96],"it":[97],"does":[98],"have":[100],"any":[101],"time":[103],"bias,":[104],"which":[105],"often":[107],"asynchronous":[110],"algorithms.":[112]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-06T13:50:29.536080","created_date":"2025-10-10T00:00:00"}