Informacja

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

Wyszukujesz frazę "genetic algorithms" wg kryterium: Temat


Tytuł:
Multi-Objective Evolutionary Optimization of Aperiodic Symmetrical Linear Arrays
Autorzy:
Napoli, F.
Pajewski, L.
Vescovo, R.
Marciniak, M.
Powiązania:
https://bibliotekanauki.pl/articles/308614.pdf
Data publikacji:
2017
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
antenna array
Dolph-Chebyshev array
genetic algorithms
Opis:
In this paper, a multi-objective approach is applied to the design of aperiodic linear arrays of antennas. The adopted procedure is based on a standard Matlab implementation of the Controlled Elitist Non-Dominated Sorting Genetic Algorithm II. Broadside symmetrical arrays of isotropic radiators are considered with both uniform and non-uniform excitations. The work focuses on whether, and in which design conditions, the aperiodic solutions obtained by the adopted standard multi-objective evolutionary procedure can approximate or outperform the Pareto-optimal front for the uniformspacing case computable by the Dolph-Chebyshev method.
Źródło:
Journal of Telecommunications and Information Technology; 2017, 3; 79-87
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artificial intelligence toolsin simulation and optimization of production systems
Autorzy:
Škorík, P.
Gregor, M.
Štefanik, A
Powiązania:
https://bibliotekanauki.pl/articles/118145.pdf
Data publikacji:
2009
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
simulation of production systems
optimalization
genetic algorithms
Opis:
This article deals with solution developed as a cooperation of Industrial engineering department, University of Žilina and Central European Institute of Technology (CEIT SK). Proposed solution involves simulation with support of virtual reality for searching of engineer-accepted manufacturing system state (so called "optimal"). Article includes basic information about evolution methods and genetic algorithms. Authors own algorithm, which is based on use of genetic algorithm, is used for optimization. Outcomes compares the speed of convergence of chosen Witness optimization algorithms and authors-developed algorithm. Comparison is presented on project from industrial praxis.
Źródło:
Applied Computer Science; 2009, 5, 2; 42-57
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimisation of crop rotations : A case study for corn growing practices in forest-steppe of Ukraine
Autorzy:
Romashchenko, Mykhailo
Bohaienko, Vsevolod
Shatkovskyi, Andrij
Saidak, Roman
Matiash, Tetiana
Kovalchuk, Volodymyr
Powiązania:
https://bibliotekanauki.pl/articles/2203553.pdf
Data publikacji:
2023
Wydawca:
Instytut Technologiczno-Przyrodniczy
Tematy:
combinatorial optimisation
corn
crop rotation
genetic algorithms
Opis:
The formation of optimal crop rotations is virtually unsolvable from the standpoint of the classical methodology of experimental research. Here, we deal with a mathematical model based on expert estimates of “predecessor-crop” pairs’ efficiency created for the conditions of irrigation in the forest-steppe of Ukraine. Solving the problem of incorporating uncertainty assessments into this model, we present new models of crop rotations’ economic efficiency taking into account irrigation, application of fertilisers, and the negative environmental effect of nitrogen fertilisers’ introduction into the soil. For the considered models we pose an optimisation problem and present an algorithm for its solution that combines a gradient method and a genetic algorithm. Using the proposed mathematical tools, for several possible scenarios of water, fertilisers, and purchase price variability, the efficiency of growing corn as a monoculture in Ukraine is simulated. The proposed models show a reduction of the profitability of such a practice when the purchase price of corn decreases below 0.81 EUR∙kg-1 and the price of irrigation water increases above 0.32 EUR∙m-3 and propose more flexible crop rotations. Mathematical tools developed in the paper can form a basis for the creation of decision support systems that recommend optimal crop rotation variations to farmers and help to achieve sustainable, profitable, and ecologically safe agricultural production. However, future works on the actualisation of the values of its parameters need to be performed to increase the accuracy.
Źródło:
Journal of Water and Land Development; 2023, 56; 194--202
1429-7426
2083-4535
Pojawia się w:
Journal of Water and Land Development
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization of elastomeric bearings to improve seismic performance of old bridges using eigen analysis and genetic algorithms
Autorzy:
Abbadi, Mohammed S.
Lamdouar, Nouzha
Powiązania:
https://bibliotekanauki.pl/articles/35552894.pdf
Data publikacji:
2022
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
seismic isolation
OpenSees
genetic algorithms
Eurocode 8
Opis:
Old bridges present several seismic vulnerabilities and were designed before the emergence of seismic codes. In this context, partial seismic isolation has given a special attention to improve their seismic performance. In particular, elastomeric bearings are the simplest and least expensive mean for this, enabling to resist both non-seismic actions and earthquake loads. In order to assess the initial structural performance and the improvement done by the isolation, this paper attempts to combine multi objective optimization using genetic algorithms with linear and non-linear analysis using FE program OpenSees. A prior screening of the columns states is settled and then a multi objective optimization of a population of standard sized bearings meeting non-seismic and stability requirements is established to optimize the linear and non-linear behavior of the structure, finding the best compromise between displacements and forces at the columns.
Źródło:
Scientific Review Engineering and Environmental Sciences; 2021, 30, 4; 511-524
1732-9353
Pojawia się w:
Scientific Review Engineering and Environmental Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithms and boundary element method in generalized shape optimization
Algorytmy ewolucyjne i metoda elementów brzegowych w uogólnionej optymalizacji kształtu
Autorzy:
Burczyński, T.
Kokot, G.
Powiązania:
https://bibliotekanauki.pl/articles/279253.pdf
Data publikacji:
2003
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
evolutionary algorithms
genetic algorithms
generalized shape optimization
topology optimization
Opis:
The coupling of modern, alternative optimization methods such as evolutionary algorithms with the effective tool for analysis of mechanical structures - BEM, gives a new optimization method, which allows one to perform the generalized shape optimization (simultaneous shape and topology optimization) for elastic mechanical structures. This new evolutionary method is free from typical limitations connected with classical optimization methods. In the paper, results of researches on the application of evolutionary methods in the domain of mechanics are presented. Numerical examples for some optimization problems are presented, too.
Połączenie nowoczesnych algorytmów optymalizacji, jakimi są algorytmy ewolucyjne, z metodą elementów brzegowych pozwala opracować alternatywną metodę optymalizacji sprężystych układów mechanicznych w zakresie uogólnionej optymalizacji kształtu (połaczenie optymalizacji kształtu z optymalizacją topologiczną). Metoda ta jest pozbawiona wad związanych z typowymi klasycznymi metodami optymalizacji (ciągłość funkcji celu, wyznaczanie gradientu funkcji itp.), co znacznie rozszerza możliwości jej zastosowań. W artykule przedstawiono proponowaną metodę optymalizacji wraz z przykładami optymalizacji wybranych układów mechanicznych.
Źródło:
Journal of Theoretical and Applied Mechanics; 2003, 41, 2; 341-364
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Utilisation of Evolution Algorithm in Production Layout Design
Autorzy:
Krajčovič, M.
Grznár, P.
Powiązania:
https://bibliotekanauki.pl/articles/117697.pdf
Data publikacji:
2017
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
production layout
material flow optimisation
heuristics
genetic algorithms
Opis:
The need for flexibility of layout planning puts higher requirements for uti-lisation of layout and location problem solving methods. Classical methods, like linear programming, dynamic programming or conventional heuristics are being replaced by advanced evolutionary algorithms, which give better solutions to large-scale problems. One of these methods are also genetic algorithms. This article describes the genetic algorithm utilisation in the production layout planningunder the terms of the digital factory concept.
Źródło:
Applied Computer Science; 2017, 13, 3; 5-18
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm combined with a local search method for identifying susceptibility genes
Autorzy:
Yang, C -H.
Moi, S. -H.
Lin, Y. -D.
Chuang, L. -Y.
Powiązania:
https://bibliotekanauki.pl/articles/91586.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithms
identifying susceptibility genes
local search algorithm
Opis:
Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ForestTaxator : a tool for detection and approximation of cross-sectional area of trees in a cloud of 3D points
Autorzy:
Małaszek, Maciej
Zembrzuski, Andrzej
Gajowniczek, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2201227.pdf
Data publikacji:
2022
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Instytut Informatyki Technicznej
Tematy:
point cloud
genetic algorithms
trees
3D scan
Opis:
In this paper we propose a novel software, named ForestTaxator, supporting terrestrial laser scanning data processing, which for dendrometric tree analysis can be divided into two main processes: tree detection in the point cloud and development of three-dimensional models of individual trees. The usage of genetic algorithms to solve the problem of tree detection in 3D point cloud and its cross-sectional area approximation with ellipse-based model is also presented. The detection and approximation algorithms are proposed and tested using various variants of genetic algorithms. The work proves that the genetic algorithms work very well: the obtained results are consistent with the reference data to a large extent, and the time of genetic calculations is very short. The attractiveness of the presented software is due to the fact that it provides all necessary functionalities used in the forest inventory field. The software is written in C# and runs on the .NET Core platform, which ensures its full portability between Windows, MacOS and Linux. It provides a number of interfaces thus ensuring a high level of modularity. The software and its code are made freely available.
Źródło:
Machine Graphics & Vision; 2022, 31, 1/4; 19--48
1230-0535
2720-250X
Pojawia się w:
Machine Graphics & Vision
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Real-time fan scheduling in exploration-exploitation to optimize minimum function objectives
Autorzy:
Larios-Gómez, Mariano
Quintero-Flores, Perfecto M.
Anzures-García, Mario
Camacho-Hernandez, Miguel
Powiązania:
https://bibliotekanauki.pl/articles/30148244.pdf
Data publikacji:
2023
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
real-time task scheduling
genetic algorithms
concurrent computing
Opis:
This paper presents the application of a task scheduling algorithm called Fan based on artificial intelligence technique such as genetic algorithms for the problem of finding minima in objective functions, where equations are predefined to measure the return on investment. This work combines the methodologies of population exploration and exploitation. Results with good aptitudes are obtained until a better learning based on non-termination conditions is found, until the individual provides a better predisposi¬tion, adhering to the established constraints, exhausting all possible options and satisfying the stopping condition. A real-time task planning algorithm was applied based on consensus techniques. A software tool was developed, and the scheduler called FAN was adapted that contemplates the execution of periodic, aperiodic, and sporadic tasks focused on controlled environments, considering that strict time restrictions are met. In the first phase of the work, it is shown how convergence precipitates to an evolution. This is done in a few iterations. In the second stage, exploitation was improved, giving the algorithm a better performance in convergence and feasibility. As a result, a population was used and iterations were applied with a fan algorithm and better predisposition was obtained, which occurs in asynchronous processes while scheduling in real time.
Źródło:
Applied Computer Science; 2023, 19, 2; 43-54
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów genetycznych do projektowania rozdrabniacza wielotarczowego
Shredder multishield structure design with the use of genetic algorithms
Autorzy:
Rama, Roksana
Powiązania:
https://bibliotekanauki.pl/articles/41203987.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Tematy:
algorytmy genetyczne
krzyżowanie
tarcze
genetic algorithms
crossover
shield
Opis:
Zakres pracy obejmuje wiadomości z zakresu algorytmów genetycznych oraz rozdrabniaczy wielotarczowych. Przedstawia funkcjonowanie algorytmu genetycznego, metody optymalizacji oraz cel badań wykorzystania algorytmów genetycznych w projektowaniu rozdrabniaczy wielotarczowych. Program TarczeAG napisano w programie C++ Builder 7. Ograniczono się do projektowania tarcz tnących na podstawie istniejących tarcz. Stworzona została nowa grupa układów dwutarczowych, a symulacja umożliwiła dobór cech konstrukcyjnych tarcz.
This paper deals with the issue concerning genetic algorithms and multi disc mills. The article not only presents genetic algorithm operating and optimization methods but it also concentrates on genetic algorithms application possibilities in them of multi disc mills. AG Discs Software was written with a help of a software called: C++Builder 7. Main focus of interest concerned the cutting disc design process, involving existing ones. New class of double disc systems, whose discs were designed using a computer simulation.
Źródło:
Studia i Materiały Informatyki Stosowanej; 2010, 2; 51-54
1689-6300
Pojawia się w:
Studia i Materiały Informatyki Stosowanej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rotor blade geometry optimization in kaplan turbine
Autorzy:
Banaszek, M.
Tesch, K.
Powiązania:
https://bibliotekanauki.pl/articles/1943215.pdf
Data publikacji:
2010
Wydawca:
Politechnika Gdańska
Tematy:
fluid mechanics
turbomachinery
genetic algorithms
artificial neural networks
Opis:
This paper presents a description of the method and results of rotor blade shape optimization. The rotor blading constitutes a part of a turbine’s flow path. The optimization consists in selecting a shape that minimizes the polytrophic loss ratio [1]. The shape of the blade is defined by the mean camber line and thickness of the airfoil. The thickness is distributed around the camber line based on the ratio of distribution. A global optimization was done by means of Genetic Algorithms (GA) with the help of Artificial Neural Networks (ANN) for approximations. For the numerical simulation of a flow through the model Kaplan turbine, the geometry employed in the model was based on the actual geometry of the existing test stage. The fluid parameters and the boundary conditions for the model were based on experimental measurements which were carried out at the test stand at the Department of Turbomachinery and Fluid Mechanics at the Gdansk University of Technology. The shape of the blading was optimized for the operational point with a maximum efficiency.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2010, 14, 3; 209-225
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Intelligent support of evacuation planning of selected public mass events
Inteligentne wspomaganie programowania ewakuacji w przypadku wybranych imprez masowych
Autorzy:
Kałkowska, J.
Pacholski, L.
Powiązania:
https://bibliotekanauki.pl/articles/202555.pdf
Data publikacji:
2017
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
genetic algorithms
safety engineering
algorytmy genetyczne
inżynieria bezpieczeństwa
Opis:
Due to the topical importance of the acts of terror, contemporary safety engineering must, among others, take on issues concerning the necessity of programming potential emergency evacuations concerning different kinds of mass events. These types of gatherings require preparing evacuation management programs in advance in case threatening information appears. These programs, apart from the conventional solutions based on binary logic and classical combinatorics methods, must also take into account the hybrid and fuzzy character of the course of the emergency evacuation accompanying occurrences. The article presents an example of implementing genetic algorithms, which are recognized as anartificial intelligence method. This example concerns the emergency evacuation of supporters in a stadium football match. The proposed method can also be applied in case of other mass events like: public concerts with the participation of show-business stars and rallies and political demonstrations.
W wyniku analizy aktualnej problematyki związanej z coraz częściej pojawiającymi się aktami terroru, współczesna inżynieria bezpieczeństwa wykorzystuje między innymi wspomaganie programowania potencjalnej konieczności ewakuacji ludności uczestniczącej w różnego typu imprezach masowych. Imprezy te wymagają uprzedniego przygotowania programu zarządzania ewakuacją na wypadek potencjalnego zagrożenia. Takie programowanie, niezależnie od konwencjonalnych rozwiązań bazujących na logice binarnej i klasycznej kombinatoryce, powinny uwzględniać również hybrydowy i rozmyty charakter towarzyszących okoliczności. W artykule przedstawiono przykład wykorzystania algorytmów genetycznych uznawanych za metodę sztucznej inteligencji. Przykład ten dotyczy konieczności przeprowadzenia nagłej ewakuacji uczestników i publiczności meczu piłki nożnej. Proponowana metoda może również zostać wykorzystana w przypadku organizacji innych imprez masowych takich jak: koncerty gwiazd estrady lub mityngi i zorganizowane demonstracje polityczne.
Źródło:
Zeszyty Naukowe Politechniki Poznańskiej. Organizacja i Zarządzanie; 2017, 72; 89-98
0239-9415
Pojawia się w:
Zeszyty Naukowe Politechniki Poznańskiej. Organizacja i Zarządzanie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the knapsack problem to reliability multi-criteria optimization
Autorzy:
Guze, S.
Powiązania:
https://bibliotekanauki.pl/articles/2069486.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
multicriteria optimization
reliability
knapsack problem
genetic algorithms
SPEA
Opis:
The main aim of the paper is to translate reliability problems to the knapsack optimization problem. The review of the known methods of multi-criteria optimization is done. Particularly, the SPEA algorithm is presented. Furthermore, the 0-1 knapsack problem solution by SPEA algorithm is introduced and used to the reliability optimization of exemplary parallel-series system.
Źródło:
Journal of Polish Safety and Reliability Association; 2014, 5, 1; 85--90
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modeling of the crystalline structure of the complex system containing doped polyaniline by use of genetic algorithms
Autorzy:
Kozik, T.
Luzny, W.
Powiązania:
https://bibliotekanauki.pl/articles/134891.pdf
Data publikacji:
2015
Wydawca:
Tomasz Mariusz Majka
Tematy:
polyaniline
genetic algorithms
computer modeling of crystalline structure
Opis:
The structure of polyaniline (PANI) protonated with camphorsulphonic acid (CSA) has been subject to research for a long time. Despite several, various models being proposed throughout the years, there is still no model widely accepted as the only correct and final one of its crystalline phase. In this paper a computer program named MoleculeEditor is described. Created basing on the concepts of an existing but significantly different program named CrystalFinder, it is a software dedicated to finding a model of the crystalline regions of the PANI/CSA system based on an input X-ray diffraction pattern. In its search it takes advantage of the genetic algorithm technique for optimizing the model parameters to fit the computed diffraction pattern to the one loaded as input. A successful example of it being employed to find the parameters of a prepared beforehand, fictional structure of the system, is presented. Conclusions drawn from this application of the prepared software cannot be ignored in the further search for the actual model of this complex system using this program. Obtaining results from MoleculeEditor for actual, experimental data is however still in progress.
Źródło:
Journal of Education and Technical Sciences; 2015, 2, 1; 9-14
2300-7419
2392-036X
Pojawia się w:
Journal of Education and Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptation of Evolutionary Algorithms for Decision Making on Building Construction Engineering (TSP Problem)
Autorzy:
Wazirali, R. A.
Alzughaibi, A. D.
Chaczko, Z.
Powiązania:
https://bibliotekanauki.pl/articles/226730.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
TSP
genetic algorithms
GA
support vector machines
SVM
Opis:
The report revolve on building construction engineering and management, in which there are a lot of requirements such as well supervision and accuracy and being in position to forecast uncertainties that may arise and mechanisms to solve them. It also focuses on the way the building and construction can minimise the cost of building and wastages of materials. The project will be based of heuristic methods of Artificial Intelligence (AI). There are various evolution methods, but report focus on two experiments Pattern Recognition and Travelling Salesman Problem (TSP). The Pattern Recognition focuses Evolutionary Support Vector Machine Inference System for Construction Management. The construction is very dynamic are has a lot of uncertainties, no exact data this implies that the inference should change according to the environment so that it can fit the reality, therefore there a need of Support Vector Machine Inference System to solve these problems. TSP focus on reducing cost of building construction engineering and also reduces material wastages, through its principals of finding the minimum cost path of the salesman.
Źródło:
International Journal of Electronics and Telecommunications; 2014, 60, 1; 125-128
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł

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