{"id":"https://openalex.org/W2954332253","doi":"https://doi.org/10.1145/3321707.3321877","title":"A genetic algorithm hybridisation scheme for effective use of parallel workers","display_name":"A genetic algorithm hybridisation scheme for effective use of parallel workers","publication_year":2019,"publication_date":"2019-07-03","ids":{"openalex":"https://openalex.org/W2954332253","doi":"https://doi.org/10.1145/3321707.3321877","mag":"2954332253"},"language":"en","primary_location":{"id":"doi:10.1145/3321707.3321877","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321877","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":"conference-paper","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/A5005236972","display_name":"Simon Bowly","orcid":"https://orcid.org/0000-0002-2070-1440"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Simon Bowly","raw_affiliation_strings":["The University of Melbourne, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Melbourne, Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005236972"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05653021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"745","last_page":"752"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9991000294685364,"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.989799976348877,"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.7778129577636719},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.714518129825592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6939744353294373},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6522057056427002},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.6198163032531738},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6175497770309448},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5581144094467163},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5325756669044495},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48557040095329285},{"id":"https://openalex.org/keywords/idle","display_name":"Idle","score":0.473358154296875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43585696816444397},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21993672847747803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19691017270088196},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15457838773727417},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0577465295791626}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7778129577636719},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.714518129825592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6939744353294373},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6522057056427002},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6198163032531738},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6175497770309448},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5581144094467163},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5325756669044495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48557040095329285},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.473358154296875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43585696816444397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21993672847747803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19691017270088196},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15457838773727417},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0577465295791626},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/3321707.3321877","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321877","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2056071540","display_name":null,"funder_award_id":"FL140100012","funder_id":"https://openalex.org/F4320337726","funder_display_name":"Centre of Excellence for Core to Crust Fluid Systems, Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"},{"id":"https://openalex.org/F4320337726","display_name":"Centre of Excellence for Core to Crust Fluid Systems, Australian Research Council","ror":"https://ror.org/03nk9pp38"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2051143945","https://openalex.org/W2100012833","https://openalex.org/W2109881441","https://openalex.org/W2135038320","https://openalex.org/W2138385386","https://openalex.org/W2141426250","https://openalex.org/W2150834164","https://openalex.org/W2162803936","https://openalex.org/W2348881650","https://openalex.org/W2734336036","https://openalex.org/W2980111052"],"related_works":["https://openalex.org/W4237368524","https://openalex.org/W3125336740","https://openalex.org/W4285295674","https://openalex.org/W90886653","https://openalex.org/W2291893040","https://openalex.org/W2114712485","https://openalex.org/W3046481193","https://openalex.org/W2041592502","https://openalex.org/W1551554231","https://openalex.org/W3043746022"],"abstract_inverted_index":{"Genetic":[0],"algorithms":[1],"are":[2,59],"simple":[3],"to":[4,22,39,82],"accelerate":[5],"by":[6,64],"evaluating":[7],"the":[8,104],"fitness":[9,16],"of":[10,53,103],"individuals":[11,62],"in":[12],"parallel.":[13],"However,":[14],"when":[15],"evaluation":[17],"is":[18,26],"expensive":[19],"and":[20,67,72,91],"time":[21],"evaluate":[23],"each":[24,86],"individual":[25],"highly":[27],"variable,":[28],"workers":[29],"can":[30,96],"be":[31,80,98],"left":[32],"idle":[33],"while":[34],"waiting":[35],"for":[36,61],"long-running":[37],"tasks":[38],"complete.":[40],"This":[41],"paper":[42],"proposes":[43],"a":[44,73,92],"local":[45,68,89],"search":[46,69,90],"hybridisation":[47],"scheme":[48],"which":[49,77],"guarantees":[50],"100%":[51],"utilisation":[52],"parallel":[54],"workers.":[55],"Separate":[56],"work":[57,84],"queues":[58],"maintained":[60],"produced":[63],"genetic":[65,94],"crossover":[66],"neighbourhood":[70],"operators,":[71],"priority":[74],"rule":[75],"determines":[76],"queue":[78],"should":[79],"used":[81],"distribute":[83],"at":[85],"step.":[87],"Hill-climbing":[88],"conventional":[93],"algorithm":[95],"both":[97],"derived":[99],"as":[100],"special":[101],"cases":[102],"algorithm.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}