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ę "local search algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Ship Collision Avoidance by Distributed Tabu Search
    Autorzy:
    Kim, D.
    Hirayama, K.
    Okimoto, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/116919.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Safety of Navigation
    Collision Avoidance
    Distributed Tabu Search Algorithm (DTSA)
    Distributed Local Search Algorithm (DLSA)
    Quasi-Local Minimum (QLM)
    Tabu Search Algorithm
    Local Search Algorithm
    Distributed Tabu Search
    Opis:
    More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Genetic algorithm combined with a local search method for identifying susceptibility genes
    Autorzy:
    Yang, C -H.
    Moi, S. -H.
    Lin, Y. -D.
    Chuang, L. -Y.
    Powiązania:
    https://bibliotekanauki.pl/articles/91586.pdf
    Data publikacji:
    2016
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    genetic algorithms
    identifying susceptibility genes
    local search algorithm
    Opis:
    Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of the Morphological Parameters of a Metal Foam for the Highest Sound Absorption Coefficient Using Local Search Algorithm
    Autorzy:
    Jafari, Mohammad Javad
    Khavanin, Ali
    Ebadzadeh, Touraj
    Fazlali, Mahmood
    Sharak, Mohsen Niknam
    Madvari, Rohollah Fallah
    Powiązania:
    https://bibliotekanauki.pl/articles/176536.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    SAC
    Sound Absorption Coefficient
    LSA
    Local Search Algorithm
    metal foam
    optimization
    Opis:
    Due to its unique features, the metal foam is considered as one of the newest acoustic absorbents. It is a navel approach determining the structural properties of sound absorbent to predict its acoustical behavior. Unfortunately, direct measurements of these parameters are often difficult. Currently, there have been acoustic models showing the relationship between absorbent morphology and sound absorption coefficient (SAC). By optimizing the effective parameters on the SAC, the maximum SAC at each frequency can be obtained. In this study, using the Benchmarking method, the model presented by Lu was validated in MATLAB coding software. Then, the local search algorithm (LSA) method was used to optimize the metal foam morphology parameters. The optimized parameters had three factors, including porosity, pore size, and metal foam pore opening size. The optimization was applied to a broad band of frequency ranging from 500 to 8000 Hz. The predicted values were in accordance with benchmark data resulted from Lu model. The optimal range of the parameters including porosity of 50 to 95%, pore size of 0.09 to 4.55 mm, and pore opening size of 0.06 to 0.4 mm were applied to obtain the highest SAC for the frequency range of 500 to 800 Hz. The optimal amount of pore opening size was 0.1 mm in most frequencies to have the highest SAC. It was concluded that the proposed method of the LSA could optimize the parameters affecting the SAC according to the Lu model. The presented method can be a reliable guide for optimizing microstructure parameters of metal foam to increase the SAC at any frequency and can be used to make optimized metal foam.
    Źródło:
    Archives of Acoustics; 2020, 45, 3; 487-497
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Adaptive ant-colony algorithm for semantic query routing
    Autorzy:
    Gómez Santillán, C.
    Cruz Reyes, L.
    Schaeffer, E.
    Meza, E.
    Rivera Zarate, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/384885.pdf
    Data publikacji:
    2011
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    parameter tuning
    search algorithm
    peer-to-peer
    adaptive algorithm
    local environment
    ant colony algorithms
    Opis:
    The most prevalent P2P application today is file sha ring, both among scientific users and the general public. Afundamental process in file sharing systems is the search mechanism. The unstructured nature of real-world largescale complex systems poses a challenge to the search me thods, because global routing and directory services are impractical to implement. This paper presents a new antcolony algorithm, Adaptive Neighboring-Ant Search (AdaNAS), for the semantic query routing problem (SQRP) in a P2P network. The proposed algorithm incor porates an adaptive control parameter tuning technique for runtime estimation of the time-to-live (TTL) of the ants. AdaNAS uses three strategies that take advantage of the local environment: learning, characterization, and explo ration. Two classical learning rules are used to gain ex perience on past performance using three new learning functions based on the distance traveled and the resources found by the ants. The experimental results show that the AdaNAS algorithm outperforms the NAS algorithm where the TTLvalue is not tuned at runtime.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 85-94
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Problem komiwojażera z zyskami i oknami czasowymi dla sieci o wagach zmiennych w czasie i jego zastosowania w systemach typu e-tourism
    Time Dependent Orienteering Problem with Time Windows and its use in systems of e-tourism
    Autorzy:
    Zabielski, P.
    Koszelew, J.
    Zimnoch, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/404117.pdf
    Data publikacji:
    2012
    Wydawca:
    Polskie Towarzystwo Symulacji Komputerowej
    Tematy:
    problem komiwojażera z zyskami i oknami czasowymi
    iteracyjny algorytm lokalnego wyszukiwania
    planer podróży
    algorytm ewolucyjny
    salesman problem with profits and time windows
    iterated local search
    planner of travel
    evolutionary algorithm
    Opis:
    W pracy przedstawiono problem komiwojażera z zyskami i oknami czasowymi dla sieci o wagach zmiennych w czasie. Jest to rozszerzenie standardowego problemu komiwojażera z zyskami. Przyczynia się to do bardziej praktycznego zastosowania go na przykład w systemach typu e-tourism. Dzięki dodatkowym ograniczeniom może stanowić prawdziwą pomoc podczas planowania ciekawych wycieczek, spełniających wszelkie preferencje użytkownika. W artykule zaproponowano algorytm wykorzystujący iteracyjne poszukiwanie lokalnych rozwiązań. Wykonano testy na realnych danych i przeanalizowano je pod względem czasu wykonywania oraz jakości otrzymanych wyników.
    This paper presents the Time Dependent Orienteering Problem with Time Windows. It is an extension of the standard traveling salesman problem with profits. This contributes to a more practical application of it, for example in systems of e-tourism. It can be a really helpful during planning trips and meet all your preferences and additional restrictions. The article proposes an algorithm that uses an iterative search for local solutions. This algorithm was tested on real data. After that we analyzed it in terms of execution time and quality results.
    Źródło:
    Symulacja w Badaniach i Rozwoju; 2012, 3, 3; 175-182
    2081-6154
    Pojawia się w:
    Symulacja w Badaniach i Rozwoju
    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