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-50 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ł
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ł:
Algorytmy genetyczne w problemach optymalizacji
Genetic algorithms in optimization problems
Autorzy:
Rutczyńska-Wdowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/250078.pdf
Data publikacji:
2015
Wydawca:
Instytut Naukowo-Wydawniczy TTS
Tematy:
algorytm genetyczny
optymalizacja
funkcja Goldsteina-Price'a
genetic algorithm
optimization
Goldstein-Price function
Opis:
W pracy analizowano skuteczność i uniwersalność stosowania algorytmów genetycznych w wybranych zagadnieniach optymalizacji. Zaimplementowano algorytm genetyczny dla problemu minimalizacji złożonych, trudnych do optymalizacji funkcji Goldsteina-Price'a i funkcji grzbietu wielbłąda sześciogarbnego. Próbowano odpowiedzieć na pytanie, gdzie można stosować omawianą metodę sztucznej inteligencji, a gdzie lepiej zastosować metody klasyczne.
In this work the efficiency and universality of the use of genetic algorithms in selected issues of optimization was analyzed. Genetic algorithm for minimization of Goldstein-Price's function and function of back of camel was implemented. In this work was attempted to answer the question, where can apply this method of artificial intelligence, and where better to use classical methods.
Źródło:
TTS Technika Transportu Szynowego; 2015, 12; 1324-1326, CD
1232-3829
2543-5728
Pojawia się w:
TTS Technika Transportu Szynowego
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytmy genetyczne i ich zastosowania
Genetic algorithms and their applications
Autorzy:
Winiczenko, R.
Powiązania:
https://bibliotekanauki.pl/articles/228899.pdf
Data publikacji:
2008
Wydawca:
Wyższa Szkoła Menedżerska w Warszawie
Opis:
W artykule przedstawiono ogólną zasadę działania algorytmów genetycznych i ich zastosowanie w niektórych gałęziach inżynierii produkcji. Prostota działania algorytmów genetycznych i ich naturalność sprawiły, że stały się obiecującą metodą rozwiązań trudnych problemów technologicznych. Obecnie zastosowanie algorytmów genetycznych jest imponujące. Stosowane są bowiem w szeregowaniu zadań, modelowaniu finansowym, optymalizacji czy harmonogramowaniu. Algorytmy genetyczne zdobywają coraz szersze obszary zastosowań w środowiskach naukowych, inżynierskich i w kręgach biznesu. Przyczyna jest oczywista: algorytmy genetyczne stanowią nieskomplikowane, a przy tym potężne narzędzie poszukiwań lepszych rozwiązań.
The paper presents a general principle of genetic algorithms operation and their application in production. The genetic algorithms have more and more applications in scientific, engineering and management fields. The reason of this popularity is quite obvious: the genetic algorithms are simple, but also powerful tool for searching of better results. GA are biologically inspired search procedures that have been used to solve different NP-hard problems. They try to extract ideas from a natural system, in particular the natural evolution in order to develop computational tools for solving engineering problems.
Źródło:
Postępy Techniki Przetwórstwa Spożywczego; 2008, 1; 107-110
0867-793X
2719-3691
Pojawia się w:
Postępy Techniki Przetwórstwa Spożywczego
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytmy genetyczne w logistyce zaopatrzenia
Genetic algorithms in logistics of supplies
Autorzy:
Rojek, K.
Powiązania:
https://bibliotekanauki.pl/articles/313952.pdf
Data publikacji:
2017
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
algorytm genetyczny
łańcuch dostaw
logistyka
genetic algorithm
supply chain
logistics
Opis:
W artykule przedstawiono zasady działania algorytmów genetycznych oraz wskazano sfery ich zastosowania w obszarze kształtowania łańcucha dostaw. Dokonano również charakterystyki wybranych problemów decyzyjnych w logistyce zaopatrzenia. Skupiono się przede wszystkim na metodach wyboru dostawców.
Partner selection is an important issue in the supply chain management. The paper presents decision-making areas in logistic including supply-chain management and logistics processes in enterprise management. Presents also selected decision problems in the management of supply processes. Presented identifying supply needs using ABC/XYZ methods, using multi-objective partner selection and effect and the possibility of the use of GE in logistics.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2017, 18, 1-2; 53-58
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of Job Shop Scheduling Problem by Genetic Algorithms: Case Study
Autorzy:
Sahar, Habbadi
Herrou, Brahim
Sekkat, Souhail
Powiązania:
https://bibliotekanauki.pl/articles/24200523.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
optimization
metaheuristics
scheduling
job shop scheduling problem
genetic algorithms
simulation
Opis:
The Job Shop scheduling problem is widely used in industry and has been the subject of study by several researchers with the aim of optimizing work sequences. This case study provides an overview of genetic algorithms, which have great potential for solving this type of combinatorial problem. The method will be applied manually during this study to understand the procedure and process of executing programs based on genetic algorithms. This problem requires strong decision analysis throughout the process due to the numerous choices and allocations of jobs to machines at specific times, in a specific order, and over a given duration. This operation is carried out at the operational level, and research must find an intelligent method to identify the best and most optimal combination. This article presents genetic algorithms in detail to explain their usage and to understand the compilation method of an intelligent program based on genetic algorithms. By the end of the article, the genetic algorithm method will have proven its performance in the search for the optimal solution to achieve the most optimal job sequence scenario.
Źródło:
Management and Production Engineering Review; 2023, 14, 3; 44--56
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms based approach for transhipment hub location in urban areas
Autorzy:
Szczepański, E.
Jacyna-Gołda, I.
Murawski, J.
Powiązania:
https://bibliotekanauki.pl/articles/224003.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
supply chain optimization
genetic algorithm
multi-level distribution system
facilities location problem
Vehicle Routing Problem - VRP
optymalizacja
łańcuch dostaw
algorytm genetyczny
dystrybucja wielopoziomowa
lokalizacja obiektów
Opis:
Points of distribution, sales or service are important elements of the supply chain. These are the final elements which are responsible for proper functioning of the whole cargo distribution process. Proper location of these points in the transport network is essential to ensure the effectiveness and reliability of the supply chain. The location of these points is very important also from the consumers point of view. In this paper developed method of points location was present on the example of urban transport network. The developed approach is based on the Vehicle Routing Problem in the multistage distribution systems. The proposed method uses a genetic algorithm. Article also presents a mathematical model of delivery cost as a criterion function. The article presents an example calculations which illustrating the operation of the developed method.
Źródło:
Archives of Transport; 2014, 31, 3; 73-82
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective optimization of multipass turning machining process using the Genetic Algorithms solution
Autorzy:
Amiolemhen, Patrick Ejebheare
Eseigbe, Joshua Ahurome
Powiązania:
https://bibliotekanauki.pl/articles/95335.pdf
Data publikacji:
2019
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
turning process
genetic algorithms
minimum production cost
minimum production time
single-objective model
multi-objective model
toczenie
proces toczenia
algorytmy genetyczne
minimalny koszt produkcji
minimalny czas produkcji
model wielokryterialny
Opis:
The study involves the development of multi-objective optimization model for turning machining process. This model was developed using a GA - based weighted-sum of minimum production cost and time criteria of multipass turning machining process subject to relevant technological/practical constraints. The results of the single-objective machining process optimization models for the multipass turning machining process when compared with those of multi-objective machining process model yielded the minimum production cost and minimum production time as $5.775 and 8.320 min respectively (and the corresponding production time and production cost as 12.996 min and $6.992, respectively), while those of the multi-objective machining process optimization model were $5.841and 9.097 min. Thus, the multi-objective machining process optimization model performed better than each of the single-objective model for the two criteria of minimum production cost and minimum production time respectively. The results also show that minimum production time model performs better than the minimum production cost model. For the example considered, the multi-objective model gave a lower production time of 30.0% than the corresponding production time obtained from the minimum production cost model, while it gave a lower production cost of 16.46% than the corresponding cost obtained by the minimum production time model.
Źródło:
Journal of Mechanical and Energy Engineering; 2019, 3, 2; 97-108
2544-0780
2544-1671
Pojawia się w:
Journal of Mechanical and Energy Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-strategy navigation for a mobile data acquisition platform using genetic algorithms
Autorzy:
Halal, F.
Zaremba, M. B.
Powiązania:
https://bibliotekanauki.pl/articles/950950.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
genetic algorithms
path planning
monitoring system
remote sensing
navigation control
heuristic search
Opis:
Monitoring of biological and chemical pollutants in large bodies of water requires the acquisition of a large number of in-situ measurements by a mobile sensor platform. Critical to this problem is an efficient path planning method, easily adaptable to different control strategies that ensure the collection of data of the greatest value. This paper proposes a deliberative path planning algorithm, which features the use of waypoints for a ship navigation trajectory that are generated by Genetic Algorithm (GA) based procedures. The global search abilities of Genetic Algorithms are combined with the heuristic local search in order to implement a navigation behaviour suitable to the required data collection strategy. The adaptive search system operates on multi-layer maps generated from remote sensing data, and provides the capacity for dealing with multiple classes of water pollutants. A suitable objective function was proposed to handle different sampling strategies for the collection of samples from multiple water pollutant classes. A region-of-interest (ROI) component was introduced to deal effectively with the large scale of search environments by pushing the search towards ROI zones. This resulted in the reduction of the search time and the computing cost, as well as good convergence to an optimal solution. The global path planning performance was further improved by multipoint crossover operators running in each GA generation. The system was developed and tested for inland water monitoring and trajectory planning of a mobile sample acquisition platform using commercially available satellite data.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 1; 30-41
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms for classifiers training sets optimisation applied to human face recognition
Autorzy:
Kawulok, M.
Powiązania:
https://bibliotekanauki.pl/articles/333826.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
maszyna wektorów nośnych
algorytmy genetyczne
rozpoznawanie twarzy człowieka
support vector machines
genetic algorithms
human face recognition
Opis:
Human face recognition is a multi-stage process within which many classification problems must be solved. This is performed by learning machines which elaborate classification rules based on a given training set. Therefore, one of the most important issues is selection of a training set which would properly represent the data that will be further classified. This paper presents an approach which utilizes genetic algorithms for selecting classifiers' training sets. This approach was implemented for the Support Vector Machines which is applied in two areas of automatic human face recognition: face verification and feature vectors comparison. Effectiveness of the presented concept was confirmed with appropriate experiments which results are described in this paper.
Źródło:
Journal of Medical Informatics & Technologies; 2007, 11; 135-143
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms solution to the single-objective machining process optimization time model
Autorzy:
Amiolemhen, Patrick
Eseigbe, Joshua
Powiązania:
https://bibliotekanauki.pl/articles/95251.pdf
Data publikacji:
2019
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
production time
optimization
machining model
genetic algorithms
development
czas produkcji
optymalizacja
obróbka
algorytmy genetyczne
rozwój
Opis:
Minimum Production Time model of the machining process optimization problem comprising seven lathe machining operations were developed using Genetic Algorithms solution method. The various cost and time components involved in the minimum production cost and minimum production time criteria respectively, as well as all relevant technological/practical constraints were determined. An interactive, user-friendly computer package was then developed in Microsoft Visual Basic.Net environment to implement the developed models. The package was used to determine optimal machining parameters of cutting speed, feed rate and depth of cut for the seven machining operations with twenty-three technological constraints in the conversion of a cylindrical metal bar stock into a finished machined profile. The result of the single-objective machining process optimization models shows that the minimum production time is 21.84 min.
Źródło:
Journal of Mechanical and Energy Engineering; 2019, 3, 1; 13-23
2544-0780
2544-1671
Pojawia się w:
Journal of Mechanical and Energy Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-criteria human resources planning optimisation using genetic algorithms enhanced with MCDA
Autorzy:
Jurczak, Marcin
Miebs, Grzegorz
Bachorz, Rafał A.
Powiązania:
https://bibliotekanauki.pl/articles/2204085.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
mathematical optimisation
multi-criteria optimisation
scheduling
job shop problem
MCDA
Opis:
The main objective of this paper is to present an example of the IT system implementation with advanced mathematical optimisation for job scheduling. The proposed genetic procedure leads to the Pareto front, and the application of the multiple criteria decision aiding (MCDA) approach allows extraction of the final solution. Definition of the key performance indicator (KPI), reflecting relevant features of the solutions, and the efficiency of the genetic procedure provide the Pareto front comprising the representative set of feasible solutions. The application of chosen MCDA, namely elimination et choix traduisant la réalité (ELECTRE) method, allows for the elicitation of the decision maker (DM) preferences and subsequently leads to the final solution. This solution fulfils all of the DM expectations and constitutes the best trade-off between considered KPIs. The proposed method is an efficient combination of genetic optimisation and the MCDA method.
Źródło:
Operations Research and Decisions; 2022, 32, 4; 57--74
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
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ł:
Modelling of the blood sugar level with the use of genetic algorithms
Autorzy:
Kamiński, M.
Kotas, R.
Marciniak, P.
Sałata, M.
Powiązania:
https://bibliotekanauki.pl/articles/397754.pdf
Data publikacji:
2016
Wydawca:
Politechnika Łódzka. Wydział Mikroelektroniki i Informatyki
Tematy:
glucose
glucose-insulin system
diabetes
blood glucose monitoring
glukoza
układ regulujący poziom glukozy
cukrzyca
monitorowanie poziomu glukozy we krwi
Opis:
This paper presents an example model of human body with particular focus on glucose level modeling designed for type 1 diabetes. The first part of the work describes motivation of the research, necessary simplifications of the model, parameters identification methods and implementation method. The second part is focused on an example examinations based on preliminary database of patients. It contains verification and evaluation of the presented model and plans of future work.
Źródło:
International Journal of Microelectronics and Computer Science; 2016, 7, 3; 92-99
2080-8755
2353-9607
Pojawia się w:
International Journal of Microelectronics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative Study of Particle Swarm Optimization and Genetic Algorithms for Complex Mathematical Functions
Autorzy:
Valdez, F.
Melin, P.
Powiązania:
https://bibliotekanauki.pl/articles/384575.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
genetic algorithms
particle swarm optimization (PSO)
hybrid systems
optimization
Opis:
The Particle Swarm Optimization (PSO) and the Genetic Algorithms (GA) have been used successfully in solving problems of optimization with continuous and combinatorial search spaces. In this paper the results of the application of PSO and GAs for the optimization of mathematical functions are presented. These two methodologies have been implemented with the goal of making a comparison of their performance in solving complex optimization problems. This paper describes a comparison between a GA and PSO for the optimization of complex mathematical functions.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 43-51
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Supplementary crossover operator for genetic algorithms based on the center-of-gravity paradigm
Autorzy:
Angelov, P.
Powiązania:
https://bibliotekanauki.pl/articles/205842.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
mutacja
środek bezwładności
center of gravity
crossover
genetic algorithms
mutation
selection operators
Opis:
A supplementary crossover operator for genetic algorithms (GA) is proposed in the paper. It performs specific breeding between the two fittest parental chromosomes. The new child chromosome is based on the center of gravity (CoG) paradigm, taking into account both the parental weights (measured by their fitness) and their actual value. It is designed to be used in combination with other crossover and mutation operators (it applies to the best fitted two parental chromosomes only) both in binary and real-valued (evolutionary) GA. Analytical proof of its ability to improve the result is provided for the simplest case of one variable and when the elitist selection strategy is used. The new operator is validated with a number of usually used numerical test functions as well as with a practical example of supply air temperature and flow rate scheduling in a hollow core ventilated slab thermal storage system. The tests indicate that it improves results (the speed of convergence as well as the final result) without a significant increase in computational expenses.
Źródło:
Control and Cybernetics; 2001, 30, 2; 159-176
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid Mesh Adaptive Direct Search and Genetic Algorithms Techniques for industrial production systems
Autorzy:
Vasant, P.
Powiązania:
https://bibliotekanauki.pl/articles/229988.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
mesh adaptive direct search
genetic algorithms
fitness function
degree of possibility
level of satisfaction
Opis:
In this paper, computational and simulation results are presented for the performance of the fitness function, decision variables and CPU time of the proposed hybridization method of Mesh Adaptive Direct Search (MADS) and Genetic Algorithm (GA). MADS is a class of direct search of algorithms for nonlinear optimization. The MADS algorithm is a modification of the Pattern Search (PS) algorithm. The algorithms differ in how the set of points forming the mesh is computed. The PS algorithm uses fixed direction vectors, whereas the MADS algorithm uses random selection of vectors to define the mesh. A key advantage of MADS over PS is that local exploration of the space of variables is not restricted to a finite number of directions (poll directions). This is the primary drawback of PS algorithms, and therefore the main motivation in using MADS to solve the industrial production planning problem is to overcome this restriction. A thorough investigation on hybrid MADS and GA is performed for the quality of the best fitness function, decision variables and computational CPU time.
Źródło:
Archives of Control Sciences; 2011, 21, 3; 299-312
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reducing transfer costs of fragments allocation in replicated distributed database using genetic algorithms
Autorzy:
Sourati, N. K
Ramezni, F
Powiązania:
https://bibliotekanauki.pl/articles/102446.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
distributed database
genetic algorithms
communication costs
GA
data segmentation
Fitness
Crossover
node
fragment data
Opis:
Distributed databases were developed in order to respond to the needs of distributed computing. Unlike traditional database systems, distributed database systems are a set of nodes that are connected with each other by network and each of nodes has its own database, but they are available by other systems. Thus, each node can have access to all data on entire network. The main objective of allocated algorithms is to attribute fragments to various nodes in order to reduce the shipping cost. Thus, firstly fragments of nodes must be accessible by all nodes in each period, secondly, the transmission cost of fragments to nodes must be reduced and thirdly, the cost of updating all components of nodes must be optimized, that results in increased reliability and availability of network. In this study, more efficient hybrid algorithm can be produced combining genetic algorithms and previous algorithms.
Źródło:
Advances in Science and Technology. Research Journal; 2015, 9, 25; 1-6
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów genetycznych w problemie diety
Applications of genetic algorithms in diet problem
Autorzy:
Winiczenko, R.
Powiązania:
https://bibliotekanauki.pl/articles/228987.pdf
Data publikacji:
2008
Wydawca:
Wyższa Szkoła Menedżerska w Warszawie
Opis:
Prostota działania algorytmów genetycznych i ich naturalność sprawiły, że stały się one obiecującą metodą rozwiązań wielu problemów technologicznych. Obecnie zastosowanie algorytmów genetycznych jest imponujące, stosowane są one bowiem w podejmowaniu decyzji, minimalizacji kosztów, modelowaniu finansowym, optymalizacji czy planowaniu produkcji. W niniejszym artykule przedstawiono ogólną zasadę działania algorytmów genetycznych i ich zastosowanie w problemie diety.
The genetic algorithms have more and more applications in scientific, engineering and management fields [2, 6, 9]. The reason of this popularity is quite obvious: the genetic algorithms are simple, but also powerful tool for searching of better results. Genetic algorithms are biologically inspired search procedures that have been used to solve different problems. They try to extract ideas from a natural system, in particular the i natural evolution, in order to develop computational tools for solving engineering problems. The paper presents a general principle of genetic algorithms operation and their application in diet problem.
Źródło:
Postępy Techniki Przetwórstwa Spożywczego; 2008, 2; 131-135
0867-793X
2719-3691
Pojawia się w:
Postępy Techniki Przetwórstwa Spożywczego
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A strategy in sports betting with the nearest neighbours search and genetic algorithms
Autorzy:
Borycki, D.
Powiązania:
https://bibliotekanauki.pl/articles/106184.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
sports betting
nearest neighbour search
genetic algorithm
English Premier League
Opis:
The point of sports betting is not merely to correctly predict the outcome of a game, but to actually win on a bet. We propose a model of sports betting that uses the nearest neighbours search and genetic algorithms to do the job. It uses data on the teams playing, their respective formations, individual players, results of previous games, as well as odds offered by bookmakers. The model has been trained using the data from the seasons 2002/03 until 2008/09 of the English Premier League and tested against the already played games of the seasons 2009/10 and 2010/11.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 7-13
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning from heterogeneously distributed data sets using artificial neural networks and genetic algorithms
Autorzy:
Peteiro-Barral, D.
Guijarro-Berdiñas, B.
Pérez-Sánchez, B.
Powiązania:
https://bibliotekanauki.pl/articles/91888.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
artificial neural networks
genetic algorithm
Devonet algorithm
Opis:
It is a fact that traditional algorithms cannot look at a very large data set and plausibly find a good solution with reasonable requirements of computation (memory, time and communications). In this situation, distributed learning seems to be a promising line of research. It represents a natural manner for scaling up algorithms inasmuch as an increase of the amount of data can be compensated by an increase of the number of distributed locations in which the data is processed. Our contribution in this field is the algorithm Devonet, based on neural networks and genetic algorithms. It achieves fairly good performance but several limitations were reported in connection with its degradation in accuracy when working with heterogeneous data, i.e. the distribution of data is different among the locations. In this paper, we take into account this heterogeneity in order to propose several improvements of the algorithm, based on distributing the computation of the genetic algorithm. Results show a significative improvement of the performance of Devonet in terms of accuracy.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 5-20
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computational Methods for Two-Level 0-1 Programming Problems through Distributed Genetic Algorithms
Autorzy:
Niwa, K.
Hayashida, T.
Sakawa, M.
Powiązania:
https://bibliotekanauki.pl/articles/309162.pdf
Data publikacji:
2010
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
distributed genetic algorithm
Stackelberg solution
two-level 0-1 programming problem
Opis:
In this paper, we consider a two-level 0-1 programming problem in which there is not coordination between the decision maker (DM) at the upper level and the decision maker at the lower level. We propose a revised computational method that solves problems related to computational methods for obtaining the Stackelberg solution. Specifically, in order to improve the computational accuracy of approximate Stakelberg solutions and shorten the computational time of a computational method implementing a genetic algorithm (GA) proposed by the authors, a distributed genetic algorithm is introduced with respect to the upper level GA, which handles decision variables for the upper level DM. Parallelization of the lower level GA is also performed along with parallelization of the upper level GA. The proposed algorithm is also improved in order to eliminate unnecessary computation during operation of the lower level GA, which handles decision variables for the lower level DM. In order to verify the effectiveness of the proposed method, we propose comparisons with existing methods by performing numerical experiments to verify both the accuracy of the solution and the time required for the computation.
Źródło:
Journal of Telecommunications and Information Technology; 2010, 2; 78-87
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parameters identification of the flexible fin kinematics model using vision and Genetic Algorithms
Autorzy:
Jurczyk, Karolina
Piskur, Paweł
Szymak, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/259505.pdf
Data publikacji:
2020
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
Biomimetic Underwater Vehicle
flexible fin kinematics model
parameters identification using vision
Genetic Algorithm
Opis:
Recently a new type of autonomous underwater vehicle uses artificial fins to imitate the movements of marine animals, e.g. fish. These vehicles are biomimetic and their driving system is an undulating propulsion. There are two main methods of reproducing undulating motion. The first method uses a flexible tail fin, which is connected to a rigid hull by a movable axis. The second method is based on the synchronised operation of several mechanical joints to imitate the tail movement that can be observed among real marine animals such as fish. This paper will examine the first method of reproducing tail fin movement. The goal of the research presented in the paper is to identify the parameters of the one-piece flexible fin kinematics model. The model needs further analysis, e.g. using it with Computational Fluid Dynamics (CFD) in order to select the most suitable prototype for a Biomimetic Underwater Vehicle (BUV). The background of the work is explained in the first section of the paper and the kinematic model for the flexible fin is described in the next section. The following section is entitled Materials and Methods, and includes a description of a laboratory test of a water tunnel, a description of a Vision Algorithm (VA)which was used to determine the positions of the fin, and a Genetic Algorithm (GA) which was used to find the parameters of the kinematic fin. In the next section, the results of the research are presented and discussed. At the end of the paper, the summary including main conclusions and a schedule of the future research is inserted.
Źródło:
Polish Maritime Research; 2020, 2; 39-47
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective genetic algorithms for the reliability analysis and optimization of electrical transmission networks
Autorzy:
Cadini, F.
Zio, E.
Golea, L. R.
Petrescu, C. A.
Powiązania:
https://bibliotekanauki.pl/articles/2069695.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
multi-objective genetic algorithms
critical infrastructures
reliability efficiency
group closeness centrality measure
Opis:
The results of two applications of multi-objective genetic algorithms to the analysis and optimization of electrical transmission networks are reported to show the potential of these combinational optimization schemes in the treatment of highly interconnected, complex systems. In a first case study, an analysis of the topological structure of an electrical power transmission system of literature is carried out to identify the most important groups of elements of different sizes in the network. The importance is quantified in terms of group closeness centrality. In the second case study, an optimization method is developed for identifying strategies of expansion of an electrical transmission network by addition of new lines of connection. The objective is that of improving the transmission reliability, while maintaining the investment cost limited.
Źródło:
Journal of Polish Safety and Reliability Association; 2009, 1; 87--94
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of genetic algorithms to determine heavy metal ions sorption dynamics on clinoptilolite bed
Autorzy:
Tomczak, E. T.
Kamiński, W. L.
Powiązania:
https://bibliotekanauki.pl/articles/185117.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
algorytm genetyczny
jony metali ciężkich
klinoptylolit
heavy metal ions
clinoptilolite
sorption dynamics
genetic algorithm
Opis:
In the last decade a growing interest was observed in low-cost adsorbents for heavy metal ions. Clinoptilolite is a mineral sorbent extracted in Poland that is used to remove heavy metal ions from diluted solutions. The experiments in this study were carried out in a laboratory column for multicomponent water solutions of heavy metal ions, i.e. Cu(II), Zn(II) and Ni(II). A mathematical model to calculate the metals' concentration of water solution at the column outlet and the concentration of adsorbed substances in the adsorbent was proposed. It enables determination of breakthrough curves for different process conditions and column dimensions. The model of process dynamics in the column took into account the specificity of sorption described by the Elovich equation (for chemical sorption and ion exchange). Identification of the column dynamics consisted in finding model coefficients [beta], KE and Deff and comparing the calculated values with experimental data. Searching for coefficients which identify the column operation can involve the use of optimisation methods to find the area of feasible solutions in order to obtain a global extremum. For that purpose our own procedure of genetic algorithm is applied in the study.
Źródło:
Chemical and Process Engineering; 2012, 33, 1; 103-116
0208-6425
2300-1925
Pojawia się w:
Chemical and Process Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability criteria for large-scale time-delay systems; the LMI approach and the Genetic Algorithms
Autorzy:
Chen, J.- D.
Powiązania:
https://bibliotekanauki.pl/articles/969948.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
delay-dependent criterion
large-scale systems
linear matrix inequality
genetic algorithms
Opis:
This paper addresses the asymptotic stability analysis problem for a class of linear large-scale systems with time delay in the state of each subsystem as well as in the interconnections. Based on the Lyapunov stability theory, a delay-dependent criterion for stability analysis of the systems is derived in terms of a linear matrix inequality (LMI). Finally, a numerical example is given to demonstrate the validity of the proposed result.
Źródło:
Control and Cybernetics; 2006, 35, 2; 291-301
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms and neural networks for solving water quality model of the Egyptian research reactor
Autorzy:
El-Sayed Wahed, M.
Ibrahim, W. Z.
Effat, A. M.
Powiązania:
https://bibliotekanauki.pl/articles/148150.pdf
Data publikacji:
2009
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
genetic algorithm
neural networks
model calibration
water distribution system
water quality model
Opis:
The second Egyptian research reactor ETRR-2 became critical on 27th November, 1997. The National Center of Nuclear Safety and Radiation Control (NCNSRC) has the responsibility for the evaluation and assessment of safety of this reactor. Modern managements of water distribution system (WDS) need water quality models that are able to accurately predict the dynamics of water quality variations within the distribution system environment. Before water quality models can be applied to solve system problems, they should be calibrated. The purpose of this paper is to present an approach which combines both macro and detailed models to optimize the water quality parameters. For an efficient search through the solution space, we use a multi-objective genetic algorithm which allows us to identify a set of Pareto optimal solutions providing the decision maker with a complete spectrum of optimal solutions with respect to the various targets. This new combinative algorithm uses the radial basis function (RBF) metamodeling as a surrogate to be optimized for the purpose of decreasing the times of time-consuming water quality simulation and can realize rapidly the calibration of pipe wall reaction coefficients of chlorine model of large-scaled WDS.
Źródło:
Nukleonika; 2009, 54, 4; 239-245
0029-5922
1508-5791
Pojawia się w:
Nukleonika
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ł:
Automatic detection of brain tumors using genetic algorithms with multiple stages in magnetic resonance images
Autorzy:
Annam, Karthik
Kumar, Sunil G.
Babu, Ashok P.
Domala, Narsaiah
Powiązania:
https://bibliotekanauki.pl/articles/27314266.pdf
Data publikacji:
2022
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
MRI brain tumor
GLCM
SURF
genetic optimization
advanced machine learning
Opis:
The field of biomedicine is still working on a solution to the challenge of diagnosing brain tumors, which is now one of the most significant challenges facing the profession. The possibility of an early diagnosis of brain cancer depends on the development of new technologies or instruments. Automated processes can be made possible thanks to the classification of different types of brain tumors by utilizing patented brain images. In addition, the proposed novel approach may be used to differentiate between different types of brain disorders and tumors, such as those that affect the brain. The input image must first undergo pre-processing before the tumor and other brain regions can be separated. Following this step, the images are separated into their respective colors and levels, and then the Gray Level Co-Occurrence and SURF extraction methods are used to determine which aspects of the photographs contain the most significant information. Through the use of genetic optimization, the recovered features are reduced in size. The cut-down features are utilized in conjunction with an advanced learning approach for the purposes of training and evaluating the tumor categorization. Alongside the conventional approach, the accuracy, inaccuracy, sensitivity, and specificity of the methodology under consideration are all assessed. The approach offers an accuracy rate greater than 90%, with an error rate of less than 2% for every kind of cancer. Last but not least, the specificity and sensitivity of each kind are higher than 90% and 50%, respectively. The usage of a genetic algorithm to support the approach is more efficient than using the other ways since the method that the genetic algorithm utilizes has greater accuracy as well as higher specificity.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2022, 16, 4; 36--43
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł:
Optymalizacja parametrów zgrzewania tarciowego za pomocą algorytmów genetycznych
Optimization of friction welding parameters using genetic algorithms
Autorzy:
Winiczenko, R.
Powiązania:
https://bibliotekanauki.pl/articles/290188.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Inżynierii Rolniczej
Tematy:
algorytm genetyczny
zgrzewanie tarciowe
wytrzymałość
genetic algorithm
friction welding
joint strength
Opis:
Celem pracy było zastosowanie algorytmów genetycznych do optymalizacji parametrów zgrzewania tarciowego. Do znalezienia funkcji celu użyto programu do optymalizacji FlexCI z modułem FlexGA. Wyniki badań wytrzymałościowych na rozciąganie przeprowadzonych na próbkach stalowych są zgodne z prognozowanymi. Największą wytrzymałość złącza równą Remax=609 MPa osiągnięto dla następujących parametrów zgrzewania: siły tarcia Pt=25 kN, czasu tarcia Tt= 3 s, siły spęczania Ps=34 kN oraz czasu spęczania Ts= 3 s.
The research work concerned the application of genetic algorithms for optimization of friction welding parameters. To find the objective function the optimization program FlexCI with the FlexGA module was used. The results of the tensile strength tests carried out on steel samples were in accordance with the forecasted results. The greatest joint strength, Remax=609 MPa, was attained for the following welding parameters: friction force Pt=25 kN, friction time Tt= 3 s, upsetting force Ps=34 kN and upsetting time Ts= 3 s.
Źródło:
Inżynieria Rolnicza; 2008, R. 12, nr 2(100), 2(100); 313-321
1429-7264
Pojawia się w:
Inżynieria Rolnicza
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the lower-bound function method to the investigation of the convergence of genetic algorithms
Autorzy:
Socała, Jolanta
Kosiński, Witold
Powiązania:
https://bibliotekanauki.pl/articles/748342.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Markov operator, exponential stationarity, lower-bound function, genetic algorithm, mutation, selection
Opis:
W badaniu wielu zjawisk przyrodniczych istotną rolę odgrywają operatory Markowa, nieujemne operatory liniowe oraz ich półgrupy. W szczególności rozważana jest asymptotyczna stabilność. A. Lasota i J. A. Yorke w 1982 r. udowodnili, że warunkiem wystarczającym i koniecznym asymptotycznej stabilności dla operatora Markowa jest istnienie nietrywialnej funkcji dolnej. W niniejszej pracy pokazujemy zastosowanie metody funkcji dolnej do badania zachowania algorytmów genetycznych. Rozpatrywane w pracy algorytmy genetyczne, używane do rozwiązywania niegładkich problemów optymalizacyjnych, są wynikiem złożenia dwóch operatorów losowych: selekcji i mutacji. Złożenie tych operacji jest macierzą Markowa.
Markovian operators, non-negative linear operators and its subgroups play a significant role for the description of phenomena observed in the nature. Research on asymptotic stability is one of the main issues in this respect. A. Lasota and J. A. Yorke proved in 1982 that the necessary and sufficient condition of the asymptotic stability of a Markovian operator is the existence of a non-trivial lower-bound function. In the present paper it is shown how the method of lower-bound function can be applied to the investigation of genetic algorithms. Genetic algorithms considered used for solving of non-smooth optimization problems are compositions of two random operators: selection and mutation. The compositions are Markovian matrices.
Źródło:
Mathematica Applicanda; 2007, 35, 49/08
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów genetycznych do aktywnej redukcji hałasu
The use of genetic algorithms for active noise reduction
Autorzy:
Makarewicz, G.
Zawieska, W. M.
Powiązania:
https://bibliotekanauki.pl/articles/179831.pdf
Data publikacji:
2003
Wydawca:
Centralny Instytut Ochrony Pracy
Tematy:
hałas
ochrona przed hałasem
algorytm genetyczny
noise
noise protection
genetic algorithm
Opis:
Algorytmy genetyczne, mimo że wywodzą się z nauk biologicznych znajdują coraz większe zastosowanie w różnych dziedzinach techniki. W artykule przedstawiono zasadę działania elementarnego algorytmu genetycznego oraz możliwości zastosowania algorytmów genetycznych do aktywnej redukcji hałasu.
Although genetic algorithms originate in biological sciences, they are increasingly used in different technical disciplines. The paper presents the concept of an elementary genetic algorithm. Some possibilities of applying genetic algorithms for active noise reduction are described.
Źródło:
Bezpieczeństwo Pracy : nauka i praktyka; 2003, 1; 4-6
0137-7043
Pojawia się w:
Bezpieczeństwo Pracy : nauka i praktyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Intelligent Control for a Perturbed Autonomous Wheeled Mobile Robot Using Type-2 Fuzzy Logic and Genetic Algorithms
Autorzy:
Martínez, R.
Castillo, O.
Aguilar, L. T.
Powiązania:
https://bibliotekanauki.pl/articles/384492.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
mobile robot
path planning
fuzzy logic
genetic algorithms
autonomous mobile robot navigation
Opis:
We describe a tracking controller for the dynamic model of a unicycle mobile robot by integrating a kinematic and a torque controller based on Type-2 Fuzzy Logic Theory and Genetic Algorithms. Computer simulations are presented confirming the performance of the tracking controller and its application to different navigation problems.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 12-22
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Economic statistical design of variable sampling interval X̅ control chart based on surrogate variable using genetic algorithms
Autorzy:
Lee, T.-H.
Hong, S.-H.
Kwon, H.-M.
Lee, M.
Powiązania:
https://bibliotekanauki.pl/articles/406970.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
economic design
surrogate variable
variable sampling interval
TRISO Fuel
genetic algorithms
Opis:
In many cases, a X̅ control chart based on a performance variable is used in industrial fields. Typically, the control chart monitors the measurements of a performance variable itself. However, if the performance variable is too costly or impossible to measure, and a less expensive surrogate variable is available, the process may be more efficiently controlled using surrogate variables. In this paper, we present a model for the economic statistical design of a VSI (Variable Sampling Interval) X̅ control chart using a surrogate variable that is linearly correlated with the performance variable. We derive the total average profit model from an economic viewpoint and apply the model to a Very High Temperature Reactor (VHTR) nuclear fuel measurement system and derive the optimal result using genetic algorithms. Compared with the control chart based on a performance variable, the proposed model gives a larger expected net income per unit of time in the long-run if the correlation between the performance variable and the surrogate variable is relatively high. The proposed model was confined to the sample mean control chart under the assumption that a single assignable cause occurs according to the Poisson process. However, the model may also be extended to other types of control charts using a single or multiple assignable cause assumptions such as VSS (Variable Sample Size) X̅ control chart, EWMA, CUSUM charts and so on.
Źródło:
Management and Production Engineering Review; 2016, 7, 4; 54-64
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Application of genetic algorithms for the selection of WSE companies in Warsaw for the investment portfolio
Autorzy:
Basiura, Beata
Motyczyńska, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/1818470.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Markowitz model
investment portfolio
genetic algorithm
Opis:
Portfolio analysis is a tool particularly intended for investors. Risk assessment and risk specification make the investor able to properly diversify and offset the portfolio. Broadly speaking, there are multiple tools destined for building up an efficient set of portfolios. One of them is Markowitz’s model theory postulating building up a portfolio determined on the basis of equilibrium between expected profit level as well as accepted level of risk assessment. In the context of this paper, the objective is to shed some light on creating investment portfolios based on either Markowitz's portfolio theory or evolutionary algorithm. The simulation based methods for building up a portfolio of approximately 40-50 companies listed out in the primary marketof the Warsaw Stock Exchange using the selection function proposed in the BA thesis were presented. Portfolio profit values have been evaluated in a dynamically shifted time window. The conducted analysis showed shifts in the economy at certain periods of time. The implemented genetic algorithms smoothly handled the optimization with a relatively short processing time of the task result.
Źródło:
Decision Making in Manufacturing and Services; 2020, 14, 1; 91--126
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-50 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