Multi-strategy ensemble particle swarm optimization for dynamic optimization

Optimization in dynamic environments is important in real-world applications, which requires the optimization algorithms to be able to find and track the changing optimum efficiently over time. Among various algorithms for dynamic optimization, particle swarm optimization algorithms (PSOs) are attracting more and more attentions in recent years, due to their ability of keeping good balance between convergence and diversity maintenance. To tackle the challenges of dynamic optimization, several strategies have been proposed to enhance the performance of PSO, and have gained success on various dynamic optimization problems. But there still exist some issues in dynamic optimization which need to be studied carefully, i.e. the robustness of the algorithm to problems of various dynamic features. In this paper, a new multi-strategy ensemble particle swarm optimization (MEPSO) for dynamic optimization is proposed. In MEPSO, all particles are divided into two parts, denoted as part I and part II, respectively. Two new strategies, Gaussian local search and differential mutation, are introduced into these two parts, respectively. Experimental analyses reveal that the mechanisms used in part I can enhance the convergence ability of the algorithm, while mechanisms used in part II can extend the searching area of the particle population to avoid being trapped into the local optimum, and can enhance the ability of catching up with the changing optimum in dynamic environments. The whole algorithm has few parameters that need to be tuned, and all of them are not sensitive to problems. We compared MEPSO with other PSOs, including MQSO, PHPSO and Standard PSO with re-initialization, on moving peaks Benchmark and dynamic Rastrigin function. The experimental results show that MEPSO has pretty good performance on almost all testing problems adopted in this paper, and outperforms other algorithms when the dynamic environment is unimodal and changes severely, or has a great number of local optima as dynamic Rastrigin function does.     

基于变异的紧凑遗传算法

紧凑遗传算法(CGA)具有存储成本低的优点,但是其容易出现早熟。该文提出一种基于变异的紧凑遗传算法(MBCGA)。MBCGA在CGA的基础上,引进变异算子,完整地体现生态进化中的选择、遗传和变异,提高了局部寻优以及算法克服早熟的能力。试验结果表明,MBCGA保留存储成本低的优点,具有较快的收敛速度。变异算子的局部寻优作用明显。     

二进制粒子群算法在路径规划中的应用

全局路径规划是智能机器人的一个重要研究领域,将二进制粒子群算法应用于路径规划是一种新的尝试.提出一种机器人路径全局路径规划方法,介绍了利用改进的二进制粒子群算法进行路径规划的详细实现过程.机器人工作空间中的障碍物表示为多边形,对多边形顶点进行编号.利用二进制粒子群算法进行路径规划,粒子的长度定义为工作环境中障碍物顶点的个数,每一位为0或1表示路径是否经过该顶点.为了克服传统的二进制粒子群算法的早熟收敛问题,在改进的算法中采用了双重编码结构,并引入变异操作.最后给出仿真结果证明该方法的正确性和有效性.     

自适应遗传算法在服装生产流水线平衡问题中的应用

将自适应遗传算法应用于服装生产流水线中,利用自适应遗传算法能够自动给出比较合适的交叉概率、和变异概率,显著提高了搜索效率,同时改进了遗传算法的搜索能力的特点,解决并行制造中的流水线平衡问题。针对某款运动上衣的生产工艺进行仿真,结果表明了该算法的有效性。     

基于双种群的进化策略算法

针对进化策略算法收敛速度较慢、容易早熟的问题,提出一种新的基于双种群的改进进化策略算法。将种群划分为规模较小的精英子群和规模较大的普通子群。精英子群用于存放种群中最优秀的个体,普通子群用于存放种群中的普通个体。对不同的子群采用不同的变异策略,使种群在解空间具有尽可能分散的全局搜索能力的同时在局部具有尽可能精细的局部搜索能力。通过理论分析证明了算法的正确性,对几个典型的函数应用该算法进行模拟进化实验,也取得了良好的效果。     

用现代设计包装传统民间艺术精粹——潍坊年画的包装设计研究

