Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!

Znaleziono wyników: 3

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available A factor graph based genetic algorithm
EN
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems are provided as support for the mathematical analysis of the approach. The experiments show that FGGA is capable of learning linkages and solving the optimization problems in polynomial time with a polynomial number of evaluations.
2
Content available remote Study Actuality of Immune Optimization Algorithm
EN
In this paper, an optimization algorithm base immune principle is expatiated, explain its basic theory and process. And discuss immune algorithm’s advantage than other heuristic algorithms, such as: genetic algorithm and evolution strategy. And introduce several better algorithms base immune algorithm, present application in optimization problems. At last we propose immune algorithm’s further development in optimization problems’ application.
PL
W artykule przedstawiono algorytm optymalizacji oparty na układzie odpornościowym. Opisano podstawy teoretyczne i zasady działania. Dokonano porównania z innymi algorytmami heurystycznymi, jak genetyczny i ewolucyjny. Omówiono także potencjalne zastosowanie algorytmów bazujących na proponowanym rozwiązaniu.
EN
The paper considers an optimization problem in which the minima of a finite collection of objective functions satisfy some unilateral constraints and are linked together by a certain subdifferential relationship. The governing relations are stated as a variational inequality defined on a nonconvex feasible set. By the reduction to the variational inequality involving nonmonotone multivalued mapping, defined over nonnegative orthant, the existence of solutions is examined. The prototype is the general economic equilibrium problem. The exemplification of the theory for the quadratic multi-objective function is provided.
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ć.