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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    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ł:
    Ligament-based spine-segment mechanisms
    Autorzy:
    Ciszkiewicz, A.
    Milewski, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/202123.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    intervertebral joint
    optimization
    parameters estimation
    genetic algorithm
    elastostatic analysis
    staw międzykręgowy
    optymalizacja
    szacowanie parametrów
    algorytm genetyczny
    analiza elastostatyczna
    Opis:
    Nowadays, a growing interest in spine-segment mechanisms for humanoid robots can be observed. The ones currently available are mostly inspired by an intervertebral joint but rarely use its structure and behaviour as input data. The aim of this study was to propose and verify an approach to spine-segment mechanisms synthesis, in which the mechanisms were obtained directly from a ligament system of the intervertebral joint through numerical optimization. The approach consists of two independent optimization procedures performed with genetic algorithm. The first one searches for the optimal structure, while the second estimates its geometrical and stiffness parameters. The mechanisms are rated by their ability to reproduce the static behaviour of the joint in selected aspects. Both procedures use the lumbar L4-L5 intervertebral joint reference data. The approach was tested in two numerical scenarios. It was possible to obtain a mechanism with 7 flexible linear legs that accurately emulated the elastostatic behaviour of the intervertebral joint under moment loads. The results prove that the proposed method is feasible and worth exploring. It may be employed in design of bioinspired joints for use in humanoid robots and can also serve as an initial step in the design of prosthetic and orthotic devices for a human spine.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 5; 705-712
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving scheduling problems with integrated online sustainability observation using heuristic optimization
    Autorzy:
    Burduk, Anna
    Musiał, Kamil
    Balashov, Artem
    Batako, Andre
    Safonyk, Andrii
    Powiązania:
    https://bibliotekanauki.pl/articles/2173719.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    production scheduling
    sustainable development
    genetic algorithm
    meta-heuristics
    intelligent optimization methods of production systems
    tabu search
    harmonogramowanie produkcji
    zrównoważony rozwój
    algorytm genetyczny
    przeszukiwanie tabu
    metaheurystyki
    inteligentne metody optymalizacji systemów produkcyjnych
    Opis:
    The paper deals with the issue of production scheduling for various types of employees in a large manufacturing company where the decision-making process was based on a human factor and the foreman’s know-how, which was error-prone. Modern production processes are getting more and more complex. A company that wants to be competitive on the market must consider many factors. Relying only on human factors is not efficient at all. The presented work has the objective of developing a new employee scheduling system that might be considered a particular case of the job shop problem from the set of the employee scheduling problems. The Neuro-Tabu Search algorithm and the data gathered by manufacturing sensors and process controls are used to remotely inspect machine condition and sustainability as well as for preventive maintenance. They were used to build production schedules. The construction of the Neuro-Tabu Search algorithm combines the Tabu Search algorithm, one of the most effective methods of constructing heuristic algorithms for scheduling problems, and a self-organizing neural network that further improves the prohibition mechanism of the Tabu Search algorithm. Additionally, in the paper, sustainability with the use of Industry 4.0 is considered. That would make it possible to minimize the costs of employees’ work and the cost of the overall production process. Solving the optimization problem offered by Neuro-Tabu Search algorithm and real-time data shows a new way of production management.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143830
    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-4 z 4

      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