{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T18:09:20Z","timestamp":1765994960668},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"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":[[2021,12,10]]},"DOI":"10.1109\/paap54281.2021.9720453","type":"proceedings-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T15:26:05Z","timestamp":1646407565000},"page":"69-75","source":"Crossref","is-referenced-by-count":2,"title":["A New Memetic Algorithm to Solve the Stochastic TSP"],"prefix":"10.1109","author":[{"given":"Yueting","family":"Luo","sequence":"first","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China"}]},{"given":"Omar","family":"Dib","sequence":"additional","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China"}]},{"given":"Jin","family":"Zian","sequence":"additional","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China"}]},{"given":"Hu","family":"Bingxu","sequence":"additional","affiliation":[{"name":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2015.129"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.11.010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/646\/1\/012032"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-097086-8.42010-6"},{"key":"ref14","article-title":"A survey of shortest-path algorithms","author":"madkour","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.12.009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/790\/1\/012149"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-017-9605-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106242"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2492-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2018.1502242"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.04.015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2015\/v8i1\/84652"},{"key":"ref1","article-title":"Distributionally robust optimization: A review","author":"rahimian","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13826-8_4"}],"event":{"name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","start":{"date-parts":[[2021,12,10]]},"location":"Xi'an, China","end":{"date-parts":[[2021,12,12]]}},"container-title":["2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9720298\/9720304\/09720453.pdf?arnumber=9720453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T17:01:44Z","timestamp":1656349304000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9720453\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/paap54281.2021.9720453","relation":{},"subject":[],"published":{"date-parts":[[2021,12,10]]}}}