A new metaheuristic optimization based on K-means clustering algorithm | ||
---|---|---|
boundary_condition_KO.m 15-11-2024 20:11:56 | Download | |
drift_control.m 15-11-2024 20:11:56 | Download | |
Get_Functions_details.m 15-11-2024 20:11:56 | Download | |
KO_optimizer_Main_23_Functions.m 15-11-2024 20:11:56 | Download | |
levy_fun_KO.m 15-11-2024 20:11:56 | Download |
We proposed a new metaheuristic optimization algorithm named K-Means Optimizer (KO) to solve a wide range of optimization problems from numerical functions to real-design challenges. First, the centroid vectors of clustering regions are established at each iteration using K-Means algorithm, then KO proposes two movement strategies to create a balance between the ability of exploitation and exploration.
The Matlab source codes of KO optimized algorithm is included
Hoang Le-Minh
Thanh Sang-To
Magd Abdel Wahab
Thanh Cuong-Le
the VLIR-UOS TEAM Project, VN2018TEA479A103, 'Damage assessment tools for Structural Health Monitoring of Vietnamese infrastructures' funded by the Flemish Government.
Minh, Hoang-Le, Thanh Sang-To, Magd Abdel Wahab, and Thanh Cuong-Le. "A new metaheuristic optimization based on K-means clustering algorithm and its application for structural damage identification in a complex 3D concrete structure." Knowledge-Based Systems (2022): 109189. https://doi.org/10.1016/j.knosys.2022.109189
We provided a Matlab-based optimization package based on our novel optimization algorithm namely K-Means Optimizer (KO).