{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:41:07Z","timestamp":1779367267167,"version":"3.53.0"},"reference-count":46,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572253"],"award-info":[{"award-number":["61572253"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aviation Science Foundation of China","doi-asserted-by":"crossref","award":["20185152035"],"award-info":[{"award-number":["20185152035"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["NJ2020022"],"award-info":[{"award-number":["NJ2020022"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["NJ2019010"],"award-info":[{"award-number":["NJ2019010"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["NJ20170007"],"award-info":[{"award-number":["NJ20170007"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p>Path generation means generating a path or a set of paths so that the generated path meets specified properties or constraints. To our knowledge, generating a path with the performance evaluation value of the path within a given value interval has received scant attention. This paper subtly formulates the path generation problem as an optimization problem by designing a reasonable fitness function, adapts the Markov decision process with reward model into a weighted digraph by eliminating multiple edges and non-goal dead nodes, constructs the path by using a priority-based indirect coding scheme, and finally modifies the bat algorithm with heuristic to solve the optimization problem. Simulation experiments were carried out for different objective functions, population size, number of nodes, and interval ranges. Experimental results demonstrate the effectiveness and superiority of the proposed algorithm.<\/jats:p>","DOI":"10.1142\/s0218194023500158","type":"journal-article","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T03:07:12Z","timestamp":1678331232000},"page":"787-814","source":"Crossref","is-referenced-by-count":1,"title":["Path Generation for a Given Performance Evaluation Value Interval by Modifying Bat Algorithm with Heuristic"],"prefix":"10.1142","volume":"33","author":[{"given":"Fujun","family":"Wang","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zining","family":"Cao","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, P. R. China"},{"name":"Key Laboratory of Safety-Critical Software, Ministry of Industry and Information Technology, Nanjing 211106, P. R. China"},{"name":"Collaborative Innovation Center of Novel Software, Technology and Industrialization, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, P. R. China"},{"name":"Science and Technology on Electro-Optic Control Laboratory, Luoyang 471000, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Xing","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Zong","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"S0218194023500158BIB001","first-page":"72","volume-title":"Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems","author":"Han T.","year":"2007"},{"issue":"2","key":"S0218194023500158BIB002","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TSE.2009.5","volume":"35","author":"Han T.","year":"2009","journal-title":"IEEE Trans. Softw. Eng."},{"key":"S0218194023500158BIB003","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.scico.2014.02.001","volume":"91","author":"Jansen N.","year":"2014","journal-title":"Sci. Comput. Program."},{"key":"S0218194023500158BIB004","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-319-50920-4_16","volume-title":"Nature-Inspired Computing and Optimization","author":"Srivastava P. R.","year":"2017"},{"issue":"2","key":"S0218194023500158BIB005","doi-asserted-by":"crossref","first-page":"231","DOI":"10.31449\/inf.v45i2.3049","volume":"45","author":"Sornkliang W.","year":"2021","journal-title":"Informatica"},{"issue":"1","key":"S0218194023500158BIB006","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00521-021-06569-4","volume":"34","author":"Puente Castro A.","year":"2022","journal-title":"Neural Comput. Appl."},{"key":"S0218194023500158BIB007","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.comcom.2019.10.014","volume":"149","author":"Aggarwal S.","year":"2020","journal-title":"Comput. Commun."},{"issue":"1","key":"S0218194023500158BIB008","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(00)00305-4","volume":"274","author":"Hermanns H.","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"S0218194023500158BIB009","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.peva.2015.04.003","volume":"90","author":"Ballarini P.","year":"2015","journal-title":"Perform. Eval."},{"issue":"3","key":"S0218194023500158BIB010","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s00165-018-0457-3","volume":"30","author":"Jing Y.","year":"2018","journal-title":"Form. Asp. Comput."},{"issue":"3","key":"S0218194023500158BIB011","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ipl.2004.06.020","volume":"92","author":"Krasikov I.","year":"2004","journal-title":"Inf. Process. Lett."},{"key":"S0218194023500158BIB012","first-page":"1","volume-title":"1st Symp. Algorithmic Foundations of Dynamic Networks","author":"Casteigts A.","year":"2022"},{"issue":"11","key":"S0218194023500158BIB014","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"Yen J. Y.","year":"1971","journal-title":"Manage. Sci."},{"issue":"7","key":"S0218194023500158BIB015","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/26.2815","volume":"36","author":"Topkis D. M.","year":"1988","journal-title":"IEEE Trans. Commun."},{"key":"S0218194023500158BIB016","first-page":"663","volume-title":"2015 Int. Conf. Industrial Engineering and Systems Management","author":"Scano G.","year":"2015"},{"key":"S0218194023500158BIB017","doi-asserted-by":"crossref","first-page":"115193","DOI":"10.1016\/j.eswa.2021.115193","volume":"182","author":"Garc\u00eda Heredia D.","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"S0218194023500158BIB018","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0020-0190(97)00122-1","volume":"63","author":"Lalgudi K. N.","year":"1997","journal-title":"Inf. Process. Lett."},{"key":"S0218194023500158BIB019","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.matpr.2019.05.363","volume":"21","author":"Kesavan V.","year":"2020","journal-title":"Mater. Today Proc."},{"issue":"4","key":"S0218194023500158BIB020","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"Mohemmed A. W.","year":"2008","journal-title":"Appl. Soft Comput."},{"key":"S0218194023500158BIB021","doi-asserted-by":"publisher","DOI":"10.1142\/S021819401650039X"},{"key":"S0218194023500158BIB022","volume-title":"Communication and Concurrency","author":"Milner R.","year":"1989"},{"key":"S0218194023500158BIB023","volume-title":"Principles of Model Checking","author":"Baier C.","year":"2008"},{"key":"S0218194023500158BIB024","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)","author":"Yang X. S.","year":"2010"},{"issue":"5","key":"S0218194023500158BIB025","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"Yang X. S.","year":"2012","journal-title":"Eng. Comput."},{"key":"S0218194023500158BIB026","first-page":"2774","volume-title":"IEEE Int. Conf. Systems, Man, and Cybernetics","author":"Munetomo M.","year":"1998"},{"key":"S0218194023500158BIB027","first-page":"137","volume-title":"1999 IEEE Int. Symp. Circuits and Systems","volume":"6","author":"Inagaki J.","year":"1999"},{"issue":"6","key":"S0218194023500158BIB028","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"Ahn C. W.","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"S0218194023500158BIB029","first-page":"401","volume-title":"Proc. 1997 IEEE Int. Conf. Evolutionary Computation","author":"Gen M.","year":"1997"},{"issue":"4","key":"S0218194023500158BIB030","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s12530-014-9126-9","volume":"6","author":"Mazinan A. H.","year":"2015","journal-title":"Evol. Syst."},{"issue":"9","key":"S0218194023500158BIB031","doi-asserted-by":"crossref","first-page":"e5619","DOI":"10.1002\/cpe.5619","volume":"32","author":"Cai X.","year":"2020","journal-title":"Concurrency Comput. Pract. Exp."},{"key":"S0218194023500158BIB032","first-page":"65","volume-title":"14th Int. School on Formal Methods for the Design of Computer, Communication and Software Systems","author":"\u00c1brah\u00e1m E.","year":"2014"},{"key":"S0218194023500158BIB033","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/QEST.2009.10","volume-title":"2009 Sixth Int. Conf. Quantitative Evaluation of Systems","author":"Aljazzar H.","year":"2009"},{"issue":"5","key":"S0218194023500158BIB034","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10009-007-0047-9","volume":"9","author":"Chechik M.","year":"2007","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"1","key":"S0218194023500158BIB035","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"Dijkstra E. W.","year":"1959","journal-title":"Numer. Math."},{"issue":"1","key":"S0218194023500158BIB036","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"Bellman R.","year":"1958","journal-title":"Q. Appl. Math."},{"key":"S0218194023500158BIB038","first-page":"285","volume-title":"Proc. Int. Symp. Switching Theory","author":"Moore E. F.","year":"1957"},{"key":"S0218194023500158BIB039","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09438-9","volume-title":"Principles of Artificial Intelligence","author":"Nilsson N. J.","year":"1982"},{"issue":"1","key":"S0218194023500158BIB040","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0004-3702(01)00106-0","volume":"129","author":"Hansen E. A.","year":"2001","journal-title":"Artif. Intell."},{"issue":"1","key":"S0218194023500158BIB041","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s10846-021-01440-z","volume":"104","author":"Spanogiannopoulos S.","year":"2022","journal-title":"J. Intell. Robot. Syst."},{"issue":"8","key":"S0218194023500158BIB042","doi-asserted-by":"crossref","first-page":"6993","DOI":"10.1109\/JIOT.2020.2979521","volume":"7","author":"Huang Z.","year":"2020","journal-title":"IEEE Internet Things J."},{"issue":"6","key":"S0218194023500158BIB043","doi-asserted-by":"crossref","first-page":"4906","DOI":"10.1109\/JIOT.2020.3030240","volume":"8","author":"Wu Y.","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"S0218194023500158BIB044","doi-asserted-by":"crossref","first-page":"11911","DOI":"10.1007\/s00521-022-07080-0","volume":"34","author":"Lv J. X.","year":"2022","journal-title":"Neural Comput. Appl."},{"key":"S0218194023500158BIB045","doi-asserted-by":"crossref","first-page":"117191","DOI":"10.1016\/j.eswa.2022.117191","volume":"199","author":"Low E. S.","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"S0218194023500158BIB046","doi-asserted-by":"crossref","first-page":"e6721","DOI":"10.1002\/cpe.6721","volume":"34","author":"Garip Z.","year":"2022","journal-title":"Concurrency Comput. Pract. Exp."},{"issue":"6","key":"S0218194023500158BIB047","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","volume":"32","author":"Luo Q.","year":"2020","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"S0218194023500158BIB048","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/20M1343154","volume":"12","author":"Fox J.","year":"2021","journal-title":"SIAM J. Financ. Math."}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194023500158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T15:19:34Z","timestamp":1702048774000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218194023500158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":46,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S0218194023500158"],"URL":"https:\/\/doi.org\/10.1142\/s0218194023500158","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"value":"0218-1940","type":"print"},{"value":"1793-6403","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,20]]}}}