Jaya algorithm using weighted sum approach for the multi-objective next release problem

Software requirements gathering and selection is primarily the first and most important step during in the development of a software product. These new set of requirements drives the next set of functionalities/ features for the product. However, there is always a necessity to select the right set of requirement which fulfills the customer satisfaction and deliver these changes within the defined budget limits. The complexity of selecting the new requirements increases with the inter-dependency of various requirements defined. In this paper, we use a Jaya based optimization technique using weighted sum approach to solve the multi-objective next release problem (MONRP). In this approach, classic bi-objective NRP comprising the conflicting objectives e.g. maximizing global satisfaction and minimizing the cost (total development effort) are reduced to single objective by assigning different weights to each objective. The proposed technique has been successfully applied to a public dataset instance provided in various literature of NRP. The simulation results are compared with various well known variants of GDE3 algorithm for solution accuracy.