Skocz do pozycji: 1.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 2.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 3.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 4.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 5.

Tytuł:

Distributed System for Power Quality Improvement

Autorzy:

Klempka, R.

Powiązania:

https://bibliotekanauki.pl/articles/262783.pdf

Data publikacji:

2008

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

Tematy:

distributed system
power quality
genetic algorithms

Opis:

On the basis of the current trends for solving complex technical problems, a new concept of power quality improvement is proposed. It consists in creating a distributed system for supply conditions improvement in a given islanding power system, in e.g. geographical terms (with determined points of delivery), or as an internal installation system of an industrial consumer.

Źródło:

Electrical Power Quality and Utilisation. Journal; 2008, 14, 2; 53-68
1896-4672

Pojawia się w:

Electrical Power Quality and Utilisation. Journal

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 6.

Tytuł:

The application of genetic algorithm for warehouse location in logistic network

Autorzy:

Izdebski, M.
Jacyna-Gołda, I.
Wasiak, M.

Powiązania:

https://bibliotekanauki.pl/articles/241946.pdf

Data publikacji:

2016

Wydawca:

Instytut Techniczny Wojsk Lotniczych

Tematy:

warehouse location
genetic algorithms
logistics network

Opis:

The paper presents a certain approach to solving the problem of warehouse locations based on the application of a genetic algorithm. The main objective is to indicate a location of warehouses from among those that already exist, which are most likely to assure the best value of the adopted criterion function, concurrently meeting recipients’ needs. A formal notation was presented of the mathematical model, allowing for the indispensable data, decisionrelated variables of limitations and the criterion function. The problem is to determine the location of warehouses taking into account minimising costs of transport and storage of forwarded cargo between determined facilities within the network. To allow solving the problem related to warehouse location within the logistics network of a manufacturing enterprise the use of a genetic algorithm was proposed. The structure of the algorithm was adapted to the mathematical model. A genetic algorithm was used to determine the volume of cargo stream flows between particular facilities in the network. To form a genetic algorithm it is advisable to define the chromosome structure, the adaptation function, cross-linking process and mutation. The location problem is solved in such a way that if for any day within the analysed period flows take place from a given warehouse or to a given warehouse, such a logistics facility should constitute an element of the target logistics network. If there are no such flows, no warehouse is necessary in the given location.

Źródło:

Journal of KONES; 2016, 23, 3; 201-208
1231-4005
2354-0133

Pojawia się w:

Journal of KONES

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 7.

Tytuł:

USING GENETIC ALGORITHM IN DYNAMIC MODEL OF SPECULATIVE ATTACK

Autorzy:

Gawrońska-Nowak, Bogna
Grabowski, Wojciech

Powiązania:

https://bibliotekanauki.pl/articles/517176.pdf

Data publikacji:

2016

Wydawca:

Instytut Badań Gospodarczych

Tematy:

currency crisis
dynamic model
genetic algorithms

Opis:

Evolution of speculative attack models shows certain progress in developing the idea of the role of expectations in the crisis mechanism. Obstfeld (1996) defines expectations as fully exogenous. Morris and Shin (1998) treat the expectations as endogenous (with respect to noise), not devoting too much attention to information structure of the foreign exchange market. Dynamic approach proposed by Angeletos, Hellwig and Pavan (2006) offers more sophisticated assumption about learning process. It tries to reflect time-variant and complex nature of information. However, this model ignores many important details like a Central Bank cost function. Genetic algorithm allows to avoid problems connected with incorporating information and expectations into agent decision-making process to an extent. There are some similarities between the evolution in Nature and currency market performance. In our paper an assumption about rational agent behaviour in the efficient market is criticised and we present our version of the dynamic model of a speculative attack, in which we use a genetic algorithm (GA) to define decision-making process of the currency market agents. The results of our simulation seem to be in line with the theory and intuition. An advantage of our model is that it reflects reality in a quite complex way, i.e. level of noise changes in time (decreasing), there are different states of fundamentals (with “more sensitive” upper part of the scale), the number of inflowing agents can be low or high (due to different globalization phases, different capital flow phases, different uncertainty levels).

Źródło:

Equilibrium. Quarterly Journal of Economics and Economic Policy; 2016, 11, 2; 287-306
1689-765X
2353-3293

Pojawia się w:

Equilibrium. Quarterly Journal of Economics and Economic Policy

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 8.

