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ę "evolutionary algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 16
Tytuł:
Implementing evolutionary algorithm into training single-layer artificial neural network in classification task
Autorzy:
Płaczek, S.
Powiązania:
https://bibliotekanauki.pl/articles/95001.pdf
Data publikacji:
2016
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
genetic algorithm
evolutionary algorithm
selection process
mutation
recombination
replacement
Opis:
The article proposes implementing a modified version of genetic algorithm in a neural network, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An Evolutionary Algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes the real value variables and matrix structure are proposed to a single-layer neural network. Particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. In the calculation example, the implementation of theoretical considerations to a classification task is demonstrated.
Źródło:
Information Systems in Management; 2016, 5, 3; 377-388
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization of high speed vehicle-passenger catamaran by genetic algorithm. Part II. Computational simulations
Autorzy:
Sekulski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/260598.pdf
Data publikacji:
2011
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship structure
multi-objective optimization
evolutionary algorithm
genetic algorithm
Pareto domination
Opis:
Real ship structural design problems are usually characterized by presence of many conflicting objectives. Simultaneously, a complete definition of the optimum structural design requires a formulation of size-topology-shape-material optimization task unifying the optimization problems of the four areas and giving an effective solution of the problem. So far, a significant progress towards the solution of the problem has not been obtained. An objective of the present paper was to develop an evolutionary algorithm for multiobjective optimization of structural elements of large spatial sections of ships. Selected elements of the multi-criteria optimization theory have been presented in detail. Methods for solution of the multi-criteria optimization problems have been discussed with the focus on the evolutionary optimization algorithms. In the paper an evolutionary algorithm where selection takes place based on the aggregated objective function combined with domination attributes as well as distance to the asymptotic solution, is proposed and applied to solve the problem of optimizing structural elements with respect to their weight and surface area on a high speed vehicle-passenger catamaran structure, with several design variables, such as plate thickness, scantlings of longitudinal stiffeners and transverse frames, and spacing between longitudinal and transversal members, taken into account. Details of the computational models were at the level typical for conceptual design. Scantlings were analyzed by using selected rules of a classification society. The results of numerical experiments with the use of the developed algorithm, are presented. They show that the proposed genetic algorithm can be an efficient tool for multi-objective optimization of ship structures. The paper is published in three parts: Part I: Theoretical background on evolutionary multi-objective optimization, Part II: Computational investigations, and Part III: Analysis of the results.
Źródło:
Polish Maritime Research; 2011, 3; 3-30
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization of high speed vehicle-passenger catamaran by genetic algorithm. Part II. Analysis of the results
Autorzy:
Sekulski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/260079.pdf
Data publikacji:
2011
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship structure
multi-objective optimization
evolutionary algorithm
genetic algorithm
Pareto domination
set of non-dominated solutions
Opis:
Real ship structural design problems are usually characterized by presence of many conflicting objectives. Simultaneously, a complete definition of the optimum structural design requires a formulation of size-topology-shape-material optimization task unifying the optimization problems from the four areas and giving an effective solution of the problem. Any significant progress towards solving the problem has not been obtained so far. An objective of the present paper was to develop an evolutionary algorithm for multiobjective optimization of the structural elements of large spatial sections of ships. Selected elements of the multi-criteria optimization theory have been presented in detail. Methods for solution of the multi-criteria optimization problems have been discussed with the focus on the evolutionary optimization algorithms. In the paper an evolutionary algorithm where selection takes place based on the aggregated objective function combined with domination attributes as well as distance to the asymptotic solution, is proposed and applied to solve the problem of optimizing structural elements with respect to their weight and surface area for a high - speed vehicle-passenger catamaran structure, with taking into account several design variables such as plate thickness, scantlings of longitudinal stiffeners and transverse frames, and spacing between longitudinal and transversal members. Details of the computational models were kept at the level typical for conceptual design stage. Scantlings were analyzed by using the selected classification society rules. The results of numerical experiments with the use of the developed algorithm are presented. They show that the proposed genetic algorithm may be considered an efficient tool for multi-objective optimization of ship structures. The paper has been published in the three parts: Part I: Theoretical background on evolutionary multiobjective optimization, Part II: Computational simulations, and Part III: Analysis of the results.
Źródło:
Polish Maritime Research; 2011, 4; 3-13
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization of high speed vehicle-passenger catamaran by genetic algorithm. Part I. Theoretical background on evolutionary multi objective optimization
Autorzy:
Sekulski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/259303.pdf
Data publikacji:
2011
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship structure
multi-objective optimization
evolutionary algorithm
genetic algorithm
Pareto domination
set of non-dominated solutions
Opis:
Real ship structural design problems are usually characterized by presence of many conflicting objectives. Simultaneously, a complete definition of the optimal structural design requires a formulation of size-topology-shape-material optimization task unifying the optimization problems from these four areas and giving an effective solution of this problem. So far, a significant progress towards the solution of this problem has not been obtained. An objective of the present paper was to develop an evolutionary algorithm for multi-objective optimization of the structural elements of the large spatial sections of ships. Selected elements of the multi-criteria optimization theory have been presented in details. Methods for solution of the multi-criteria optimization problems have been discussed with the focus on the evolutionary optimization algorithms. In the paper an evolutionary algorithm where selection takes place based on the aggregated objective function combined with domination attributes as well as distance to the asymptotic solution is proposed and applied to solve the problem of optimizing structural elements with respect to their weight and surface area on a high speed vehicle-passenger catamaran structure with several design variables, such as plate thickness, scantlings of longitudinal stiffeners and transverse frames, and spacing between longitudinals and transversal members. Details of the computational models were at the level typical for conceptual design. Scantlings were analyzed using the selected rules of a classification society. The results of numerical experiments with the use of the developed algorithm are presented. They show that the proposed genetic algorithm can be an efficient multi-objective optimization tool for ship structures optimization. The paper will be published in three parts: Part I: Theoretical background on evolutionary multi-objective optimization, Part II: Computational investigations, and Part III: Analysis of the results.
Źródło:
Polish Maritime Research; 2011, 2; 3-18
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Teoria i metody algorytmu ewolucyjnego w uczeniu jednowarstwowej sieci neuronowej
Implementation of the Evolutionary Algorithm Theory and Methods in the Learning Process of One-Layer ANN
Autorzy:
Płaczek, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/509173.pdf
Data publikacji:
2016
Wydawca:
Akademia Finansów i Biznesu Vistula
Tematy:
algorytmy genetyczne
algorytmy ewolucyjne
sztuczne sieci neuronowe
algorytmy uczenia sieci
algorytmy selekcji
algorytmy krzyżowania
algorytmy mutacji
genetic algorithm
evolutionary algorithm
artificial neural network
learning algorithm
selection algorithm
crossover algorithm
mutation algorithm
Opis:
Rozwój teorii sztucznych sieci neuronowych, a także pojawienie się nowych, efektywnych narzędzi programistycznych (systemy wieloprocesorowe, programowanie wielowątkowe) umożliwia zastosowanie algorytmów genetycznych oraz ewolucyjnych do uczenia sztucznych sieci neuronowych (SSN). W literaturze dotyczącej zasad działania SSN podkreśla się ich atrakcyjne własności, takie jak: aproksymacja dowolnych nieliniowych odwzorowań, równolegle i rozproszone przetwarzanie, adaptacja i uczenie. Szczególnie równoległe i rozproszone przetwarzanie koresponduje ze strukturą algorytmu genetycznego i ewolucyjnego. Klasyczne algorytmy genetyczne operują na ciągach binarnych o stałej długości. Natomiast algorytmy ewolucyjne można interpretować jako uogólnienie algorytmów genetycznych. W algorytmach tych stosuje się zasady ewolucji i dziedziczenia oraz wykorzystuje się właściwą strukturę danych do reprezentacji chromosomów (liczby rzeczywiste, macierze, grafy). Definiuje się również inne operatory krzyżowania i mutacji. Tak więc struktura algorytmu ewolucyjnego jest prawie taka sama jak genetycznego. Różnice ukryte są na niższych poziomach przetwarzania – w strukturach danych. W artykule przedstawiono próbę implementacji algorytmu ewolucyjnego do uczenia jednowarstwowej sieci neuronowej. Sieć opisuje się w postaci macierzy połączeń między wektorami – wejściowym X oraz wyjściowym Y. Funkcja uczenia SSN zdefiniowana jest jako nieliniowa funkcja wag sieci oraz nieliniowej funkcji aktywacji minimalizującej błąd średniokwadratowy między wektorem wyjściowym Y a wektorem uczącym Z, dla całej paczki uczącej. Pojawienie się nieliniowości utrudnia zastosowanie algorytmu uczenia opartego na wstecznej propagacji błędu. Funkcja celu, oprócz minimum globalnego, może zawierać wiele minimów lokalnych, w których algorytm oparty na badaniu gradientu funkcji celu może się zatrzymać. Oczywiście stosuje się różne techniki i metody umożliwiające wyjście algorytmu z tego typu pułapek. Tym niemniej dla sprawdzenia poprawności otrzymanych wyników uruchamia się proces uczenia SSN dla różnych danych początkowych. W zaproponowanym algorytmie ewolucyjnym tworzy się zbiór osobników. Każdy z osobników przedstawia możliwe rozwiązanie zadania minimalizacji funkcji celu i jest reprezentowany przez macierzową strukturę danych. Każde rozwiązanie cząstkowe ocenia się na podstawie dopasowania funkcji celu, a następnie tworzy się nową populację (potomków) przez selekcję osobników o najlepszych dopasowaniach oraz dwa algorytmy krzyżowania i mutacji. W artykule omówiono zaproponowaną strukturę osobników, przyjęte algorytmy selekcji z ich wadami i zaletami oraz różne algorytmu krzyżowania i mutacji. Na wstępie zdefiniowano takie podstawowe pojęcia, jak gen, chromosom oraz najogólniejszą strukturę algorytmu ewolucyjnego. Artykuł ma charakter koncepcyjny.
The article proposes implementation of a modified version of genetic algorithms in neural networks, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An evolutionary algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes, the real value variables and matrix structure are proposed. In the article, this decision is widely elaborated and discussed. In the original versions of genetic algorithms, all variables’ values are transformed into binary versions. The chromosomes bit sequences could include thousands of positions. It does not simplify the crossover and mutation operations. Processes could be very time-consuming and the algorithm convergence could also be slow. For a single-layer neural network matrix data structure is used. A particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. The primary population, known as the parent population, is employed to build a new set of individuals using the selection process. These individuals are known as the children population. The selection algorithm should converge on the two very important issues: population diversity and selective pressure. Selective pressure can manifest in the overrepresentation of the best individuals in the new population. The area, in which the optimal solution is sought, is reduced too fast. Premature convergence is not desirable due to the high probability of achieving the local maximum. Reducing the selective pressure may result in increasing the time it takes to search for the solution.
Źródło:
Zeszyty Naukowe Uczelni Vistula; 2016, 49(4) Informatyka; 23-39
2353-2688
Pojawia się w:
Zeszyty Naukowe Uczelni Vistula
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metamodel-Based Optimization of the Labyrinth Seal
Autorzy:
Rulik, S.
Wróblewski, W.
Frączek, D.
Powiązania:
https://bibliotekanauki.pl/articles/140287.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
labyrinth seal
metamodel optimization
neural network
genetic algorithm
evolutionary algorithm
CFD optimization
uszczelnienie labiryntowe
optymalizacja oparta na metamodelu
sieć neuronowa
algorytm genetyczny
algorytm ewolucyjny
optymalizacja CFD
Opis:
The presented paper concerns CFD optimization of the straight-through labyrinth seal with a smooth land. The aim of the process was to reduce the leakage flow through a labyrinth seal with two fins. Due to the complexity of the problem and for the sake of the computation time, a decision was made to modify the standard evolutionary optimization algorithm by adding an approach based on a metamodel. Five basic geometrical parameters of the labyrinth seal were taken into account: the angles of the seal’s two fins, and the fin width, height and pitch. Other parameters were constrained, including the clearance over the fins. The CFD calculations were carried out using the ANSYS-CFX commercial code. The in-house optimization algorithm was prepared in the Matlab environment. The presented metamodel was built using a Multi-Layer Perceptron Neural Network which was trained using the Levenberg-Marquardt algorithm. The Neural Network training and validation were carried out based on the data from the CFD analysis performed for different geometrical configurations of the labyrinth seal. The initial response surface was built based on the design of the experiment (DOE). The novelty of the proposed methodology is the steady improvement in the response surface goodness of fit. The accuracy of the response surface is increased by CFD calculations of the labyrinth seal additional geometrical configurations. These configurations are created based on the evolutionary algorithm operators such as selection, crossover and mutation. The created metamodel makes it possible to run a fast optimization process using a previously prepared response surface. The metamodel solution is validated against CFD calculations. It then complements the next generation of the evolutionary algorithm.
Źródło:
Archive of Mechanical Engineering; 2017, LXIV, 1; 75-91
0004-0738
Pojawia się w:
Archive of Mechanical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of traveling salesman problem using affinity propagation clustering and genetic algorithm
Autorzy:
El-Samak, A. F.
Ashour, W.
Powiązania:
https://bibliotekanauki.pl/articles/91810.pdf
Data publikacji:
2015
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
combinatorial optimization problem
travel salesman problem
genetic algorithm
evolutionary computation algorithm
affinity propagation clustering technique
AP
problem optymalizacji kombinatorycznej
algorytm genetyczny
obliczenia ewolucyjne
Opis:
Combinatorial optimization problems, such as travel salesman problem, are usually NPhard and the solution space of this problem is very large. Therefore the set of feasible solutions cannot be evaluated one by one. The simple genetic algorithm is one of the most used evolutionary computation algorithms, that give a good solution for TSP, however, it takes much computational time. In this paper, Affinity Propagation Clustering Technique (AP) is used to optimize the performance of the Genetic Algorithm (GA) for solving TSP. The core idea, which is clustering cities into smaller clusters and solving each cluster using GA separately, thus the access to the optimal solution will be in less computational time. Numerical experiments show that the proposed algorithm can give a good results for TSP problem more than the simple GA.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 4; 239-245
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Analytical Study for the Role of Fuzzy Logic in Improving Metaheuristic Optimization Algorithms
Autorzy:
Vij, Sonakshi
Jain, Amita
Tayal, Devendra
Castillo, Oscar
Powiązania:
https://bibliotekanauki.pl/articles/385121.pdf
Data publikacji:
2018
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
fuzzy logic
metaheuristics
evolutionary computing
genetic algorithm
particle swarm optimization (PSO)
ant colony optimization
fuzzy evolutionary algorithm
fuzzy cuckoo
fuzzy simulated annealing
fuzzy swarm intelligence
fuzzy differential evolution
tabu
fuzzy mutation
fuzzy natural selection
fuzzy fitness function
big bang big crunch
fuzzy bacterial
neuro fuzzy logic
logika rozmyta
metaheurystyka
obliczenia ewolucyjne
algorytm genetyczny
optymalizacja roju cząstek
optymalizacja kolonii mrówek
Opis:
The research applications of fuzzy logic have always been multidisciplinary in nature due to its ability in handling vagueness and imprecision. This paper presents an analytical study in the role of fuzzy logic in the area of metaheuristics using Web of Science (WoS) as the data source. In this case, 178 research papers are extracted from it in the time span of 1989-2016. This paper analyzes various aspects of a research publication in a scientometric manner. The top cited research papers, country wise contribution, topmost organizations, top research areas, top source titles, control terms and WoS categories are analyzed. Also, the top 3 fuzzy evolutionary algorithms are extracted and their top research papers are mentioned along with their topmost research domain. Since neuro fuzzy logic poses feasible options for solving numerous research problems, hence a section is also included by the authors to present an analytical study regarding research in it. Overall, this study helps in evaluating the recent research patterns in the field of fuzzy metaheuristics along with envisioning the future trends for the same. While on one hand this helps in providing a new path to the researchers who are beginners in this field as they can start exploring it through the analysis mentioned here, on the other hand it provides an insight to professional researchers too who can dig a little deeper in this field using knowledge from this study.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 4; 11-27
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mining Pharmacy Database Using Evolutionary Genetic Algorithm
Autorzy:
Ykhlef, M.
ElGibreen, H.
Powiązania:
https://bibliotekanauki.pl/articles/226717.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
data mining
evolutionary algorithms
genetic algorithm
pharmacy database
sequential patterns
Opis:
Medication management is an important process in pharmacy field. Prescribing errors occur upstream in the process, and their effects can be perpetuated in subsequent steps. Prescription errors are an important issue for which conflicts with another prescribed medicine could cause severe harm for a patient. In addition, due to the shortage of pharmacists and to contain the cost of healthcare delivery, time is also an important issue. Former knowledge of prescriptions can reduce the errors, and discovery of such knowledge requires data mining techniques, such as Sequential Pattern. Moreover, Evolutionary Algorithms, such as Genetic Algorithm (GA), can find good rules in short time, thus it can be used to discover the Sequential Patterns in Pharmacy Database. In this paper GA is used to assess patient prescriptions based on former knowledge of series of prescriptions in order to extract sequenced patterns and predict unusual activities to reduce errors in timely manner.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 4; 427-432
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja strukturalna dla architektów
Structural optimisation for architects
Autorzy:
Pasternak, A.
Powiązania:
https://bibliotekanauki.pl/articles/1366543.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optymalizacja strukturalna
algorytm genetyczny
architektura ewolucyjna
structural optimisation
genetic algorithm
evolutionary architecture
Opis:
Poprzez porównanie etapów procesu projektowego w dziedzinie projektowania architektonicznego i projektowania samolotów, zwracając uwagę na sposób obsługi danych i integracji technik, uwidocznione zostały duże różnice w zakresie automatyzacji pewnych procesów projektowych. W projektowaniu architektonicznym, operowanie w takim środowisku, w którym możliwe jest tworzenie modeli parametrycznych, które w swojej logice mają zaprogramowane wytyczne, np. konstrukcyjne, umożliwi projektowanie budynków, których układ strukturalny i funkcjonalny są ze sobą lepiej zintegrowane i zoptymalizowane.
A comparison of the phases of the design process in the field of architectural design and aircraft design, with particular consideration of the differences in data handling and technique integration, has shown large differences in the automation of certain design processes. In the field of architectural design, operating in an environment where it is possible to create parametric models in which logic guidelines such as construction guidelines are programmed, will allow designing buildings whose structural and functional layout are better integrated and optimized.
Źródło:
Kwartalnik Architektury i Urbanistyki; 2014, 59, 2; 63-66
0023-5865
Pojawia się w:
Kwartalnik Architektury i Urbanistyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques
Autorzy:
Niewiadomska-Szynkiewicz, E.
Marks, M.
Kamola, M.
Powiązania:
https://bibliotekanauki.pl/articles/308429.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
evolutionary strategy
genetic algorithm
localization
location systems
nonconvex optimization
simulated annealing
wireless sensor network
Opis:
Many applications of wireless sensor networks (WSN) require information about the geographic location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field, and to self-organize to perform sensing and acting task. The goal of localization is to assign geographic coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, we address issues associated with the application of heuristic techniques to accurate localization of nodes in a WSN system. We survey and discuss the location systems based on simulated annealing, genetic algorithms and evolutionary strategies. Finally, we describe and evaluate our methods that combine trilateration and heuristic optimization.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 4; 55-64
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The On-line Evolutionary Method for Soft Fault Diagnosis in Diode-transistor Circuits
Autorzy:
Korzybski, M.
Ossowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/226980.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
electric circuit diagnosis
soft faults
multiple faults
evolutionary computation
gene expression programming
genetic algorithm
differential evolution
Opis:
The paper is devoted to diagnostic method enabling us to perform all the three levels of fault investigations - detection, localization and identification. It is designed for analog diode-transistor circuits, in which the circuit’s state is defined by the DC sources’ values causing elements operating points and the harmonic components with small amplitudes being calculated in accordance with small-signal circuit analysis rules. Geneexpression programming (GEP), differential evolution (DE) and genetic algorithms (GA) are a mathematical background of the proposed algorithms. Time consumed by diagnostic process rises rapidly with the increasing number of possible faulty circuit elements in case of using any of mentioned algorithms. The conncept of using two different circuit models with partly different elements allows us to decrease a number of possibly faulty elements in each circuit because some of possibly faulty elements are absent in one of two investigated circuits.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 1; 109-115
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm based optimized convolutional neural network for face recognition
Autorzy:
Karlupia, Namrata
Mahajan, Palak
Abrol, Pawanesh
Lehana, Parveen K.
Powiązania:
https://bibliotekanauki.pl/articles/2201023.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
convolutional neural network
genetic algorithm
deep learning
evolutionary technique
sieć neuronowa konwolucyjna
algorytm genetyczny
uczenie głębokie
technika ewolucyjna
Opis:
Face recognition (FR) is one of the most active research areas in the field of computer vision. Convolutional neural networks (CNNs) have been extensively used in this field due to their good efficiency. Thus, it is important to find the best CNN parameters for its best performance. Hyperparameter optimization is one of the various techniques for increasing the performance of CNN models. Since manual tuning of hyperparameters is a tedious and time-consuming task, population based metaheuristic techniques can be used for the automatic hyperparameter optimization of CNNs. Automatic tuning of parameters reduces manual efforts and improves the efficiency of the CNN model. In the proposed work, genetic algorithm (GA) based hyperparameter optimization of CNNs is applied for face recognition. GAs are used for the optimization of various hyperparameters like filter size as well as the number of filters and of hidden layers. For analysis, a benchmark dataset for FR with ninety subjects is used. The experimental results indicate that the proposed GA-CNN model generates an improved model accuracy in comparison with existing CNN models. In each iteration, the GA minimizes the objective function by selecting the best combination set of CNN hyperparameters. An improved accuracy of 94.5% is obtained for FR.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 21--31
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Appraisal of genetic algorithm and its application in 0-1 knapsack problem
Autorzy:
Okwu, Modestus
Otanocha, Omonigho B.
Omoregbee, Henry O.
Edward, Bright A.
Powiązania:
https://bibliotekanauki.pl/articles/95189.pdf
Data publikacji:
2020
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
classical techniques
genetic algorithm
evolutionary biology
0-1 knapsack problem
techniki klasyczne
algorytm genetyczny
biologia ewolucyjna
problem plecakowy
Opis:
A lot of uncertainties and complexities exist in real life problem. Unfortunately, the world approaches such intricate realistic life problems using traditional methods which has failed to offer robust solutions. In recent times, researchers look beyond classical techniques. There is a model shift from the use of classical techniques to the use of standardized intelligent biological systems or evolutionary biology. Genetic Algorithm (GA) has been recognized as a prospective technique capable of handling uncertainties and providing optimized solutions in diverse area, especially in homes, offices, stores and industrial operations. This research is focused on the appraisal of GA and its application in real life problem. The scenario considered is the application of GA in 0-1 knapsack problem. From the solution of the GA model, it was observed that there is no combination that would give the exact weight or capacity the 35 kg bag can carry but the possible range from the solution model is 34 kg and 36 kg. Since the weight of the bag is 35 kg, the feasible or near optimal solution weight of items the bag can carry would be 34 kg at benefit of 16. Additional load beyond 34 kg could lead to warping of the bag.
Źródło:
Journal of Mechanical and Energy Engineering; 2020, 4, 1; 39-46
2544-0780
2544-1671
Pojawia się w:
Journal of Mechanical and Energy Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Advanced supervision of oil wells based on soft computing techniques
Autorzy:
Camargo, E.
Aguilar, J.
Powiązania:
https://bibliotekanauki.pl/articles/91828.pdf
Data publikacji:
2014
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
intelligent model of supervision
evolutionary computation
fuzzy system
oil industry
operational diagnosis
petroleum wells
gas lift method
multilayer fuzzy system
genetic algorithm
Opis:
In this work is presented a hybrid intelligent model of supervision based on Evolutionary Computation and Fuzzy Systems to improve the performance of the Oil Industry, which is used for Operational Diagnosis in petroleum wells based on the gas lift (GL) method. The model is composed by two parts: a Multilayer Fuzzy System to identify the operational scenarios in an oil well and a genetic algorithm to maximize the production of oil and minimize the flow of gas injection, based on the restrictions of the process and the operational cost of production. Additionally, the first layers of the Multilayer Fuzzy System have specific tasks: the detection of operational failures, and the identification of the rate of gas that the well requires for production. In this way, our hybrid intelligent model implements supervision and control tasks.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 3; 215-225
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 16

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