中文摘要：

根据自适应离散差分进化（SaDDE）算法的提出过程，对算法策略选择问题进行了重点研究．策略池在SaDDE中起着重要作用，策略池的设计面临着3个问题，即：（1）怎样鉴别某个候选解产生策略（CSGS）是有效的还是无效的；（2）应该选择哪些CSGS组成策略池；（3）策略池的大小应该是多少．为了解决这些问题，提出了基于相对排列顺序的标度法fRPOSM）和基于RPOSM的层次分析法（RPOSM-AHP）．主要采用某电子对抗（electroniccountermeasure，简称ECM）仿真实验平台上的6个测试实例（TINS）进行测试实验．首先，设计了144个不同的CSGS，为了获得这些CSGS在求解问题上的性能排序序列，做了144×6个独立的实验：然后，采用RPOSM和RPOSM-AHP计算这144个CSGS的最终优先级向量；接着，设计了16个具有不同策略池大小的算法，然后在同样的6个测试实例上测试这些算法的性能；最后，再一次采用RPOSM和RPOSM-AHP为SaDDE寻找到了合适的策略池大小．与其他类似算法的对比实验结果表明：在有限的评估次数（NFE）内，SaDDE比同类算法性能优越．

英文摘要：

In line with the proposing process of the self-adaptive discrete differential evolution （SaDDE） algorithm, this research focuses on the strategy selection problem. The strategy pool plays a significant role in the SaDDE algorithm, and there are three issues need to beaddressed in designing the strategy pool： （1） how to determine if a candidate solution generating strategy （CSGS） is effective; （2） which CSGSes to choose to constitute the strategy pool; and （3） how to find a suitable size forthe strategy pool. In order to solve these problems, a relative permutation order based scale method （RPOSM） and a RPOSM based analytic hierarchy process （RPOSM-AHP） are proposed in this paper. The experiments are mainly conducted on six test instances （T INSes） which come from an electronic countermeasure （ECM） simulation experimental platform. 144 different CSGSes are designed, and 144×6 independent experiments are performed to obtain the sort sequences of the CSGSes. The RPOSM and the RPOSM-AHP are adopted to obtain the priority vector of the 144 CSGSes. Sequentially, 16 algorithms with different sizes of strategy pools are constructed and their performance is tested on the six T_INSes. Further, the RPOSM and RPOSM-AHP are employed again to find the suitable pool size for the SaDDE algorithm. Computational comparisons demonstrate that, within fixed number of fitness evaluations （NFE）, the SaDDE algorithm can generate better results than its competitors.