Tytuł:

Heuristic algorithms in topological design of telecommunication networks

Autorzy:

Karaś, P.

Powiązania:

https://bibliotekanauki.pl/articles/307692.pdf

Data publikacji:

2003

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

topological design
network optimisation
heuristic algorithms
genetic algorithms

Opis:

The paper addresses the generic topological network design problem and considers the use of various heuristic algorithms for solving the problem. The target of the optimisation is to determine a network structure and demand allocation pattern that would minimise the cost of the network, which is given by fixed installation costs of nodes and links and variable link capacity costs described bv linear or concave functions. Input data for the optimisation consists of a list of potential node and link locations and their costs and a set of demands defined between the nodes. Since the problem is known to be NP-hard. The use of specialised heuristic algorithms is proposed. The presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following ideas and methods: shifting of individual flows, local and global restoration of flows from chosen links or nodes, Yaged algorithm for finding local minima, Minoux greedy algorithm, simulated allocation and genetic algorithms. Efficiency of each of the proposed methods is tested on a set of numerical examples.

Źródło:

Journal of Telecommunications and Information Technology; 2003, 3; 73-82
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 9.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 10.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 11.

Tytuł:

Rola algorytmów genetycznych w procesie optymalizacji wyznaczania tras przejazdu
The role of genetic algorithms in the process of optimization determining driving routes

Autorzy:

Gauda, K.

Powiązania:

https://bibliotekanauki.pl/articles/313849.pdf

Data publikacji:

2016

Wydawca:

Instytut Naukowo-Wydawniczy "SPATIUM"

Tematy:

algorytmy genetyczne
optymalizacja
transport
genetic algorithms
optimization

Opis:

Problematyka artykułu dotyczy możliwości wykorzystania algorytmów genetycznych w procesie optymalizacji wyznaczania tras przejazdu. Opisana jest idea algorytmów genetycznych oraz zasada ich działania. Ukazany jest także przebieg wyznaczania optymalnej trasy z wykorzystaniem aplikacji Visual Genetic.
The problem of the article concerns the possibility of using genetic algorithms in the optimization process of determining driving routes. Described is the idea of genetic algorithms and the principle their activities. Shown is also the process of optimizing exemplary route with the use of Visual Genetic application.

Źródło:

Autobusy : technika, eksploatacja, systemy transportowe; 2016, 17, 11; 54-57
1509-5878
2450-7725

Pojawia się w:

Autobusy : technika, eksploatacja, systemy transportowe

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 12.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 13.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 14.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 15.

Tytuł:

Genetic tuning fuzzy dempster-shafer decision rules

Autorzy:

Walijewski, J. S.
Sosnowski, Z. A.

Powiązania:

https://bibliotekanauki.pl/articles/1931591.pdf

Data publikacji:

2002

Wydawca:

Politechnika Gdańska

Tematy:

genetic algorithms
fuzzy modelling
Dempster-Shafer theory

Opis:

The objective of this paper is to employ the Dempster-Shafer theory (DST) as a vehicle supporting the generation of fuzzy decision rules. The concept of fuzzy granulation realized via fuzzy clustering is aimed at the discretization of continuous attributes. Next we use Genetic for tuning fuzzy decision rules. Detailed experimental studies are presented concerning well-known medical data sets available on the Web.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 4; 631-640
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 16.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 17.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 18.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 19.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 20.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 21.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 22.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 23.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 24.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 25.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 26.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 27.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 28.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 29.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 30.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 31.

Tytuł:

Evolutionary method of robust controller computation
Techniki ewolucyjne doboru regulatorów odpornych

Autorzy:

Królikowski, T.
Nikończuk, P.

Powiązania:

https://bibliotekanauki.pl/articles/277210.pdf

Data publikacji:

2013

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

algorytmy genetyczne
sterowanie odporne
genetic algorithms
robust control

Opis:

