{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:47:24Z","timestamp":1777704444746,"version":"3.51.4"},"reference-count":36,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T00:00:00Z","timestamp":1582848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,5,29]]},"abstract":"<jats:p>Metaheuristic algorithms have been applied widely for real-world problems in many fields, e.g., engineering, financial, healthcare. Bats algorithm (BA) is a recent metaheuristic algorithm with considering as a robust optimization method that can outperform existing algorithms. However, when dealing with complicated combinatorial problems such as traveling salesman problems (TSP), the BA can be fallen in a local optimum. This paper proposes a new hybridizing Parallel BA (HPBA) with a mutation in local-search to escape such its drawback scenario for TSP. A graph theory mutation method is used to embed for hybridizing BA with exploiting similarities among individuals. The proposed method is extensively evaluated in TSP with series instances of the benchmark from TSPLIB to test its performance. The compared experimental result with the previous method and the best-known solutions (B.K.S) in the literature shows that the proposed approach offers competitive results.<\/jats:p>","DOI":"10.3233\/jifs-179668","type":"journal-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T11:16:15Z","timestamp":1582888575000},"page":"5811-5820","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":16,"title":["A hybridized parallel bats algorithm for combinatorial problem of traveling salesman"],"prefix":"10.1177","volume":"38","author":[{"given":"Trong-The","family":"Nguyen","sequence":"first","affiliation":[{"name":"Intelligent Information Processing Research Center, Fujian University of Technology, Fuzhou, Fujian, China"},{"name":"Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fujian, China"},{"name":"Department of Information Technology, University of Manage and Technology, Haiphong, Vietnam"}]},{"given":"Yu","family":"Qiao","sequence":"additional","affiliation":[{"name":"Intelligent Information Processing Research Center, Fujian University of Technology, Fuzhou, Fujian, China"},{"name":"Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fujian, China"}]},{"given":"Jeng-Shyang","family":"Pan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Shu-Chuan","family":"Chu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Kuo-Chi","family":"Chang","sequence":"additional","affiliation":[{"name":"Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fujian, China"}]},{"given":"Xingsi","family":"Xue","sequence":"additional","affiliation":[{"name":"Intelligent Information Processing Research Center, Fujian University of Technology, Fuzhou, Fujian, China"}]},{"given":"Thi-Kien","family":"Dao","sequence":"additional","affiliation":[{"name":"Intelligent Information Processing Research Center, Fujian University of Technology, Fuzhou, Fujian, China"},{"name":"Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fujian, China"}]}],"member":"179","published-online":{"date-parts":[[2020,2,28]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1121-x"},{"issue":"7","key":"e_1_3_1_3_2","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1109\/TVLSI.2019.2903289","article-title":"Novel Systolization of Subquadratic Space Complexity Multipliers Based on Toeplitz Matrix-Vector Product Approach","volume":"27","author":"Pan J.S.","year":"2019","unstructured":"PanJ.S., LeeC.Y., SghaierA., ZeghidM. and XieJ., Novel Systolization of Subquadratic Space Complexity Multipliers Based on Toeplitz Matrix-Vector Product Approach, IEEE Trans Very Large Scale Integr Syst27(7) (2019), 1614\u20131622.","journal-title":"IEEE Trans Very Large Scale Integr Syst"},{"issue":"6","key":"e_1_3_1_4_2","first-page":"58:1","article-title":"High-Utility Itemset Mining with Effective Pruning Strategies","volume":"13","author":"Wu J.M.-T.","year":"2019","unstructured":"WuJ.M.-T., LinJ.C.-W. and TamrakarA., High-Utility Itemset Mining with Effective Pruning Strategies, ACM Trans Knowl Discov13(6) (2019), 58:1\u201358:22.","journal-title":"ACM Trans Knowl Discov"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2891105"},{"key":"e_1_3_1_6_2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1145\/2684103.2684132","volume-title":"Proceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia","author":"Nguyen T.-T.","year":"2014","unstructured":"NguyenT.-T., ShiehC.-S., HorngM.-F. and DaoT.-K., A Genetic Algorithm with Self-Configuration Chromosome for the Optimization of Wireless Sensor Networks, Proceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia. ACM, Kaohsiung, Taiwan, (2014), pp, 413\u2013418."},{"issue":"10","key":"e_1_3_1_7_2","first-page":"2019","article-title":"A Compact Bat Algorithm for Unequal Clustering in Wireless Sensor Networks","volume":"9","author":"Nguyen T.-T.","unstructured":"NguyenT.-T., PanJ.-S. and DaoT.-K., A Compact Bat Algorithm for Unequal Clustering in Wireless Sensor Networks, Applied Sciences9(10), 2019.","journal-title":"Applied Sciences"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.3390\/info10060194"},{"issue":"2","key":"e_1_3_1_9_2","first-page":"126","article-title":"Adaptation in natural and artificial systems","volume":"6","author":"Holland J.H.","year":"1992","unstructured":"HollandJ.H., Adaptation in natural and artificial systems, Ann Arbor6(2) (1992), 126\u2013137.","journal-title":"Ann Arbor"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.3390\/s19030671"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"e_1_3_1_13_2","first-page":"854","article-title":"Cat swarm optimization, inLNAI","volume":"4099","author":"Chu S.A.","year":"2006","unstructured":"ChuS.A., TsaiP.W., PanJ.S., Cat swarm optimization, inLNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4099 (2006), 854\u2013858.","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.knosys.2019.01.006","article-title":"PaDE: An enhanced Differential Evolution algorithm with novel control parameter adaptation schemes for numerical optimization","volume":"168","author":"Meng Z.","year":"2019","unstructured":"MengZ., PanJ.S. and TsengK.K., PaDE: An enhanced Differential Evolution algorithm with novel control parameter adaptation schemes for numerical optimization, Knowledge-Based Syst168 (2019), 80\u201399.","journal-title":"Knowledge-Based Syst"},{"key":"e_1_3_1_16_2","first-page":"65","volume-title":"Studies in Computational Intelligence","author":"Yang X.S.","year":"2010","unstructured":"YangX.S., A new metaheuristic Bat-inspired Algorithm, in Studies in Computational Intelligence, vol. 284, Gonz\u00e1lezJ., PeltaD., CruzC., TerrazasG., and KrasnogorN., Eds. SpringerBerlin, Heidelberg, 2010, pp. 65\u201374."},{"issue":"4","key":"e_1_3_1_17_2","first-page":"761","article-title":"Parallel bat algorithm applied to the economic load dispatch problem","volume":"17","author":"Tsai C.F.","year":"2016","unstructured":"TsaiC.F., DaoT.K., PanT.S., NguyenT.T. and ChangJ.F., Parallel bat algorithm applied to the economic load dispatch problem, J Internet Technol17(4) (2016), 761\u2013769.","journal-title":"J Internet Technol"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-319-12286-1_12","article-title":"Evolved Bat Algorithm for solving the Economic Load Dispatch problem","volume":"329","author":"Dao T.K.","year":"2015","unstructured":"DaoT.K., PanT.S., NguyenT.T. and ChuS.C., Evolved Bat Algorithm for solving the Economic Load Dispatch problem, in Advances in Intelligent Systems and Computing329 (2015), pp. 109\u2013119.","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"e_1_3_1_19_2","first-page":"109","article-title":"Unequal clustering formation based on bat algorithm for wireless sensor networks","volume":"329","author":"Dao T.K.","year":"2015","unstructured":"DaoT.K., PanT.S., NguyenT.T., ChuS.C., Unequal clustering formation based on bat algorithm for wireless sensor networks, in Advances in Intelligent Systems and Computing329 (2015), 109\u2013119.","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/978-3-319-11680-8_53","article-title":"Unequal clustering formation based on bat algorithm for wireless sensor networks","volume":"326","author":"Nguyen T.T.","year":"2015","unstructured":"NguyenT.T., ShiehC.S., HorngM.F., NgoT.G., DaoT.K., Unequal clustering formation based on bat algorithm for wireless sensor networks, in Advances in Intelligent Systems and Computing326 (2015), 667\u2013678.","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"e_1_3_1_21_2","volume":"8481","author":"Tsai C.-F.","year":"2014","unstructured":"TsaiC.-F., DaoT.-K., YangW.-J., NguyenT.-T. and PanT.-S., Parallelized Bat Algorithm with a Communication Strategy, vol. 8481 LNAI, no. PART 1. (2014).","journal-title":"Parallelized Bat Algorithm with a Communication Strategy"},{"issue":"1","key":"e_1_3_1_22_2","first-page":"87","article-title":"Parallelized bat algorithm with a communication strategy","volume":"8481","author":"Tsai C.F.","year":"2014","unstructured":"TsaiC.F., DaoT.K., YangW.J., NguyenT.T., PanT.S., Parallelized bat algorithm with a communication strategy, in Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)8481(PART 1) (2014), 87\u201395.","journal-title":"Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)"},{"issue":"19","key":"e_1_3_1_23_2","first-page":"975","article-title":"Survey of Metaheuristic Algorithms for Combinatorial Optimization","volume":"58","author":"Baghel M.","year":"2012","unstructured":"BaghelM., AgrawalS. and SilakariS., Survey of Metaheuristic Algorithms for Combinatorial Optimization, Int J Comput Appl58(19) (2012), 975\u20138887.","journal-title":"Int J Comput Appl"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36478-1_17"},{"issue":"1","key":"e_1_3_1_25_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1080\/02533839.2018.1537807","article-title":"A provably secure certificateless public key encryption with keyword search","volume":"42","author":"Wu T.-Y.","year":"2019","unstructured":"WuT.-Y., ChenC.-M., WangK.-H., MengC. and WangE.K., A provably secure certificateless public key encryption with keyword search, J Chinese Inst Eng42(1) (2019), 20\u201328.","journal-title":"J Chinese Inst Eng"},{"issue":"1","key":"e_1_3_1_26_2","first-page":"1","article-title":"Node Coverage Optimization Strategy Based on Ions Motion Optimization","volume":"4","author":"Nguyen T.-T.","year":"2019","unstructured":"NguyenT.-T., PanJ.-S., WuT.-Y., DaoT.-K. and NguyenT.-D., Node Coverage Optimization Strategy Based on Ions Motion Optimization, J Netw Intell4(1) (2019), 1\u20139.","journal-title":"J Netw Intell"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2921721"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2921721"},{"key":"e_1_3_1_29_2","volume-title":"The traveling salesman problem: A Guided tour of Combinatorial Optimization","author":"Lawler E.L.","year":"1985","unstructured":"LawlerE.L., LenstraJ.K., KanA.H.G.R. and ShmoysD.B., The traveling salesman problem: A Guided tour of Combinatorial Optimization, vol. 3. WileyNew York, 1985."},{"issue":"1","key":"e_1_3_1_30_2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg M.","year":"1991","unstructured":"PadbergM. and RinaldiG., A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev33(1) (1991), 60\u2013100.","journal-title":"SIAM Rev"},{"issue":"4","key":"e_1_3_1_31_2","first-page":"1","article-title":"A parallel particle swarm optimization algorithm with communication strategies","volume":"21","author":"Chu S.C.","year":"2005","unstructured":"ChuS.C. and PanJ.-S., A parallel particle swarm optimization algorithm with communication strategies, J Inf Sci Eng21(4) (2005), 1\u20139.","journal-title":"J Inf Sci Eng"},{"key":"e_1_3_1_32_2","first-page":"1","article-title":"A Parallel Genetic Algorithm for Solving the School Timetabling Problem","author":"Abramson D.","year":"1992","unstructured":"AbramsonD. and AbelaJ., A Parallel Genetic Algorithm for Solving the School Timetabling Problem, Div Inf Technol C.S.I.R.O, no. Hobart, Australia, (1992), pp. 1\u201311.","journal-title":"Div Inf Technol C.S.I.R.O"},{"key":"e_1_3_1_33_2","first-page":"3415","volume-title":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No. 04CH37583)","volume":"4","author":"Wang X.","year":"2004","unstructured":"WangX., GaoX.Z. and OvaskaS.J., Artificial immune optimization methods and applications-a survey, in 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No. 04CH37583), 2004, vol. 4, pp. 3415\u20133420."},{"key":"e_1_3_1_34_2","first-page":"3415","article-title":"Artificial immune optimization methods and applications-a survey, in","volume":"4","author":"Wang X.","year":"2004","unstructured":"WangX., GaoX.Z., OvaskaS.J., Artificial immune optimization methods and applications-a survey, in, IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No. 04CH37583)4 (2004), 3415\u20133420.","journal-title":"IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No. 04CH37583)"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.3390\/pr7110845"},{"issue":"6","key":"e_1_3_1_36_2","first-page":"1717","article-title":"\u03b1-fraction first strategy for hierarchical model in wireless sensor networks","volume":"19","author":"Pan J.S.","year":"2018","unstructured":"PanJ.S., KongL., SungT.W., TsaiP.W. and Sn\u00e1\u0161elV., \u03b1-fraction first strategy for hierarchical model in wireless sensor networks, J Internet Technol19(6) (2018), 1717\u20131726.","journal-title":"J Internet Technol"},{"issue":"8","key":"e_1_3_1_37_2","doi-asserted-by":"crossref","first-page":"3133","DOI":"10.1007\/s12652-018-1029-3","article-title":"Attacks and solutions on a three-party password-based authenticated key exchange protocol for wireless communications","volume":"10","author":"Chen C.-M.","year":"2019","unstructured":"ChenC.-M., WangK.-H., YehK.-H., XiangB. and WuT.-Y., Attacks and solutions on a three-party password-based authenticated key exchange protocol for wireless communications, J Ambient Intell Humaniz Comput10(8) (2019), 3133\u20133142.","journal-title":"J Ambient Intell Humaniz Comput"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179668","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179668","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:14Z","timestamp":1777455674000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,28]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5,29]]}},"alternative-id":["10.3233\/JIFS-179668"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179668","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,28]]}}}