软件产品线的最佳特性选择:让您的模型和价值观指导您的搜索

Abdel Salam Sayyad, Joseph Ingram, T. Menzies, H. Ammar
{"title":"软件产品线的最佳特性选择:让您的模型和价值观指导您的搜索","authors":"Abdel Salam Sayyad, Joseph Ingram, T. Menzies, H. Ammar","doi":"10.5555/2662572.2662581","DOIUrl":null,"url":null,"abstract":"In Search-Based Software Engineering, well-known metaheuristic search algorithms are utilized to find solutions to common software engineering problems. The algorithms are usually taken “off the shelf” and applied with trust, i.e. software engineers are not concerned with the inner workings of algorithms, only with the results. While this may be sufficient is some domains, we argue against this approach, particularly where the complexity of the models and the variety of user preferences pose greater challenges to the metaheuristic search algorithms. We build on our previous investigation which uncovered the power of Indicator-Based Evolutionary Algorithm (IBEA) over traditionally-used algorithms (such as NSGA-II), and in this work we scrutinize the time behavior of user objectives subject to optimization. This analysis brings out the business perspective, previously veiled under Pareto-collective gauges such as Hypervolume and Spread. In addition, we show how slowing down the rates of crossover and mutation can help IBEA converge faster, as opposed to following the higher rates used in many other studies as “rules of thumb”.","PeriodicalId":193450,"journal":{"name":"2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":"{\"title\":\"Optimum feature selection in software product lines: Let your model and values guide your search\",\"authors\":\"Abdel Salam Sayyad, Joseph Ingram, T. Menzies, H. Ammar\",\"doi\":\"10.5555/2662572.2662581\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Search-Based Software Engineering, well-known metaheuristic search algorithms are utilized to find solutions to common software engineering problems. The algorithms are usually taken “off the shelf” and applied with trust, i.e. software engineers are not concerned with the inner workings of algorithms, only with the results. While this may be sufficient is some domains, we argue against this approach, particularly where the complexity of the models and the variety of user preferences pose greater challenges to the metaheuristic search algorithms. We build on our previous investigation which uncovered the power of Indicator-Based Evolutionary Algorithm (IBEA) over traditionally-used algorithms (such as NSGA-II), and in this work we scrutinize the time behavior of user objectives subject to optimization. This analysis brings out the business perspective, previously veiled under Pareto-collective gauges such as Hypervolume and Spread. In addition, we show how slowing down the rates of crossover and mutation can help IBEA converge faster, as opposed to following the higher rates used in many other studies as “rules of thumb”.\",\"PeriodicalId\":193450,\"journal\":{\"name\":\"2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"48\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5555/2662572.2662581\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/2662572.2662581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 48

摘要

在基于搜索的软件工程中,众所周知的元启发式搜索算法被用来寻找常见软件工程问题的解决方案。算法通常是“现成的”,并以信任的方式应用,也就是说,软件工程师不关心算法的内部工作原理,只关心结果。虽然这在某些领域可能是足够的,但我们反对这种方法,特别是在模型的复杂性和用户偏好的多样性对元启发式搜索算法构成更大挑战的情况下。我们在之前的研究基础上,揭示了基于指标的进化算法(IBEA)比传统使用的算法(如NSGA-II)的力量,在这项工作中,我们仔细检查了用户目标的时间行为,以进行优化。这一分析揭示了商业视角,而这一视角以前隐藏在Hypervolume和Spread等帕累托集体指标之下。此外,我们展示了如何减缓交叉和突变的速率可以帮助IBEA更快地收敛,而不是遵循许多其他研究中使用的更高速率作为“经验法则”。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimum feature selection in software product lines: Let your model and values guide your search
In Search-Based Software Engineering, well-known metaheuristic search algorithms are utilized to find solutions to common software engineering problems. The algorithms are usually taken “off the shelf” and applied with trust, i.e. software engineers are not concerned with the inner workings of algorithms, only with the results. While this may be sufficient is some domains, we argue against this approach, particularly where the complexity of the models and the variety of user preferences pose greater challenges to the metaheuristic search algorithms. We build on our previous investigation which uncovered the power of Indicator-Based Evolutionary Algorithm (IBEA) over traditionally-used algorithms (such as NSGA-II), and in this work we scrutinize the time behavior of user objectives subject to optimization. This analysis brings out the business perspective, previously veiled under Pareto-collective gauges such as Hypervolume and Spread. In addition, we show how slowing down the rates of crossover and mutation can help IBEA converge faster, as opposed to following the higher rates used in many other studies as “rules of thumb”.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信