Matematyczne metody doboru współczynników regulatora odpornego w przestrzeniach H∞ są bardzo skomplikowane. Projektant układu regulacji musi wykazywać się znajomością technik analizy funkcjonalnej. Do rozwiązywania problemów optymalizacji tego rodzaju doskonale nadają się algorytmy ewolucyjne. W artykule przedstawiono metodę oraz wyniki symulacji podczas doboru współczynników równania regulatora odpornego. Do doboru użyte są tylko dwa kryteria: sprawdzenie stabilności i zależność geometryczna - minimalizacja największej odległości między krzywymi Nyquista operacji G(jω) i 1/F(jω), gdzie G(jω) i F(jω) są transmitancjami regulatora oraz obiektu regulacji w układzie sprzężenia zwrotnego.
Mathematical methods of robust controller coefficients selection in H∞ spaces are very complicated. A control system integrator has to know functional analysis methods. To solve this kind of problem, evolutionary algorithms can be used. The paper presents both the method and simulation results of evolutionary algorithms application for a robust controller coefficients selection. To select robust controller, only two requirements are used: stability check and geometric dependency - minimizing the maximum distance between Nyquist diagrams of operations - G(jω) and 1/F(jω). Where G(jω) and F(jω) are controller and plant transfer functions in a feedback control system.

Źródło:

Pomiary Automatyka Robotyka; 2013, 17, 1; 80-82
1427-9126

Pojawia się w:

Pomiary Automatyka Robotyka

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 32.

Tytuł:

Grammars in genetic programming

Autorzy:

Wieczorek, W.
Czech, Z.

Powiązania:

https://bibliotekanauki.pl/articles/205856.pdf

Data publikacji:

2000

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

algorytm genetyczny
gramatyka
genetic algorithms
grammars
strongly typed genetic programming

Opis:

The work consists of two parts. In the first part the idea of genetic programming is presented and the basic elements of a genetic programming system are described. In the second part, considering a selected example, we describe the results of investigations of the influence of program grammars on the efficiency of genetic programming.

Źródło:

Control and Cybernetics; 2000, 29, 4; 1019-1030
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 33.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 34.

Tytuł:

Evolutionary Learning of Goal-Oriented Communication Strategies in Multi-Agent Systems

Autorzy:

Althnian, A.
Agah, A.

Powiązania:

https://bibliotekanauki.pl/articles/384735.pdf

Data publikacji:

2015

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

multi-agent system
communication strategy
evolutionary communication
genetic algorithms

Opis:

Previous studies in multi-agent systems have observed that varying the type of information that agents communicate, such as goals and beliefs, has a significant impact on the performance of the system with respect to different, usually conflicting, performance metrics, such as speed of solution, communication efficiency, and travel distance/cost. Therefore, when designing a communication strategy for a multi-agent system, it is unlikely that one strategy can perform well with respect to all of performance metrics. Yet, it is not clear in advance, which strategy will be the best with respect to each metric. With multi-agent systems being a common paradigm for building distributed systems in different domains, performance goals can vary from one application to the other according to the domain’s specifications and requirements. To address this issue, this work proposes a genetic algorithm-based approach for learning a goal- oriented communication strategy. The approach enables learning an effective communication strategy with respect to flexible, user-defined measurable performance goals. The learned strategy will determine what, when, and to whom information should be communicated during the course of task execution in order to improve the performance of the system with respect to the stated goal. Our preliminary evaluation shows that the proposed approach has promising results and the learned strategies have significant usefulness in improving the performance of the system with respect to the goals.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2015, 9, 3; 52-64
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 35.

Tytuł:

Exchange Rates: Predictable but not Explainable? Data Mining with Leading Indicators and Technical Trading Rules
Możliwości modelowania i prognozowania kursów walutowych: wskaźniki wyprzedzające i analiza techniczna

Autorzy:

Brandl, Bernd

Powiązania:

https://bibliotekanauki.pl/articles/907593.pdf

Data publikacji:

2005

Wydawca:

Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego

Tematy:

exchange rates
data mining
artificial neural networks
genetic algorithms

Opis:

This paper presents a data mining approach to forecasting exchange rates. It is assumed that exchange rates are determined by both fundamental and technical factors. The balance of fundamental and technical factors varies for each exchange rate and frequency. It is difficult for forecasters to establish the relative relevance of different kinds of factors given this mixture; therefore the utilization of data mining algorithms is advantageous. The approach applied uses a genetic algorithm and neural networks. Out-of-sample forecasting results are illustrated for five exchange rates on different frequencies and it is shown that data mining is able to produce forecasts that perform well.
W artykule przedstawiono proces eksploracji danych statystycznych w prognozowaniu kursów walutowych. Zakładamy, że kursy walutowe pozostają pod wpływem zarówno czynników o charakterze fundamentalnym, jak i czynników pozaekonomicznych. Równowaga pomiędzy tymi czynnikami różni się w zależności od rodzaju kursu walutowego i częstotliwości jego pomiaru. Prognostykom trudno jest ustalić względną siłę wpływu różnych czynników, stąd analiza polegająca na eksploracji danych ma określone zalety. W proponowanym podejściu wykorzystano algorytmy genetyczne i sztuczne sieci neuronowe. Przedstawiliśmy wyniki eksperymentów prognostycznych poza próbą statystyczną w odniesieniu do pięciu kursów walutowych, obserwowanych z różną częstotliwością. Pokazaliśmy, że metoda eksploracji danych może stanowić skuteczne narzędzie prognostyczne.

