{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:03Z","timestamp":1740169143690,"version":"3.37.3"},"reference-count":49,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100007225","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","award":["NSC102-2221-E-007-086-MY3"],"award-info":[{"award-number":["NSC102-2221-E-007-086-MY3"]}],"id":[{"id":"10.13039\/100007225","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005023","name":"State Key Laboratory of Rail Traffic Control and Safety","doi-asserted-by":"publisher","award":["RCS2019K010"],"award-info":[{"award-number":["RCS2019K010"]}],"id":[{"id":"10.13039\/501100005023","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.2953180","type":"journal-article","created":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T21:58:06Z","timestamp":1573595886000},"page":"173310-173319","source":"Crossref","is-referenced-by-count":6,"title":["A New Node-Based Concept for Solving the Minimal Path Problem in General Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7835-4990","authenticated-orcid":false,"given":"Wenbo","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7393-0768","authenticated-orcid":false,"given":"Wei-Chang","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-4635","authenticated-orcid":false,"given":"Neal Naixue","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8622-888X","authenticated-orcid":false,"given":"Bin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ress.2015.05.019","article-title":"Assessment of the transition-rates importance of Markovian systems at steady state using the unscented transformation","volume":"142","author":"ramirez-marquez","year":"2015","journal-title":"Rel Eng Syst Saf"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2004.05.002"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.11.007"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2014.11.010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2452580"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2016.11.012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2016.04.002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2452573"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.02.004"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.03.011"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/24725854.2017.1351044"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2017.2771495"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.04.019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(94)00121-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1980.5220755"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2006.890900"},{"key":"ref22","first-page":"329","article-title":"Faster Evolutionary Convolutional Neural Networks Based on iSSO for Lesion Recognition in Medical Images","volume":"124","author":"zhu","year":"2019","journal-title":"Basic Clin Pharmacol Toxicol"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105582","article-title":"Solving cold-standby reliability redundancy allocation problems using a new swarm intelligence algorithm","volume":"83","author":"yeh","year":"2019","journal-title":"Appl Soft Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2018.2867103"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2019.2901057"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2018.02.002"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2018.04.006"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/24.664005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/en11092385"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JSEE.2012.00038"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4711-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8050539"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2011.2161703"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2925044"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1903-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2015.06.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2598562"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2016.07.025"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0951-8320(88)90122-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2014.2299693"},{"journal-title":"The Universal Generating Function in Reliability Analysis and Optimization","year":"2005","author":"levitin","key":"ref6"},{"journal-title":"The Combinatorics of Network Reliability","year":"1987","author":"colbourn","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2007.891923"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","author":"shier","year":"1991","journal-title":"Network Reliability and Algebraic Structures"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2017.05.032"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.06.019"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.903290"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s11518-017-5343-7"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.047"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TSMCA.2009.2026209","article-title":"A simple universal generating function method to search for all minimal paths in networks","volume":"39","author":"yeh","year":"2009","journal-title":"IEEE Trans Syst Man Cybern A Syst Humans"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2005.09.009"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2010.09.033"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2012.2220897"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2016.2570552"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08896880.pdf?arnumber=8896880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T20:33:37Z","timestamp":1722026017000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8896880\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2953180","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}