Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jiaqi Wu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • KATSA: KNN Ameliorated Tree Seed Algorithm for complex optimization problems

    by Jianhua Jiang, Jiaqi Wu, Jinmeng Luo, Xianqiu Meng, Lize Qian, Keqin Li


  • Open Access

    BCA: Besiege and Conquer Algorithm

    by Jianhua Jiang, Xianqiu Meng, Jiaqi Wu, Jun Tian, Gaochao Xu, Weihua Li

    This paper introduces a bio-inspired meta-heuristic algorithm, the Besiege and Conquer Algorithm (BCA), developed to tackle complex and high-dimensional optimization problems. Drawing inspiration from the concept of symmetry and guerrilla warfare strategies, the BCA incorporates four core components: besiege, conquer, balance, and feedback. The besiege strategy strengthens exploration, while the conquer strategy enhances exploitation. Balance and feedback mechanisms maintain a dynamic equilibrium between these capabilities, ensuring robust optimization performance. The algorithm’s effectiveness is validated through benchmark test functions, demonstrating superior results in comparison with existing methods, supported by Friedman rankings and Wilcoxon signed-rank tests. Beyond theoretical and experimental validation, the BCA showcases its real-world relevance through applications in engineering design and classification problems, addressing practical challenges. These results underline the algorithm’s strong exploration, exploitation, and convergence capabilities and its potential to contribute meaningfully to diverse real-world domains.


  • Open Access

    DTSA: Dynamic Tree-Seed Algorithm with Velocity-Driven Seed Generation and Count-Based Adaptive Strategies

    by Jianhua Jiang, Jiansheng Huang, Jiaqi Wu, Jinmeng Luo, Xi Yang, Weihua Li

    The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA’s capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm’s ability to explore and exploit solution spaces. Moreover, DTSA’s adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm’s efficiency and stability in handling complex optimization issues, and DTSA’s robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations.


  • Top Cited Papers
    Open Access

    MOBCA: Multi-Objective Besiege and Conquer Algorithm

    by Jianhua Jiang, Jiaqi Wu, Jinmeng Luo, Xi Yang, Zulu Huang

    The besiege and conquer algorithm has shown excellent performance in single-objective optimization problems. However, there is no literature on the research of the BCA algorithm on multi-objective optimization problems. Therefore, this paper proposes a new multi-objective besiege and conquer algorithm to solve multi-objective optimization problems. The grid mechanism, archiving mechanism, and leader selection mechanism are integrated into the BCA to estimate the Pareto optimal solution and approach the Pareto optimal frontier. The proposed algorithm is tested with MOPSO, MOEA/D, and NSGAIII on the benchmark function IMOP and ZDT. The experiment results show that the proposed algorithm can obtain competitive results in terms of the accuracy of the Pareto optimal solution.