Źródło:

Acta Universitatis Lodziensis. Folia Oeconomica; 2005, 192
0208-6018
2353-7663

Pojawia się w:

Acta Universitatis Lodziensis. Folia Oeconomica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 36.

Tytuł:

An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem

Autorzy:

Stanimirovic, Z.

Powiązania:

https://bibliotekanauki.pl/articles/970612.pdf

Data publikacji:

2008

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

p-hub problem
genetic algorithms
discrete location and assignment

Opis:

In this paper the Uncapacitated Multiple Allocation p-hub Median Problem (the UMApHMP) is considered. A new heuristic method based on a genetic algorithm approach (GA) for solving UMApHMP is proposed. The described GA uses binary representation of the solutions. Genetic operators which keep the feasibility of individuals in the population are designed and implemented. The mutation operator with frozen bits is used to increase the diversibility of the genetic material. The running time of the GA is improved by caching technique. Proposed GA approach is bench-marked on the well known CAB and AP data sets and compared with the existing methods for solving the UMApHMP. Computational results show that the GA quickly reaches all previously known optimal solutions, and also gives results on large scale AP instances (up to n=200, p=20) that were not considered in the literature so far.

Źródło:

Control and Cybernetics; 2008, 37, 3; 669-692
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 37.

Tytuł:

AH Method: a Novel Routine for Vicinity Examination of the Optimum Found with a Genetic Algorithm

Autorzy:

Piętak, Daniel Andrzej
Bilski, Piotr
Napiorkowski, Paweł Jan

Powiązania:

https://bibliotekanauki.pl/articles/2200688.pdf

Data publikacji:

2022

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

heuristics
evolutionary computations
genetic algorithms
uncertainty estimation
parameter study

Opis:

The paper presents a novel heuristic procedure (further called the AH Method) to investigate function shape in the direct vicinity of the found optimum solution. The survey is conducted using only the space sampling collected during the optimization process with an evolutionary algorithm. For this purpose the finite model of point-set is considered. The statistical analysis of the sampling quality based upon the coverage of the points in question over the entire attraction region is exploited. The tolerance boundaries of the parameters are determined for the user-specified increase of the objective function value above the found minimum. The presented test-case data prove that the proposed approach is comparable to other optimum neighborhood examination algorithms. Also, the AH Method requires noticeably shorter computational time than its counterparts. This is achieved by a repeated, second use of points from optimization without additional objective function calls, as well as significant repository size reduction during preprocessing.

Źródło:

International Journal of Electronics and Telecommunications; 2022, 68, 4; 695--708
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 38.

Tytuł:

Biologically inspired methods for control of evolutionary algorithms

Autorzy:

Stańczak, J.

Powiązania:

https://bibliotekanauki.pl/articles/206262.pdf

Data publikacji:

2003

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

algorytm genetyczny
adaptacja
adaptacyjny algorytm ewolucyjny
genetic algorithms
adaptation
adaptive ewolutionary algorithms

Opis:

In this paper two methods for evolutionary algorithm control are proposed. The first one is a new method of tuning tlie probabilities of genetic operators. It is assumed in the presented approach that every member of the optimized population conducts his own ranking of genetic operators' qualities. This ranking enables computing the probabilities of execution of genetic operators. This set of probabilities is a basis of experience of every individual and according to this basis the individual chooses the operator in every iteration of the algorithm. Due to this experience one can maximize the chances of his offspring to survive. The second part of the paper deals with a self-adapting method of selection of individuals to a subsequent generation. Methods of selection applied in the evolutionary algorithms are usually inspired by nature and prefer solutions where the main role is played by randomness, competition and struggle among individuals. In the case of evolutionary algorithms, where populations of individuals are usually small, this causes a premature convergence to local minima. In order to avoid this drawback I propose to apply an approach based rather on an agricultural technique. Two new methods of object selection are proposed: a histogram selection and a mixed selection. The methods described were tested using examples based on scheduling and TSP.

