t路测试集生成的Flower Polynomial算法中的动态解概率接受
Dynamic Solution Probability Acceptance within the Flower Pollination Algorithm for t-way Test Suite Generation
摘要:
花形启发式算法是求解一般优化问题的新一代元启发式算法。本文在花极化算法(FPA)的基础上提出了一种改进算法imFPA。在imFPA中,静态选择概率被动态解选择概率所取代,以增强整个搜索过程的多样化和集约化。实验采用组合t路测试集生成问题(其中t表示相互作用强度)表明,imFPA产生非常有竞争力的结果相比,现有的战略。
英文摘要:
Flower Pollination Algorithm (FPA) is the new breed of metaheuristic for the general optimization problem. In this paper, an improved algorithm based on Flower Pollination Algorithm (FPA), called imFPA, has been proposed. In imFPA, the static selection probability is replaced by the dynamic solution selection probability in order to enhance the diversification and intensification of the overall search process. Experimental adoptions on combinatorial t- way test suite generation problem (where t indicates the interaction strength) show that imFPA produces very competitive results as compared to existing strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。