scholarly journals Approximate backbone based multilevel algorithm for next release problem

Author(s):  
He Jiang ◽  
Jifeng Xuan ◽  
Zhilei Ren
2012 ◽  
Vol 38 (5) ◽  
pp. 1195-1212 ◽  
Author(s):  
Jifeng Xuan ◽  
He Jiang ◽  
Zhilei Ren ◽  
Zhongxuan Luo

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 60547-60558 ◽  
Author(s):  
Jiangyi Geng ◽  
Shi Ying ◽  
Xiangyang Jia ◽  
Ting Zhang ◽  
Xuan Liu ◽  
...  

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-20
Author(s):  
Paulo A. M. Barbosa ◽  
Plácido R. Pinheiro ◽  
Francisca R. V. Silveira ◽  
Marum Simão Filho

During the software development process, the decision maker (DM) must master many variables inherent in this process. Software releases represent the order in which a set of requirements is implemented and delivered to the customer. Structuring and enumerating a set of releases with prioritized requirements represents a challenging task because the requirements contain their characteristics, such as technical precedence, the cost required for implementation, the importance that one or more customers add to the requirement, among other factors. To facilitate this work of selection and prioritization of releases, the decision maker may adopt some support tools. One field of study already known to solve this type of problem is the Search-Based Software Engineering (SBSE) that uses metaheuristics as a means to find reasonable solutions taking into account a set of well-defined objectives and constraints. In this paper, we seek to increase the possibilities of solving the Next Release Problem using the methods available in Verbal Decision Analysis (VDA). We generate a problem and submit it so that the VDA and SBSE methods try to resolve it. To validate this research, we compared the results obtained through VDA and compared with the SBSE results. We present and discuss the results in the respective sections.


Author(s):  
José Carlos Almeida ◽  
Felipe de C. Pereira ◽  
Marina V. A. Reis ◽  
Breno Piva

Sign in / Sign up

Export Citation Format

Share Document