In this paper, a new dynamical evolutionary algorithm (DEA) is presented basedon the theory of statistical mechanics. The novelty of this kind of dynamical evolutionary algorithmis that all individuals in a population...
详细信息
In this paper, a new dynamical evolutionary algorithm (DEA) is presented basedon the theory of statistical mechanics. The novelty of this kind of dynamical evolutionary algorithmis that all individuals in a population (called particles in a dynamical system) are running andsearching with their population evolving driven by a nev selecting mechanism. This mechanismsimulates the principle of molecular dynamics, which is easy to design and implement. A basictheoretical analysis for the dynamical evolutionary algorithm is given and as a consequence twostopping criteria of the algorithm are derived from the principle of energy minimization and the lawof entropy increasing. In order to verify the effectiveness of the scheme, DEA is applied to solvingsome typical numerical function minimization problems which are poorly solved by traditionalevolutionaryalgorithms. The experimental results show that DEA is fast and reliable.
In this paper, we introduce a new dynamical evolutionary algorithm (DEA) that aims to find the global optimum and give the theoretical explanation from statistical mechanics. The algorithm has been evaluated numerical...
详细信息
In this paper, we introduce a new dynamical evolutionary algorithm (DEA) that aims to find the global optimum and give the theoretical explanation from statistical mechanics. The algorithm has been evaluated numerically using a wide set of test functions which are nonlinear, multimodal and multidimensional. The numerical results show that it is possible to obtain global optimum or more accurate solutions than other methods for the investigated hard problems.
In evolutionary multi-objective optimization, achieving a balance between convergence speed and population diversity remains a challenging topic especially for many-objective optimization problems (MaOPs). To accelera...
详细信息
In evolutionary multi-objective optimization, achieving a balance between convergence speed and population diversity remains a challenging topic especially for many-objective optimization problems (MaOPs). To accelerate convergence toward the Pareto front and maintain a high degree of diversity for MaOPs, we propose a new many-objective dynamical evolutionary algorithm based on E-dominance and adaptive-grid strategies (EDAGEA). In EDAGEA, it incorporates the E_dominance and adaptive strategies to enhance the search ability. Instead of the Pareto dominance mechanism in the traditional dynamical evolutionary algorithm, EDAGEA employs the E-dominance strategy to improve the selective pressure and to accelerate the convergence speed. Moreover, EDAGEA incorporates the adaptive-grid strategy to promote the uniformity and diversity of the population. In the experiments, the proposed EDAGEA algorithm is tested on DTLZ series problems under 3-8 objectives with diverse characteristics and is compared with two excellent many-objective evolutionaryalgorithms. Experimental results demonstrate that the proposed EDAGEA algorithm exhibits competitive performance in terms of both convergence speed and diversity of population.
An improved dynamical evolutionary algorithm based on the chaotic is proposed for optimizing. The new algorithm makes full use of initial value sensitivity and track ergodicity of chaos, overcoming the disadvantage of...
详细信息
ISBN:
(纸本)9781424420957
An improved dynamical evolutionary algorithm based on the chaotic is proposed for optimizing. The new algorithm makes full use of initial value sensitivity and track ergodicity of chaos, overcoming the disadvantage of big searching dead zone existed in conventional chaotic mutation model. To achieve high performance in optimizing, the chaotic search mechanism is embedded in the standard dynamical evolutionary algorithm adaptively to avoid the stagnancy of population and increase the speed of convergence. The method keeps balance between the global search and the local search. It has been compared with other methods. In comparison, the proposed method shows its superiority in convergence property and robustness. It is validated by the simulation results.
The dynamical evolutionary algorithm (DEA) is a new evolutionaryalgorithm based on the theory of statistical mechanics, however, DEA converges slowly and often converge at local optima for some function optimization ...
详细信息
ISBN:
(纸本)9783037855744
The dynamical evolutionary algorithm (DEA) is a new evolutionaryalgorithm based on the theory of statistical mechanics, however, DEA converges slowly and often converge at local optima for some function optimization problems. In this paper, a hybrid dynamical evolutionary algorithm (HDEA) with multi-parent crossover and differential evolution mutation is proposed for accelerating convergence velocity and easily escaping suboptimal solutions. Moreover, the population of HDEA is initialized by chaos. In order to confirm the effectiveness of our algorithm, HDEA is applied to solve the typical numerical function minimization problems. The computational complexity of HDEA is analyzed, and the experimental results show that HDEA outperforms the DEA in the aspect of convergence velocity and precision, even the two algorithms have the similar time complexity.
The dynamical evolutionary algorithm (DEA) is a novel evolutionary computation technology, which is based on the theory of statistical mechanics. In this paper, an improved dynamical evolutionary algorithm (IDEA) with...
详细信息
ISBN:
(纸本)9780769539423
The dynamical evolutionary algorithm (DEA) is a novel evolutionary computation technology, which is based on the theory of statistical mechanics. In this paper, an improved dynamical evolutionary algorithm (IDEA) with multi-parent crossover and differential evolution mutation is proposed and IDEA is applied to estimate parameters for asymptotic regression model for the first time. In order to confirm performance of our algorithm, IDEA is verified on six groups of actual data and several sets of random sampling data, and then how sampling range and data with Gaussian noise influence on the performance of IDEA is considered. Experimental results show that IDEA is a stable, reliable and effective method in parameter estimation for asymptotic regression model and it's robust to noise.
In this paper, we proposed the Tracking dynamical evolutionary algorithm (TDEA) that can efficiently locate and track the optimal solution in a dynamically changing environment. In TDEA, the particle's structure i...
详细信息
ISBN:
(纸本)9780769536194
In this paper, we proposed the Tracking dynamical evolutionary algorithm (TDEA) that can efficiently locate and track the optimal solution in a dynamically changing environment. In TDEA, the particle's structure is different from traditional DEA. Each particle's knowledge is applied an "evaporation constant" to gradually weaken the knowledge's validity. Through this mechanism, the knowledge of each particle will be gradually updated in a dynamically changing environment. Compared with the traditional DEA, TDEA can quickly converge to the area of the goal and maintain the shortest distance from the goal.
A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionaryalgorithm and the two novel features are the u...
详细信息
A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is very different from the traditional evolutionaryalgorithm and the two novel features are the unique of selecting strategy and the determination of individuals that are selected to crossover and mutate. We use DEA to solve a lot of global optimization problems that are nonlinear, multimodal and multidimensional and obtain satisfactory results.
The dynamical evolutionary algorithm(DEA) is a new evolutionaryalgorithm based on the theory of statistical mechanics,however,DEA converges slowly and often converge at local optima for some function optimization ***...
详细信息
The dynamical evolutionary algorithm(DEA) is a new evolutionaryalgorithm based on the theory of statistical mechanics,however,DEA converges slowly and often converge at local optima for some function optimization *** this paper,a hybrid dynamical evolutionary algorithm(HDEA) with multi-parent crossover and differential evolution mutation is proposed for accelerating convergence velocity and easily escaping suboptimal ***,the population of HDEA is initialized by *** order to confirm the effectiveness of our algorithm,HDEA is applied to solve the typical numerical function minimization *** computational complexity of HDEA is analyzed,and the experimental results show that HDEA outperforms the DEA in the aspect of convergence velocity and precision,even the two algorithms have the similar time complexity.
In this paper, a new dynamical evolutionary algorithm is proposed based on principle of minimal free energy from the statistical mechanics. Also, a definition of the entropy of the particle system is
In this paper, a new dynamical evolutionary algorithm is proposed based on principle of minimal free energy from the statistical mechanics. Also, a definition of the entropy of the particle system is
暂无评论