潍坊年画具有浓郁的乡土气息和淳朴鲜明的艺术风格,在包装设计中应通过分析潍坊年画的精神内涵和吉祥寓意,通过对色彩、图形、文字等表象性要素的设计探索,抓住年画文化的本质和精神核心,把它融入到具体设计中,将年画传统的文化思想精髓同当代设计要素有机结合起来,创造具有鲜明艺术个性的包装设计形式。     

浅谈民间年画的艺术特色

年画是我国的一种古老民间艺术,是中国民间最为普及的艺术品之一。它是中国民俗的形象反映,是节日文化风俗的典型体现,是中国民俗、年俗文化的代表。它在漫长的发展过程中传播和丰富了民族文化,也强健和完善了自身的艺术形象。本文从民间年画的历史渊源、造型手法、构图特点以及色彩样式这几方面进行了阐述。     

基于GPIO的永磁同步电机模型预测转矩控制

在永磁同步电机模型预测转矩控制(model predictive torque control,MPTC)中,由于目标函数控制变量的量纲不同,为了在代价函数中选取最优的权重系数,提出一种改进高斯变异鸽群算法(Gaussian mutation pigeon-inspired optimization algorithm, GPIO)实现权重系数自整定。首先,基于代价函数最小化原则设计PIO的目标函数,用电流id、iq脉动误差均方根评价权重系数。其次,在传统高斯变异算子的基础上引入自适应调整动态参数实现变异。仿真和实验结果表明,将改进后的算法应用于永磁同步电机模型预测转矩系统,能在较少的迭代次数内整定出最优的权重系数,极大地降低了转矩误差和电流谐波畸变率。     

Novel Metrics for Mutation Analysis

A measure of the “goodness” or efficiency of the test suite is used to determine the proficiency of a test suite. The appropriateness of the test suite is determined through mutation analysis. Several Finite State Machine (FSM) mutants are produced in mutation analysis by injecting errors against hypotheses. These mutants serve as test subjects for the test suite (TS). The effectiveness of the test suite is proportional to the number of eliminated mutants. The most effective test suite is the one that removes the most significant number of mutants at the optimal time. It is difficult to determine the fault detection ratio of the system. Because it is difficult to identify the system’s potential flaws precisely. In mutation testing, the Fault Detection Ratio (FDR) metric is currently used to express the adequacy of a test suite. However, there are some issues with this metric. If both test suites have the same defect detection rate, the smaller of the two tests is preferred. The test case (TC) is affected by the same issue. The smaller two test cases with identical performance are assumed to have superior performance. Another difficulty involves time. The performance of numerous vehicles claiming to have a perfect mutant capture time is problematic. Our study developed three metrics to address these issues: , , and In this context, most used test generation tools were examined and tested using the developed metrics. Thanks to the metrics we have developed, the research contributes to eliminating the problems related to performance measurement by integrating the missing parameters into the system.     

面向安卓自动化测试工具综合评估

自动化测试工具是安卓应用质量保障的主要手段.随着安卓版本多样性、底层硬件差异性(碎片化)以及逻辑复杂性增加,自动化测试迎来新的挑战.为解决这些问题,近年来,业界开发出大量自动化测试工具.但是现有工具数量多,并且测试重点多样,测试人员选择工具时存在一定的困扰.为帮助测试人员选择最佳测试工具,实现对自动化测试工具的统一评估,提出了面向安卓自动化测试工具多特征综合评估方法(comprehensiveevaluation of Android automated testing, CEAT),并将其实现为便于测试人员使用的平台. CEAT在引入测试领域广泛接受的3个评估指标,即代码覆盖率、异常检出率、融合多版本兼容度得分的基础上,进一步基于变异测试的思想引入变异杀死率,并从用户体验出发引入UI控件覆盖率.以上5个指标构成CEAT整个体系,从而实现安卓自动化测试工具的综合多维评估.为验证CEAT的效果,生成了1 089个变异应用的待测应用集,在包含6个移动设备的真机集群中部署实验,对5个自动化测试工具适配并执行5 040次测试任务.最终结果表明:i) 5个指标从不同角度对自动化测试工具进行评估,...