{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:06:12Z","timestamp":1777597572792,"version":"3.51.4"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,28]]},"DOI":"10.1109\/cec45853.2021.9504766","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T21:57:06Z","timestamp":1628546226000},"page":"2331-2338","source":"Crossref","is-referenced-by-count":19,"title":["An Adaptive and Near Parameter-Free BRKGA Using Q-Learning Method"],"prefix":"10.1109","author":[{"given":"Antonio Augusto","family":"Chaves","sequence":"first","affiliation":[]},{"given":"Luiz Henrique Nogueira","family":"Lorena","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185743"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04008-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"ref13","first-page":"230","article-title":"On the virtues of parameterized uniform crossover","author":"spears","year":"1991","journal-title":"Proc of the Fourth International Conference on Genetic Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IEEM.2015.7385771"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185770"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9186-y"},{"key":"ref19","article-title":"Traveling salesman type combinatorial problems and their relation to the logistics of regional blood banking","author":"or","year":"1976","journal-title":"Ph D Dissertation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.07.031"},{"key":"ref3","first-page":"1","article-title":"Adaptive and multilevel metaheuristics","author":"sevaux","year":"2018","journal-title":"Handbook of heuristics"},{"key":"ref6","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9143-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.01.040"},{"key":"ref7","article-title":"Learning from delayed rewards","author":"watkins","year":"1989","journal-title":"Ph D Dissertation"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume":"74","author":"talbi","year":"2009","journal-title":"Metaheuristics From Design to Implementation"},{"key":"ref9","first-page":"1","article-title":"A novel general variable neighborhood search through q-learning for no-idle flowshop scheduling","author":"\u00f6ztop","year":"2020","journal-title":"2020 IEEE Congress on Evolutionary Computation (CEC)"},{"key":"ref20","article-title":"Local search and metaheuristics for the travelling salesman problem","author":"rego","year":"2002","journal-title":"The Travelling Salesman Problem and its Variations"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"l\u00f3pez-ib\u00e1\u00f1ez","year":"2016","journal-title":"Perspectives on Operations Research"},{"key":"ref21","author":"gerhard","year":"1995","journal-title":"Tsplib 95 documentation"},{"key":"ref23","first-page":"1658","article-title":"Wilcoxon-signed-rank test","author":"rey","year":"2014","journal-title":"International Encyclopedia of Statistical Science"}],"event":{"name":"2021 IEEE Congress on Evolutionary Computation (CEC)","location":"Krak\u00f3w, Poland","start":{"date-parts":[[2021,6,28]]},"end":{"date-parts":[[2021,7,1]]}},"container-title":["2021 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9504682\/9504683\/09504766.pdf?arnumber=9504766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:22:45Z","timestamp":1725596565000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9504766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/cec45853.2021.9504766","relation":{},"subject":[],"published":{"date-parts":[[2021,6,28]]}}}