{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:16:33Z","timestamp":1770297393133,"version":"3.49.0"},"reference-count":50,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,30]]},"DOI":"10.1109\/cec60901.2024.10612186","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T17:55:15Z","timestamp":1723139715000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem with Forfeits"],"prefix":"10.1109","author":[{"given":"Gabriel","family":"Souto","sequence":"first","affiliation":[{"name":"Federal University of Rio de Janeiro,System Engineering and Computer Science Program,Rio de Janeiro,Brazil"}]},{"given":"Masayoshi","family":"Aritsugi","sequence":"additional","affiliation":[{"name":"Kumamoto University,Faculty of Advanced Science and Technology,Kumamoto,Japan"}]},{"given":"Israel","family":"Mendon\u00e7a","sequence":"additional","affiliation":[{"name":"Kumamoto University,Faculty of Advanced Science and Technology,Kumamoto,Japan"}]},{"given":"Luidi","family":"Simonetti","sequence":"additional","affiliation":[{"name":"Federal University of Rio de Janeiro,System Engineering and Computer Science Program,Rio de Janeiro,Brazil"}]},{"given":"Pedro Henrique","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[{"name":"Federal University of Rio de Janeiro,System Engineering and Computer Science Program,Rio de Janeiro,Brazil"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2895-y"},{"key":"ref2","article-title":"Minimal spanning trees with conflict graphs","author":"Darmann","year":"2009","journal-title":"Optimization online"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21527-8_26"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0742"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18500-8_41"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2012.044026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/060666329"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0355"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53262-8_22"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06331-x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9143-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2004.07.003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0395-5"},{"key":"ref15","volume-title":"Reinforcement learning: An introduction","author":"Sutton","year":"2018"},{"key":"ref16","first-page":"1179","article-title":"Conservative q-learning for offline reinforcement learning","volume":"33","author":"Kumar","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109075"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2070-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101236"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.03.016"},{"key":"ref23","article-title":"Uma heur\u00edstica ils para o problema da mochila com penalidades","author":"Moura","year":"2021","journal-title":"Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_11"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504856"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870321"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.057"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.01.005"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12178"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12429"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020377910258"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.011"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870442"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504766"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1957.6.56038"},{"key":"ref37","article-title":"Learning from delayed rewards","author":"Watkins","year":"1989","journal-title":"Machine learning"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101398"},{"key":"ref39","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"arXiv preprint"},{"key":"ref40","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011443"},{"key":"ref42","article-title":"Solving a new 3d bin packing problem with deep reinforcement learning method","author":"Hu","year":"2017","journal-title":"arXiv preprint"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106521"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870302"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.06.016"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477947"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1201\/b10451"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1959.10501526"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.041"}],"event":{"name":"2024 IEEE Congress on Evolutionary Computation (CEC)","location":"Yokohama, Japan","start":{"date-parts":[[2024,6,30]]},"end":{"date-parts":[[2024,7,5]]}},"container-title":["2024 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10609966\/10611750\/10612186.pdf?arnumber=10612186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T04:26:16Z","timestamp":1723350376000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10612186\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/cec60901.2024.10612186","relation":{},"subject":[],"published":{"date-parts":[[2024,6,30]]}}}