Pareto Dominance-Based Approach for the Component Selection Problem

Component selection is a crucial problem in component based software engineering (CBSE). CBSE is concerned with the assembly of pre-existing software components that leads to a software system that responds to client-specific requirements. We are approaching the component selection problem. We formulate the problem as multiobjective, involving 2 objectives: the number of used components and the cost of the involved components. We use the Pareto dominance principle to deal with the multiobjective optimization problem. The approach used is an evolutionary computation technique (a steady state evolutionary algorithm). The experiments and comparisons with greedy approach show the effectiveness of the proposed approach.