基于混合变异策略的改进差分进化算法及函数优化

针对差分进化算法DE 传统变异策略不能有效平衡全局搜索和局部搜索,并且算 子固定,导致算法早收敛、搜索效率较低。基于DE 变异策略性能,提出一种混合变异策略, 力图平衡算法探索和开发能力,使得前期增强全局搜索,保持种群多样性; 后期偏重局部搜 索,尽快收敛到全局最优值。同时操作算子采用随机正态缩放因子F 和时变交叉概率因子CＲ, 进一步改善算法性能。几个典型Benchmarks 测试函数实验表明: 该改进型差分进化算法能有 效避免早收敛,较好地提高算法的全局收敛能力和搜索效率。     

分形下的河道演变初探——以尼洋河为例

以尼洋河为例运用分形算法探讨了河道演变的机理,初步认为:在河道演变分类的基础上,河道演变是河道外部条件和河道内部条件不断协调的结果,即演变主要依靠水力和携砂两个关键因素。具体到尼洋河来说是渐进式演变与急剧式演变相结合的河道演变,其渐进式演变主要由于携砂带来河势演变,其急剧式演变主要是由于水位落差或流量增大引起的纵向和横向演变。     

超差特征量指标集约束下PID调节器的满意优化

针对一类具有目的域的控制系统,提出将一组由滞留时间、超差时间以及随机穿越周期时间等构成的超差特征量指标纳入满意PID调节器的目标函数集中进行研究。将PID调节器的参数设计转化为局部状态反馈问题,推导出带状目的域下超差特征量指标的解析表达式,并分析了其与稳定裕度、动态误差系数以及稳态输出方差指标之间的相容性;当上述指标相容时,给出了一种利用双群体机制下的差分进化算法和内点法相结合对PID调节器参数进行优化求解的策略;数值算例表明了所提方法的有效性。     

基于蜂群遗传算法的0-1背包问题

针对0-1背包问题,本文提出了基于蜂群遗传算法的优化求解方案。该算法包括两个种群,一个主要用于全局搜索,另一个主要用于局部搜索;每个个体采用二进制编码;采用最优个体交叉策略;对当前解的处理措施是将还未装入背包且性价比最好的物品装进背包,直至不能装为止;不符合约束条件的解采用诱变因子指导变异处理;遗传算子包括单点交叉算子、简单变异算子、主动进化算子和抑制算子。本算法充分发挥了遗传算法的群体搜索和全局收敛的特性,快速地并行搜索,有效地克服了经典遗传算法容易陷入局部最优问题。数值实验表明,该算法在求解0-1背包问题中取得了较好的效果,同样可以应用于其它的组合优化问题。     

差分演化算法在约束优化问题中的应用

差分演化算法的变异机制没有充分利用种群的信息,导致变异是盲目的。受到粒子群算法信息共享机制的启发,文中提出了一种多群体差分演化算法,新算法将整个种群分成多个子种群,每个子种群通过借鉴本种群的内部经验与整个种群的外部经验对变异进行指导。一方面,由于变异操作借鉴了子种群的局部信息和整个种群的全局信息,提高了算法收敛的速度;另一方面,多个子群体增强了种群的多样性,提升了算法的全局搜索能力。数值实验表明新算法具有很强的稳定性和全局搜索能力,在相同计算复杂度情况下的全局搜索能力较原始差分演化算法有明显提升,可以有效求解约束优化问题。     

本体映射的进化研究

本体映射的进化是本体研究中待研究的课题之一。本文首先给出本体和本体映射形式化定义,在此基础上讨论本体变化后的映射进化方法。将本体变化类型分为删除、增加、修改,针对不同的类型提出本体删除后的映射进化算法、本体增加后的映射进化算法和本体修改后的映射进化算法。实验结果表明该方法能基本解决本体映射的进化问题。最后指出算法中存在的挑战,并给出进一步研究的方向。     

The effectiveness of software metrics in identifying error-prone classes in post-release software evolution process

Many empirical studies have found that software metrics can predict class error proneness and the prediction can be used to accurately group error-prone classes. Recent empirical studies have used open source systems. These studies, however, focused on the relationship between software metrics and class error proneness during the development phase of software projects. Whether software metrics can still predict class error proneness in a system’s post-release evolution is still a question to be answered. This study examined three releases of the Eclipse project and found that although some metrics can still predict class error proneness in three error-severity categories, the accuracy of the prediction decreased from release to release. Furthermore, we found that the prediction cannot be used to build a metrics model to identify error-prone classes with acceptable accuracy. These findings suggest that as a system evolves, the use of some commonly used metrics to identify which classes are more prone to errors becomes increasingly difficult and we should seek alternative methods (to the metric-prediction models) to locate error-prone classes if we want high accuracy.     

Supervised and Reinforcement Evolutionary Learning for Wavelet-based Neuro-fuzzy Networks

This study presents a wavelet-based neuro-fuzzy network (WNFN). The proposed WNFN model combines the traditional Takagi–Sugeno–Kang (TSK) fuzzy model and the wavelet neural networks (WNN). This study adopts the non-orthogonal and compactly supported functions as wavelet neural network bases. A novel supervised evolutionary learning, called WNFN-S, is proposed to tune the adjustable parameters of the WNFN model. The proposed WNFN-S learning scheme is based on dynamic symbiotic evolution (DSE). The proposed DSE uses the sequential-search-based dynamic evolutionary (SSDE) method. In some real-world applications, exact training data may be expensive or even impossible to obtain. To solve this problem, the reinforcement evolutionary learning, called WNFN-R, is proposed. Computer simulations have been conducted to illustrate the performance and applicability of the proposed WNFN-S and WNFN-R learning algorithms.     

A bacterial colony growth algorithm for mobile robot localization

Achieving robot autonomy is a fundamental objective in Mobile Robotics. However in order to realize this goal, a robot must be aware of its location within an environment. Therefore, the localization problem (i.e.,the problem of determining robot pose relative to a map of its environment) must be addressed. This paper proposes a new biology-inspired approach to this problem. It takes advantage of models of species reproduction to provide a suitable framework for maintaining the multi-hypothesis. In addition, various strategies to track robot pose are proposed and investigated through statistical comparisons. The Bacterial Colony Growth Algorithm (BCGA) provides two different levels of modeling: a background level that carries on the multi-hypothesis and a foreground level that identifies the best hypotheses according to an exchangeable strategy. Experiments, carried out on the robot ATRV-Jr manufactured by iRobot, show the effectiveness of the proposed BCGA.

一种具有双重进化空间的扩展粒子群优化算法

为了使粒子群优化(PSO)适于求解更多类问题,提出一种由动力空间和制导空间共同进化的改进粒子群优化算法-具有双重进化空间的扩展粒子群优化算法(简记EPSO).在EPSO中,在演化转换映射的作用下,首先将动力空间中对粒子辅助位置的进化转换为制导空间中对主导位置的进化,然后基于对主导位置的择优选择操作实现算法的进化过程.EPSO克服了PSO仅适于求解连续域最优化问题的缺陷,也非常适于求解离散组合优化问题.对于随机3-SAT问题、背包问题和TSP问题,通过与PSO、ACO和GA等算法的计算对比表明:EPSO是一种继承了PSO优点的高效、扩展演化算法.