Skip to content

7zaa/KATSA-KNN-Ameliorated-Tree-Seed-Algorithm-for-complex-optimization-problems

Repository files navigation

KATSA-KNN-Ameliorated-Tree-Seed-Algorithm-for-complex-optimization-problems

matlab Code of my paper 'KATSA: KNN Ameliorated Tree Seed Algorithm for complex optimization problems'

bibtex citation as follows

@article{JIANG2025127465, title = {KATSA: KNN Ameliorated Tree Seed Algorithm for complex optimization problems}, journal = {Expert Systems with Applications}, volume = {280}, pages = {127465}, year = {2025}, issn = {0957-4174}, doi = {https://doi.org/10.1016/j.eswa.2025.127465}, url = {https://www.sciencedirect.com/science/article/pii/S0957417425010875}, author = {Jianhua Jiang and Jiaqi Wu and Jinmeng Luo and Xianqiu Meng and Lize Qian and Keqin Li}, keywords = {Tree Seed Algorithm, KNN, KATSA, Optimization problem, Swarm intelligence}, abstract = {Tree Seed Algorithm (TSA) is an outstanding algorithm for optimization problems, but it inevitably falls into the local optimum and has a low convergence speed in solving complex problems. This paper aims to address these above defects. Inspired by efficient learning from neighbors, a K-Nearest Neighbor (KNN) mechanism is adopted to enhance the tree or seed generation strategies for achieving the balance between exploitation and exploration. The proposed algorithm is named the KNN Ameliorated Tree Seed Algorithm (KATSA). First, based on the current best tree, the search space is divided into best and non-best neighbor areas by the KNN mechanism. Based on this division approach, the proposed seed generation strategy has a precise heuristic, and the convergence speed can be accelerated. Second, the proposed seed generation and tree migration strategies integrate the proposed dynamic regulation mechanism, which reduces the possibility of falling into a local optimum. Third, the proposed feedback mechanism can effectively balance exploration and exploitation. With these enhancements from the KNN mechanism, KATSA can converge to the global optima more effectively during its evolutionary process. The results obtained from IEEE CEC 2014 benchmark function evaluation verify the excellent performance of the KATSA when compared with some recent variants, including STSA, EST-TSA, fb_TSA, and MTSA. In addition, GWO, PSO, BOA, BA, GA, LSHADE, and RSA are also adopted for some benchmark comparative experiments. The applicability of the proposed KATSA is demonstrated by three real complex and constrained problems when compared to TSA, fb_TSA, LSHADE, RSA, GWO, ABC, and PSO. The experimental results show that the proposed KATSA can obtain stable and optimal results on these complex problems. The source code is available at www.jianhuajiang.com.} }