Browsing by Subject "genetic algorithms"

Now showing 1 - 20 of 20

Access status: Restricted ,
Algorytmy ewolucyjne w inwersji trójwymiarowych danych sejsmologicznych
(Data obrony: 2012-12-19) Kozimor, Adam
Wydział Geologii, Geofizyki i Ochrony Środowiska
This work presents a brief description of genetic algorithms and methods of determining the trajectory of seismic wave radius connecting two points. The application was created to solve the problem of three-dimensional inversion of seismic data. It thoroughly describes each application’s function. The module presentation of the results in the virtual world based on the Java3D technology was also created.
Access status: Restricted ,
Algorytmy genetyczne + struktury danych = programy ewolucyjne
(Wydawnictwa Naukowo-Techniczne, 2003) Michalewicz, Zbigniew
Access status: Restricted ,
Algorytmy genetyczne i ich zastosowania
(Wydawnictwa Naukowo-Techniczne, 2003) Goldberg, David E.
Access status: Open Access ,
An application of response surface method to design optimization of a model of rail vehicle considering uncertainties
(2011) Martowicz, Adam; Kurowski, Piotr; Uhl, Tadeusz; Lasko, Grzegorz
An application of design optimization methodology performed for a multibody model of real-live rail structure stands for the scope of present work. For carried out analyses a model of five-piece tram has been elaborated and then parameterized to allow for an effective and easy change of checked design configuration. There has been assumed the index of travelling comfort as an object of optimization process. Performed analyses have taken into account the uncertainty dealing with the number of passengers on board. The stiffness coefficients of springs of the primary and secondary suspension systems have been chosen as design parameters. Mentioned index has been calculated with virtually measured accelerations in the passengers area for assumed velocity of a run. For modeled rail there has been introduced roughness defined to represent real geometric imperfections. Response surface modeling based on polynomial regression has been applied as a surrogate for the full model to speed up the dynamic analyses. The work has used genetic algorithms for the optimization. Improved values of studied index confirm better comfort of traveling.
Access status: Open Access ,
An efficient approach for view selection for data warehouse using tree mining and evolutionary computation
(Wydawnictwa AGH, 2018) Thakare, Atul; Deshpande, Parag
The selection of a proper set of views to materialize plays an important role in database performance. There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. In this paper, we present a new efficient scalable method for view selection under the given storage constraints using a tree mining approach and evolutionary optimization. The tree mining algorithm is designed to determine the exact frequency of (sub)queries in the historical SQL dataset. The Query Cost model achieves the objective of maximizing the performance benefits from the final view set that is derived from the frequent view set given by the tree mining algorithm. The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. The experimental results show that the proposed method is successful in recommending a solution that is fairly close to an optimal solution.
Access status: Open Access ,
Building blocks propagation in quantum-inspired genetic algorithm
(Wydawnictwa AGH, 2010) Nowotniak, Robert; Kucharski, Jacek
This paper presents an analysis of building blocks propagation in Quantum-Inspired Genetic Algorithm, which belongs to a new class of metaheuristics drawing their inspiration from both biological evolution and unitary evolution of quantum systems. The expected number of quantum chromosomes matching a schema has been analyzed and a random variable corresponding to this issue has been introduced. The results have been compared with Simple Genetic Algorithm. Also, it has been presented how selected binary quantum chromosomes cover a domain of one-dimensional fitness function.
Access status: Open Access ,
Comparison of algorithms for simultaneous localization and mapping problem for mobile robot
(Wydawnictwa AGH, 2010) Jeżewski, Sławomir; Łaski, Maciej; Nowotniak, Robert
This paper presents a comparison of selected algorithms for simultaneous localization and mapping (SLAM) problem in mobile robotics. Results of four general metaheuristics, Simple Genetic Algorithm, Particle Swarm Optimization, Quantum-Inspired Genetic Algorithms and Genetic Algorithm with Quantum Probability Representation, have been compared to results of classical, analytic method in this field, Iterative Closes Points algorithm. In the experiments the same objective function, drawn from Iterative Closest Points algorithm, has been used. Two situations have been considered: local and global localization problems of mobile robot. Both problems are import and often critical for successful navigation of robot in environment.
Access status: Restricted ,
Frequency assignment in mobile networks and its practical implementation
(Data obrony: 2014-07-07) Więcek, Witold
Wydział Matematyki Stosowanej
Access status: Open Access ,
GPU-based massively parallel implementation of metaheuristic algorithms
(Wydawnictwa AGH, 2011) Nowotniak, Robert; Kucharski, Jacek
W artykule zostały przedstawione szczegóły implementacji kwantowo inspirowanego algorytmu genetycznego (QIGA) w środowisku obliczeń masowo równoległych na procesorach kart graficznych. W odróżnieniu od wielu dotychczasowych opracowań, prezentujących implementacje algorytmów ewolucyjnych w środowiskach obliczeń równoległych, w niniejszym artykule zostało zaproponowane nowatorskie podejście do implementacji algorytmu ewolucyjnego. Zrównoleglenie algorytmu zostało wykonane na dwóch poziomach: poszczególne osobniki w populacji lub poszczególne geny są przetwarzane przez osobne wątki w blokach, a w poszczególnych blokach przeprowadzany jest proces ewolucji populacji o tych samych lub różnych parametrach. Obliczenia zostały rozdzielone na osiem jednostek GPU, co pozwoliło na uzyskanie ponad 400-krotnego przyśpieszenia algorytmu w stosunku do sekwencyjnej implementacji w języku ANSI C na pojedynczym rdzeniu procesora Intel Core i7 2,93 GHz. Poprawność implementacji została zweryfikowana poprzez analizę statystyczną otrzymanych wyników. Zaproponowane podejście pozwala przyśpieszyć badanie dowolnych metaheurystyk przeszukiwania.
Access status: Restricted ,
Implementation and comparison of machine learning algorithms for selection of an optimal configuration parameter set for a video analytics in CCTV
(Data obrony: 2019-01-22) Król, Jakub
Wydział Informatyki, Elektroniki i Telekomunikacji
Access status: Restricted ,
Maximum independent set problem in graphs
(Data obrony: 2014-07-07) Wideł, Wojciech
Wydział Matematyki Stosowanej
Access status: Restricted ,
Modelowanie dwuwymiarowego ośrodka geologicznego z wykorzystaniem algorytmów genetycznych
(Data obrony: 2010-05-11) Mazgaj, Szymon
Wydział Geologii, Geofizyki i Ochrony Środowiska
Modeling of geological setting is difficult multidimensional optimalization problem. Analytic solution is possible to find for geological profiles consisting of regular-shaped elements. For more complex ones it’s only possible to find approximate solutions. This paper shows that even in complex cases genetic algorithm is able to find a good solution.
Access status: Open Access ,
Optimization of material distribution for forged automotive components using hybrid optimization techniques
(Wydawnictwa AGH, 2021) Sebastjan, Przemysław; Kuś, Wacław
The paper deals with the problem of optimal material distribution inside the provided design area. Optimization based on deterministic and stochastic algorithms is used to obtain the best result on the basis of the proposed objective function and constraints. The optimization of the shock absorber is used as an example of the described methods. One of the main difficulties addressed is the manufacturability of the optimized part intended for the forging process. Additionally, nonlinear buckling simulation with the use of the finite element method is used to solve the misuse case of shock absorber compression, where the shape of the optimized part has a key role in the total strength of the automotive damper. All of that, together with the required design precision, creates the nontrivial constrained optimization problem solved using the parametric, implicit geometry representation and a combination of stochastic and deterministic algorithms used with parallel design processing. Two methods of optimization are examined and compared in terms of the total amount of function calls, final design mass, and feasibility of the resultant design. Also, the amount of parameters used for the implicit geometry representation is greatly reduced compared to existing schemes presented in the literature. The problem addressed in this article is strongly inspired by the actual industrial example of the mass minimization process, but it is more focused on the actual manufacturability of the resultant component and admissible solving time. Commercially accessible software combined with authors' procedures is used to resolve the material distribution task, which makes the proposed method universal and easily adapted to other fields of the optimization of mechanical elements.
Access status: Restricted ,
Optymalizacja rozkładu zajęć katedry uniwersyteckiej z wykorzystaniem algorytmu genetycznego
(Data obrony: 2019-01-23) Pudełko, Radosław
Wydział Elektrotechniki, Automatyki, Informatyki i Inżynierii Biomedycznej
Access status: Restricted ,
Wykłady z algorytmów ewolucyjnych
(Wydawnictwa Naukowo-Techniczne, 2004) Arabas, Jarosław
Access status: Open Access ,
Zastosowanie algorytmów genetycznych do modelowania procesów przeróbki surowców mineralnych
(Wydawnictwa AGH, 2009) Gawenda, Tomasz; Niedoba, Tomasz; Przybycień, Krzysztof; Tumidajski, Tadeusz
The dynamic development of technical sciences and economical problems relied to it requires new, more appropriate and more precise researching methods and more detailed quantitative analyzes. There are many optimizing methods, which can be applied in analyzes if technological systems of mineral processing. Recently, the calculation methods based on the genetic algorithms were applied in purpose of designing, simulation and optimization of operation systems work effects. In the presented paper, this method was used to estimate coefficients of formulae describing hydrocyclone work on the basis of empirical results. It occurred that from the four presented approximation ways (estimation) of Plitt equation coefficients, the method of genetic algorithms was minimally the best. The application of genetic algorithms in simulation of devices and mineral processing systems is a very good solution if the applied heuristic models describe sufficiently well conditions and work effects of devices.
Access status: Open Access ,
Zastosowanie algorytmów genetycznych do optymalizacji modeli HMM
(2005) Szostek, Karol
W artykule przedstawiono metodę optymalizacji modeli HMM z wykorzystaniem algorytmu genetycznego. W celu zbadania skuteczności przedstawionego algorytmu genetycznego zostały przeprowadzone badania optymalizacji modeli HMM za pomocą algorytmu Bauma-Welcha oraz zaproponowanego algorytmu genetycznego. Dodatkowo w artykule zostały umieszczone wyniki z badań modelowania sygnału mowy w postaci przebiegów czasowych przez modele HMM optymalizowane algorytmem Bauma-Welcha.
Access status: Restricted ,
Zastosowanie algorytmu NEAT do sterowania w grze komputerowej
(Data obrony: 2017-01-19) Juraszek, Dominik
Wydział Elektrotechniki, Automatyki, Informatyki i Inżynierii Biomedycznej
Access status: Open Access ,
Zastosowanie kwantowych algorytmów genetycznych do selekcji cech
(Wydawnictwa AGH, 2009) Jopek, Łukasz; Nowotniak, Robert; Postolski, Michał; Babout, Laurent; Janaszewski, Marcin Sławomir
In the article a feature selection problem for k-NN classifier in image segmentation has been analyzed. Feature selection has been considered as a two criteria combinatorial optimization problem. An objective of optimization process was to find a feature subset of image points, allowing good quality of segmentation in satisfactory time. A fitness function for feature subsets has been proposed, taking into account time needed for calculation of feature values and quality of segmentation. Three population-based heuristic methods of optimization have been compared: simple genetic algorithm and its two modifications, inspired by principles of quantum computing: QiGA (Quantum-Inspired Genetic Algorithm) and GAQPR (Genetic Algorithm with Quantum Probability Representation). Results of experiments with artificial and tomography textures have been presented.
Access status: Open Access ,
Zastosowanie nowego operatora krzyżowania w rozwiązywaniu problemu gniazdowego z transportem
(Wydawnictwa AGH, 2007) Tyński, Adam
In the paper the new crossover quasi-operator MX utilizing path-relinking idea is presented. The operator has been embedded in the genetic algorithm used for heuristic solve the job-shop scheduling problem with transportation. In the mathematical model of the problem it is assumed, the assignment of transport activities to AGV vehicles is not given and constitutes an additional decision variable. As the optimization criterion the completion time of all jobs is assumed.