arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.07950cs.SEcs.NE
收藏

基于搜索的软件工程的进化算法

Beyond Evolutionary Algorithms for Search-based Software Engineering

Jianfeng Chen, Vivek Nair, Tim Menzies

摘要:

内容:进化算法通常需要大量的评估(解决方案)收敛-这可能是非常缓慢和昂贵的evaluation.Objective:为了解决基于搜索的软件工程(SE)问题,使用较少的评价比evolutionarymethods.Method:而不是变异一个小的人口,我们建立了一个非常大的初始人口,然后使用递归双聚类斩方法剔除。我们评估这种方法对多个SE模型,无约束以及约束,并比较其性能与标准的进化算法。结果如下:使用几个评估(低于100),我们可以获得与最先进的进化算法相当的结果。结论:仅仅因为某个方法有效,并且被广泛使用,并不一定意味着没有价值去寻找方法来改进该方法。在使用传统EA进行基于搜索的SE优化任务之前,建议尝试其他技术,如本文所述,以获得相同的结果,并减少评估。

英文摘要:

Context: Evolutionary algorithms typically require a large number of evaluations (of solutions) to converge - which can be very slow and expensive to evaluate.Objective: To solve search-based software engineering (SE) problems, using fewer evaluations than evolutionary methods.Method: Instead of mutating a small population, we build a very large initial population which is then culled using a recursive bi-clustering chop approach. We evaluate this approach on multiple SE models, unconstrained as well as constrained, and compare its performance with standard evolutionary algorithms. Results: Using just a few evaluations (under 100), we can obtain comparable results to state-of-the-art evolutionary algorithms.Conclusion: Just because something works, and is widespread use, does not necessarily mean that there is no value in seeking methods to improve that method. Before undertaking search-based SE optimization tasks using traditional EAs, it is recommended to try other techniques, like those explored here, to obtain the same results with fewer evaluations.

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

↑