Źródło:

Control and Cybernetics; 2003, 32, 2; 411-433
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 39.

Tytuł:

A genetic algorithm for the maximum 2-packing set problem

Autorzy:

Trejo-Sánchez, Joel Antonio
Fajardo-Delgado, Daniel
Gutierrez-Garcia, J. Octavio

Powiązania:

https://bibliotekanauki.pl/articles/330154.pdf

Data publikacji:

2020

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

maximum 2-packing set
genetic algorithms
graph algorithms
algorytm genetyczny
algorytm grafowy

Opis:

Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem. We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 173-184
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 40.

Tytuł:

Toward the best combination of optimization with fuzzy systems to obtain the best solution for the GA and PSO algorithms using parallel processing

Autorzy:

Valdez, Fevrier
Kawano, Yunkio
Melin, Patricia

Powiązania:

https://bibliotekanauki.pl/articles/384329.pdf

Data publikacji:

2020

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

genetic algorithms
particle swarm optimization (PSO)
fuzzy logic
parallel processing

Opis:

In general, this paper focuses on finding the best configuration for PSO and GA, using the different migration blocks, as well as the different sets of the fuzzy systems rules. To achieve this goal, two optimization algorithms were configured in parallel to be able to integrate a migration block that allow us to generate diversity within the subpopulations used in each algorithm, which are: the particle swarm optimization (PSO) and the genetic algorithm (GA). Dynamic parameter adjustment was also performed with a fuzzy system for the parameters within the PSO algorithm, which are the following: cognitive, social and inertial weight parameter. In the GA case, only the crossover parameter was modified.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 1; 55-64
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 41.

Tytuł:

Zastosowanie algorytmów genetycznych do optymalizacji modeli HMM
The use of genetic algorithms for optimalization of the models HMM

Autorzy:

Szostek, K.

Powiązania:

https://bibliotekanauki.pl/articles/320378.pdf

Data publikacji:

2005

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

optymalizacja
rozpoznawanie mowy
algorytmy genetyczne
optimization
speech recognition
genetic algorithms

Opis:

W artykule przedstawiono metodę optymalizacji modeli HMM z wykorzystaniem algorytmu genetycznego. W celu zbadania skuteczności przedstawionego algorytmu genetycznego zostały przeprowadzone badania optymalizacji modeli HMM za pomocą algorytmu Bauma-Welcha oraz zaproponowanego algorytmu genetycznego. Dodatkowo w artykule zostały umieszczone wyniki z badań modelowania sygnału mowy w postaci przebiegów czasowych przez modele HMM optymalizowane algorytmem Bauma-Welcha.
In the article there was presented the method of optimization of the models HMM with the use of the genetic algorithm. For the purpose of examining the effectiveness of the presented genetic algorithm there were carried out tests of optimization of the models HMM with the use of Baum-Welch's algorithm and the proposed genetic algorithm. In addition, in the article there were placed the results of tests of modeling the speech signal in the form of time runs by the models HMM optimized with the use of Baum-Welch 's algorithm.

Źródło:

Elektrotechnika i Elektronika; 2005, 24, 2; 183-193
1640-7202

Pojawia się w:

Elektrotechnika i Elektronika

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 42.

Tytuł:

Voice command recognition using hybrid genetic algorithm

Autorzy:

Wroniszewska, M.
Dziedzic, J.

Powiązania:

https://bibliotekanauki.pl/articles/1955309.pdf

Data publikacji:

2010

Wydawca:

Politechnika Gdańska

Tematy:

voice command recognition
genetic algorithms
K-nearest neighbour
hybrid approach

Opis:

