The next release problem

Bagnall, Anthony; Rayward‐Smith, V. J.; Whittley, Ian M.

doi:10.1016/s0950-5849(01)00194-x

Cited by 265 publications

(255 citation statements)

References 9 publications

Supporting

Mentioning

251

Contrasting

Unclassified

Order By: Relevance

“…Bagnall et al [1] suggested the term Next Release Problem (NRP) for requirements release planning and described the various metaheuristic optimisation algorithms, including greedy, branch and bound, simulated annealing and hill climbing. The authors did not give any value property to each requirement.…”

Section: Related Workmentioning

confidence: 99%

“…There has been much recent work on search based optimisation for requirements engineering problems [1,2,3,4,5,6,7,8]. This work has traditionally considered objectives such as cost and value of requirements and sought to maximise the value of the requirements delivered, while minimising the cost [2,5,7].…”

Section: Introductionmentioning

confidence: 99%

“…This question has come to be known as the Next Release Problem (NRP) [1,3], while the activity of solving this NRP is known as Release Planning [11,12,13,14,15,16,17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Comparing the performance of metaheuristics for the analysis of multi-stakeholder tradeoffs in requirements optimisation

Zhang

Harman

Finkelstein

et al. 2011

Information and Software Technology

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Comparing the performance of metaheuristics for the analysis of multi-stakeholder tradeoffs in requirements optimisation

Zhang

Harman

Finkelstein

et al. 2011

Information and Software Technology

View full text Add to dashboard Cite

“…Section 2 summarizes the basic Requirements Engineering concepts, focusing in requirement selec-tion process for the next software release, together with the description and definition of the problem of selection of requirements to be included in the next software release, know as Next Release Problem (NRP) (Bagnall et al, 2001). Section 3 describes the metaheuristic technique applied in this work, Ant Colony Optimization.…”

Section: Introductionmentioning

confidence: 99%

Multi-objective ant colony optimization for requirements selection

Sagrado

Orellana

2013

Empir Software Eng

View full text Add to dashboard Cite

The selection of a set of requirements between all the requirements previously defined by customers is an important process, repeated at the beginning of each development step when an incremental or agile software development approach is adopted. The set of selected requirements will be developed during the actual iteration. This selection problem can be reformulated as a search problem, allowing its treatment with metaheuristic optimization techniques. This paper studies how to apply Ant Colony Optimization algorithms to select requirements. First, we describe this problem formally extending an earlier version of the problem, and introduce a method based on Ant Colony System to find a variety of efficient solutions. The performance achieved by the Ant Colony System is compared with that of Greedy Randomized Adaptive Search Procedure and Non-dominated Sorting Genetic Algorithm, by means of computational experiments carried out on two instances of the problem constructed from data provided by the experts.

show abstract

“…One of the most important problems of most companies in developing and maintaining huge and complicated software systems is to determine functionality and changes to be exerted on different software releases [1]. Companies try to improve their products through an understanding of new needs and considering them in future release [2].…”

Section: Introductionmentioning

confidence: 99%

Preparation of Papers for Journal of Advances in Computer Networks

Danesh¹,

Ahmad²,

Zargarnataj³

2014

IJCCE

View full text Add to dashboard Cite

Abstract-Release planning is an important activity in the software development that can adjust budget and time over various releases. Most software companies always concern about the best delivery of a new release although new features and needs are available. Effective parameters on release planning adopt certain values in a project but as a result of their ambiguity and diversity they take different values in a same project. Therefore, despite existence of various release planning methods, release planning process is deficient. This means that every method performs planning task by the help of defined algorithms and specific parameters. The present paper aims to develop a general process for release planning which result from investigation of common tasks and steps of current release planning method. Then, certain patterns are obtained by customizing the common tasks and steps. It also explains how to generate the patterns and achieve them in order to plan for a release.Index Terms-Pattern-based, software, release planning.

show abstract

The next release problem

Cited by 265 publications

References 9 publications

Comparing the performance of metaheuristics for the analysis of multi-stakeholder tradeoffs in requirements optimisation

Comparing the performance of metaheuristics for the analysis of multi-stakeholder tradeoffs in requirements optimisation

Multi-objective ant colony optimization for requirements selection

Preparation of Papers for Journal of Advances in Computer Networks

Contact Info

Product

Resources

About