{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:03:30Z","timestamp":1763535810841,"version":"3.41.2"},"reference-count":57,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T00:00:00Z","timestamp":1610755200000},"content-version":"vor","delay-in-days":15,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701363"],"award-info":[{"award-number":["11701363"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The Chinese postman problem is a classic resource allocation and scheduling problem, which has been widely used in practice. As a classical nondeterministic polynomial problem, finding its efficient algorithm has always been the research direction of scholars. In this paper, a new bioinspired algorithm is proposed to solve the Chinese postman problem based on molecular computation, which has the advantages of high computational efficiency, large storage capacity, and strong parallel computing ability. In the calculation, DNA chain is used to properly represent the vertex, edge, and corresponding weight, and then all possible path combinations are effectively generated through biochemical reactions. The feasible solution space is obtained by deleting the nonfeasible solution chains, and the optimal solution is solved by algorithm. Then the computational complexity and feasibility of the DNA algorithm are proved. By comparison, it is found that the computational complexity of the DNA algorithm is significantly better than that of previous algorithms. The correctness of the algorithm is verified by simulation experiments. With the maturity of biological operation technology, this algorithm has a broad application space in solving large\u2010scale combinatorial optimization problems.<\/jats:p>","DOI":"10.1155\/2021\/8814947","type":"journal-article","created":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T02:50:08Z","timestamp":1610851808000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing"],"prefix":"10.1155","volume":"2021","author":[{"given":"Zhaocai","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaoguang","family":"Bao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3131-1130","authenticated-orcid":false,"given":"Tunhua","family":"Wu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,1,16]]},"reference":[{"key":"e_1_2_10_1_2","first-page":"263","article-title":"Odd-even-point graphical operation method","volume":"3","author":"Guan M. G.","year":"1960","journal-title":"Acta Mathematica Sinica"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2019.101937"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1139\/cjce-2017-0185"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105552"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.3390\/app9030368"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.08.005"},{"key":"e_1_2_10_7_2","first-page":"15","article-title":"Exact solution approaches for the directed bi-objective Chinese postman problem","volume":"29","author":"Ero","year":"2018","journal-title":"Journal of Industrial and Engineering Chemistry"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3382-8"},{"key":"e_1_2_10_9_2","first-page":"1","article-title":"A time-dependent hierarchical Chinese postman problem","volume":"17","author":"Codur M. K.","year":"2020","journal-title":"Central European Journal of Operations Research"},{"key":"e_1_2_10_10_2","article-title":"Chinese postman problem","volume":"17","author":"Edmonds J.","year":"1965","journal-title":"Operational Researc"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1021\/ci010046r"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02899501"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1360\/crad20050217"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.3724\/sp.j.1087.2009.01880"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"ZoraidaB. S. E. DNA algorithm employing temperature gradient for chinese postman problem. process automation control and computing (pacc) Proceedings of the 2011 International Conference on 2011 March 2011 Bonn Germany.","DOI":"10.1109\/PACC.2011.5979046"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.9708\/jksci.2016.21.7.047"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09.010"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.2016.2591267"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2019.1911405"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.07.004"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2972389"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2020.1003204"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.7973651"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.7725098"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.278.5337.446"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.3934\/mbe.2019320"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.5004\/dwt.2018.22175"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.5004\/dwt.2019.24386"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-018-4643-x"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.3390\/ijms161025338"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11571-020-09575-9"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2929094"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2897580"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2940-9"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2071-8"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.2166\/ws.2020.302"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2019.103997"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.2991\/ijcis.d.201127.001"},{"key":"e_1_2_10_39_2","doi-asserted-by":"publisher","DOI":"10.1134\/s0005117915100070"},{"volume-title":"DNA Computing Models","year":"2008","author":"Zimmermann K. H.","key":"e_1_2_10_40_2"},{"key":"e_1_2_10_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2017.09.001"},{"key":"e_1_2_10_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.04.051"},{"key":"e_1_2_10_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2015.03.004"},{"key":"e_1_2_10_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.02.011"},{"key":"e_1_2_10_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.07.051"},{"key":"e_1_2_10_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2013.06.118"},{"key":"e_1_2_10_47_2","doi-asserted-by":"crossref","unstructured":"BraichR. S. JohnsonC. RothemundP. W. K. HwangD. ChelyapovN. andAdlemanL. M. Solution of a satisfiability problem on a gel-based DNA computer Proceedings of the Sixth International Conference on DNA Computation (DNA 2000) Lecture Notes in Computer Science June 2001 Leiden The Netherlands 27\u201342.","DOI":"10.1007\/3-540-44992-2_3"},{"key":"e_1_2_10_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2016.09.008"},{"key":"e_1_2_10_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-018-0047-1"},{"key":"e_1_2_10_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2011.03.004"},{"key":"e_1_2_10_51_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1069528"},{"key":"e_1_2_10_52_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2007.06.002"},{"key":"e_1_2_10_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf01580113"},{"key":"e_1_2_10_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.08.004"},{"key":"e_1_2_10_55_2","doi-asserted-by":"publisher","DOI":"10.1142\/s179383091250019x"},{"key":"e_1_2_10_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.07.006"},{"key":"e_1_2_10_57_2","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-190035"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/8814947.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/8814947.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8814947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:16:00Z","timestamp":1722946560000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8814947"}},"subtitle":[],"editor":[{"given":"Paolo","family":"Gastaldo","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8814947"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8814947","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-09-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8814947"}}