Speech recognition is a process of converting the acoustic signal into a set of words, whereas voice command recognition consists in the correct identification of voice commands, usually single words. Voice command recognition systems are widely used in the military, control systems, electronic devices, such as cellular phones, or by people with disabilities (e.g., for controlling a wheelchair or operating a computer system). This paper describes the construction of a model for a voice command recognition system based on the combination of genetic algorithms (GAs) and K-nearest neighbour classifier (KNN). The model consists of two parts. The first one concerns the creation of feature patterns from spoken words. This is done by means of the discrete Fourier transform and frequency analysis. The second part constitutes the essence of the model, namely the design of the supervised learning and classification system. The technique used for the classification task is based on the simplest classifier – K-nearest neighbour algorithm. GAs, which have been demonstrated as a good optimization and machine learning technique, are applied to the feature extraction process for the pattern vectors. The purpose and main interest of this work is to adapt such a hybrid approach to the task of voice command recognition, develop an implementation and to assess its performance. The complete model of the system was implemented in the C++ language, the implementation was subsequently used to determine the relevant parameters of the method and to improve the approach in order to obtain the desired accuracy. Different variants of GAs were surveyed in this project and the influence of particular operators was verified in terms of the classification success rate. The main finding from the performed numerical experiments indicates the necessity of using genetic algorithms for the learning process. In consequence, a highly accurate recognition system was obtained, providing 94.2% correctly classified patterns. The hybrid GA/KNN approach constituted a significant improvement over the simple KNN classifier. Moreover, the training time required for the GA to learn the given set of words was found to be on a level that is acceptable for the efficient functioning of the voice command recognition system.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2010, 14, 4; 377-396
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 43.

Tytuł:

Optimizing the Use of Human Resources in Industrial-Service Enterprises

Autorzy:

Tychoniuk, A.
Wyczółkowski, R.
Stuchlý, V.

Powiązania:

https://bibliotekanauki.pl/articles/2064891.pdf

Data publikacji:

2018

Wydawca:

STE GROUP

Tematy:

optimization
human resource allocation
competency
selection of employees
genetic algorithms

Opis:

The optimal use of resources available in the enterprise is important regardless of the size of the company and the industry in which it operates. Enterprises are therefore forced constantly to make alternative choices related to the allocation of available resources and to optimize these choices. The article addresses the problem of the approach to optimizing the use of human resources particularly, the use of extra employee qualifications e.g., manual skills, pressure resistance, work precision, the ability to read schematic diagrams, etc. in the context of technical requirements for a given task. This is extremely important in the situation when subsequent works are individual and the conditions in which they will be performed, cannot be predicted in 100%, they may differ from those that have been implemented so far, and at the same time numerous orders of various nature are being implemented. In this situation, an accurate prediction of the requirements posed by new tasks and the appropriate selection of teams executing them can have an impact on the effectiveness of the task completion process. In the article, this problem is presented on the example of a medium-sized service enterprise operating in the industry-related sector operating basically on tender procedures and tender contests. The works are carried out on the customer's premises, often with new customers or in new field conditions. Thus, the success of the undertaking depends mainly on the optimal selection of employees with appropriate qualifications and competences. The example of an investment task is used to show a method of identifying characteristics relevant to the task as well as selection of employees in order to use the capabilities of human teams better. Technical aspects of task implementation and an employees team selection with regard to the absolutely required technical qualifications as well as the behavioral and physical skills necessary for its implementation are taken into account. The described method can be used for future tasks regardless of the changing conditions of their implementation. The intention of the authors is to develop a tool supporting the decision-making process in this area, so that it can also be used by managers with lower technical competences.

Źródło:

Multidisciplinary Aspects of Production Engineering; 2018, 1, 1; 857--865
2545-2827

Pojawia się w:

Multidisciplinary Aspects of Production Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 44.

Tytuł:

Using a genetic algorithm for the design of an optimal transport network
Zastosowanie algorytmu genetycznego do optymalizacji sieci transportowej

Autorzy:

Król, A.
Pamuła, T.

Powiązania:

https://bibliotekanauki.pl/articles/375204.pdf

Data publikacji:

2009

Wydawca:

Politechnika Śląska. Wydawnictwo Politechniki Śląskiej

Tematy:

algorytm genetyczny
sieć transportowa
optymalizacja
transport network
genetic algorithms
optimisation

Opis:

