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ę "Ant Colony algorithm" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-31 z 31
    Tytuł:
    An Ant Colony Algorithm for efficient ship routing
    Autorzy:
    Tsou, M.-C.
    Cheng, H.-C.
    Powiązania:
    https://bibliotekanauki.pl/articles/258892.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
    Tematy:
    ship routing
    Ant Colony Algorithm
    GIS
    weather routing
    Opis:
    With the substantial rising of international oil price and global warming on the rise, how to reduce operational fuel consumption and decrease air pollution has become one of the pursued goals of green ship. Ship route planning is an indispensible part of the ship navigation process, especially in transoceanic crossing ship routing. The soundness of ship routing not only affects the safety of ship navigation but also the operation economy and environmental protection. This research is based on the platform of Electronic Chart Display and Information System (ECDIS), and founded on Ant Colony Algorithm (ACA) combined with the concept of Genetic Algorithm (GA), to model living organisms optimization behaviour to perform efficient ship route planning in transoceanic crossing. Besides the realization of route planning automation, ship routing will achieve the goal of optimum carbon dioxide reduction and energy conservation, and provide reference for route planning decision.
    Źródło:
    Polish Maritime Research; 2013, 3; 28-38
    1233-2585
    Pojawia się w:
    Polish Maritime Research
    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ł:
    Emergency Evacuation Route Choice Based on Improved Ant Colony Algorithm
    Autorzy:
    Wang, Bo
    Zhou, Ling Bo Jibiao
    Hu, Danjuan
    Pawęska, Marcin
    Šimák, Ladislav
    Ristvej, Jozef
    Jánošíková, Michaela
    Powiązania:
    https://bibliotekanauki.pl/articles/503788.pdf
    Data publikacji:
    2019
    Wydawca:
    Międzynarodowa Wyższa Szkoła Logistyki i Transportu
    Tematy:
    route choice
    ant colony algorithm
    brittleness
    emergency evacuation
    Opis:
    In order to explore the optimal route choice for emergency evacuation in the campus, we propose a novel route choice method based on brittle characteristics of campus system and improved ant colony algorithm. Both optimal and worst-case emergency evacuation routes are simulated in the campus of Ningbo University of Technology. From the simulation, the length of optimal and worse-case evacuation routes between the starting point and eight exits can be obtained by adjusting the importance value of trip distance and the degree of conformity, under the condition of static relative importance of pheromone concentration to graph G. The optimal route of emergency evacuation in the campus can be obtained when the importance of trip distance is above 5 and the degree of conformity is above 0.3; while the worse-case route is obtained with the importance of trip distance above 5 and the degree of conformity below 0.5.
    Źródło:
    Logistics and Transport; 2019, 44, 4; 33-39
    1734-2015
    Pojawia się w:
    Logistics and Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Development of a modified ant colony algorithm for order scheduling in food processing plants
    Autorzy:
    Korobiichuk, Igor
    Hrybkov, Serhii
    Seidykh, Olga
    Ovcharuk, Volodymyr
    Ovcharuk, Andrii
    Powiązania:
    https://bibliotekanauki.pl/articles/2204558.pdf
    Data publikacji:
    2022
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    order fulfillment planning
    modified ant colony algorithm
    efficiency of the algorithms
    optimization
    food industry
    Opis:
    This developed modified ant colony algorithm includes an additional improvement with local optimization methods, which reduces the time required to find a solution to the problem of optimization of combinatorial order sequence planning in a food enterprise. The planning problem requires consideration of a number of partial criteria, constraints, and an evaluation function to determine the effectiveness of the established version of the order fulfillment plan. The partial criteria used are: terms of storage of raw materials and finished products, possibilities of occurrence and processing of substandard products, terms of manufacturing orders, peculiarities of fulfillment of each individual order, peculiarities of use of technological equipment, expenses for storage and transportation of manufactured products to the end consumer, etc. The solution of such a problem is impossible using traditional methods. The proposed algorithm allows users to build and reconfigure plans, while reducing the time to find the optimum by almost 20% compared to other versions of algorithms.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2022, 16, 1; 53--61
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of ant-colony algorithm to the issue of improving rectified voltage parameters in electric tram traction
    Autorzy:
    Kulesz, B.
    Sikora, A.
    Zielonka, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/374940.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    ant colony optimization
    traction voltage
    tram traction
    voltage transformation
    tap changer
    distorted voltage
    voltage unbalance
    multi-winding transformer
    trakcja tramwajowa
    transformacja napięcia
    napięcie odkształcone
    nierównowaga napięć
    transformator wielouzwojeniowy
    optymalizacja kolonią mrówek
    napięcie sieci trakcyjnej
    przełącznik zaczepów
    Opis:
    In this paper, the problem related to transformation of ac voltage into DC voltage used in tram supply is considered. A variable component is always present in rectified voltage. Pulsation of rectified voltage is influenced by different factors. In a 12-pulse system, where two secondary transformer windings are used (one delta-connected and the other star-connected), an additional factor increasing the pulsation is the unbalance of the output voltages at these windings. Tap changer may be used and its setting is optimized here by applying the ant-colony algorithm. Different supply voltage variants have been considered. It is demonstrated that pulsation may be reduced by even 25%.
    Źródło:
    Transport Problems; 2018, 13, 2; 133-144
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Research on optimization model of marine industry strategic adjustment under complex maritime conditions based on ant colony algorithm
    Autorzy:
    Shen, X.
    Powiązania:
    https://bibliotekanauki.pl/articles/260022.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
    Tematy:
    ant colony algorithm
    complex maritime
    marine industry strategy
    Opis:
    This article seeks to analyze the factors constraining the development of strategic marine emerging industries and the deficiencies in China’s strategic marine emerging industry development policies. Learn from the successful experiences of overseas strategic marine emerging industry development policies. We will study and construct a policy framework for the development of strategic marine emerging industries in the new era, guided by the scientific concept of development and enhanced by the capacity of independent innovation. Provide policy recommendations for actively promoting the development of strategic marine emerging industries. At the same time, it provides theoretical and methodological reference for the formulation and implementation of China’s strategic marine emerging industry policies. On the basis of reviewing relevant theories of industrial policy, this article first defines China’s strategic emerging industries and clarifies the connotation of China’s strategic marine emerging industry development policies. Then, the paper conducts detailed analysis on the development policies of strategic marine emerging industries at home and abroad, and summarizes the experience of overseas strategic development policies for marine emerging industries. Finally, combining the above-mentioned comprehensive analysis, with the guidance of the scientific concept of development, the development strategy and concrete development policy of China’s strategic emerging industries in the ocean are proposed.
    Źródło:
    Polish Maritime Research; 2018, S 2; 164-169
    1233-2585
    Pojawia się w:
    Polish Maritime Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Control imrovement of shunt active power filter using an optimized-PI controller based on ant colony algorithm and swarm optimization
    Autorzy:
    Berbaoui, B.
    Ferdi, B.
    Benachaiba, C.
    Dehini, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/385137.pdf
    Data publikacji:
    2010
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    ant colony optimization
    particle swarm optimization (PSO)
    shunt active power filter
    armonic compensation
    PI controller
    Opis:
    In the last years, there has been a increase currents harmonics on electrical network injected by nonlinear loads, such as rectifier equipment used in telecommunication system, power suppliers, domestic appliances, ect. This paper makes a comparison of the effectiveness of the two methods on particular optimization problem, namely. The tuning of the parameters for PI DC link voltage to a shunt active power filter. The simulation results demonstrates that the optimized PI controller by ant colony (ACO) presents a advantage of little response time and best control performances compared to the optimized PI with Particle swarm (PSO). This comparison is shown on redu cing harmonic current supply (THD).
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2010, 4, 4; 19-25
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorytm wielu kolonii mrówek dla optymalnego dopasowania w ważonych grafach dwudzielnych
    Multi-type Ant colony algorithm for optimal matching problem in weighted bipartite graph
    Autorzy:
    Schiff, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/320231.pdf
    Data publikacji:
    2008
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    optymalizacja koloniami mrówek wielu typów
    minimalny problem dopasowania w grafach dwudzielnych
    maksymalny problem dopasowania w grafach dwudzielnych
    Multi-type Ant Colony Optimization
    minimum weighted bipartite matching
    maximum weighted bipartite matching
    Opis:
    Praca prezentuje algorytm wykorzystujący metodę optymalizacji różnymi typami kolonii mrówek dla problemu maksymalnego i minimalnego dopasowania w ważonych grafach dwudzielnych. Algorytm ten wyznacza optymalne dopasowanie, bazując na wyznaczaniu rozdzielnych ścieżek w grafie między wierzchołkami s-t, które stanowią rozwiązanie dla problemu optymalnego dopasowania w ważonych grafach dwudzielnych. Opracowany algorytm został porównany z algorytmem węgierskim i algorytmem mrówkowym o jednym typie kolonii mrówek i omówione zostały wyniki tego porównania.
    In this paper algorithm for optimal matching problem in weighted bipartite graph is presented, which is based on multi-type ant colony optimization. Matching problem is modeled as disjoint-paths problem between s-t vertices. Multi-type ants was used in order to find these disjoint paths between s-t vertices which are the solution for optimal matching problem in weighted bipartite graph. The algorithm was compared with Hungarian algorithm and ACO algorithm for optimal matching problem in weighted bipartite graph and results of this comparison was discussed.
    Źródło:
    Elektrotechnika i Elektronika; 2008, 27, 2; 115-119
    1640-7202
    Pojawia się w:
    Elektrotechnika i Elektronika
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A hybrid algorithm based on non-dominated sorting ant colony and genetic algorithmsfor solving multi-objective multi-mode project scheduling problems under resource constraints
    Autorzy:
    Bagherinejad, Jafar
    Jolai, Fariborz
    Abdollahnejad, Raheleh
    Shoeib, Mahnaz
    Powiązania:
    https://bibliotekanauki.pl/articles/407427.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    multi-objectives project scheduling
    ant colony algorithm
    time-cost trade-off
    resource leveling
    Opis:
    A project scheduling problem investigates a set of activities that have to be scheduled due to precedence priority and resource constraints in order to optimize project-related objective functions. This paper focuses on the multi-mode project scheduling problem concerning resource constraints (MRCPSP). Resource allocation and leveling, renewable and non-renewable resources, and time-cost trade-off are some essential characteristics which are considered in the proposed multi-objective scheduling problem. In this paper, a novel hybrid algorithm is proposed based on non-dominated sorting ant colony optimization and genetic algorithm (NSACO-GA). It uses the genetic algorithm as a local search strategy in order to improve the efficiency of the ant colony algorithm. The test problems are generated based on the project scheduling problem library (PSPLIB) to compare the efficiency of the proposed algorithm with the non-dominated sorting genetic algorithm (NSGA-II). The numerical result verifies the efficiency of the proposed hybrid algorithm in comparison to the NSGA-II algorithm.
    Źródło:
    Management and Production Engineering Review; 2020, 11, 2; 88-98
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Comparative Study of PID Controller Tuning Using GA, EP, PSO and ACO
    Autorzy:
    Nagaraj, B.
    Vijayakumar, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/384767.pdf
    Data publikacji:
    2011
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    ant colony algorithm
    evolutionary program
    genetic algorithm particle swarm optimization and soft computing
    Opis:
    Proportional - Integral - Derivative control schemes continue to provide the simplest and effective solutions to most of the control engineering applications today. How ever PID controller are poorly tuned in practice with most of the tuning done manually which is difficult and time consuming. This article comes up with a hybrid approach involving Genetic Algorithm (GA), Evolutionary Pro gramming (EP), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). The proposed hybrid algorithm is used to tune the PID parameters and its per formance has been compared with the conventional me thods like Ziegler Nichols and Cohen Coon method. The results obtained reflect that use of heuristic algorithm based controller improves the performance of process in terms of time domain specifications, set point tracking, and regulatory changes and also provides an optimum stability. Speed control of DC motor process is used to assess the efficacy of the heuristic algorithm methodology
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 2; 42-48
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    User habits and multimodal route planning
    Autorzy:
    Katona, G.
    Juhasz, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/112017.pdf
    Data publikacji:
    2017
    Wydawca:
    Stowarzyszenie Menedżerów Jakości i Produkcji
    Tematy:
    user habits
    multimodal route planning
    Ant Colony algorithm
    planowanie trasy
    algorytm mrówkowy
    nawyki komunikacyjne
    wymagania użytkowników
    Opis:
    The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.
    Źródło:
    Production Engineering Archives; 2017, 16; 22-27
    2353-5156
    2353-7779
    Pojawia się w:
    Production Engineering Archives
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An improved ant colony optimization algorithm and its application to text-independent speaker verification system
    Autorzy:
    Aghdam, M. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/91678.pdf
    Data publikacji:
    2012
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    ant colony
    optimization
    ant colony optimization
    ACO
    security
    automatic speaker verification
    ASV
    feature space
    Gaussian mixture model universal background model
    GMM-UBM
    Opis:
    With the growing trend toward remote security verification procedures for telephone banking, biometric security measures and similar applications, automatic speaker verification (ASV) has received a lot of attention in recent years. The complexity of ASV system and its verification time depends on the number of feature vectors, their dimensionality, the complexity of the speaker models and the number of speakers. In this paper, we concentrate on optimizing dimensionality of feature space by selecting relevant features. At present there are several methods for feature selection in ASV systems. To improve performance of ASV system we present another method that is based on ant colony optimization (ACO) algorithm. After feature selection phase, feature vectors are applied to a Gaussian mixture model universal background model (GMM-UBM) which is a text-independent speaker verification model. The performance of proposed algorithm is compared to the performance of genetic algorithm on the task of feature selection in TIMIT corpora. The results of experiments indicate that with the optimized feature set, the performance of the ASV system is improved. Moreover, the speed of verification is significantly increased since by use of ACO, number of features is reduced over 80% which consequently decrease the complexity of our ASV system.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 4; 301-315
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Ship route planning using historical trajectories derived from AIS Data
    Autorzy:
    He, Y. K.
    Zhang, D.
    Zhang, J. F.
    Zhang, M. Y.
    Li, T. W.
    Powiązania:
    https://bibliotekanauki.pl/articles/116536.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    AIS Data
    Automatic Identification System (AIS)
    route planning
    historical trajectories
    AIS messages
    marine traffic
    Dijkstra algorithm
    ant colony algorithm
    Opis:
    Ship route planning is one of the key issues in enhancing traffic safety and efficiency. Many route planning methods have been developed, but most of them are based on the information from charts. This paper proposes a method to generate shipping routes based on historical ship tracks. The ship's historical route information was obtained by processing the AIS data. From which the ship turning point was extracted and clustered as nodes. The ant colony algorithm was used to generate the optimize route. The ship AIS data of the Three Gorges dam area was selected as a case study. The ships’ optimized route was generated, and further compared with the actual ship's navigation trajectory. The results indicate that there is space of improvement for some of the trajectories, especially near the turning areas.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 69-76
    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ł:
    Optimization of travel routes based on modified genetic and ant algorithms
    Autorzy:
    Rybchak, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/410861.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    ant algorithm
    ant colony genetic algorithm
    hiking trails
    algorytm mrówkowy
    genetyczny algorytm mrówkowy
    ścieżki turystyczne
    Opis:
    In the article, propose to use modified mating operators and initialization genetic and ant algorithms to solve transport problems in tourism. The article analyzes modern methods of optimization of routes used to transport tourists between the settlements of view of efficient use of resources. By analyzing the behavior of ant colonies, such as finding the shortest route by providing mating pheromones and features two solutions genetic algorithm developed algorithms for finding the optimal route, costing resources search distance, time, route, storing executed routes. The paper present description created system for mobile phones operating system IOS, which performs all operations listed above.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2017, 6, 2; 85-90
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Reconstruction of boundary condition of the third kind by applying the Ant Colony Optimization algorithm
    Odtworzenie warunku brzegowego trzeciego rodzaju przy zastosowaniu algorytmu mrówkowego
    Autorzy:
    Hetmaniok, E.
    Zielonka, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/87300.pdf
    Data publikacji:
    2011
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    warunek brzegowy
    algorytm mrówkowy
    przewodnictwo cieplne
    zagadnienie odwrotne
    boundary condition
    ant colony optimization
    heat conduction
    inverse problem
    Opis:
    In this paper we present an application of the Ant Colony Optimization algorithm for solving the inverse heat conduction problem in which the state function and some of the boundary conditions should be determined. The ACO algorithm is a part of the swarm intelligence and it is inspired by the technique of searching for the shortest way connecting the ant-hill with the source of food. We propose to use this algorithm for minimizing the proper functional, which plays a crucial role in the method of solution and allows to reconstruct the value of heat transfer coefficient.
    W niniejszym artykule przedstawione zostało zastosowanie algorytmu mrówkowego do rozwiązania odwrotnego zagadnienia przewodnictwa ciepła, polegającego na wyznaczeniu funkcji stanu oraz rekonstrukcji jednego z warunków brzegowych. Algorytm mrówkowy należy do grupy algorytmów inteligencji roju i zainspirowany został techniką wyszukiwania najkrótszej drogi łączącej mrowisko ze źródłem pożywienia. W proponowanym podejściu algorytm ten zostanie wykorzystany do wyznaczania minimum funkcjonału będącego istotnym elementem metody rozwiązania, umożliwiającym odtworzenie wartości współczynnika wnikania ciepła.
    Źródło:
    Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska; 2011, 1; 137-147
    2084-073X
    Pojawia się w:
    Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Ant Colony Optimization Algorithm for Scheduling Parallel Machines with Sequence-Dependent Setup Costs
    Zastosowanie algorytmu mrówkowego do szeregowania zadań na maszynach równoległych z uwzględnieniem kosztów przezbrojeń zależnych od kolejności zadań
    Autorzy:
    Figielska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/91349.pdf
    Data publikacji:
    2013
    Wydawca:
    Warszawska Wyższa Szkoła Informatyki
    Tematy:
    ant colony optimization
    unrelated machines
    sequence-dependent setup costs
    resource constraints
    algorytm mrówkowy
    dowolne maszyny
    koszty przezbrojeń
    kolejność zadań
    ograniczenia zasobowe
    Opis:
    The paper addresses the problem of scheduling preemptive jobs on parallel unrelated machines in the presence of renewable resource constraints and sequence-dependent setup costs. The objective is to minimize the weighted sum of makespan and setups. The problem is known to be NP-hard. To solve this problem, a heuristic is proposed which uses column generation technique and an ant colony optimization algorithm. The results of a computational experiment indicate that the heuristic is able to produce good results in reasonable computation time.
    Artykuł dotyczy zagadnienia szeregowania zadań podzielnych na równoległych dowolnych maszynach z uwzględnieniem ograniczeń na dostępność zasobów odnawialnych oraz kosztów przezbrojeń zależnych od kolejności wykonywania zadań. Celem jest minimalizacja ważonej sumy czasu trwania harmonogramu i przezbrojeń. Zagadnienie należy do klasy problemów NP-trudnych. W celu jego rozwiązania, zaproponowany został algorytm heurystyczny, wykorzystujący technikę generacji kolumn, oraz algorytm mrówkowy. Wyniki eksperymentu obliczeniowego wskazują, że algorytm ten jest zdolny dostarczyć dobrej jakości wyniki w rozsądnym czasie.
    Źródło:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2013, 7, 9; 15-26
    1896-396X
    2082-8349
    Pojawia się w:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An ant algorithm for the maximum number of 3-cliques in 3-partite graphs
    Autorzy:
    Schiff, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2183443.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    ant colony optimization
    three-partite graph
    3-clique
    combinatorial optimization
    graph theory
    Opis:
    The problem of finding the maximum number of d- vertices cliques (d = 3) in d-partite graph (d = 3) when graph density q is lower than 1 is an important problem in combinatorial optimization and it is one of many NP-complete problems. For this problem a meta-heuristic algorithm has been developed, namely an ant colony optimization algorithm. In this paper a new development of this ant algorithm and experimental results are presented. The problem of finding the maximum number of 3-vertices cliques can be encountered in computer image analysis, computer vision applications, automation and robotic vision systems. The optimal solution of this problem boils down to finding a set of 3-vertices cliques in a 3-partite graph and this set should have cardinality as high as possible. The elaborated ant colony algorithm can be easily modified for d-dimensional problems, that is for finding the maximum number of d-vertices cliques in a d-partite graph.
    Źródło:
    Control and Cybernetics; 2021, 50, 2; 347--358
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Logistic staff managment - ant algorithm for the optimal team creation
    Autorzy:
    Schiff, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/409194.pdf
    Data publikacji:
    2019
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    logistic staff management
    three dimensional matching problem
    ant colony
    Opis:
    During daily logistic management managers often met difficult decision optimization problem concerning company staff. Such problems often rely on matching workers between them and team leader or matching worker to a place and a time slot and often they, menagers want to optimise their resources in order to receive such matches as maximum as possible as regars a cardinality number of a such set. These optimisation problem are often NP-difficults and to solve them menagers need special software tools. To aid managers in such situation artificial methods are used. Between artificials methods is a one called the ant colony optimisation algorithm and why in this article an ant colony optimization algorithm for the maximum cardinality 3-dimensional matching problem is described. The problem is modeled by means of 2-dimensional arrays. The elaborated ant algorithm was compared with another existing ant algorithm and tested for different values of ant algorithm parameters. Results of these tests were presented and discussed. The elaborated algorithm shows its superiority.
    Źródło:
    Research in Logistics & Production; 2019, 9, 1; 49-59
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Metaheuristic approach to optimal power flow using mixed integer distributed ant colony optimization
    Autorzy:
    Suresh, Vishnu
    Janik, Przemyslaw
    Jasinski, Michal
    Powiązania:
    https://bibliotekanauki.pl/articles/141692.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    ant colony optimization
    IEEE 30 bus
    IEEE 57 bus
    metaheuristic algorithm
    mixed integer distributed ant colony optimization
    optimal power flow
    Opis:
    This paper presents the application of an improved ant colony optimization algorithm called mixed integer distributed ant colony optimization to optimize the power flow solution in power grids. The results provided indicate an improvement in the reduction of operational costs in comparison with other optimization algorithms used in optimal power flow studies. The application was realized to optimize power flow in the IEEE 30 and the IEEE 57 bus test cases with the objective of operational cost minimization. The optimal power flow problem described is a non-linear, non-convex, complex and heavily constrained problem.
    Źródło:
    Archives of Electrical Engineering; 2020, 69, 2; 335-348
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Verification of ships trajectory planning algorithms using real navigational data
    Autorzy:
    Lazarowska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/117103.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Visibility Graph-search Algorithm (VGA)
    Discrete Artificial Potential Field (DAPF)
    real navigational data
    ARPA
    ship's trajectory planning
    ship's trajectory planning algorithms
    Ant Colony Optimization (ACO)
    Trajectory Base Algorithm (TBA)
    Opis:
    The paper presents results of ship's safe trajectory planning algorithms verification. Real navigational data registered from a radar with an Automatic Radar Plotting Aid on board the research and training ship Horyzont II were used as input data to the algorithms. The algorithms verified in the presented research include the Ant Colony Optimization algorithm (ACO), the Trajectory Base Algorithm (TBA), the Visibility Graph-search Algorithm (VGA) ant the Discrete Artificial Potential Field algorithm (DAPF). Details concerning data registration and exemplary results obtained with the use or real navigational data are introduced and summarized in the paper. Presented results prove the applicability of proposed algorithms for solving the ship's safe trajectory planning problem.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 559-564
    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ł:
    Ant colony metaphor in a new clustering algorithm
    Autorzy:
    Boryczka, U.
    Powiązania:
    https://bibliotekanauki.pl/articles/969824.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    data mining
    cluster analysis
    ant clustering algorithm
    Opis:
    Among the many bio-inspired techniques, ant clustering algorithms have received special attention, especially because they still require much investigation to improve performance, stability and other key features that would make such algorithms mature tools for data mining. Clustering with swarm-based algorithms is emerging as an alternative to more conventional clustering methods, such as k-means algorithm. This proposed approach mimics the clustering behavior observed in real ant colonies. As a case study, this paper focuses on the behavior of clustering procedures in this new approach. The proposed algorithm is evaluated on a number of well-known benchmark data sets. Empirical results clearly show that the ant clustering algorithm (ACA) performs well when compared to other techniques.
    Źródło:
    Control and Cybernetics; 2010, 39, 2; 343-358
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A hybrid ant colony for multiresponse mixed-integer problems
    Autorzy:
    Kushwaha, S.
    Mukherjee, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/409419.pdf
    Data publikacji:
    2012
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    ant colony optimization(ACO)
    desirability functions
    genetic algorithm (GA)
    multiple response optimization(MRO)
    Opis:
    In this paper, a hybrid ant colony optimization (ACO) is used to solve a multiple response optimization problem with mixed-integer (MI) search space. The work reported in this paper may be clasified into three part. The first part discusses on relevant litratures and the methodology to solve multiple response optimization problem. The second part provide details on the working principal, parameter tuning of a hybrid ACO proposed for mixed integer state space. In the hybrid ACO, genetic algorithm (GA) is used for intensification of the search strategy. Standard single response (objective) test functions are selected to verify the suitability of hybrid ACO. The third part of this research work illustrates the application of the hybrid ACO in a multiple response optimization (MRO) problem. Statistical experimentation, partial least square regression, 'maximin' desirability function, and hybrid ACO is used to solve the MRO problem. The results confirm the suitability of the hybid ACO for a typical MI MRO problem.
    Źródło:
    Research in Logistics & Production; 2012, 2, 4; 317-327
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    ACO-Inspired Energy-Aware Routing Algorithm for Wireless Sensor Networks
    Autorzy:
    Yamamoto, Ryo
    Nishibu, Seira
    Yamazaki, Taku
    Okamura, Yasushi
    Tanaka, Yoshiaki
    Powiązania:
    https://bibliotekanauki.pl/articles/308447.pdf
    Data publikacji:
    2019
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    ant colony optimization
    loadbalancing
    routing algorithm
    sensor networks
    Opis:
    Multi-hop networks, such as WSNs, become an object of increasing attention as an emerging technology which plays an important role for practical IoT applications. These multi-hop networks generally consist of mobile and small terminals with limited resources, which makes them vulnerable to various network status changes. Moreover, the limited nature of terminal resources available, especially in terms of battery capacity, is one of the most important issues to be addressed in order to prolong their operating time. In order to ensure efficient communications in such networks, much research has already been conducted, especially in the field of routing and transmission technologies. However, conventional approaches adopted in the routing field still suffer from the so-called energy hole problem, usually caused by unbalanced communication loads existing due to difficulties in adaptive route management. To address this issue, the present paper proposes a novel routing algorithm that utilizes ACO-inspired routing based on residual energy of terminals. Operational evaluation reveals its potential to ensure balanced energy consumption and to boost network performance.
    Źródło:
    Journal of Telecommunications and Information Technology; 2019, 1; 5-13
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A comparison of nature inspired algorithms for the quadratic assignment problem
    Autorzy:
    Chmiel, W.
    Kadłuczka, P.
    Kwiecień, J.
    Filipowicz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/202135.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    permutation problem
    quadratic assignment problem
    ant algorithm
    bees algorithm
    problem permutacji
    problem przydziału kwadratowego
    algorytm Ant Colony
    algorytm pszczół
    Opis:
    This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A nature inspired collision avoidance algorithm for ships
    Autorzy:
    Lazarowska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/24201448.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    collision avoidance algorithm
    safe own Ship's Trajectory
    safe navigation
    ant colony optimization
    firefly agorithm
    path planning
    swarm intelligence
    nature inspired computing
    Opis:
    Nature inspired algorithms are regarded as a powerful tool for solving real life problems. They do not guarantee to find the globally optimal solution, but can find a suboptimal, robust solution with an acceptable computational cost. The paper introduces an approach to the development of collision avoidance algorithms for ships based on the firefly algorithm, classified to the swarm intelligence methods. Such algorithms are inspired by the swarming behaviour of animals, such as e.g. birds, fish, ants, bees, fireflies. The description of the developed algorithm is followed by the presentation of simulation results, which show, that it might be regarded as an efficient method of solving the collision avoidance problem. Such algorithm is intended for use in the Decision Support System or in the Collision Avoidance Module of the Autonomous Navigation System for Maritime Autonomous Surface Ships.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2023, 17, 2; 341--346
    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ł:
    Multi-criteria ACO-based algorithm for ship’s trajectory planning
    Autorzy:
    Lazarowska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/116548.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    colregs
    ships manoeuvering
    Ant Colony Optimization (ACO)
    ship’s trajectory planning
    route planning
    multi-criteria ACO-based algorithm
    guidance
    navigation and control (GNC)
    ARPA
    Opis:
    The paper presents a new approach for solving a path planning problem for ships in the environment with static and dynamic obstacles. The algorithm utilizes a heuristic method, classified to the group of Swarm Intelligence approaches, called the Ant Colony Optimization. The method is inspired by a collective behaviour of ant colonies. A group of agents - artificial ants searches through the solution space in order to find a safe, optimal trajectory for a ship. The problem is considered as a multi-criteria optimization task. The criteria taken into account during problem solving are: path safety, path length, the International Regulations for Preventing Collisions at Sea (COLREGs) compliance and path smoothness. The paper includes the description of the new multi-criteria ACO-based algorithm along with the presentation and discussion of simulation tests results.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2017, 11, 1; 31-36
    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ł:
    An ACO Path Planner Using a FIS for Path Selection Adjusted with a Simple Tuning Algorithm
    Autorzy:
    Porta-Garcia, M.
    Montiel, O.
    Sepulveda, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/384490.pdf
    Data publikacji:
    2008
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    ant colony optimization
    ACO
    autonomous mobile robot
    navigation
    fuzzy logic
    path planning
    Opis:
    This paper presents a path planner application for mobile robots based on Ant Colony Optimization (ACO). The selection of the optimal path relies in the criterion of a Fuzzy Inference System (FIS), which is adjusted using a Simple Tuning Algorithm (STA). The path planner can be executed in Mode I and Mode II. The first mode only works in the virtual environment of the interface, while Mode II embraces the wireless communication with a real robot; once the ACO algorithm finds the best route, the coordinates are sent to a mobile robot via Bluetooth communication; if the robot senses a new obstacle, the computer is notified and does a rerouting routine in order to avoid the obstacle and reach the goal. In other words, the application supports dynamic search spaces.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 5-11
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A comparison between Dijkstra algorithm and simplified ant colony optimization in navigation
    Analiza porównawcza algorytmu Dijkstry i uproszczonego algorytmu mrówkowego w nawigacji
    Autorzy:
    Dramski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/360173.pdf
    Data publikacji:
    2012
    Wydawca:
    Akademia Morska w Szczecinie. Wydawnictwo AMSz
    Tematy:
    poszukiwanie najkrótszej drogi
    akwen ograniczony
    nawigacja
    shortest path routing
    restricted area
    navigation
    Opis:
    In this paper, two different shortest path routing algorithms in respect of basic navigation problems are discussed. First of them is a “state of art” in computer science – well known Dijkstra algorithm. The second one is a method based on artificial intelligence – simplified ant colony optimization proposed originally by Marco Dorigo. Author used both ways to find an optimal / suboptimal route for a ship in a restricted area. Results showed the advantages and disadvantages of both algorithms in simple static navigation situations.
    W artykule omówiono dwa różne algorytmy poszukiwania najkrótszej drogi w odniesieniu do zagadnień nawigacji. Pierwszym z nich jest algorytm Dijkstry, stanowiący podstawę rozwiązywania tego typu problemów. Drugi to metoda bazująca na sztucznej inteligencji – uproszczony algorytm mrówkowy, zaproponowany przez Marco Dorigo. Autor używał obu sposobów w celu uzyskania optymalnej, bądź suboptymalnej trasy dla statku na akwenie ograniczonym. Rezultaty badań pokazały korzyści i wady ze stosowania obu rozwiązań w prostych sytuacjach nawigacyjnych.
    Źródło:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 29 (101); 25-29
    1733-8670
    2392-0378
    Pojawia się w:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new metaheuristic algorithm for long-term open-pit production planning
    Nowy meta-heurystyczny algorytm wspomagający długoterminowe planowanie produkcji w kopalni odkrywkowej
    Autorzy:
    Sattarvand, J.
    Niemann-Delius, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/219597.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    optymalizacja kopalń odkrywkowych
    planowanie produkcji
    optymalizacja metodą kolonii mrówek
    metaheurystyka
    open pit optimization
    production planning
    ant colony optimization
    metaheuristics
    Opis:
    Paper describes a new metaheuristic algorithm which has been developed based on the Ant Colony Optimisation (ACO) and its efficiency have been discussed. To apply the ACO process on mine planning problem, a series of variables are considered for each block as the pheromone trails that represent the desirability of the block for being the deepest point of the mine in that column for the given mining period. During implementation several mine schedules are constructed in each iteration. Then the pheromone values of all blocks are reduced to a certain percentage and additionally the pheromone value of those blocks that are used in defining the constructed schedules are increased according to the quality of the generated solutions. By repeated iterations, the pheromone values of those blocks that define the shape of the optimum solution are increased whereas those of the others have been significantly evaporated.
    W artykule zaprezentowano nowy meta-heurystyczny algorytm oparty na zasadach optymalizacji mrowiska i zbadano jego skuteczność w zastosowaniach do planowania wydobycia w kopalniach. Uwzględniono szereg zmiennych w każdym bloku schematu i przeanalizowano „ślady feromonów” które przedstawiają „dążność” poszczególnych bloków w danej kolumnie do stania się najgłębszym punktem kopalni w trakcie określonego okresu prowadzenia prac wydobywczych. W ramach kolejnych iteracji generuje się kilka harmonogramów prowadzenia wydobycia. Następnie wartości poziomu feromonów przypisane do kolejnych bloków redukowane są do wielkości wyrażonych w procentach a wartości poziomu feromonów przypisane do bloków wykorzystywanych do wygenerowania danego harmonogramu zostają powiększone, zgodnie z wymogami odnośnie jakości uzyskanych rozwiązań. Drogą kolejnych iteracji, wartości poziomu feromonów przypisane do bloków generujących rozwiązania optymalne zostają powiększane podczas gdy wartości przypisane do bloków pozostałych zostają odpowiednio pomniejszone.
    Źródło:
    Archives of Mining Sciences; 2013, 58, 1; 107-118
    0860-7001
    Pojawia się w:
    Archives of Mining Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Analytical Study for the Role of Fuzzy Logic in Improving Metaheuristic Optimization Algorithms
    Autorzy:
    Vij, Sonakshi
    Jain, Amita
    Tayal, Devendra
    Castillo, Oscar
    Powiązania:
    https://bibliotekanauki.pl/articles/385121.pdf
    Data publikacji:
    2018
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    fuzzy logic
    metaheuristics
    evolutionary computing
    genetic algorithm
    particle swarm optimization (PSO)
    ant colony optimization
    fuzzy evolutionary algorithm
    fuzzy cuckoo
    fuzzy simulated annealing
    fuzzy swarm intelligence
    fuzzy differential evolution
    tabu
    fuzzy mutation
    fuzzy natural selection
    fuzzy fitness function
    big bang big crunch
    fuzzy bacterial
    neuro fuzzy logic
    logika rozmyta
    metaheurystyka
    obliczenia ewolucyjne
    algorytm genetyczny
    optymalizacja roju cząstek
    optymalizacja kolonii mrówek
    Opis:
    The research applications of fuzzy logic have always been multidisciplinary in nature due to its ability in handling vagueness and imprecision. This paper presents an analytical study in the role of fuzzy logic in the area of metaheuristics using Web of Science (WoS) as the data source. In this case, 178 research papers are extracted from it in the time span of 1989-2016. This paper analyzes various aspects of a research publication in a scientometric manner. The top cited research papers, country wise contribution, topmost organizations, top research areas, top source titles, control terms and WoS categories are analyzed. Also, the top 3 fuzzy evolutionary algorithms are extracted and their top research papers are mentioned along with their topmost research domain. Since neuro fuzzy logic poses feasible options for solving numerous research problems, hence a section is also included by the authors to present an analytical study regarding research in it. Overall, this study helps in evaluating the recent research patterns in the field of fuzzy metaheuristics along with envisioning the future trends for the same. While on one hand this helps in providing a new path to the researchers who are beginners in this field as they can start exploring it through the analysis mentioned here, on the other hand it provides an insight to professional researchers too who can dig a little deeper in this field using knowledge from this study.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 4; 11-27
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fuzzy-based firefly and ACO algorithm for densely deployed WSN
    Autorzy:
    Sharma, Tripti
    Mohapatra, Amar Kumar
    Tomar, Geetam
    Powiązania:
    https://bibliotekanauki.pl/articles/38700721.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Podstawowych Problemów Techniki PAN
    Tematy:
    clustering
    firefly
    WSN
    ant colony optimization
    fuzzy
    wireless sensor
    healthcare network
    FIS
    grupowanie
    robaczek świętojański
    optymalizacja kolonii mrówek
    rozmyty
    czujnik bezprzewodowy
    sieć opieki zdrowotnej
    Opis:
    Most of the wireless sensor networks (WSNs) used in healthcare and security sectors are affected by the battery constraints, which cause a low network lifetime problem and prevents these networks from achieving their maximum performance. It is anticipated that by combining fuzzy logic (FL) approximation reasoning approach with WSN, the complex behavior of WSN will be easier to handle. In healthcare, WSNs are used to track activities of daily living (ADL) and collect data for longitudinal studies. It is easy to understand how such WSNs could be used to violate people’s privacy. The main aim of this research is to address the issues associated with battery constraints for WSN and resolve these issues. Such an algorithm could be successfully applied to environmental monitoring for healthcare systems where a dense sensor network is required and the stability period should be high.
    Źródło:
    Computer Assisted Methods in Engineering and Science; 2023, 30, 2; 223-246
    2299-3649
    Pojawia się w:
    Computer Assisted Methods in Engineering and Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-31 z 31

      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