Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "genetic algorithms" wg kryterium: Wszystkie pola


Wyświetlanie 1-12 z 12
Tytuł:
Advances in parallel heterogeneous genetic algorithms for continuous optimization
Autorzy:
Alba, E.
Luna, F.
Nebro, A. J.
Powiązania:
https://bibliotekanauki.pl/articles/907622.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm genetyczny
optymalizacja ciągła
konwergencja przedwczesna
parallel genetic algorithms
continuous optimization
premature convergence
heterogeneity
Opis:
In this paper we address an extension of a very efficient genetic algorithm (GA) known as Hy3, a physical parallelization of the gradual distributed real-coded GA (GD-RCGA). This search model relies on a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimization by using crossover operators tuned to explore and exploit the solutions inside each subpopulation. We introduce here a further extension of Hy3, called Hy4, that uses 16 islands arranged in a hypercube of four dimensions. Thus, two new faces with different exploration/exploitation search capabilities are added to the search performed by Hy3. We analyze the importance of running a synchronous versus an asynchronous version of the models considered. The results indicate that the proposed Hy4 model overcomes the Hy3 performance because of its improved balance between exploration and exploitation that enhances the search. Finally, we also show that the async Hy4 model scales better than the sync one.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 317-333
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem
Autorzy:
Julstrom, B. A.
Powiązania:
https://bibliotekanauki.pl/articles/907639.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm ewolucyjny
algorytm genetyczny
kod Prüfera
evolutionary codings
leaf-constrained spanning trees
Prüfer strings
Blob Code
fixed-length subsets
Opis:
The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem illustrate these observations. Given a connected, weighted, undirected graph G with n vertices and a bound l, this problem seeks a spanning tree on G with at least l leaves and minimum weight among all such trees. A greedy heuristic for the problem begins with an unconstrained minimum spanning tree on G, then economically turns interior vertices into leaves until their number reaches l. One genetic algorithm encodes candidate trees with Prüfer strings decoded via the Blob Code. The second GA uses strings of length n - l that specify trees' interior vertices. Both GAs apply operators that generate only valid chromosomes. The latter represents and searches a much smaller space. In tests on 65 instances of the problem, both Euclidean and with weights chosen randomly, the Blob-Coded GA cannot compete with the greedy heuristic, but the subset-coded GA consistently identifies leaf-constrained spanning trees of lower weight than the greedy heuristic does, particularly on the random instances.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 385-396
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm for the maximum 2-packing set problem
Autorzy:
Trejo-Sánchez, Joel Antonio
Fajardo-Delgado, Daniel
Gutierrez-Garcia, J. Octavio
Powiązania:
https://bibliotekanauki.pl/articles/330154.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maximum 2-packing set
genetic algorithms
graph algorithms
algorytm genetyczny
algorytm grafowy
Opis:
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem. We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 173-184
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Designing a ship course controller by applying the adaptive backstepping method
Autorzy:
Witkowska, A.
Śmierzchalski, R.
Powiązania:
https://bibliotekanauki.pl/articles/331255.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
autopilot
sterowanie adaptacyjne
sterowanie nieliniowe
algorytm genetyczny
adaptive control
nonlinear control
backstepping
genetic algorithms
Opis:
The article discusses the problem of designing a proper and efficient adaptive course-keeping control system for a seagoing ship based on the adaptive backstepping method. The proposed controller in the design stage takes into account the dynamic properties of the steering gear and the full nonlinear static maneuvering characteristic. The adjustable parameters of the achieved nonlinear control structure were tuned up by using the genetic algorithm in order to optimize the system performance. A realistic full-scale simulation model of the B-481 type vessel including wave and wind effects was applied to simulate the control algorithm by using time domain analysis.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 985-997
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A backstepping approach to ship course control
Autorzy:
Witkowska, A.
Tomera, M.
Śmierzchalski, R.
Powiązania:
https://bibliotekanauki.pl/articles/911245.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sterowanie nieliniowe
algorytm genetyczny
sterowanie statkiem
funkcja Lapunowa
backstepping
nonlinear control
genetic algorithms
ship control
Lyapunov function
Opis:
As an object of course control, the ship is characterised by a nonlinear function describing static manoeuvring characteristics that reflect the steady-state relation between the rudder deflection and the rate of turn of the hull. One of the methods which can be used for designing a nonlinear ship course controller is the backstepping method. It is used here for designing two configurations of nonlinear controllers, which are then applied to ship course control. The parameters of the obtained nonlinear control structures are tuned to optimise the operation of the control system. The optimisation is performed using genetic algorithms. The quality of operation of the designed control algorithms is checked in simulation tests performed on the mathematical model of a tanker. In order to obtain reference results to be used for comparison with those recorded for nonlinear controllers designed using the backstepping method, a control system with the PD controller is examined as well.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 1; 73-85
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fusion Technology of Neural Networks and Fuzzy Systems: a Chronicled Progression from the Laboratory to Our Daily Lives
Autorzy:
Takagi, H.
Powiązania:
https://bibliotekanauki.pl/articles/911142.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć neuronowa
system rozmyty
algorytmy
cooperative models
neural networks
fuzzy systems
genetic algorithms
real world applications
overview
Opis:
We chronicle the research on the fusion technology of neural networks and fuzzy systems (NN+FS), the models that have been proposed from this research, and the commercial products and industrial systems that have adopted these models. First, we review the NN+FS research activity during the early stages of their development in Japan, the US, and Europe. Next, following the classifi- cation of NN+FS models, we show the ease of fusing these technologies based on the similarities of the data flow network structures and the non-linearity realization strategies of NNs and FSs. Then, we describe several models and applications of NN+FS. Finally, we introduce some important and recently developed NN+FS patents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 4; 647-673
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The island model as a Markov dynamic system
Autorzy:
Schaefer, R.
Byrski, A.
Smołka, M.
Powiązania:
https://bibliotekanauki.pl/articles/331253.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm genetyczny
analiza asymptotyczna
optymalizacja globalna
algorytm ewolucyjny równoległy
łańcuch Markova
genetic algorithms
asymptotic analysis
global optimization
parallel evolutionary algorithms
Markov chain modeling
Opis:
Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and their collaborators. An original and crucial feature of the framework we propose is the mechanism of inter-deme agent operation synchronization. It is important from both a practical and a theoretical point of view. We show that under a mild assumption the resulting Markov chain is ergodic and the sequence of the related sampling measures converges to some invariant measure. The asymptotic guarantee of success is also obtained as a simple issue of ergodicity. Moreover, if the cardinality of each island population grows to infinity, then the sequence of the limit invariant measures contains a weakly convergent subsequence. The formal description of the island model obtained for the case of solving a single-objective problem can also be extended to the multi-objective case.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 971-984
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
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ł
Tytuł:
Genetic and combinatorial algorithms for optimal sizing and placement of active power filters
Autorzy:
Maciążek, M.
Grabowski, D.
Pasko, M.
Powiązania:
https://bibliotekanauki.pl/articles/330809.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
power quality
optimization
active power filter
harmonics
genetic algorithm
combinatorial algorithm
jakość energii
energetyczny filtr aktywny
algorytm genetyczny
algorytm kombinatoryczny
Opis:
The paper deals with cost effective compensator placement and sizing. It becomes one of the most important problems in contemporary electrical networks, in which voltage and current waveform distortions increase year-by-year reaching or even exceeding limit values. The suppression of distortions could be carried out by means of three types of compensators, i.e., passive filters, active power filters and hybrid filters. So far, passive filters have been more popular mainly because of economic reasons, but active and hybrid filters have some advantages which should cause their wider application in the near future. Active power filter placement and sizing could be regarded as an optimization problem. A few objective functions have been proposed for this problem. In this paper we compare solutions obtained by means of combinatorial and genetic approaches. The theoretical discussion is followed by examples of active power filter placement and sizing.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 269-279
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparative and experimental study on gradient and genetic optimization algorithms for parameter identification of linear MIMO models of a drilling vessel
Autorzy:
Bańka, S.
Brasel, M.
Dworak, P.
Jaroszewski, K.
Powiązania:
https://bibliotekanauki.pl/articles/329756.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
MIMO dynamic plant
identification
nonlinear system
system MIMO
identyfikacja parametryczna
układ nieliniowy
Opis:
The paper presents algorithms for parameter identification of linear vessel models being in force for the current operating point of a ship. Advantages and disadvantages of gradient and genetic algorithms in identifying the model parameters are discussed. The study is supported by presentation of identification results for a nonlinear model of a drilling vessel.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 877-893
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion
Autorzy:
Wang, Wen
Chen, Xin
Musial, Jędrzej
Blazewicz, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/330022.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
late work minimization
unrelated machines
tabu search
genetic algorithm
minimalizacja opóźnienia
przeszukiwanie tabu
algorytm genetyczny
Opis:
A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuristic algorithms to solve it, namely, a tabu search (TS) and a genetic algorithm (GA), both of which are equipped with the techniques of initialization, iteration, as well as termination. The performances of the designed algorithms are verified through computational experiments, where we show that the GA can produce better solutions but with a higher time consumption. Moreover, we also analyze the influence of problem parameters on the performances of these metaheuristics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 573-584
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-12 z 12

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies