文献类型：期刊文献

英文题名：Combining Constraint Solving with Different MOEAs for Configuring Large Software Product Lines: A Case Study

作者：Yu, Huiqun[1,2]; Shi, Kai[1,2]; Guo, Jianmei[3]; Fan, Guisheng[1]; Yang, Xingguang[1]; Chen, Liqiong[4]

机构：[1] Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China; [2] Shanghai Key Laboratory of Computer Software Evaluating and Testing, Shanghai, China; [3] Alibaba Group, Hangzhou, China; [4] Department of Computer Science and Information Engineering, Shanghai Institute of Technology, Shanghai, China

年份：2018

卷号：1

起止页码：54

外文期刊名：Proceedings - International Computer Software and Applications Conference

收录：EI(收录号：20184406004237)

语种：英文

外文关键词：Codes (symbols) - Budget control - Optimization - Software design

摘要：Multi-objective evolutionary algorithm (MOEA) with the constraint solving has been successfully applied to address the configuration optimization problem in software product line (SPL), for example, the state-of-the-art SATIBEA algorithm. However, each different MOEA with special search operator demonstrates the different strength and weakness in terms of optimality and convergence speed. The SATIBEA just combines the SAT (Boolean satisfiability problem) constraint solving with the Indicator-Based Evolutionary Algorithm (IBEA) for evaluating the algorithm performance. In this paper, we propose six hybrid algorithms which combine the SAT solving with different MOEAs. Case study is based on five large-scale, rich-constrained and real-world SPLs. Empirical results demonstrate that SATMOCell algorithm obtains a competitive optimization performance to the state-of-the-art that outperforms the SATIBEA in terms of quality Hypervolume metric for 2 out of 5 SPLs within the same time budget. Moreover, the convergence speed of SATMOCell and SATssNSGA2 is comparable after 10min terminal times. Particularly, the Hypervolume value of SATssNSGA2 reports the average improvement of 1.33% after 20min terminal times. ? 2018 IEEE.