Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: An Integer Linear Programming approach to the single and bi-objective Next Release Problem
Author(s): Veerapen, Nadarajen
Ochoa, Gabriela
Harman, Mark
Burke, Edmund
Contact Email:
Keywords: Integer Linear Programming
Multi-objective optimization
Next Release Problem
Requirements optimization
Search based software engineering
Issue Date: Sep-2015
Date Deposited: 13-May-2015
Citation: Veerapen N, Ochoa G, Harman M & Burke E (2015) An Integer Linear Programming approach to the single and bi-objective Next Release Problem. Information and Software Technology, 65, pp. 1-13.
Abstract: Context The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, Integer Linear Programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques.  Objective In this paper, we investigate if the single-objective and bi-objective Next Release Problem can be solved exactly and how to better approximate the results when exact resolution is costly.  Methods We revisit Integer Linear Programming for the single-objective version of the problem. In addition, we integrate it within the Epsilon-constraint method to address the bi-objective problem. We also investigate how the Pareto front of the bi-objective problem can be approximated through an anytime deterministic Integer Linear Programming-based algorithm when results are required within strict runtime constraints. Comparisons are carried out against NSGA-II. Experiments are performed on a combination of synthetic and real-world datasets. Findings We show that a modern Integer Linear Programming solver is now a viable method for this problem. Large single objective instances and small bi-objective instances can be solved exactly very quickly. On large bi-objective instances, execution times can be significant when calculating the complete Pareto front. However, good approximations can be found effectively.  Conclusion This study suggests that (1) approximation algorithms can be discarded in favor of the exact method for the single-objective instances and small bi-objective instances, (2) the Integer Linear Programming-based approximate algorithm outperforms the NSGA-II genetic approach on large bi-objective instances, and (3) the run times for both methods are low enough to be used in real-world situations.
DOI Link: 10.1016/j.infsof.2015.03.008
Rights: This article is open-access. Open access publishing allows free access to and distribution of published articles where the author retains copyright of their work by employing a Creative Commons attribution licence. Proper attribution of authorship and correct citation details should be given.
Licence URL(s):

Files in This Item:
File Description SizeFormat 
Veerapen et al. - 2015 - An Integer Linear Programming approach to the sing.pdfFulltext - Published Version2.39 MBAdobe PDFView/Open

This item is protected by original copyright

A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.