Home > Archive > 2019 > Volume 9 Number 5 (Oct. 2019) >
IJMLC 2019 Vol.9(5): 561-568 ISSN: 2010-3700
DOI: 10.18178/ijmlc.2019.9.5.840

Greedy Binary Particle Swarm Optimization for multi-Objective Constrained Next Release Problem

A. Hamdy and A. A. Mohamed

Abstract—Softwarecompanies, that adopt agile methodologies in the development of a large and complex software product,encounter the problem of selectingthe subset of requirements to be included in the next release of theproduct. This problem is known as the next release problem (NRP). NRP is identified as an NP-hard problem as it involves a set of conflicting objectives that need to be addressed. These objectives areas follows: (1) maximizing the customer satisfaction taking into consideration that each customer has an importancelevel to the company, and (2) minimizing the development cost such that it does not exceed the allocated budget. Furthermore, the requirements havedependency and precedence relationships,and each requirementhas a priority for each customer according to the customer’s needs. Therefore, metaheuristic algorithms are good candidate for tackling this problem.This paper proposesa hybrid approach to address the multi-objectiveconstrained NRP. The proposed approach is based on adapting animproved binary particle swarm optimization (IBPSO) algorithm. Additionally,a greedy methodology was utilizedfor swarm initialization to seed the swarm with good solutions. Experimental results, of over six small and large NRP instances, demonstratedthat the proposed approach convergesmuch faster to solutions better thanthe onesdiscovered by the original binary PSO.

Index Terms—Next release problem, binaryPSO, swarm intelligence, requirementsengineering.

A. Hamdy is with the Faculty of Informatics and Computer Science, British University in Egypt, El-Sherouk City, Egypt, on secondment from Computers and Systems Department, Electronics Research Institute, Giza, Egypt (e-mail: abeer.hamdy@bue.edu.eg).
A. A. Mohamed is with the Faculty of Informatics and Computer Science, British University in Egypt, El-Sherouk City, Egypt (e-mail: ali.alaa.eldin@outlook.com).

[PDF]

Cite: A. Hamdy and A. A. Mohamed, "Greedy Binary Particle Swarm Optimization for multi-Objective Constrained Next Release Problem," International Journal of Machine Learning and Computing vol. 9, no. 5, pp. 561-568, 2019.

Copyright © 2019 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

 

General Information

  • E-ISSN: 2972-368X
  • Abbreviated Title: Int. J. Mach. Learn.
  • Frequency: Quaterly
  • DOI: 10.18178/IJML
  • Editor-in-Chief: Dr. Lin Huang
  • Executive Editor:  Ms. Cherry L. Chen
  • Abstracing/Indexing: Inspec (IET), Google Scholar, Crossref, ProQuest, Electronic Journals LibraryCNKI.
  • E-mail: ijml@ejournal.net


Article Metrics in Dimensions