首页> 中文期刊> 《软件学报》 >面向软件产品线中特征选择的多目标优化算法

面向软件产品线中特征选择的多目标优化算法

         

摘要

In software product lines,the core of product customization is to select appropriate features.Due to the various competing and even conflicting non-functional requirements (NFRs),feature selection,in essential,is a multi-objective optimization process.What's more,the search space in optimization is constrained largely by the relationships between features and the definitive funetional requirements (FRs).Besides,some NFRs are with clear numerical limits,while others are not.These varied types of NFRs also present challenges for feature selection.To solve these problems,a novel multi-objective optimization algorithm with a feature selection reviser is proposed.Firstly,description language for the dependency and constraints relationships between features (DL-DCF) are designed to format different types of relationships between features uniformly,which stipulates the coexistence of two or more features.Next,during selection,all NFRs are transformed to optimization goals,and the quantified constraints on NFRs are used as filters to exclude invalid solutions.Furthermore,a reviser is designed to repair the configuration which violates any relation between features or FRs.Finally,the reviser is planted into the multi-objective optimization framework to form the proposed algorithm,MOOFs,to perform feature selection.Comparing with four popular baselines running on four feature models with different scales,empirical results show notable performance improvement of the algorithm on efficiency of valid solution generation and on the multiple NFRs balancing,especially when the feature models are large and complex.%软件产品线中,产品定制的核心是选择合适的特征集.由于多个非功能需求间往往相互制约甚至发生冲突,特征选择的本质是多目标优化过程.优化过程的搜索空间被特征间错综复杂的依赖和约束关系以及明确的功能需求大大限制.另外,有些非功能需求有明确的数值约束,而有些则仅要求尽可能地得到优化.多样的非功能需求约束类型也给优化选择过程带来极大的挑战.提出一种含修正算子的多目标优化算法MOOFs.首先,设计特征间依赖和约束关系描述语言DL-DCF来统一规范特征选择过程中必须遵守的规则,所有的非功能需求都转化为优化目标,相关的数值约束则作为优化过程中特征选择方案的过滤器.另外,设计了修正算子用于保证选择出的特征配置方案必满足产品线的特征规则约束.通过与4种常用的多目标优化算法在4个不同规模的特征模型上的运行结果进行对比,表明该方法能够更快地产生满足约束的优化解,且优化解具备更好的收敛性与多样性.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号