A New Method for Fastening the Convergence of Immune Algorithms Using an Adaptive Mutation Approach (original) (raw)
Related papers
The Convergence Speed of Single-And Multi-Objective Immune Algorithm Based Optimization Problems
Signal Processing: An …, 2010
Despite the considerable amount of research related to immune algorithms and it applications in numerical optimization, digital filters design, and data mining, there is still little work related to issues as important as sensitivity analysis, [1]-[4]. Other aspects, such as convergence speed and parameters adaptation, have been practically disregarded in the current specialized literature [7]-[8]. The convergence speed of the immune algorithm heavily depends on its main control parameters: population size, replication rate, mutation rate, clonal rate and hypermutation rate. In this paper we investigate the effect of control parameters variation on the convergence speed for single-and multi-objective optimization problems. Three examples are devoted for this purpose; namely the design of 2-D recursive digital filter, minimization of simple function, and banana function. The effect of each parameter on the convergence speed of the IA is studied considering the other parameters with fixed values and taking the average of 100 times independent runs. Then, the concluded rules are applied on some examples introduced in [2] and [3]. Computational results show how to select the immune algorithm parameters to speedup the algorithm convergence and to obtain the optimal solution.
2007
In this paper we propose an immune algorithm (IA) to solve high dimensional global optimization problems. To evaluate the effectiveness and quality of the IA we performed a large set of unconstrained numerical optimisation experiments, which is a crucial component of many real-world problem-solving settings. We extensively compare the IA against several Differential Evolution (DE) algorithms as these have been shown to perform better than many other Evolutionary Algorithms on similar problems.
A Hybrid Artificial Immune Optimization Method
International Journal of Computational Intelligence Systems, 2009
This paper proposes a hybrid optimization method based on the fusion of the Simulated Annealing (SA) and Clonal Selection Algorithm (CSA), in which the SA is embedded in the CSA to enhance its search capability. The novel optimization algorithm is also employed to deal with several nonlinear benchmark functions as well as a practical engineering design problem. Simulation results demonstrate the remarkable advantages of our approach in achieving the diverse optimal solutions and improved convergence speed.
An evolutionary artificial immune system for multi-objective optimization
European Journal of Operational Research, 2008
In this paper, an evolutionary artificial immune system for multi-objective optimization which combines the global search ability of evolutionary algorithms and immune learning of artificial immune systems is proposed. A new selection strategy is developed based upon the concept of clonal selection principle to maintain the balance between exploration and exploitation. In order to maintain a diverse repertoire of antibodies, an information-theoretic based density preservation mechanism is also presented. In addition, the performances of various multi-objective evolutionary algorithms as well as the effectiveness of the proposed features are examined based upon seven benchmark problems characterized by different difficulties in local optimality, non-uniformity, discontinuity, non-convexity, high-dimensionality and constraints. The comparative study shows the effectiveness of the proposed algorithm, which produces solution sets that are highly competitive in terms of convergence, diversity and distribution. Investigations also demonstrate the contribution and robustness of the proposed features.
A simulated annealing-based immune optimization method
2008
This paper proposes a hybrid optimization method based on the fusion of the Simulated Annealing (SA) and Clonal Selection Algorithm (CSA), in which the SA is embedded in the CSA to enhance its search capability. The novel optimization algorithm is also employed to deal with several nonlinear benchmark functions as well as a practical engineering design problem. Simulation results demonstrate the remarkable advantages of our approach in achieving the diverse optimal solutions and improved convergence speed.
A comparative study of immune system based genetic algorithms in dynamic environments
2006
Diversity and memory are two major mechanisms used in biology to keep the adaptability of organisms in the everchanging environment in nature. These mechanisms can be integrated into genetic algorithms to enhance their performance for problem optimization in dynamic environments. This paper investigates several GAs inspired by the ideas of biological immune system and transformation schemes for dynamic optimization problems. An aligned transformation operator is proposed and combined to the immune system based genetic algorithm to deal with dynamic environments. Using a series of systematically constructed dynamic test problems, experiments are carried out to compare several immune system based genetic algorithms, including the proposed one, and two standard genetic algorithms enhanced with memory and random immigrants respectively. The experimental results validate the efficiency of the proposed aligned transformation and corresponding immune system based genetic algorithm in dynamic environments.
A Human-Simulated Immune Evolutionary Computation Approach
Lecture Notes in Computer Science, 2012
Premature convergence to local optimal solutions is one of the main difficulties when using evolutionary algorithms in real-world optimization problems. To prevent premature convergence and degeneration phenomenon, this paper proposes a new optimization computation approach, humansimulated immune evolutionary algorithm (HSIEA). Considering that the premature convergence problem is due to the lack of diversity in the population, the HSIEA employs the clonal selection principle of artificial immune system theory to preserve the diversity of solutions for the search process. Mathematical descriptions and procedures of the HSIEA are given, and four new evolutionary operators are formulated which are clone, variation, recombination, and selection. Two benchmark optimization functions are investigated to demonstrate the effectiveness of the proposed HSIEA.
International Journal of Computational Science and Information Technology (IJCSITY), 2013
By the advances in the Evolution Algorithms (EAs) and the intelligent optimization methods we witness the big revolutions in solving the optimization problems. The application of the evolution algorithms are not only not limited to the combined optimization problems, but also are vast in domain to the continuous optimization problems. In this paper we analyze and study the Genetic Algorithm (GA) and the Artificial Immune System (AIS) algorithm which are capable in escaping the local optimization and also fastening reaching the global optimization and to show the efficiency of the GA and AIS the application of them in Solving Continuous Optimization Functions (SCOFs) are studied. Because of the multi variables and the multi-dimensional spaces in SCOFs the use of the classic optimization methods, is generally non-efficient and high cost. In other words the use of the classic optimization methods for SCOFs generally leads to a local optimized solution. A possible solution for SCOFs is ...
An Artificial Immune Network for Multimodal Function Optimization on Dynamic Environments
Proceedings of the 2005 …, 2005
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the search. One of the most popular proposals is denoted opt-aiNet (artificial immune network for optimization) and is extended here to deal with time-varying fitness functions. Additional procedures are designed to improve the overall performance and the robustness of the immune-inspired approach, giving rise to a version for dynamic optimization, denoted dopt-aiNet. Firstly, challenging benchmark problems in static multimodal optimization are considered to validate the new proposal. No parameter adjustment is necessary to adapt the algorithm according to the peculiarities of each problem. In the sequence, dynamic environments are considered, and usual evaluation indices are adopted to assess the performance of dopt-aiNet and compare with alternative solution procedures available in the literature.
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
Do Artificial Immune Systems (AIS) have something to offer the world of optimisation? Indeed do they have any new to offer at all? This paper reports the initial findings of a comparison between two immune inspired algorithms and a hybrid genetic algorithm for function optimisation. This work is part of ongoing research which forms part of a larger project to assess the performance and viability of AIS. The investigation employs standard benchmark functions, and demonstrates that for these functions the opt-aiNET algorithm, when compared to the Bcell algorithm and hybrid GA, on average, takes longer to find the solution, without necessarily a better quality solution. Reasons for these differences are proposed and it is acknowledge that this is preliminary empirical work. It is felt that a more theoretical approach may well be required to ascertain real performance and applicability issues.