Addressing Dependent Data in Constrained Optimization Problems: A WOA-based Algorithm

Optimization algorithms are widely used in various fields to find the best solution to a problem by minimizing or maximizing an objective function, subject to certain constraints. This paper introduces the development and application of an innovative optimization algorithm (WOADD) designed to address the challenges posed by constrained optimization problems with dependent data. Unlike traditional algorithms that struggle with data dependencies and valid range constraints, WOADD incorporates a novel normalization process and a dynamic updating mechanism that accurately considers the interdependencies among features. Specifically, it adjusts the search strategy by calculating a scaling parameter to maneuver within feasible regions, ensuring the preservation of data dependencies and adherence to constraints, thus leading to more efficient and precise optimization outcomes. Our extensive experimental analysis, comparing WOADD against other swarm-based optimization methods on a suite of benchmark functions, illustrates its superior performance in terms of faster convergence rates, improved solution quality, and enhanced determinism in outcomes.

کلیدواژه ها:

Swarm-based optimization ، constraints ، Compositional data ، Penalty function