{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T09:57:06Z","timestamp":1777370226150,"version":"3.51.4"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370183"],"award-info":[{"award-number":["61370183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71320107001"],"award-info":[{"award-number":["71320107001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908011","type":"journal-article","created":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T22:15:50Z","timestamp":1554329750000},"page":"52142-52154","source":"Crossref","is-referenced-by-count":8,"title":["A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4794-9833","authenticated-orcid":false,"given":"Zhouxing","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junchen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0618-4969","authenticated-orcid":false,"given":"Zhipeng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2016.05.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/RNDM.2016.7608281"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/net.21778"},{"key":"ref13","first-page":"2378","article-title":"Elementary shortest-paths visiting a given set of nodes","author":"de andrade","year":"2013","journal-title":"Simpósio Brasileiro de Pesquisa Operacional"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.008"},{"key":"ref15","first-page":"6","article-title":"A study of sufficient conditions for hamiltonian cycles","volume":"1","author":"deleon","year":"2000","journal-title":"Rose Hulman Undergraduate Mathematics Journal"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1126\/science.251.4995.754"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36626-1_5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/321765.321768"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11434-012-5162-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1360\/N112014-00144"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2009.5366808"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1015031"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.5.909"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/RNDM.2015.7325218"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-013-5013-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0—Survivable network design library","volume":"55","author":"orlowski","year":"2010","journal-title":"Networks"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1100.0360"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"ref25","year":"2017","journal-title":"Gurobi Optimizer Reference Manual Version 5 0"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08681195.pdf?arnumber=8681195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T10:30:08Z","timestamp":1694773808000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8681195\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908011","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}