A transportation network serves the transport requirements of moving people and goods with different destination goals and relocation directions. The current network structure is usually a result of historically long adaptation process and the probability that it is not optimal is very high. Additionally it can be observed a growth of transportation needs. In these circumstances when a modernisation or expansion is required a number of competing designs must be evaluated. Combined total building expenses and maintenance costs are accepted among the evaluation criteria. Such a restriction does not guarantee an optimal solution as only a small fraction of the solution space is analysed. The input data for the optimisation problem cannot be entered in analytical form so it is natural to propose a genetic algorithm for performing the task.
Siec transportowa służy zaspokojeniu komunikacyjnych potrzeb ludności ukierunkowanych na różne punkty docelowe i różne kierunki. Ponieważ aktualna struktura sieci jest skutkiem długotrwałych procesów w przeszłosci prawdopodobienstwo, że nie jest ona optymalna dla obecnych potrzeb jest duże. Dodatkowo, przewiduje sie wzrost tych potrzeb. W takiej sytuacji, gdy wymagana jest modernizacja lub rozbudowa sieci transportowej z reguły rozpatruje sie kilka konkurencyjnych projektów i nastepnie wybiera jeden z nich. Jako kryterium rozpatruje sie łaczne koszty rozbudowy i koszty użytkowania sieci transportowej. Taka procedura nie gwarantuje znalezienia rozwiązania optymalnego, gdyż nawet niewielki ułamek przestrzeni wszystkich możliwości nie jest poddany analizie. Ze wzgledu na to, że dane wejściowe dla tego problemu nie mogą być zadane postaci analitycznej, naturalne jest zaproponowanie algorytmu genetycznego, jako narzędzia optymalizacyjnego

Źródło:

Transport Problems; 2009, 4, 4; 107-113
1896-0596
2300-861X

Pojawia się w:

Transport Problems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 45.

Tytuł:

Optimisation of the machining process using genetic algorithm

Autorzy:

Čuboňová, Nadežda
Dodok, Tomáš
Ságová, Zuzana

Powiązania:

https://bibliotekanauki.pl/articles/196338.pdf

Data publikacji:

2019

Wydawca:

Politechnika Śląska. Wydawnictwo Politechniki Śląskiej

Tematy:

optimisation
genetic algorithms
CAM system
optymalizacja
algorytmy genetyczne
system CAM

Opis:

This paper deals with genetic algorithms as an optimisation method and its use for optimisation of the machining process in the CAM system. Tool path verification and optimisation are two best ways of dramatically improving manufacturing operations while saving money with relatively little work. Genetic algorithms can be used for improvement of these operations and considerably reduce length of tool paths leading to the reduction of machine times and optimisation of cutting parameters. Provides the software application created to optimise processes of boring and local milling (Incomplete sentence; what or who provides).

Źródło:

Zeszyty Naukowe. Transport / Politechnika Śląska; 2019, 104; 15-25
0209-3324
2450-1549

Pojawia się w:

Zeszyty Naukowe. Transport / Politechnika Śląska

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 46.

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

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 47.

Tytuł:

Genetic algorithm coupled with Bézier curves applied to the magnetic field on a solenoid axis synthesis

Autorzy:

Ziolkowski, M.
Gratkowski, S.

Powiązania:

https://bibliotekanauki.pl/articles/141616.pdf

Data publikacji:

2016

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

Bézier curves
genetic algorithms
magnetic field synthesis
nonlinear inverse
problems

Opis:

Electromagnetic arrangements which create a magnetic field of required distribution and magnitude are widely used in electrical engineering. Development of new accurate designing methods is still a valid topic of technical investigations. From the theoretical point of view the problem belongs to magnetic fields synthesis theory. This paper discusses a problem of designing a shape of a solenoid which produces a uniform magnetic field on its axis. The method of finding an optimal shape is based on a genetic algorithm (GA) coupled with Bézier curves.

Źródło:

Archives of Electrical Engineering; 2016, 65, 2; 361-370
1427-4221
2300-2506

Pojawia się w:

Archives of Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 48.

Tytuł:

Wpływ parametrów startowych na tempo zbieżności koewolucyjnego algorytmu genetycznego
Impact of the starting parameters on the convergence of results for a coevolutionary genetic algorithm

Autorzy:

Kameduła, Michał
Gajda, Jan

Powiązania:

https://bibliotekanauki.pl/articles/588424.pdf

Data publikacji:

2015

Wydawca:

Uniwersytet Ekonomiczny w Katowicach

Tematy:

Algorytmy genetyczne
Koewolucja
Zbieżność rozwiązań
Co-evolution,
Convergence
Genetic algorithms

Opis:

