Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "evolutionary" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    Niching in evolutionary multi-agent systems
    Autorzy:
    Krzywicki, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/305774.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    niching
    evolutionary algorithms
    multi-agent systems
    Opis:
    Niching is a group of techniques used in evolutionary algorithms, useful in several types of problems, including multimodal or nonstationary optimization. This paper investigates the applicability of these methods to evolutionary multi-agent systems (EMAS), a hybrid model combining the advantages of evolutionary algorithms and multi-agent systems. This could increase the efficiency of this type of algorithms and allow to apply them to a wider class of problems. As a starting point, a simple but flexible EMAS framework is proposed. Then, it is shown how to extend this framework in order to introduce niching, by adapting two classical niching methods. Finally, preliminary experimental results show the efficiency and the simultaneous discovery of multiple optima by this modified EMAS.
    Źródło:
    Computer Science; 2013, 14 (1); 77-95
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary multi-agent system with crowding factor and mass center mechanisms for multiobjective optimisation
    Autorzy:
    Różański, Mateusz
    Siwik, Leszek
    Powiązania:
    https://bibliotekanauki.pl/articles/305591.pdf
    Data publikacji:
    2019
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    evolutionary computation
    multi-agent system
    multiobjective optimisation
    Opis:
    This work presents some additional mechanisms for Evolutionary Multi-Agent Systems for Multiobjective Optimisation trying to solve problems with population stagnation and loss of diversity. Those mechanisms reward solutions located in a less crowded neighborhood and on edges of the frontier. Both techniques have been described and also some preliminary results have been shown.
    Źródło:
    Computer Science; 2019, 20 (3); 343-367
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary multi-agent computing in inverse problems
    Autorzy:
    Wróbel, K.
    Torba, P.
    Paszyński, M
    Byrski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/305816.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    multi-agent systems
    evolutionary computation
    inverse problems
    Opis:
    This paper tackles the application of evolutionary multi-agent computing to solve inverse problems. High costs of fitness function call become a major difficulty when approaching these problems with population-based heuristics. However, evolutionary agent-based systems (EMAS) turn out to reduce the fitness function calls, which makes them a possible weapon of choice against them. This paper recalls the basics of EMAS and describes the considered problem (Step and Flash Imprint Lithography), and later, shows convincing results that EMAS is more effective than a classical evolutionary algorithm.
    Źródło:
    Computer Science; 2013, 14 (3); 367-383
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scaling evolutionary programming with the use of apache spark
    Autorzy:
    Funika, W.
    Koperek, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/952932.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    distributed systems
    evolutionary programming
    symbolic regression
    scaling
    Apache Spark
    Opis:
    Organizations across the globe gather more and more data, encouraged by easy-to-use and cheap cloud storage services. Large datasets require new approaches to analysis and processing, which include methods based on machine learning. In particular, symbolic regression can provide many useful insights. Unfortunately, due to high resource requirements, use of this method for large-scale dataset analysis might be unfeasible. In this paper, we analyze a bottleneck in the open-source implementation of this method we call hubert. We identify that the evaluation of individuals is the most costly operation. As a solution to this problem, we propose a new evaluation service based on the Apache Spark framework, which attempts to speed up computations by executing them in a distributed manner on a cluster of machines. We analyze the performance of the service by comparing the evaluation execution time of a number of samples with the use of both implementations. Finally, we draw conclusions and outline plans for further research.
    Źródło:
    Computer Science; 2016, 17 (1); 69-82
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-objective optimization of vehicle routing problem using evolutionary algorithm with memory
    Autorzy:
    Podlaski, K.
    Wiatrowski, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/305266.pdf
    Data publikacji:
    2017
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    vehicle routing problem
    time windows
    evolutionary algorithms
    multi-objective optimization
    Opis:
    The idea of a new evolutionary algorithm with memory aspect included is proposed to find multiobjective optimized solution of vehicle routing problem with time windows. This algorithm uses population of agents that individually search for optimal solutions. The agent memory incorporates the process of learning from the experience of each individual agent as well as from the experience of the population. This algorithm uses crossover operation to define agents evolution. In the paper we choose as a base the Best Cost Route Crossover (BCRC) operator. This operator is well suited for VPRTW problems. However it does not treat both of parent symmetrically what is not natural for general evolutionary processes. The part of the paper is devoted to find an extension of the BCRC operator in order to improve inheritance of chromosomes from both of parents. Thus, the proposed evolutionary algorithm is implemented with use of two crossover operators: BCRC and its extended-modified version. We analyze the results obtained from both versions applied to Solomon’s and Gehring & Homberger instances. We conclude that the proposed method with modified version of BCRC operator gives statistically better results than those obtained using original BCRC. It seems that evolutionary algorithm with memory and modification of Best Cost Route Crossover Operator lead to very promising results when compared to the ones presented in the literature.
    Źródło:
    Computer Science; 2017, 18 (3); 269-286
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary multi-agent systems in non-stationary environments
    Autorzy:
    Kisiel-Dorohinicki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/305810.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    multi-agent systems
    evolutionary computation
    dynamic optimization
    non-stationary environment
    Opis:
    In this article, the performance of an evolutionary multi-agent system in dynamic optimization is evaluated in comparison to classical evolutionary algorithms. The starting point is a general introduction describing the background, structure and behavior of EMAS against classical evolutionary techniques. Then, the properties of energy-based selection are investigated to show how they may influence the diversity of the population in EMAS. The considerations are illustrated by experimental results based on the dynamic version of the well-known, high-dimensional Rastrigin function benchmark.
    Źródło:
    Computer Science; 2013, 14 (4); 563-575
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The airport gate assignment problem – multi-objective optimization versus evolutionary multi-objective optimization
    Autorzy:
    Kaliszewski, I.
    Miroforidis, J.
    Stańczak, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/305661.pdf
    Data publikacji:
    2017
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    airport gate assignment problem
    Evolutionary Multi-objective Optimization
    mixed-integer programming
    Opis:
    In this paper, we approach the Airport Gate Assignment Problem by Multi-objective Optimization as well as Evolutionary Multi-objective Optimization. We solve a bi-criteria formulation of this problem by the commercial mixed-integer programming solver CPLEX and a dedicated Evolutionary Multi-objective Optimization algorithm. To deal with multiple objectives, we apply a methodology that we developed earlier to capture decision-maker preferences in multi-objective environments. We present the results of numerical tests for these two approaches.
    Źródło:
    Computer Science; 2017, 18 (1); 41-52
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of simulation model parameters for solidification of metals with use of agent-based evolutionary algorithm
    Optymalizacja parametrów modelu symulacyjnego procesu krzepnięcia metali z zastosowaniem agentowego algorytmu ewolucyjnego
    Autorzy:
    Kluska-Nawarecka, S.
    Smolarek-Grzyb, A.
    Byrski, A.
    Wilk-Kołodziejczyk, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/305357.pdf
    Data publikacji:
    2008
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    numeryczna symulacja
    algorytmy ewolucyjne
    system agentowy
    proces krzepnięcia odlewów
    odlew
    numerical simulation
    evolutionary algorithm
    agent systems
    solidification casting process
    casting
    Opis:
    The finite elements method (FEM) is currently widely used for simulation of thermal processes. However, one of still unresolved problems remains proper selection of mathematical model parameters for these processes. As far as modelling of cooling casts in forms is concerned, particular difficulties appear while estimating values of numerous coefficients such as: heat transport coefficient between metal and form, specific heat, metal and form heat conduction coefficient, metal and form density. Coefficients mentioned above depend not only on materials properties but also on temperature. In the paper the idea of optimalization of simulation method parameters based on adaptive adjustment of curve representing simulation result and result obtained in physical experiment is presented along with the idea of evolutionary and agent-based evolutionary optimization system designed to conduct such optimizations. Preliminary results obtained with use of ABAQUS system available in ACK CYFRONET and software developed at AGH-UST conclude the paper.
    Metoda elementów skończonych (MES) znajduje obecnie liczne zastosowania w symulacji procesów cieplnych. Wciąż jednak nierozwiązalny pozostaje problem doboru niektórych współczynników modeli matematycznych tych procesów. Przy modelowaniu stygnięcia odlewów w formie, szczególne trudności powstają przy wyznaczeniu wartości licznych parametrów, np.: współczynnika transportu ciepła pomiędzy metalem a formą, ciepła właściwego, współczynnika przewodnictwa cieplnego metalu i formy, gęstości metalu i formy. Współczynniki te zależą nie tylko od właściwości materiałów, lecz również od temperatury. W artykule zaproponowano metodę optymalizacji wartości parametrów modelu opartą na adaptacyjnym dostosowaniu krzywej stanowiącej wynik symulacji do przebiegu uzyskanego w eksperymencie fizycznym z zastosowaniem algorytmu ewolucyjnego w wersji agentowej. Wstępne wyniki obliczeń zostały zrealizowane przy wykorzystaniu systemu ABAQUS dostępnego w ACK CYFRONET oraz oprogramowania opracowanego przez AGH-UST.
    Źródło:
    Computer Science; 2008, 9; 55-66
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An efficient approach for view selection for data warehouse using tree mining and evolutionary computation
    Autorzy:
    Thakare, A.
    Deshpande, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/305413.pdf
    Data publikacji:
    2018
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    database management systems
    data warehousing and data mining
    query optimization
    graph mining
    algorithms for parallel computing
    evolutionary computations
    genetic algorithms
    Opis:
    The selection of a proper set of views to materialize plays an important role in database performance. There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. In this paper, we present a new efficient scalable method for view selection under the given storage constraints using a tree mining approach and evolutionary optimization. The tree mining algorithm is designed to determine the exact frequency of (sub)queries in the historical SQL dataset. The Query Cost model achieves the objective of maximizing the performance benefits from the final view set that is derived from the frequent view set given by the tree mining algorithm. The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. The experimental results show that the proposed method is successful in recommending a solution that is fairly close to an optimal solution.
    Źródło:
    Computer Science; 2018, 19 (4); 431-455
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      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