{"id":"https://openalex.org/W3192979375","doi":"https://doi.org/10.1145/3461598.3461603","title":"Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy","display_name":"Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy","publication_year":2021,"publication_date":"2021-04-10","ids":{"openalex":"https://openalex.org/W3192979375","doi":"https://doi.org/10.1145/3461598.3461603","mag":"3192979375"},"language":"en","primary_location":{"id":"doi:10.1145/3461598.3461603","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3461598.3461603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","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/A5032142322","display_name":"Celso C. Ribeiro","orcid":"https://orcid.org/0000-0002-9478-2351"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Celso C. Ribeiro","raw_affiliation_strings":["Universidade Federal Fluminense, Brazi"],"affiliations":[{"raw_affiliation_string":"Universidade Federal Fluminense, Brazi","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037964769","display_name":"Jos\u00e9 A. Riveaux","orcid":null},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jose A. Riveaux","raw_affiliation_strings":["Universidade Federal Fluminense, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal Fluminense, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089254575","display_name":"Julliany Sales Brand\u00e3o","orcid":null},"institutions":[{"id":"https://openalex.org/I158509141","display_name":"Federal Center for Technological Education Celso Suckow da Fonseca","ror":"https://ror.org/03j8tnm47","country_code":"BR","type":"education","lineage":["https://openalex.org/I1293487690","https://openalex.org/I158509141","https://openalex.org/I2801200668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Julliany S. Brandao","raw_affiliation_strings":["CEFET/RJ, Brazil"],"affiliations":[{"raw_affiliation_string":"CEFET/RJ, Brazil","institution_ids":["https://openalex.org/I158509141"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032142322"],"corresponding_institution_ids":["https://openalex.org/I161127581"],"apc_list":null,"apc_paid":null,"fwci":0.2719,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62873423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"28","last_page":"36"},"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.9991999864578247,"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.9970999956130981,"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.9722808599472046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5907275676727295},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5885894298553467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5704159140586853},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5523890256881714},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5096962451934814},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.49386364221572876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48536598682403564},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4338167905807495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36920469999313354},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13141873478889465}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9722808599472046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5907275676727295},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5885894298553467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5704159140586853},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5523890256881714},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5096962451934814},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.49386364221572876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48536598682403564},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4338167905807495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36920469999313354},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13141873478889465},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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":1,"locations":[{"id":"doi:10.1145/3461598.3461603","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3461598.3461603","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W144556539","https://openalex.org/W1526030233","https://openalex.org/W1589581725","https://openalex.org/W1943385891","https://openalex.org/W1972542061","https://openalex.org/W1981970233","https://openalex.org/W1996472849","https://openalex.org/W2031770229","https://openalex.org/W2032005718","https://openalex.org/W2034368997","https://openalex.org/W2036894611","https://openalex.org/W2074887624","https://openalex.org/W2103937264","https://openalex.org/W2114320142","https://openalex.org/W2120470208","https://openalex.org/W2131113792","https://openalex.org/W2153386665","https://openalex.org/W2153446897","https://openalex.org/W2164824749","https://openalex.org/W2168079536","https://openalex.org/W2168959224","https://openalex.org/W2541616316","https://openalex.org/W2617162982","https://openalex.org/W2731478787","https://openalex.org/W2805404656","https://openalex.org/W2999572838","https://openalex.org/W3009929116","https://openalex.org/W3112292673","https://openalex.org/W4247393183","https://openalex.org/W6682763932"],"related_works":["https://openalex.org/W1691987593","https://openalex.org/W2187548779","https://openalex.org/W4379984321","https://openalex.org/W2349224693","https://openalex.org/W2393378219","https://openalex.org/W2366152627","https://openalex.org/W1981105365","https://openalex.org/W2037594302","https://openalex.org/W2387689044","https://openalex.org/W2380898791"],"abstract_inverted_index":{"In":[0,74],"a":[1,6,11,15,23,44,52,64,94],"biased":[2,36,99],"random-key":[3,100],"genetic":[4,101],"algorithm,":[5],"deterministic":[7],"decoder":[8],"algorithm":[9],"takes":[10],"solution":[12,25],"represented":[13],"by":[14,121,125,161],"vector":[16],"of":[17,55,87,105,172],"real":[18],"numbers":[19],"(random-keys)":[20],"and":[21,90,136],"builds":[22],"feasible":[24],"for":[26],"the":[27,85,88,106,117,130,137,148,157,169,173,183],"problem":[28,135],"at":[29],"hand.":[30],"Selection":[31],"is":[32,42,63,123],"said":[33],"to":[34,59,68,167,178],"be":[35,82],"not":[37,165],"only":[38,166],"because":[39,49],"one":[40],"parent":[41],"always":[43],"high-quality":[45,72],"solution,":[46],"but":[47,176],"also":[48,177],"it":[50],"has":[51],"higher":[53],"probability":[54],"passing":[56],"its":[57,60],"characteristics":[58],"offspring.":[61],"Path-relinking":[62],"search":[65],"intensification":[66],"strategy":[67,97,120,160],"explore":[69],"trajectories":[70],"connecting":[71],"solutions.":[73],"this":[75],"work,":[76],"we":[77],"show":[78,146],"how":[79],"path-relinking":[80],"can":[81],"applied":[83],"in":[84,98,182],"space":[86],"random-keys":[89],"successfully":[91],"explored":[92],"as":[93],"progressive":[95,118,158],"crossover":[96,110,114,119,150,154,159],"algorithms.":[102],"The":[103,143],"efficiency":[104],"newly":[107],"proposed":[108],"improved":[109,149],"strategies,":[111,151],"combining":[112,152],"multiple":[113,153],"operators":[115,155],"with":[116,156],"path-relinking,":[122,162],"illustrated":[124],"applications":[126],"on":[127],"two":[128],"problems:":[129],"single-round":[131],"divisible":[132,139],"load":[133,140],"scheduling":[134,141],"multi-round":[138],"problem.":[142],"computational":[144],"results":[145],"that":[147],"are":[163],"able":[164],"improve":[168],"running":[170,185],"times":[171],"original":[174],"BRKGA,":[175],"find":[179],"better":[180],"solutions":[181],"same":[184],"times.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}