An Artificial Immune Network for Multimodal Function Optimization on Dynamic Environments (original) (raw)
Related papers
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.
Soft Computing, 2011
A bio-inspired artificial immune system is developed to track dynamically the Pareto fronts of time-varying constrained multi-objective problems with changing variable dimensions. It executes in order T-module, B-module, and M-module within a run period. The first module is designed to examine dynamically whether the environment changes or whether a change takes place in the optimization problem, while creating an initial population by means of the history information. Thereafter, the second one is a loop of optimization that searches for the desired non-dominated front of a given environment, in which the evolving population is sorted into several subpopulations. Each of such subpopulations, relying upon the population diversity, suppresses its redundant individuals and evolves the winners. The last one stores temporarily the resultant non-dominated solutions of the environment that assist T-module to create some initial candidates helpful for the coming environment. These dynamic characteristics, along with the comparative experiments guarantee that the artificial immune system can track adaptively the time-varying environment and maintain the diversity of population while being of potential use for complex dynamic constrained multi-objective problems.
A Dynamic Artificial Immune Algorithm Applied to Challenging Benchmarking Problems
… Computation, 2009. CEC'09. …, 2009
In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of these uncertainties is a constantly changing environment in which the optima change their location over time. New heuristics or adaptations to already available algorithms must be conceived in order to deal with such problems. Among the desirable features that a search strategy should exhibit to deal with dynamic optimization are diversity maintenance, a memory of past solutions, and a multipopulation structure of candidate solutions. In this paper, an immune-inspired algorithm that presents these features, called dopt-aiNet, is properly adapted to deal with six newly proposed benchmark instances, and the obtained results are outlined according to the available specifications for the competition at the Congress on Evolutionary Computation 2009.
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.
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.
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 Immune System-Based Genetic Algorithm to Deal with Dynamic Environments: Diversity and Memory
Artificial Neural Nets and Genetic Algorithms, 2003
The standard Genetic Algorithm has several limitations when dealing with dynamic environments. The most harmful limitation as to do with the tendency for the large majority of the members of a population to convergence prematurely to a particular region of the search space, making thus difficult for the GA to find other solutions when changes in the environment occur. Several approaches have been tested to overcome this limitation by introducing diversity in the population or through the incorporation of memory in order to help the algorithm when situations of the past can be observed in future situations. In this paper, we propose a GA inspired in the immune system ideas in order to deal with dynamic environments. This algorithm combines the two aspects mentioned above: diversity and memory and we will show that our algorithm is also more adaptable and accurate than the other algorithms proposed in the literature.
omni-aiNet: An Immune-Inspired Approach for Omni Optimization
Lecture Notes in Computer Science, 2006
This work presents omni-aiNet, an immune-inspired algorithm developed to solve single and multi-objective optimization problems, either with single and multi-global solutions. The search engine is capable of automatically adapting the exploration of the search space according to the intrinsic demand of the optimization problem. This proposal unites the concepts of omni-optimization, already proposed in the literature, with distinctive procedures associated with immune-inspired concepts. Due to the immune inspiration, the omni-aiNet presents a population capable of adjusting its size during the execution of the algorithm, according to a predefined suppression threshold, and a new grid mechanism to control the spread of solutions in the objective space. The omni-aiNet was applied to several optimization problems and the obtained results are presented and analyzed.
A Gaussian Artificial Immune System for multi-objective optimization in continuous domains
2010 10th International Conference on Hybrid Intelligent Systems, HIS 2010, 2010
This paper proposes a Multi-Objective Gaussian Artificial Immune System (MOGAIS) to deal effectively with building blocks (high-quality partial solutions coded in the solution vector) in multi-objective continuous optimization problems. By replacing the mutation and cloning operators with a probabilistic model, more specifically a Gaussian network representing the joint distribution of promising solutions, MOGAIS takes into account the relationships among the variables of the problem, avoiding the disruption of already obtained high-quality partial solutions. The algorithm was applied to three benchmarks and the results were compared with those produced by state-of-the-art algorithms.
Evolutionary artificial immune system optimization
Proceedings of the …, 2010
In this paper, it is presented a new evolutionary algorithm of advanced optimization based in the technique of Artificial Immune Systems and in the Principles of Game Theory, more specifically, in the inclusion of evolutionary characteristics and a phase called "Social Interaction" in the algorithm AISO. In this way some theoretical aspects are presented, the new algorithm proposal and finally some simulation and comparison to Classical Genetic Algorithm and Genetic Algorithm with Social Interaction are made to the Traveling Salesman Problem.