Multi-objective Integer Programming Approaches for Solving Optimal Feature Selection Problem: A New Perspective on Multi-objective Optimization Problems in SBSE

摘要

The optimal feature selection problem in software product line is typically addressed by the approaches based on Indicator-based Evolutionary Algorithm (IBEA). In this study, we frst expose the mathematical nature of this problem — multi-objective binary integer linear programming. Then, we implement/propose three mathematical programming approaches to solve this problem at di?erent scales. For small-scale problems (roughly, less than 100 features), we implement two established approaches to fnd all exact solutions. For medium-to-large problems (roughly, more than 100 features), we propose one efcient approach that can generate a representation of the entire Pareto front in linear time complexity. The empirical results show that our proposed method can fnd signifcantly more non-dominated solutions in similar or less execution time, in comparison with IBEA and its recent enhancement (i.e., IBED that combines IBEA and Di?erential Evolution).