Immune Genetic Algorithm for Optimal Design

A computing model employing the immune and genetic algorithm (IGA) for the optimization of part design is presented. This model operates on a population of points in search space simultaneously, not on just one point. It uses the objective function itself, not derivative or any other additional information and guarantees the fast convergence toward the global optimum. This method avoids some weak points in genetic algorithm, such as inefficient to some local searching problems and its convergence is too early. Based on this model, an optimal design support system (IGBODS) is developed.IGBODS has been used in practice and the result shows that this model has great advantage than traditional one and promises good application in optimal design.

Adaptive template filter method for image processing based on immune genetic algorithm

To preserve the original signal as much as possible and filter random noises as many as possible in image processing,a threshold optimization-based adaptive template filtering algorithm was proposed.Unlike conventional filters whose template shapes and coefficients were fixed,multi-templates were defined and the right template for each pixel could be matched adaptively based on local image characteristics in the proposed method.The superiority of this method was verified by former results concerning the matching experiment of actual image with the comparison of conventional filtering methods.The adaptive search ability of immune genetic algorithm with the elitist selection and elitist crossover(IGAE) was used to optimize threshold t of the transformation function,and then combined with wavelet transformation to estimate noise variance.Multi-experiments were performed to test the validity of IGAE.The results show that the filtered result of t obtained by IGAE is superior to that of t obtained by other methods,IGAE has a faster convergence speed and a higher computational efficiency compared with the canonical genetic algorithm with the elitism and the immune algorithm with the information entropy and elitism by multi-experiments.

Forecasting increasing rate of power consumption based on immune genetic algorithm combined with neural network

Considering the factors affecting the increasing rate of power consumption, the BP neural network structure and the neural network forecasting model of the increasing rate of power consumption were established. Immune genetic algorithm was applied to optimizing the weight from input layer to hidden layer, from hidden layer to output layer, and the threshold value of neuron nodes in hidden and output layers. Finally, training the related data of the increasing rate of power consumption from 1980 to 2000 in China, a nonlinear network model between the increasing rate of power consumption and influencing factors was obtained. The model was adopted to forecasting the increasing rate of power consumption from 2001 to 2005, and the average absolute error ratio of forecasting results is 13.521 8%. Compared with the ordinary neural network optimized by genetic algorithm, the results show that this method has better forecasting accuracy and stability for forecasting the increasing rate of power consumption.

Elitism-based immune genetic algorithm and its application to optimization of complex multi-modal functions

A novel immune genetic algorithm with the elitist selection and elitist crossover was proposed, which is called the immune genetic algorithm with the elitism （IGAE）. In IGAE, the new methods for computing antibody similarity, expected reproduction probability, and clonal selection probability were given. IGAE has three features. The first is that the similarities of two antibodies in structure and quality are all defined in the form of percentage, which helps to describe the similarity of two antibodies more accurately and to reduce the computational burden effectively. The second is that with the elitist selection and elitist crossover strategy IGAE is able to find the globally optimal solution of a given problem. The third is that the formula of expected reproduction probability of antibody can be adjusted through a parameter r, which helps to balance the population diversity and the convergence speed of IGAE so that IGAE can find the globally optimal solution of a given problem more rapidly. Two different complex multi-modal functions were selected to test the validity of IGAE. The experimental results show that IGAE can find the globally maximum/minimum values of the two functions rapidly. The experimental results also confirm that IGAE is of better performance in convergence speed, solution variation behavior, and computational efficiency compared with the canonical genetic algorithm with the elitism and the immune genetic algorithm with the information entropy and elitism.

Optimization of Submarine Hydrodynamic Coefficients Based on Immune Genetic Algorithm

Aiming at the demand for optimization of hydrodynamic coefficients in submarine's motion equations,an adaptive weight immune genetic algorithm was proposed to optimize hydrodynamic coefficients in motion equations.Some hydrodynamic coefficients of high sensitivity to control and maneuver were chosen as the optimization objects in the algorithm.By using adaptive weight method to determine the weight and target function,the multi-objective optimization could be translated into single-objective optimization.For a certain kind of submarine,three typical maneuvers were chosen to be the objects of study:overshoot maneuver in horizontal plane,overshoot maneuver in vertical plane and turning circle maneuver in horizontal plane.From the results of computer simulations using primal hydrodynamic coefficient and optimized hydrodynamic coefficient,the efficiency of proposed method is proved.

Intelligent optimization of the structure of the large section highway tunnel based on improved immune genetic algorithm

As in the building of deep buried long tunnels,there are complicated conditions such as great deformation,high stress,multi-variables,high non-linearity and so on,the algorithm for structure optimization and its application in tunnel engineering are still in the starting stage. Along with the rapid development of highways across the country,it has become a very urgent task to be tackled to carry out the optimization design of the structure of the section of the tunnel to lessen excavation workload and to reinforce the support. Artificial intelligence demonstrates an extremely strong capability of identifying,expressing and disposing such kind of multiple variables and complicated non-linear relations. In this paper,a comprehensive consideration of the strategy of the selection and updating of the concentration and adaptability of the immune algorithm is made to replace the selection mode in the original genetic algorithm which depends simply on the adaptability value. Such an algorithm has the advantages of both the immune algorithm and the genetic algorithm,thus serving the purpose of not only enhancing the individual adaptability but maintaining the individual diversity as well. By use of the identifying function of the antigen memory,the global search capability of the immune genetic algorithm is raised,thereby avoiding the occurrence of the premature phenomenon. By optimizing the structure of the section of the Huayuan tunnel,the current excavation area and support design are adjusted. A conclusion with applicable value is arrived at. At a higher computational speed and a higher efficiency,the current method is verified to have advantages in the optimization computation of the tunnel project. This also suggests that the application of the immune genetic algorithm has a practical significance to the stability assessment and informationization design of the wall rock of the tunnel.

A novel immune genetic algorithm based on quasi secondary response

Combining the advantages of a genetic algorithm and an artificial immune system, a novel genetic algorithm named immune genetic algorithm based on quasi secondary response （IGA QSR） is proposed. IGA QSR employs a database to simulate the standard secondary response and the quasi secondary response. Elitist strategy, automatic extinction, clonal propagation, diversity guarantee, and selection based on comprehensive fitness are also used in the process of IGA QSR. Theoretical analysis, numerical examples of three benchmark mathematical optimization problems and a trave ling salesman problem all demonstrate that IGA-QSR is more effective not only on convergence speed but also on convergence probability than a simple genetic algorithm with the elitist strategy （ SGA ES）. Besides, IGA QSR allows the designers to stop and restart the optimization process freely with out losing the best results that have already been obtained. These properties make IGA QSR be a fea sible, effective and robust search algorithm for complex engineering problems.

Adaptive immune-genetic algorithm for global optimization to multivariable function

An adaptive immune-genetic algorithm （AIGA） is proposed to avoid premature convergence and guarantee the diversity of the population. Rapid immune response （secondary response）, adaptive mutation and density operators in the AIGA are emphatically designed to improve the searching ability, greatly increase the converging speed, and decrease locating the local maxima due to the premature convergence. The simulation results obtained from the global optimization to four multivariable and multi-extreme functions show that AIGA converges rapidly, guarantees the diversity, stability and good searching ability.

Modified Self-adaptive Immune Genetic Algorithm for Optimization of Combustion Side Reaction of p-Xylene Oxidation

In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.

Immune and Genetic Algorithm Based Assembly Sequence Planning

In this paper an assembly sequence planning model inspired by natural immune and genetic algorithm (ASPIG) based on the part degrees of freedom matrix (PDFM) is proposed, and a proto system — DSFAS based on the ASPIG is introduced to solve assembly sequence problem. The concept and generation of PDFM and DSFAS are also discussed. DSFAS can prevent premature convergence, and promote population diversity, and can accelerate the learning and convergence speed in behavior evolution problem.

Application of a Genetic Algorithm Based on the Immunity for Flow Shop under Uncertainty

The uncertain duration of each job in each machine in flow shop problem was regarded as an independent random variable and was described by mathematical expectation.And then,an immune based partheno-genetic algorithm was proposed by making use of concepts and principles introduced from immune system and genetic system in nature.In this method,processing se- quence of products could be expressed by the character encoding and each antibody represents a feasible schedule.Affinity was used to measure the matching degree between antibody and antigen.Then several antibodies producing operators,such as swopping,mov- ing,inverting,etc,were worked out.This algorithm was combined with evolution function of the genetic algorithm and density mechanism in organisms immune system.Promotion and inhibition of antibodies were realized by expected propagation ratio of an- tibodies,and in this way,premature convergence was improved.The simulation proved that this algorithm is effective.

Immune Genetic Learning of Fuzzy Cognitive Map

This paper presents a hybrid methodology of automatically constructing fuzzy cognitive map (FCM). The method uses immune genetic algorithm to learn the connection matrix of FCM. In the algorithm, the DNA coding method is used and an immune operator based on immune mechanism is constructed. The characteristics of the system and the experts' knowledge are abstracted as vaccine for restraining the degenerative phenomena during evolution so as to improve the algorithmic efficiency. Finally, an illustrative example is provided, and its results suggest that the method is capable of automatically generating FCM model.

NOVEL QUANTUM-INSPIRED GENETIC ALGORITHM BASED ON IMMUNITY

A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.

An Improved Artificial Immune Algorithm with a Dynamic Threshold

