Temat: multi-objective - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Verified methods for computing Pareto sets: General algorithmic analysis
Autorzy:: G.-Tóth, B.
Kreinovich, V.
Powiązania:: https://bibliotekanauki.pl/articles/930124.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: optymalizacja wielocelowa
zbiór Pareto
multi-objective optimisation
Pareto set
verified computing
Opis:: In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set-a set of all possible solutions x which cannot be improved in all categories (i.e., for which fj (x') fj (x) for all j and fj(x') > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between, say, cost and durability. We extend the general results about (verified) algorithmic computability of maxima locations to show that Pareto sets can also be computed.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 369-380
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Evolutionary algorithms and fuzzy sets for discovering temporal rules
Autorzy:: Matthews, S. G.
Gongora, M. A.
Hopgood, A. A.
Powiązania:: https://bibliotekanauki.pl/articles/330148.pdf
Data publikacji:: 2013
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: fuzzy association rules
temporal association rules
multi objective evolutionary algorithm
reguła asocjacji rozmytej
wieloobiektowy algorytm ewolucyjny
Opis:: A novel method is presented for mining fuzzy association rules that have a temporal pattern. Our proposed method contributes towards discovering temporal patterns that could otherwise be lost from defining the membership functions before the mining process. The novelty of this research lies in exploring the composition of fuzzy and temporal association rules, and using a multi-objective evolutionary algorithm combined with iterative rule learning to mine many rules. Temporal patterns are augmented into a dataset to analyse the method’s ability in a controlled experiment. It is shown that the method is capable of discovering temporal patterns, and the effect of Boolean itemset support on the efficacy of discovering temporal fuzzy association rules is presented.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 855-868
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Evolutionary Multi-Objective Pareto Optimisation of Diagnostic State Observers
Autorzy:: Kowalczuk, Z.
Suchomski, P.
Białaszewski, T.
Powiązania:: https://bibliotekanauki.pl/articles/908280.pdf
Data publikacji:: 1999
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: diagnostyka
wyodrębnienie i wykrycie błędu
algorytm genetyczny
obserwator stanów
diagnostics
fault detection and isolation
genetic algorithms
multi-objective optimisation
Pareto optimality
residuals
state observers
Opis:: A multi-objective Pareto-optimisation procedure for the design of residual generators which constitute a primary instrument for model-based fault detection and isolation (FDI) in systems of plant monitoring and control is considered. An evolutionary approach to the underlying multi-objective optimisation problem is utilised. The resulting robust observer detector allows for FDI, taking into account the issue of false alarms.
Źródło:: International Journal of Applied Mathematics and Computer Science; 1999, 9, 3; 689-709
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Niching mechanisms in evolutionary computations
Autorzy:: Kowalczuk, Z.
Białaszewski, T.
Powiązania:: https://bibliotekanauki.pl/articles/908461.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: algorytm genetyczny
projektowanie inżynierskie
obliczenia ewolucyjne
obserwator detekcyjny
niching
ranking
Pareto optimality
genetic algorithms
evolutionary computations
multi-objective optimisation
solutions diversity
engineering designs
detection observers
Opis:: Different types of niching can be used in genetic algorithms (GAs) or evolutionary computations (ECs) to sustain the diversity of the sought optimal solutions and to increase the effectiveness of evolutionary multi-objective optimization solvers. In this paper four schemes of niching are proposed, which are also considered in two versions with respect to the method of invoking: a continuous realization and a periodic one. The characteristics of these mechanisms are discussed, while as their performance and effectiveness are analyzed by considering exemplary multi-objective optimization tasks both of a synthetic and an engineering (FDI) design nature.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2006, 16, 1; 59-84
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja