短波chirp探测的遗传退火频率分配算法研究

针对短波chirp探测系统的通信网络频率分配问题,建立了合理的干扰模型;利用系统所提供的测量参数,结合基本遗传算法,同时进行模拟退火操作以克服基本遗传算法易陷入局部最优解的不足,并最终趋于全局最优化;仿真结果表明,该算法在寻优性、收敛速度和稳定性等方面都要优于基本遗传算法。     

基于云自适应遗传算法的NoC路径分配研究

路径分配是NoC设计流程中的两个关键步骤之一;路径分配的结果对NoC系统的性能尤其是通讯延时有着很重要的影响;多约束条件下的NoC路径分配问题是NP完全问题,要求出其最优解比较困难,目前常用的方法是利用启发式算法求得其较优解;文中提出一种基于云自适应遗传算法的NoC路径分配解决方案,该算法利用云模型对传统遗传算法加以改进,采取新的方法自动调整遗传算法过程中的交叉概率pc和变异概率pm,将适应度与云模型的3个参数Ex、En、He相互结合,从而达到优化遗传算法的目的;将此算法应用于2D-Mesh拓扑结构的NoC中,以平衡链路负载和联合优化为实验目标,以优化静态通讯分配结果;实验证明,文章所采取的算法在平衡链路负载和联合优化方面均取得了良好的效果。     

基于多种群混沌遗传神经网络的模拟电路故障诊断

针对标准遗传算法优化BP神经网络收敛慢,易陷入局部最优的问题,提出了改进的多种群协同进化遗传算法,该算法改变了以往的随机初始化方法,采用了附加混沌扰动的tent映射初始化均匀分布的种群,提高了初始解的质量;每个种群采用自适应交叉率和变异率,引入移民算子实现种群间的横向联系;算法通过多种群的协同进化和种群间的个体移植提高了算法的搜索均匀性和效率;仿真实验表明该算法误差小,收敛速度快,诊断正确率高,较好地解决了模拟电路的软故障诊断问题。     

遗传算法模糊PID测控系统在环控试验台中的应用

飞机环控试验台须模拟流量0～14000kg/h、压力0～2.5MPa和常温～500℃的空气环境;项目要求测控范围广、精度±1%且不超调;空气状态具有非线性、时变等特点,且控制参数之间存在复杂耦合;针对以上难点,设计了分布式测控系统,提出了改进的智能PID控制方案;通过遗传算法分段整定PID参数,离线建立PID数据库,使系统能够根据控制目标值选择最优PID初值;在此基础上,结合模糊推理在线调整PID参数,使系统具有了自适应性,能在具体工况和干扰下达到很好的控制效果;实际应用中完全满足了指标要求,解决了传统PID的控制难点,对类似的复杂系统有一定借鉴意义。     

基于模糊数据挖掘和遗传算法的网络入侵检测技术

文章通过开发一套新的网络入侵检测系统来证实应用模糊逻辑和遗传算法的数据挖掘技术的有效性;这个系统联合了基于模糊数据挖掘技术的异常检测和基于专家系统的滥用检测,在开发异常检测的部分时,利用模糊数据挖掘技术来从正常的行为存储模式中寻找差异,遗传算法用来调整模糊隶属函数和选择一个合适的特征集合,滥用检测部分用于寻找先前行为描述模式,这种模式很可能预示着入侵,网络的通信量和系统的审计数据被用做两个元件的输入;此系统的系统结构既支持异常检测又支持滥用检测、既适用于个人工作站又可以适用于复杂网络。     

Asymptotic and robust stability of T‐S fuzzy genetic regulatory networks with time‐varying delays

In this paper, we propose and investigate a new general model of fuzzy genetic regulatory networks described by the Takagi–Sugeno (T‐S) fuzzy model with time‐varying delays. By using a Lyapunov functional approach and linear matrix inequality (LMI) techniques, the stability criteria for the delayed fuzzy genetic regulatory networks are expressed as a set of LMIs, which can be solved numerically by LMI toolbox in Matlab. Two fuzzy genetic network example are given to verify the effectiveness and applicability of the proposed approach. Copyright © 2011 John Wiley & Sons, Ltd.     

Design of robotic visual servo control based on neural network and genetic algorithm

A new visual servo control scheme for a robotic manipulator is presented in this paper, where a back propagation (BP) neural network is used to make a direct transition from image feature to joint angles without requiring robot kinematics and camera calibration. To speed up the convergence and avoid local minimum of the neural network, this paper uses a genetic algorithm to find the optimal initial weights and thresholds and then uses the BP algorithm to train the neural network according to the data given. The proposed method can effectively combine the good global searching ability of genetic algorithms with the accurate local searching feature of BP neural network. The Simulink model for PUMA560 robot visual servo system based on the improved BP neural network is built with the Robotics Toolbox of Matlab. The simulation results indicate that the proposed method can accelerate convergence of the image errors and provide a simple and effective way of robot control.     

Selective ensemble extreme learning machine modeling of effluent quality in wastewater treatment plants

Real-time and reliable measurements of the effluent quality are essential to improve operating efficiency and reduce energy consumption for the wastewater treatment process.Due to the low accuracy and unstable performance of the traditional effluent quality measurements,we propose a selective ensemble extreme learning machine modeling method to enhance the effluent quality predictions.Extreme learning machine algorithm is inserted into a selective ensemble frame as the component model since it runs much faster and provides better generalization performance than other popular learning algorithms.Ensemble extreme learning machine models overcome variations in different trials of simulations for single model.Selective ensemble based on genetic algorithm is used to further exclude some bad components from all the available ensembles in order to reduce the computation complexity and improve the generalization performance.The proposed method is verified with the data from an industrial wastewater treatment plant,located in Shenyang,China.Experimental results show that the proposed method has relatively stronger generalization and higher accuracy than partial least square,neural network partial least square,single extreme learning machine and ensemble extreme learning machine model.     

Delay‐dependent stability for Markovian genetic regulatory networks with time‐varying delays

This paper is concerned with the problem of stochastic stability analysis for a class of genetic regulatory networks with Markovian jump parameters and time‐varying delays. A delay‐dependent stability criterion is derived by using a novel mode‐dependent Lyapunov functional. The derived stability criterion is expressed in terms of linear matrix inequalities and is less conservative than the existing ones in the literature. A numerical example is provided to demonstrate the effectiveness of the proposed stability criterion. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.