Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  mutation operator
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this paper, we propose a multi-operator differentia evolution variant that incorporates three diverse mutation strategies in MOEA/D. Instead of exploiting the local region, the proposed approach continues to search for optimal solutions in the entire objective space. It explicitly maintains diversity of the population by relying on the benefit of clustering. To promowe convergence, the solutions close to the ideal position, in the objective space are given preference in the evolutionary process. The core idea is to ensure diversity of the population by applying multiple mutation schemes and a faster convergence rate, giving preference to solutions based on their proximity to the ideal position in the MOEA/D paradigm. The performance of the proposed algorithm is evaluated by two popular test suites. The experimental results demonstrate that the proposed approach outperforms other MOEA/D algorithms.
EN
Evolutionary algorithms are one of the heuristic techniques used to solve task sequencing problems. An important example of such a problem is the issue of sequencing production tasks. The combinatorial optimization of task sequences allows the minimization of the cost or time of a set of production tasks by reducing the components of these values which are present in the transitions between tasks. This paper aims to analyze the influence of the production nature expressed by a set of production task parameters and a definition of the task transition cost on the effectiveness of the modification of the evolutionary algorithm based on new directed stochastic mutation operators. The research carried out included the influence of the space dimension of the task parameters, the number of levels of the value of the cost function, and a definition of this function. The results obtained allow us to assess the effectiveness of the directed mutation in task sequencing for productions of various natures.
EN
Considering the non-linear characteristics of the activation functions, the entire task is multidimensional and non-linear with a multimodal target function. Implementing evolutionary computing in the multimodal optimization tasks gives developers new and effective tools for seeking the global minimum. A developer has to find the optimal and simple transformation between the realization of a phenotype and a genotype. In the article, a two-layer neural network is analysed. In the first step, the population is created. In the main algorithm loop, a parent selection mechanism is used together with the fitness function. To evaluate the quality of evolutionary computing process different measured characteristics are used. The final results are depicted using charts and tables.
4
Content available Lévy flights in binary optimization
EN
There are many optimization heuristics which involves mutation operator. Reducing them to binary optimization allows to study properties of binary mutation operator. Modern heuristics yield from Lévy flights behavior, which is a bridge between local search and random shooting in binary space. The paper is oriented to statistical analysis of binary mutation with Lévy flight inside and Quantum Tunneling heuristics.
PL
W pracy rozważono alternatywną wobec reprezentacji binarnej reprezentację Hadamarda, w które] operuje się na liczbach +1 oraz -1. Wskazano pewne właściwości tak zdefiniowanej reprezentacji oraz wyrażono w niej operatory genetyczne krzyżowania i mutacji wraz z podaniem wzorów na indeksy potomnych elementów.
EN
Hadamard representation, an alternative representation to binary one is considered. Some properties of the Hadamard representation are shown. Crossover and mutation operators over Hadamard-coded genetic algorithm are expressed. Both of the operators work using indexes of the chromosomes instead of their contents.
PL
W artykule przedstawiono wpływ operatorów krzyżowania i mutacji na efektywność działania algorytmu genetycznego. Rozważono znaną funkcję testową, która została sparametryzowana. Dla różnych wartości współczynników ustalono najlepsze wartości prawdopodobieństw stosowania poszczególnych parametrów.
EN
In influence of operators of crossing and mutation in article was introduced on efficiency the working of genetic algorithm. It was examined four test functions differing with values of coefficients. The best values of probabilities of applying the individual parameters were established.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.