{"id":"https://openalex.org/W3187499533","doi":"https://doi.org/10.1109/cec45853.2021.9504766","title":"An Adaptive and Near Parameter-Free BRKGA Using Q-Learning Method","display_name":"An Adaptive and Near Parameter-Free BRKGA Using Q-Learning Method","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3187499533","doi":"https://doi.org/10.1109/cec45853.2021.9504766","mag":"3187499533"},"language":"en","primary_location":{"id":"doi:10.1109/cec45853.2021.9504766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","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/A5004964195","display_name":"Ant\u00f4nio Augusto Chaves","orcid":"https://orcid.org/0000-0001-5767-6798"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Antonio Augusto Chaves","raw_affiliation_strings":["Univ Fed of S\u00e3o Paulo, S\u00e3o Jos\u00e9 dos Campos, Brazil"],"affiliations":[{"raw_affiliation_string":"Univ Fed of S\u00e3o Paulo, S\u00e3o Jos\u00e9 dos Campos, Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032190066","display_name":"Luiz Henrique Nogueira Lorena","orcid":"https://orcid.org/0000-0002-7072-785X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luiz Henrique Nogueira Lorena","raw_affiliation_strings":["Univ Fed of S\u00e3o Paulo, S\u00e3o Jos\u00e9 dos Campos, Brazil"],"affiliations":[{"raw_affiliation_string":"Univ Fed of S\u00e3o Paulo, S\u00e3o Jos\u00e9 dos Campos, Brazil","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004964195"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0395,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89030077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2331","last_page":"2338"},"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.995199978351593,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6725778579711914},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6469297409057617},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6349596381187439},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6133328676223755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5963456630706787},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5214235782623291},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5103780627250671},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.48584720492362976},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4786040484905243},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.4750102460384369},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4578491747379303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3517930507659912},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32821959257125854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3026527166366577},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.24857977032661438}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6725778579711914},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6469297409057617},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6349596381187439},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6133328676223755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5963456630706787},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5214235782623291},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5103780627250671},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.48584720492362976},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4786040484905243},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.4750102460384369},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4578491747379303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3517930507659912},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32821959257125854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3026527166366577},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.24857977032661438},{"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/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.1109/cec45853.2021.9504766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec45853.2021.9504766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"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":31,"referenced_works":["https://openalex.org/W220623884","https://openalex.org/W1588847046","https://openalex.org/W1613273921","https://openalex.org/W1999784138","https://openalex.org/W2010113720","https://openalex.org/W2010334716","https://openalex.org/W2037938479","https://openalex.org/W2121863487","https://openalex.org/W2132202037","https://openalex.org/W2141119792","https://openalex.org/W2151554678","https://openalex.org/W2153386665","https://openalex.org/W2168079536","https://openalex.org/W2244880409","https://openalex.org/W2885000664","https://openalex.org/W2910087204","https://openalex.org/W3004309097","https://openalex.org/W3011120880","https://openalex.org/W3036211873","https://openalex.org/W3083002018","https://openalex.org/W3083095378","https://openalex.org/W3083347893","https://openalex.org/W4214717370","https://openalex.org/W4232791346","https://openalex.org/W4233415207","https://openalex.org/W4246565613","https://openalex.org/W6608733066","https://openalex.org/W6652883923","https://openalex.org/W6775686901","https://openalex.org/W6779325222","https://openalex.org/W6814518867"],"related_works":["https://openalex.org/W2146364482","https://openalex.org/W1604040598","https://openalex.org/W2530777107","https://openalex.org/W3013791021","https://openalex.org/W3164942530","https://openalex.org/W2079274775","https://openalex.org/W2572756133","https://openalex.org/W89357012","https://openalex.org/W1975009952","https://openalex.org/W2099174039"],"abstract_inverted_index":{"The":[0,68],"Biased":[1],"Random-Key":[2],"Genetic":[3],"Algorithm":[4],"(BRKGA)":[5],"is":[6,66,70],"an":[7],"efficient":[8],"metaheuristic":[9],"to":[10,48,71,96],"solve":[11],"combinatorial":[12],"optimization":[13],"problems":[14],"but":[15],"requires":[16],"parameter":[17,39],"tuning":[18],"so":[19],"the":[20,25,42,49,52,73,77,84,91,97,103,106,111],"intensification":[21],"and":[22,41,102,108],"diversification":[23],"of":[24,51,110],"algorithm":[26,64,74],"work":[27],"in":[28,56],"a":[29,60],"balanced":[30],"way.":[31],"There":[32],"is,":[33],"however,":[34],"not":[35],"only":[36],"one":[37],"optimal":[38],"configuration,":[40],"best":[43,85],"configuration":[44,86],"may":[45],"differ":[46],"according":[47],"stages":[50],"evolutionary":[53,78],"process.":[54],"Hence,":[55],"this":[57],"research":[58],"paper,":[59],"BRKGA":[61],"with":[62],"Q-Learning":[63],"(BRKGA-QL)":[65],"proposed.":[67],"aim":[69],"control":[72],"parameters":[75],"during":[76],"process":[79],"using":[80],"Reinforcement":[81],"Learning,":[82],"indicating":[83],"at":[87],"each":[88],"stage.":[89],"In":[90],"experiments,":[92],"BRKGA-QL":[93],"was":[94],"applied":[95],"symmetric":[98],"Traveling":[99],"Salesman":[100],"Problem,":[101],"results":[104],"show":[105],"efficiency":[107],"competitiveness":[109],"proposed":[112],"algorithm.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
