This paper studies the niching mechanism based on population replacement in the process of evolution to solve the multimodal functions optimization (MMFO) problems. In order to niche multiple species for the MMFO task...
详细信息
This paper studies the niching mechanism based on population replacement in the process of evolution to solve the multimodal functions optimization (MMFO) problems. In order to niche multiple species for the MMFO tasks, the overlapping population replacement is surely needed because the offspring population most probably does not inherit all of the genetic information contained in its parental population, and the basic procedure for niching genetic algorithms with overlapping population replacement is presented. Then four niching schemes, the nearest neighbors replacement crowding (NNRC), the species conservation technique (SCT), the HFC-I (implicit hierarchical fair competition), and the CPE (clearing procedure with elitist) are investigated. These niching schemes are characterized with regard to different niching strategies and parameterizations, and the corresponding niching procedures are outlined. Finally, experiments are carried out on a suite of test functions to compare different niching strategies regarding niching efficiency and scalability. Experimental results illustrate the intrinsic difference of the four niching schemes. The NNRC and HFC-I have a mechanism of multiple species coevolution via adapting multiple species to different niches, while the SCT and CPE tend to make use of a mandatory mechanism to conserve species just like the grid searching over the solution space based on species distance or clearing radius. All niching methods are able to deal with complex MMFO problems, while the NNRC and HFC-I show a better performance in terms of niching efficiency and scalability, and are more robust regarding the algorithm parameterization.
Glowworm swarm optimization (GSO) is a novel algorithm for the simultaneous computation of multiple optima of multimodalfunctions, which is a swarm intelligence based optimization algorithm, such as ant colony optimi...
详细信息
ISBN:
(纸本)9781424487363
Glowworm swarm optimization (GSO) is a novel algorithm for the simultaneous computation of multiple optima of multimodalfunctions, which is a swarm intelligence based optimization algorithm, such as ant colony optimization (ACO) and particle swarm optimization (PSO). In the optimization of multimode functions, GSO performs very well in terms of the number of peaks captured. In this paper, we propose a modified glowworm swarm optimization algorithm. Variable step-size movement strategy and the self-exploration behavior of glowworms have been studied according to the phenomena of nature. In this way, the behavior of glowworms accords with the biological natural law even more, and easily find multiple optima of a given multimodal function. Simulation experiments on three standard multimodalfunctions are carried out, and the results show that this modified optimization strategy has nice convergence ability and precision. And the convergence speed of the algorithm is greatly improved.
Glowworm swarm optimization (GSO) is a novel algorithm for the simultaneous computation of multiple optima of multimodalfunctions, which is a swarm intelligence based optimization algorithm, such as ant colony optimi...
详细信息
Glowworm swarm optimization (GSO) is a novel algorithm for the simultaneous computation of multiple optima of multimodalfunctions, which is a swarm intelligence based optimization algorithm, such as ant colony optimization (ACO) and particle swarm optimization (PSO). In the optimization of multimode functions, GSO performs very well in terms of the number of peaks captured. In this paper, we propose a modified glowworm swarm optimization algorithm. Variable step-size movement strategy and the self-exploration behavior of glowworms have been studied according to the phenomena of nature. In this way, the behavior of glowworms accords with the biological natural law even more, and easily find multiple optima of a given multimodal function. Simulation experiments on three standard multimodalfunctions are carried out, and the results show that this modified optimization strategy has nice convergence ability and precision. And the convergence speed of the algorithm is greatly improved.
This paper builds the normal model of fitness sharing with proportionate selection on real-valued functions, and derives the dynamic formula to describe the evolution process of the population with the fitness sharing...
详细信息
This paper builds the normal model of fitness sharing with proportionate selection on real-valued functions, and derives the dynamic formula to describe the evolution process of the population with the fitness sharing. The normal modeling simulation is investigated on specific test functions, and experimental results illustrate that the normal model is able to describe exactly the dynamics of the fitness sharing EAs and is a good platform to study the behavior of the fitness sharing EAs with regard to niching radius. The experimental results of the normal modeling simulation and the fitness sharing EAs verify the dilemma in finding optimal niche radius to achieve both good niching convergence and niching efficiency, for which a hybrid scheme is proposed to carry out the niching task. (C) 2009 Elsevier B. V. All rights reserved.
In order to overcome the premature convergence of particle swarm optimization (PSO) algorithm, an improved PSO algorithm based on sub-groups mutation (SsMPSO) is proposed. This algorithm has proposed the sub-groups wi...
详细信息
ISBN:
(纸本)9783319959573;9783319959566
In order to overcome the premature convergence of particle swarm optimization (PSO) algorithm, an improved PSO algorithm based on sub-groups mutation (SsMPSO) is proposed. This algorithm has proposed the sub-groups with random directional vibrating search to mutate the global optimal position of the main swarm and changed the way of random mutation. The mutation based on sub-groups enabled the algorithm had excellent local exploit ability and circumvented the premature convergence. It used another mutation on bad particles to enhance the algorithm's global exploit ability and expand the searching space. Finally, high dimension benchmark functions have been used to test the performance of improved algorithm. The simulation results show that the proposed algorithm can effectively overcome the premature problem, the multimodal function optimization can avoid local extreme point and the convergence and convergence accuracy are greatly improved.
This paper studies the possibility to use efficient multi-modal optimizers for multi-objective optimization. In this paper, the application area considered for such new approach is the optimal dispatch of energy sourc...
详细信息
ISBN:
(纸本)9781627483889
This paper studies the possibility to use efficient multi-modal optimizers for multi-objective optimization. In this paper, the application area considered for such new approach is the optimal dispatch of energy sources in smart microgrids. The problem indeed shows a non uniform Pareto front and requires efficient optimal search methods. The idea is to exploit the potential of agents in population-based heuristics to improve diversity in the Pareto front, where solutions show the same rank and are thus equally weighted. Since Pareto dominance is at the basis of the theory of multi-objective optimization, most algorithms show the non dominance ranking as quality indicator, with some problem in finding sufficiently diverse solutions. Other algorithms, such as the Indicator Based Evolutionary Algorithm, use most commonly the Hypervolume indicator which also intrinsically shows diversity preserving problems. In this paper, the Glow-worm swarm optimizer is used as multimodaloptimization method over a set of solutions ordered based on non dominance. After the introduction of this algorithm, its multiobjective implementation is briefly outlined. Then some tests are carried out on test functions taken from the literature giving quite encouraging results. Finally, the problem of optimal energy dispatch in smart microgrids is described and different applications are shown comparing the results with those obtained emplying the Non Dominated Sorting Genetic Algorithm II.
暂无评论