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: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 174
Tytuł:
Genetic algorithm as a method of solving selected optimization problems
Autorzy:
Gil, J.
Powiązania:
https://bibliotekanauki.pl/articles/225536.pdf
Data publikacji:
2011
Wydawca:
Politechnika Warszawska. Wydział Geodezji i Kartografii
Tematy:
algorytmy genetyczne
genetic algorithms
Opis:
Genetic algorithms, which were created on the basis of observation and imitation of processes happening in living organisms, are used to solve optimisation tasks. The idea of genetic algorithms was presented by Holland, and they were developed and implemented for solving optimisation tasks by Goldberg. Choice of particular variables of the vector w = [w1, w2,…, w n ] in order to maximize or minimize a fitness function takes place as a result of a sequence of genetic operations in the form of selection, crossbreeding and mutation. The article describes the basic genetic (classic) algorithm including its components.
Źródło:
Reports on Geodesy; 2011, z. 1/90; 141-147
0867-3179
Pojawia się w:
Reports on Geodesy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Use of Genetic Algorithms for Searching Parameter Space in Gaussian Process Modeling
Autorzy:
Krok, A.
Powiązania:
https://bibliotekanauki.pl/articles/308239.pdf
Data publikacji:
2015
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Gaussian processes
genetic algorithms
Opis:
The aim of the paper is to present the possibilities of modeling the experimental data by Gaussian processes. Genetic algorithms are used for finding the Gaussian process parameters. Comparison of data modeling accuracy is made according to neural networks learned by Kalman filtering. Concrete hysteresis loops obtained by the experiment of cyclic loading are considered as the real data time series.
Źródło:
Journal of Telecommunications and Information Technology; 2015, 3; 58-63
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
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ł:
Distributed System for Power Quality Improvement
Autorzy:
Klempka, R.
Powiązania:
https://bibliotekanauki.pl/articles/262783.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
Tematy:
distributed system
power quality
genetic algorithms
Opis:
On the basis of the current trends for solving complex technical problems, a new concept of power quality improvement is proposed. It consists in creating a distributed system for supply conditions improvement in a given islanding power system, in e.g. geographical terms (with determined points of delivery), or as an internal installation system of an industrial consumer.
Źródło:
Electrical Power Quality and Utilisation. Journal; 2008, 14, 2; 53-68
1896-4672
Pojawia się w:
Electrical Power Quality and Utilisation. Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms in topological design of telecommunication networks
Autorzy:
Karaś, P.
Powiązania:
https://bibliotekanauki.pl/articles/307692.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
topological design
network optimisation
heuristic algorithms
genetic algorithms
Opis:
The paper addresses the generic topological network design problem and considers the use of various heuristic algorithms for solving the problem. The target of the optimisation is to determine a network structure and demand allocation pattern that would minimise the cost of the network, which is given by fixed installation costs of nodes and links and variable link capacity costs described bv linear or concave functions. Input data for the optimisation consists of a list of potential node and link locations and their costs and a set of demands defined between the nodes. Since the problem is known to be NP-hard. The use of specialised heuristic algorithms is proposed. The presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following ideas and methods: shifting of individual flows, local and global restoration of flows from chosen links or nodes, Yaged algorithm for finding local minima, Minoux greedy algorithm, simulated allocation and genetic algorithms. Efficiency of each of the proposed methods is tested on a set of numerical examples.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 73-82
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
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ł:
The application of genetic algorithm for warehouse location in logistic network
Autorzy:
Izdebski, M.
Jacyna-Gołda, I.
Wasiak, M.
Powiązania:
https://bibliotekanauki.pl/articles/241946.pdf
Data publikacji:
2016
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
warehouse location
genetic algorithms
logistics network
Opis:
The paper presents a certain approach to solving the problem of warehouse locations based on the application of a genetic algorithm. The main objective is to indicate a location of warehouses from among those that already exist, which are most likely to assure the best value of the adopted criterion function, concurrently meeting recipients’ needs. A formal notation was presented of the mathematical model, allowing for the indispensable data, decisionrelated variables of limitations and the criterion function. The problem is to determine the location of warehouses taking into account minimising costs of transport and storage of forwarded cargo between determined facilities within the network. To allow solving the problem related to warehouse location within the logistics network of a manufacturing enterprise the use of a genetic algorithm was proposed. The structure of the algorithm was adapted to the mathematical model. A genetic algorithm was used to determine the volume of cargo stream flows between particular facilities in the network. To form a genetic algorithm it is advisable to define the chromosome structure, the adaptation function, cross-linking process and mutation. The location problem is solved in such a way that if for any day within the analysed period flows take place from a given warehouse or to a given warehouse, such a logistics facility should constitute an element of the target logistics network. If there are no such flows, no warehouse is necessary in the given location.
Źródło:
Journal of KONES; 2016, 23, 3; 201-208
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
USING GENETIC ALGORITHM IN DYNAMIC MODEL OF SPECULATIVE ATTACK
Autorzy:
Gawrońska-Nowak, Bogna
Grabowski, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/517176.pdf
Data publikacji:
2016
Wydawca:
Instytut Badań Gospodarczych
Tematy:
currency crisis
dynamic model
genetic algorithms
Opis:
Evolution of speculative attack models shows certain progress in developing the idea of the role of expectations in the crisis mechanism. Obstfeld (1996) defines expectations as fully exogenous. Morris and Shin (1998) treat the expectations as endogenous (with respect to noise), not devoting too much attention to information structure of the foreign exchange market. Dynamic approach proposed by Angeletos, Hellwig and Pavan (2006) offers more sophisticated assumption about learning process. It tries to reflect time-variant and complex nature of information. However, this model ignores many important details like a Central Bank cost function. Genetic algorithm allows to avoid problems connected with incorporating information and expectations into agent decision-making process to an extent. There are some similarities between the evolution in Nature and currency market performance. In our paper an assumption about rational agent behaviour in the efficient market is criticised and we present our version of the dynamic model of a speculative attack, in which we use a genetic algorithm (GA) to define decision-making process of the currency market agents. The results of our simulation seem to be in line with the theory and intuition. An advantage of our model is that it reflects reality in a quite complex way, i.e. level of noise changes in time (decreasing), there are different states of fundamentals (with “more sensitive” upper part of the scale), the number of inflowing agents can be low or high (due to different globalization phases, different capital flow phases, different uncertainty levels).
Źródło:
Equilibrium. Quarterly Journal of Economics and Economic Policy; 2016, 11, 2; 287-306
1689-765X
2353-3293
Pojawia się w:
Equilibrium. Quarterly Journal of Economics and Economic Policy
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ł
Tytuł:
Rola algorytmów genetycznych w procesie optymalizacji wyznaczania tras przejazdu
The role of genetic algorithms in the process of optimization determining driving routes
Autorzy:
Gauda, K.
Powiązania:
https://bibliotekanauki.pl/articles/313849.pdf
Data publikacji:
2016
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
algorytmy genetyczne
optymalizacja
transport
genetic algorithms
optimization
Opis:
Problematyka artykułu dotyczy możliwości wykorzystania algorytmów genetycznych w procesie optymalizacji wyznaczania tras przejazdu. Opisana jest idea algorytmów genetycznych oraz zasada ich działania. Ukazany jest także przebieg wyznaczania optymalnej trasy z wykorzystaniem aplikacji Visual Genetic.
The problem of the article concerns the possibility of using genetic algorithms in the optimization process of determining driving routes. Described is the idea of genetic algorithms and the principle their activities. Shown is also the process of optimizing exemplary route with the use of Visual Genetic application.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2016, 17, 11; 54-57
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
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ł:
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ł:
Application of genetic algorithms for the estimation of hydraulic conductivity
Autorzy:
Bartlewska-Urban, M.
Strzelecki, T.
Powiązania:
https://bibliotekanauki.pl/articles/178471.pdf
Data publikacji:
2018
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
genetic algorithms
hydraulic conductivity
Biot consolidation model
Opis:
In the study described here model calibration was performed employing the inverse analysis using genetic algorithms (GA). The objective of analysis is to determine value of the coefficient of hydraulic conductivity, k. The commonly used method for the determination of coefficient of hydraulic conductivity based on Terzaghi consolidation leads to an underestimation of the value of k as the Terzaghi model does not take into account the deformation of soil skeleton. Here, an alternative methodology based on genetic algorithms is presented for the determination of the basic parameters of Biot consolidation model. It has been demonstrated that genetic algorithms are a highly effective tool enabling automatic calibration based on simple rules. The values of the coefficient of hydraulic conductivity obtained with GA are of at least one order smaller than values obtained with the Terzaghi model.
Źródło:
Studia Geotechnica et Mechanica; 2018, 40, 2; 140-146
0137-6365
2083-831X
Pojawia się w:
Studia Geotechnica et Mechanica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic tuning fuzzy dempster-shafer decision rules
Autorzy:
Walijewski, J. S.
Sosnowski, Z. A.
Powiązania:
https://bibliotekanauki.pl/articles/1931591.pdf
Data publikacji:
2002
Wydawca:
Politechnika Gdańska
Tematy:
genetic algorithms
fuzzy modelling
Dempster-Shafer theory
Opis:
The objective of this paper is to employ the Dempster-Shafer theory (DST) as a vehicle supporting the generation of fuzzy decision rules. The concept of fuzzy granulation realized via fuzzy clustering is aimed at the discretization of continuous attributes. Next we use Genetic for tuning fuzzy decision rules. Detailed experimental studies are presented concerning well-known medical data sets available on the Web.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 4; 631-640
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 174

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