arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.02631cs.SE
收藏

基于需求交互的分布估计算法求解双目标下一次发布问题

An Estimation of Distribution Algorithm based on interactions between requirements to solve the bi-objective Next Release Problem

Jose del Sagrado, Jose Antonio Sierra Ibanez, Isabel M. del Aguila

摘要:

选择适当的需求,在下一个版本的开放市场软件产品的发展,在演变,是每个软件开发项目的一个强制性步骤。这种选择应该通过最大化利益相关者的满意度和最小化开发成本来完成,同时保持约束。在这项工作中,我们调查什么是需求的相互作用的影响时,寻找解决方案的双目标下一个版本的问题。一方面,这些相互作用被明确地包含在两个算法中:分支定界算法和分布估计算法(EDA)。另一方面,我们研究了这些以前没有使用过的解决方法的性能,通过将它们应用在几个实例中的小型,中型和大型数据集。我们发现,相互作用包括增强搜索和时间限制存在时,在双目标的下一个版本的问题的情况下,EDAs已被证明是稳定和可靠的定位大量的参考帕累托前沿的解决方案。

英文摘要:

Selecting the appropriate requirements to develop in the next release of an open market software product under evolution, is a compulsory step of each software development project. This selection should be done by maximizing stakeholders' satisfaction and minimizing development costs, while keeping constraints. In this work we investigate what is the requirements interactions impact when searching for solutions of the bi-objective Next Release Problem. In one hand, these interactions are explicitly included in two algorithms: a branch and bound algorithm and an estimation of distribution algorithm (EDA). And on the other, we study the performance of these not previously used solving approaches by applying them in several instances of small, medium and large size data sets. We find that interactions inclusion do enhance the search and when time restrictions exists, as in the case of the bi-objective Next Release Problem, EDAs have proven to be stable and reliable locating a large number of solutions on the reference Pareto front.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