W pracy tej zaprezentowano procedurę pozwalającą zbadać wpływ parametrów startowych na tempo zbieżności algorytmu genetycznego. Jej zaletą jest fakt, że bierze ona pod uwagę nie tylko samą szybkość znalezienia rozwiązań bliskich optymalnym, ale również stabilność wyników. Przedstawioną metodę wykorzystano następnie do wyboru najlepszej wartości parametrów pewnego koewolucyjnego algorytmu analizy portfelowej. Wykazano przy tym, że dla zadania dwukryterialnego daje on lepsze wyniki, niż niezależne przebiegi zwykłego algorytmu genetycznego przetwarzającego jedną populację na raz. Jednocześnie jednak wymiana informacji pomiędzy niszami podlegającymi koewolucji powinna zostać przerwana, gdy znajdziemy już zestaw rozwiązań bliskich optymalnym. Wykazano też znaczny wpływ parametrów mutacji na zbieżność algorytmu.
In this work we propose a procedure for testing the impact of starting parameters on the convergence of a genetic algorithm. Although the described solution is quite time consuming it takes into consideration both number of iterations required and stability of obtained results. We then proceed to infer optimal values of such parameters for a certain co-evolutionary portfolio analysis algorithm. We prove, that such an implementation is superior to simple genetic algorithms operating on a single population when dealing with multi-objective fitness functions. However, the exchange of information between different niches should not be enabled for too long. We also point out the big impact that often disregarded mutation procedure can have on the convergence to suboptimal solutions. Interestingly, both too high and too low probability of mutation can have a noticible negative impact on the performance of a given algorithm.

Źródło:

Studia Ekonomiczne; 2015, 235; 100-112
2083-8611

Pojawia się w:

Studia Ekonomiczne

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 49.

Tytuł:

Efficiency of selected meta-heuristics applied to the TSP problem: a simulation study

Autorzy:

Kwaśnicka, H.

Powiązania:

https://bibliotekanauki.pl/articles/1931573.pdf

Data publikacji:

2003

Wydawca:

Politechnika Gdańska

Tematy:

ant colony
genetic algorithms
simulated annealing
tabu search
neural networks

Opis:

The paper presents a simulation study of the usefulness of a numberof meta-heuristicsused as optimisation methods forTSPproblems. The five considered approaches are outlined: GeneticAlgorithm, Simulated Annealing, Ant Colony System, Tabu Search and Hopfield Neural Network.Using a purpose-developed computer program, efficiency of the meta-heuriticshas been studied andcompared. Results obtained from about 40000 simulation runs are briefly presented and discussed.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2003, 7, 1; 73-91
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 50.

Tytuł:

Optimization of the loading pattern of the PWR core using genetic algorithms and multi-purpose fitness function

Autorzy:

Kubiński, Wojciech
Darnowski, Piotr
Chęć, Kamil

Powiązania:

https://bibliotekanauki.pl/articles/2055670.pdf

Data publikacji:

2021

Wydawca:

Instytut Chemii i Techniki Jądrowej

Tematy:

genetic algorithms
fuel loading
loading optimization
PWR
nuclear reactor technology

Opis:

The study demonstrates an application of genetic algorithms (GAs) in the optimization of the first core loading pattern. The Massachusetts Institute of Technology (MIT) BEAVRS pressurized water reactor (PWR) model was applied with PARCS nodal-diffusion core simulator coupled with GA numerical tool to perform pattern selection. In principle, GAs have been successfully used in many nuclear engineering problems such as core geometry optimization and fuel confi guration. In many cases, however, these analyses focused on optimizing only a single parameter, such as the effective neutron multiplication factor (keff), and often limited to the simplified core model. On the contrary, the GAs developed in this work are equipped with multiple-purpose fitness function (FF) and allow the optimization of more than one parameter at the same time, and these were applied to a realistic full-core problem. The main parameters of interest in this study were the total power peaking factor (PPF) and the length of the fuel cycle. The basic purpose of this study was to improve the economics by finding longer fuel cycle with more uniform power/flux distribution. Proper FFs were developed, tested, and implemented and their results were compared with the reference BEAVRS first fuel cycle. In the two analysed test scenarios, it was possible to extend the fi rst fuel cycle while maintaining lower or similar PPF, in comparison with the BEAVRS core, but for the price of increased initial reactivity.

Źródło:

Nukleonika; 2021, 66, 4; 147--151
0029-5922
1508-5791

Pojawia się w:

Nukleonika

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce