Informacja

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

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

Wyszukujesz frazę "genetic algorithms" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Genetic minimisation of peak-to-peak level of a complex multi-tone signal
    Autorzy:
    Chruszczyk, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/201424.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    evolutionary computation
    genetic algorithms
    multi-tone signal
    optimisation
    peak-to-peak minimisation
    obliczenia ewolucyjne
    algorytmy genetyczne
    sygnał wielotonowy
    optymalizacja
    Opis:
    This paper presents results of evolutionary minimisation of peak-to-peak value of a?multi-tone signal. The signal is the sum of multiple tones (channels) with constant amplitudes and frequencies combined with variable phases. An exemplary application is emergency broadcasting using widely used analogue broadcasting techniques: citizens band (CB) or VHF FM commercial broadcasting. The work presented illustrates a?relatively simple problem, which, however, is characterised by large combinatorial complexity, so direct (exhaustive) search becomes completely impractical. The process of minimisation is based on genetic algorithm (GA), which proves its usability for given problem. The final result is a?significant reduction of peak-to-peak level of given multi-tone signal, demonstrated by three real-life examples.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 3; 621-629
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Direct least squares and derivative-free optimisation techniques for determining mine-induced horizontal ground displacement
    Autorzy:
    Rusek, Janusz
    Tajduś, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2090675.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    horizontal ground displacement
    mining
    direct least squares
    derivative-free optimisation
    genetic algorithms
    differential evolution
    particle swarm optimization
    przemieszczenie poziome gruntu
    górnictwo
    optymalizacja bez pochodnych
    optymalizacja roju cząstek
    algorytmy genetyczne
    ewolucja różnicowa
    bezpośrednie najmniejsze kwadraty
    Opis:
    The paper presents the results of analyses concerning a new approach to approximating trajectory of mining-induced horizontal displacements. Analyses aimed at finding the most effective method of fitting data to the trajectory of mining-induced horizontal displacements. Two variants were made. In the first, the direct least square fitting (DLSF) method was applied based on the minimization of the objective function defined in the form of an algebraic distance. In the second, the effectiveness of differential-free optimization methods (DFO) was verified. As part of this study, the following methods were tested: genetic algorithms (GA), differential evolution (DE) and particle swarm optimization (PSO). The data for the analysis were measurements of on the ground surface caused by the mining progressive work at face no. 698 of the German Prospel-Haniel mine. The results obtained were compared in terms of the fitting quality, the stability of the results and the time needed to carry out the calculations. Finally, it was found that the direct least square fitting (DLSF) approach is the most effective for the analyzed registration data base. In the authors’ opinion, this is dictated by the angular range in which the measurements within a given measuring point oscillated.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; e135840, 1--12
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Direct least squares and derivative-free optimisation techniques for determining mine-induced horizontal ground displacement
    Autorzy:
    Rusek, Janusz
    Tajduś, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2173560.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    horizontal ground displacement
    mining
    direct least squares
    derivative-free optimisation
    genetic algorithms
    differential evolution
    particle swarm optimization
    przemieszczenie poziome gruntu
    górnictwo
    optymalizacja bez pochodnych
    optymalizacja roju cząstek
    algorytmy genetyczne
    ewolucja różnicowa
    bezpośrednie najmniejsze kwadraty
    Opis:
    The paper presents the results of analyses concerning a new approach to approximating trajectory of mining-induced horizontal displacements. Analyses aimed at finding the most effective method of fitting data to the trajectory of mining-induced horizontal displacements. Two variants were made. In the first, the direct least square fitting (DLSF) method was applied based on the minimization of the objective function defined in the form of an algebraic distance. In the second, the effectiveness of differential-free optimization methods (DFO) was verified. As part of this study, the following methods were tested: genetic algorithms (GA), differential evolution (DE) and particle swarm optimization (PSO). The data for the analysis were measurements of on the ground surface caused by the mining progressive work at face no. 698 of the German Prospel-Haniel mine. The results obtained were compared in terms of the fitting quality, the stability of the results and the time needed to carry out the calculations. Finally, it was found that the direct least square fitting (DLSF) approach is the most effective for the analyzed registration data base. In the authors’ opinion, this is dictated by the angular range in which the measurements within a given measuring point oscillated.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 1; art. no. e135840
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
    Autorzy:
    Nowotniak, R.
    Kucharski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/201268.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    quantum-inspired genetic algorithm
    evolutionary computing
    meta-optimization
    parallel algorithms
    GPGPU
    Opis:
    This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDATMtechnology). A novel approach to parallel implementation of the algorithm has been presented. In a block of threads, each thread transforms a separate quantum individual or different quantum gene; In each block, a separate experiment with different population is conducted. The computations have been distributed to eight GPU devices, and over 400× speedup has been gained in comparison to Intel Core i7 2.93GHz CPU. This approach allows efficient meta-optimization of the algorithm parameters. Two criteria for the meta-optimization of the rotation angles in quantum genes state space have been considered. Performance comparison has been performed on combinatorial optimization (knapsack problem), and it has been presented that the tuned algorithm is superior to Simple Genetic Algorithm and to original QIGA algorithm.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 323-330
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of the process of restoring the continuity of the WDS based on the matrix and genetic algorithm approach
    Autorzy:
    Antonowicz, Ariel
    Urbaniak, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/2173692.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    WNTR
    Water Network Tool for Resilience
    aggregation of failures
    water distribution system
    EPANET Solver
    Graph Searching Algorithms
    genetic algorithm
    optimization
    post-disaster events
    agregacja awarii
    system dystrybucji wody
    EPANET
    algorytm wyszukiwania grafów
    algorytm genetyczny
    optymalizacja
    wydarzenia po katastrofie
    Opis:
    The article discusses an example of the use of graph search algorithms with trace of water analysis and aggregation of failures in the occurrence of a large number of failures in the Water Supply System (WSS). In the event of a catastrophic situation, based on the Water Distribution System (WDS) network model, information about detected failures, the condition and location of valves, the number of repair teams, criticality analysis, the coefficient of prioritization of individual network elements, and selected objective function, the algorithm proposes the order of repairing the failures should be analyzed. The approach proposed by the authors of the article assumes the selection of the following objective function: minimizing the time of lack of access to drinking water (with or without prioritization) and minimizing failure repair time (with or without failure aggregation). The algorithm was tested on three different water networks (small, medium, and large numbers of nodes) and three different scenarios (different numbers of failures and valves in the water network) for each selected water network. The results were compared to a valve designation approach for closure using an adjacency matrix and a Strategic Valve Management Model (SVMM).
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141594
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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