On the Running Time Analysis of the (1+1) Evolutionary Algorithm for the Subset Sum Problem.

Theoretic researches of evolutionary algorithms have received much attention in the past few years. This paper presents the running time analysis of evolutionary algorithm for the subset sum problems. The analysis is carried out on (1+1) EA for different subset sum problems. It uses the binary representation to encode the solutions, the method "superiority of feasible point" that separate objectives and constraints to handle the constraints, and the absorbing Markov chain model to analyze the expected runtime. It is shown that the mean first hitting time of (1+1) EA for solving subset sum problems may be polynomial, exponential, or infinite. [ABSTRACT FROM AUTHOR]