Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

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

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-15 z 242
Tytuł:
Genetic algorithms-aided reliability analysis
Autorzy:
Harnpornchai, N.
Powiązania:
https://bibliotekanauki.pl/articles/2069699.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
genetic algorithms
reliability analysis
simulation methods
complex systems
multiple failure modes
Opis:
A hybrid procedure of Genetic Algorithms (GAs) and reliability analysis is described, discussed, and summarized. The procedure is specifically referred to as a Genetic Algorithms-aided (GAs-aided) reliability analysis. Two classes of GAs, namely simple GAs and multimodal GAs, are introduced to solve a number of important problems in reliability analysis. The problems cover the determination of Point of Maximum Likelihood in failure domain (PML), the computation of failure probability using the GAs-determined PML, and the determination of multiple design points. The MCS-based method using the GAs-determined PML is specifically implemented in the so-called an Importance Sampling around PML (ISPML). The application of GAs to each respective problem is then demonstrated via numerical examples in order to clarify the procedures. With an aid from GAs, reliability analysis is possible even if there is no information about the geometry or landscape of limit state surfaces and the total number of crucial likelihood points. In addition, GAs significantly improve the computational efficiency and realize the analysis of rare events under constrained computational resources. The implementation of GAs to reliability analysis for building up the hybrid procedure is readily because of their algorithmic simplicity.
Źródło:
Journal of Polish Safety and Reliability Association; 2009, 1; 145--156
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms in fatigue crack detection
Autorzy:
Krawczuk, M.
Żak, A.
Ostachowicz, W.
Powiązania:
https://bibliotekanauki.pl/articles/279846.pdf
Data publikacji:
2001
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
fatigue crack detection
vibration methods
genetic algorithms
Opis:
This paper presents results identification of fatigue cracks in beams via genetic search technique and changes in natural frequencies. The location and size of the crack are determined by minimisation of an errorfunction involving the difference between the calculated and "measured" natural frequencies. The simulation studies indicate that the changes in the natural frequencies and genetic algorithm allows one to estimate the fatigue crack parameters (location and size) very accurately and fast.
Algorytmy genetyczne w detekcji pęknięć zmęczeniowych. W pracy przedstawiono wyniki identyfikacji położenia i wielkości pęknięć zmęczeniowych metodą algorytmów genetycznych z wykorzystaniem zmian częstości drgań własnych. Położenie i wielkość pęknięcia poszukiwano minimalizując funkcję celu wykorzystując różnice między częstościami mierzonymi i obliczanymi. Wyniki symulacji wskazują, że zmiany częstości drgań własnych i algorytm genetyczny pozwalają wyznaczać parametry pęknięcia zmęczeniowego (położenie i wielkość) szybko i dokładnie.
Źródło:
Journal of Theoretical and Applied Mechanics; 2001, 39, 4; 815-823
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic Algorithms Approach to Community Detection
Autorzy:
Mazur, P.
Zmarzłowski, K.
Orłowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/1538569.pdf
Data publikacji:
2010-04
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
89.65.Gh
89.65.Ef
02.50.-r
89.75.Fb
Opis:
The so-called community detection problem is investigated within a framework of graph theory. Genetic algorithms approach is applied to the task of identifying possible communities. Results obtained for two different fitness functions are presented and compared to each other.
Źródło:
Acta Physica Polonica A; 2010, 117, 4; 703-705
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic Algorithms for Positron Lifetime Data
Autorzy:
Karbowski, A.
Fisz, J.
Karwasz, G.
Kansy, J.
Brusa, R.
Powiązania:
https://bibliotekanauki.pl/articles/1812491.pdf
Data publikacji:
2008-05
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
71.60.+z
78.70.Bj
71.55.Cn
Opis:
Recently, genetic algorithms have been applied for ultrafast optical spectrometry in systems with several convoluted lifetimes. We apply these algorithms and compare the results with POSFIT (by Kirkegaard and Eldrup) and LT programme (by Kansy). The analysis was applied to three types of samples: molybdenum monocrystals, Czochralski-grown silicon with oxygen precipitates, Si with under-surface cavities obtained by He + H ion co- implantation. In all three tests, the genetic algorithm performs very well, in particular for short lifetimes. Further developments to model the resolution function in genetic algorithms are needed.
Źródło:
Acta Physica Polonica A; 2008, 113, 5; 1365-1372
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms in active vibration reduction problem
Autorzy:
Grochowina, Marcin
Tyburski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2202428.pdf
Data publikacji:
2022
Wydawca:
Politechnika Poznańska. Instytut Mechaniki Stosowanej
Tematy:
active vibration control
genetic algorithm
PID
aktywna kontrola drgań
algorytm genetyczny
Opis:
The design of active vibration reduction systems usually consists in selecting a control algorithm and determining the value of its settings. This article presents the results of research on the concept of using genetic algorithms to induce the settings of control systems. To test the concept, a simple pulse-excited flat bar model was selected. The vibrations were suppressed by the PID controller. Genetic algorithms with two types of crossover were tested - arithmetic and uniform. As a result, the settings for the PID controller were obtained, enabling effective reduction of vibrations in a short time.
Źródło:
Vibrations in Physical Systems; 2022, 33, 2; art. no. 2022219
0860-6897
Pojawia się w:
Vibrations in Physical Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive approaches to parameter control in genetic algorithms and genetic programming
Autorzy:
Spalek, J.
Gregor, M.
Powiązania:
https://bibliotekanauki.pl/articles/117900.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
adaptive approach
genetic algorithms
genetic programming
Opis:
The paper concerns the application of Genetic Algorithms and Genetic Programming to complex tasks such as automated design of control systems, where the space of solutions is non-trivial and may contain discontinuities. Several adaptive mechanisms for control of the search algorithm's parameters are proposed, investigated and compared to each other. It is shown that the proposed mechanisms are useful in preventing the search from getting trapped in local extremes of the fitness landscape.
Źródło:
Applied Computer Science; 2011, 7, 1; 38-56
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive switching of mutation rate for genetic algorithms and genetic programming
Autorzy:
Spalek, J.
Gregor, M.
Powiązania:
https://bibliotekanauki.pl/articles/118223.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
genetic algorithms
genetic programming
adaptive mechanism
Opis:
The paper concerns the application of Genetic Algorithms and Genetic Programming to complex tasks such as automated design of control systems, where the space of solutions is non-trivial and may contain discontinuities. An adaptive value-switching mechanism for mutation rate control is proposed. It is shown that the proposed mechanism is useful in preventing the search from getting trapped in local extremes of the fitness landscape.
Źródło:
Applied Computer Science; 2011, 7, 1; 30-37
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving the abstract planning problem using genetic algorithms
Autorzy:
Skaruz, J.
Niewiadomski, A.
Penczek, W.
Powiązania:
https://bibliotekanauki.pl/articles/93024.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
abstract planning
genetic algorithms
web service composition
Opis:
The paper presents a new approach based on genetic algorithms to the abstract planning problem, which is the first stage of the web service composition problem. An abstract plan is defined as an equivalence class of sequences of service types that satisfy a user query. Intuitively, two sequences are equivalent if they are composed of the same service types, but not necessarily occurring in the same order. The objective of our genetic algorithm (GA) is to return representatives of abstract plans without generating all the equivalent sequences. The paper presents experimental results compared with the results obtained from SMT-solver, which show that GA finds solutions for very large sets of service types in a reasonable time.
Źródło:
Studia Informatica : systems and information technology; 2013, 1-2(17); 29-48
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms in pseudorandom testing of medical digitalcircuits
Autorzy:
Chodacki, M.
Michalski, D.
Powiązania:
https://bibliotekanauki.pl/articles/333138.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
algorytmy genetyczne
urządzenia medyczne
symulacja układów cyfrowych
genetic algorithms
medical devices
simulation of digital circuits
pseudorandom testing
Opis:
In this paper the problem of unsatisfactory diagnostic efficiency of pseudorandom testing (PRT) technique used to detect faults of digital circuits in testing medical systems of critical importance is presented. The simulations have revealed a weakness of commonly used PRT technique that generally does not assure that all stuck at faults are detected. Thus, it is suggested that PRT technique should be supplemented with additional deterministic testing sequences to enhance fault detection. To design built-in selftesting (BIST) structures a genetic algorithm and digital system stochastic model were used. By employing the stochastic model it is possible to reduce considerably the computer simulation time required for BIST architecture design. In particular, an effect of proportional and ranking selections on the convergence of genetic algorithm in searching for a globally optimal solution, while maintaining the diversity of the population of individuals and limiting its premature stagnation.
Źródło:
Journal of Medical Informatics & Technologies; 2009, 13; 209-214
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of genetic algorithms to the traveling salesman problem
Autorzy:
Sikora, Tomasz
Gryglewicz-Kacerka, Wanda
Powiązania:
https://bibliotekanauki.pl/articles/30148246.pdf
Data publikacji:
2023
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
evolutionary algorithms
genetic algorithms
traveling salesman problem
TSP
Opis:
The purpose of this paper was to investigate in practice the possibility of using evolutionary algorithms to solve the traveling salesman problem on a real example. The goal was achieved by developing an original implementation of the evolutionary algorithm in Python, and by preparing an example of the traveling salesman problem in the form of a directed graph representing Polish voivodship cities. As part of the work an application in Python was written. It provides a user interface which allows to set selected parameters of the evolutionary algorithm and solve the prepared problem. The results are presented in both text and graphical form. The correctness of the evolutionary algorithm's operation and the implementation was confirmed by performed tests. A large number of tested solutions (2500) and the analysis of the obtained results allowed for a conclusion that an optimal (relatively suboptimal) solution was found.
Źródło:
Applied Computer Science; 2023, 19, 2; 55-62
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms and evolution strategies application for ship loading
Autorzy:
Olej, Vladimir.
Świątnicki, Zbigniew.
Powiązania:
Biuletyn Wojskowej Akademii Technicznej 2001, nr 2/3, s. 35-51
Data publikacji:
2001
Tematy:
Okręty załadunek
Sieci neuronowe zastosowanie
Algorytmy
Opis:
Wykorzystanie algorytmów genetycznych i strategii ewolucyjnych do załadunku okrętów.
Rys., tab.; Bibliogr.; Abstr., Rez., streszcz.
Dostawca treści:
Bibliografia CBW
Artykuł
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ł:
Optimization of slender systems by means of genetic algorithms
Autorzy:
Sokół, K.
Kulawik, A.
Powiązania:
https://bibliotekanauki.pl/articles/973636.pdf
Data publikacji:
2014
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
crack
genetic algorithm
optimization
slender system
pęknięcie
algorytm genetyczny
optymalizacja
układ smukły
Opis:
In this paper, the results of numerical studies on optimization of a geometrically nonlinear column with an internal crack by means of genetic algorithms are presented. The system is loaded by an axially applied external force P with a constant line of action. The presented problem is formulated on the basis of the principle of stationary total potential energy. The main purpose of this paper is to investigate an influence upon the localization of the crack and flexural rigidity ratio on critical loading of the system and to find an optimum localization of the crack in order to achieve high loading capacity. In order to calculate optimum values of these parameters the genetic algorithms are implemented into computer program. The artificial method of solution of the problem has been used due to the strongly nonlinear nature of the investigated problem.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 1; 115-124
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Genetic Algorithms in Design of Public Transport Network
Autorzy:
Lesiak, Piotr
Bojarczak, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/504669.pdf
Data publikacji:
2015
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
genetic algorithms
search methods
optimization
transportation problems
Opis:
The paper presents possibilities of application of genetic algorithms in design of public transport network. Transportation tasks such as determination of optimal routes and timetable for means of transport belong to difficult complex optimization problems, therefore they cannot be solved using traditional search algorithms. It turns out that genetic algorithms can be very useful to solve these transportation problem.
Źródło:
Logistics and Transport; 2015, 26, 2; 75-82
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 242

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