M-best subset selection from n alternatives based on genetic algorithm

Genetic algorithm (GA) is an efficient method based on the natural selection for global optimization. To take the advantages of GA, the primary goal of this paper is to extend or generalize GA to the m-best subset selection problems. In m-best subset selection, a subset consists of m alternatives is selected from n alternatives to form a group to fulfill a goal most efficiently. This paper concentrates on discussing the possibility of selecting a best subset from n alternatives for certain conditions with constrains. By designing new fitness functions, GA is successfully used in some sorts of certain subset selections. The experimental results show that the improved GA method fulfills the m best subset selection efficiently.