A runtime analysis of evolutionary algorithms for constrained optimization problems
Research output: Contribution to journal › Article
Colleges, School and Institutes
Although there are many evolutionary algorithms (EAs) for solving constrained optimization problems, there are few rigorous theoretical analyses. This paper presents a time complexity analysis of EAs for solving constrained optimization. It is shown when the penalty coefficient is chosen properly, direct comparison between pairs of solutions using penalty fitness function is equivalent to that using the criteria "superiority of feasible point" or "superiority of objective function value." This paper analyzes the role of penalty coefficients in EAs in terms of time complexity. The results show that in some examples, EAs benefit greatly from higher penalty coefficients, while in other examples, EAs benefit from lower penalty coefficients. This paper also investigates the runtime of EAs for solving the 0-1 knapsack problem and the results indicate that the mean first hitting times ranges from a polynomial-time to an exponential time when different penalty coefficients are used.
|Number of pages||12|
|Journal||IEEE Transactions on Evolutionary Computation|
|Publication status||Published - 1 Oct 2007|
- evolutionary algorithms (EAs), 0-1 knapsack problems, constrained optimization problem, time complexity