{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:09Z","timestamp":1725566649523},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/ijcnn.2018.8489750","type":"proceedings-article","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T22:25:09Z","timestamp":1539987909000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Q-Learning with Dynamic Rewards Table Applied to the SONET\/SDH Ring Problem"],"prefix":"10.1109","author":[{"given":"Thiago Henrique Freire","family":"de Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriao Duarte Doria","family":"Neto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge Dantas","family":"Melo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Algoritmo q-learning como estrat&#x00E9;gia de explora&#x00E7;&#x00E3;o e\/ou explota&#x00E7;&#x00E3;o para as metaheur&#x00ED;sticas grasp e algoritmo gen&#x00E9;tico.","year":"2009","author":"j\u00fanior","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10701-6_14"},{"year":"2000","key":"ref12","article-title":"A branch-and-cut algorithm for solving an intraring synchronous optical network design problem"},{"key":"ref13","article-title":"A genetic algorithm with evolutionary path relinking for the sonet ring assignement problem","author":"bastos","year":"2008","journal-title":"Proc of the International Conference on Engineering and Optimization"},{"key":"ref14","article-title":"Split procedure for graph partitioning: An application to the sonet ring problem","author":"duhamel","year":"2015","journal-title":"IFCA-PapersOnLine"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-005-6998-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/net.20102"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2011.11.001"},{"key":"ref5","first-page":"239","article-title":"GRASP with pathrelinking for the SONET ring assignment problem","author":"bastos","year":"2005","journal-title":"Proceedings of the Fifth International Conference on Hybrid Intelligent Systems ser HIS &#x2019;05 Washington DC USA IEEE Computer Society"},{"key":"ref8","article-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming","author":"puterman","year":"2005","journal-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming"},{"article-title":"Learning from delayed rewards","year":"1989","author":"watkins","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000026267.44673.ed"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00236-6"},{"article-title":"Reinforcement Learning: An Introduction","year":"2016","author":"sutton","key":"ref9"}],"event":{"name":"2018 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2018,7,8]]},"location":"Rio de Janeiro","end":{"date-parts":[[2018,7,13]]}},"container-title":["2018 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8465565\/8488986\/08489750.pdf?arnumber=8489750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:57:19Z","timestamp":1598245039000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8489750\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2018.8489750","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}