نتایج جستجو برای: differential evolution de
تعداد نتایج: 2130058 فیلتر نتایج به سال:
This work details early research aimed at applying the powerful resource allocation mechanism deployed in Stochastic Diffusion Search (SDS) to the Differential Evolution (DE), effectively merging a nature inspired swarm intelligence algorithm with a biologically inspired evolutionary algorithm. The results reported herein suggest that the hybrid algorithm, exploiting information sharing between...
Target behaviours can be achieved by finding suitable parameters for Continuous Time Recurrent Neural Networks (CTRNNs) used as agent control systems. Differential Evolution (DE) has been deployed to search parameter space of CTRNNs and overcome granularity, boundedness and blocking limitations. In this paper we provide initial support for DE in the context of two sample learning problems.
This article is an extended abstract of a doctoral dissertation on chess evaluation function tuning with differential evolution (DE) algorithm. DE is adopted for efficient chess evaluation function tuning, extended with an opposition-based optimization and a new history mechanism. Experimental results show that the algorithm is efficient and can be applied to the chess evaluation function tunin...
Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces, and has been successfully used to solve several kinds of problems. In this paper, differential evolution is used for quantitative interpretation of self-potential data in geophysics. Six parameters are estimated including the elec...
Differential Evolution (DE) proved to be one of the most successful evolutionary algorithms for global optimization purposes in continuous problems. The core operator in DE is mutation which can provide the algorithm with both exploration and exploitation. In this article, a new notation for DE is proposed which has a formula that can be utilized for generating and extracting novel mutations an...
The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the ε level comparison, which compares search points based on the pair of objective value and constraint violation of them. We have proposed the ε constrained differential evolution εDE, which is the combination of the ε constrained...
the multivariate exponentially weighted moving average (mewma) control chart is one of the best statistical control chart that are usually used to detect simultaneous small deviations on the mean of more than one cross-correlated quality characteristics. the economic design of mewma control charts involves solving a combinatorial optimization model that is composed of a nonlinear cost function ...
The general purpose optimization method known as Differential Evolution (DE) has a number of parameters that determine its behaviour and efficacy in optimizing a given problem. This paper gives a list of good choices of parameters for various optimization scenarios which should help the practitioner achieve better results with little effort.
1 Differential Evolution Approach Using Chaotic Sequences Applied to Planning of Mobile Robot in a Static Environment with Obstacles Leandro dos Santos Coelho, Nadia Nedjah, Luiza de Macedo Mourelle . . . 3 1.
Differential evolution algorithm is a simple yet efficient metaheuristic for global optimization over continuous spaces. However, there is a shortcoming of premature convergence in standard DE, especially in DE/best/1/bin. In order to take advantage of direction guidance information of the best individual of DE/best/1/bin and avoid getting into local trap, based on multiple mutation strategies,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید