Informacja

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

Wyszukujesz frazę "Ant Colony algorithm" wg kryterium: Wszystkie pola


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ł:
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ł
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł

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