An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antibody＇s fitness and setting the dynamic threshold value. Numerical experiments show that compared with the genetic algorithm and the originally real-valued coding artificial immune algorithm, the improved algorithm possesses high speed of convergence and good performance for preventing premature convergence.

A Fuzzy-based Adaptive Genetic Algorithm and Its Case Study in Chemical Engineering

Considering that the performance of a genetic algorithm （GA） is affected by many factors and their rela-tionships are complex and hard to be described,a novel fuzzy-based adaptive genetic algorithm （FAGA） combined a new artificial immune system with fuzzy system theory is proposed due to the fact fuzzy theory can describe high complex problems.In FAGA,immune theory is used to improve the performance of selection operation.And,crossover probability and mutation probability are adjusted dynamically by fuzzy inferences,which are developed according to the heuristic fuzzy relationship between algorithm performances and control parameters.The experi-ments show that FAGA can efficiently overcome shortcomings of GA,i.e.,premature and slow,and obtain better results than two typical fuzzy GAs.Finally,FAGA was used for the parameters estimation of reaction kinetics model and the satisfactory result was obtained.

Feature selection for chemical process fault diagnosis by artificial immune systems

With the Industry 4.0 era coming, modern chemical plants will be gradually transformed into smart factories, which sets higher requirements for fault detection and diagnosis(FDD) to enhance operation safety intelligence. In a typical chemical process, there are hundreds of process variables. Feature selection is a key to the efficiency and effectiveness of FDD. Even though artificial immune system has advantages in adaptation and independency on a large number of fault samples, antibody library construction used to be based on experience. It is not only time consuming, but also lack of scientific foundation in fault feature selection, which may deteriorate the FDD performance of the AIS. In this paper, a fault antibody feature selection optimization(FAFSO) algorithm is proposed based on genetic algorithm to optimize the fault antibody features and the antibody libraries' thresholds simultaneously. The performance of the proposed FAFSO algorithms is illustrated through the Tennessee Eastman benchmark problem.

A New Cultivation-Evolution Technology of Accident Immune Function for a Petrochemical Enterprise

For the purpose of developing an immune function on production accidents in a petrochemical enterprise, a new cultivation-evolution approach of preventive mechanism is suggested by analyzing various factors relating to immune deficiency syndrome and by referring to immunity genetic algorithm and relevant concepts applied in medicine science. Accident-immunity system for highly hazardous petrochemical enterprise, which is made up of its productive system＇s Safety Organ and Safety Organization, is typically an evolution-cultivation progress for immune function, The new B immune cell is generated after several layers＇ screening, clone expanding, receptor editing, organizing in immune system of work accident in petrochemical enterprise. There is a B immune cell with high appetency and a manipulative function chain for accident-immunity. Taking the antigen of accidents in industry as the target function and the immune antibody as the solution, the authors carried out a computation diagram for prediction of appetency between the antigen and antibody.

Immune Recognition Method Based on Analogy Reasoning in Intrusion Detection System

In this paper, we propose an analogy based immune recognition method that focuses on the implement of the clone selection process and the negative selection process by means of analogy similarity. This method is applied in an IDS （Intrusion Detection System） following several steps. Firstly, the initial abnormal behaviours sample set is optimized through the combining of the AIS （Artificial Immune System） and the genetic algorithm. Then, the abnormity probability algorithm is raised considering the two sides of abnormality and normality. Finally, an intrusion detection system model is established based on the above algorithms and models.

基于改进式免疫遗传算法的车联网任务卸载方案

为了解决车联网场景下卸载决策和资源分配不合理的问题,提出了一种改进的启发式车联网任务卸载策略。该策略利用改进式的双种群免疫遗传算法(IDP-IGA),在保留了精英种群的同时引入了自适应移民算子,并在满足车辆最大容忍时延和路侧单元最大可分配资源的前提下,优化系统的时延-能耗开销。仿真结果表明,所提算法具有良好收敛性,与传统算法和遗传-粒子群优化算法相比,能够显著降低系统的时延-能耗开销,在任务卸载过程中实现最优的资源分配方案。

基于改进免疫遗传算法的建设项目应急预案优化

为了提高建设项目应急预案的针对性,基于改进免疫遗传算法对建设项目应急预案优化进行仿真研究。首先,借鉴生物免疫原理,构建建设项目应急预案优化理论模型;其次,通过设计Taguchi试验优化算法中的重要参数,引入精英保留策略改进免疫遗传算法,并基于该算法构建建设项目应急预案优化模型;最后,以某高速公路为例,运用MATLAB软件进行模拟仿真,测试改进免疫遗传算法的可行性,并设置两组对比实验验证改进免疫遗传算法的优越性。仿真结果表明:相比于传统免疫遗传算法,改进免疫遗传算法下应急预案的亲和度更高,收敛速度也更快。这拓展了项目风险研究,为风险应对决策提供参考依据。