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ę "Particle Swarm Optimization" wg kryterium: Temat


Tytuł:
A hybrid PSO approach for solving non-convex optimization problems
Autorzy:
Ganesan, T.
Vasant, P.
Elamvazuthy, I.
Powiązania:
https://bibliotekanauki.pl/articles/229756.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Kuhn-Tucker conditions (KT)
non-convex optimization
particle swarm optimization (PSO)
semi-classical particle swarm optimization (SPSO)
Opis:
The aim of this paper is to propose an improved particle swarm optimization (PSO) procedure for non-convex optimization problems. This approach embeds classical methods which are the Kuhn-Tucker (KT) conditions and the Hessian matrix into the fitness function. This generates a semi-classical PSO algorithm (SPSO). The classical component improves the PSO method in terms of its capacity to search for optimal solutions in non-convex scenarios. In this work, the development and the testing of the refined the SPSO algorithm was carried out. The SPSO algorithm was tested against two engineering design problems which were; ‘optimization of the design of a pressure vessel’ (P1) and the ‘optimization of the design of a tension/compression spring’ (P2). The computational performance of the SPSO algorithm was then compared against the modified particle swarm optimization (PSO) algorithm of previous work on the same engineering problems. Comparative studies and analysis were then carried out based on the optimized results. It was observed that the SPSO provides a better minimum with a higher quality constraint satisfaction as compared to the PSO approach in the previous work.
Źródło:
Archives of Control Sciences; 2012, 22, 1; 87-105
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative Study of Particle Swarm Optimization and Genetic Algorithms for Complex Mathematical Functions
Autorzy:
Valdez, F.
Melin, P.
Powiązania:
https://bibliotekanauki.pl/articles/384575.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
genetic algorithms
particle swarm optimization (PSO)
hybrid systems
optimization
Opis:
The Particle Swarm Optimization (PSO) and the Genetic Algorithms (GA) have been used successfully in solving problems of optimization with continuous and combinatorial search spaces. In this paper the results of the application of PSO and GAs for the optimization of mathematical functions are presented. These two methodologies have been implemented with the goal of making a comparison of their performance in solving complex optimization problems. This paper describes a comparison between a GA and PSO for the optimization of complex mathematical functions.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 43-51
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Celestial navigation fix based on particle swarm optimization
Autorzy:
Tsou, M.-C.
Powiązania:
https://bibliotekanauki.pl/articles/258524.pdf
Data publikacji:
2015
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
particle swarm optimization (PSO)
Celestial navigation
Intercept method
Opis:
A technique for solving celestial fix problems is proposed in this study. This method is based on Particle Swarm Optimization from the field of swarm intelligence, utilizing its superior optimization and searching abilities to obtain the most probable astronomical vessel position. In addition to being applicable to two-body fix, multi-body fix, and high-altitude observation problems, it is also less reliant on the initial dead reckoning position. Moreover, by introducing spatial data processing and display functions in a Geographical Information System, calculation results and chart work used in Circle of Position graphical positioning can both be integrated. As a result, in addition to avoiding tedious and complicated computational and graphical procedures, this work has more flexibility and is more robust when compared to other analytical approaches.
Źródło:
Polish Maritime Research; 2015, 3; 20-27
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Collision-free autonomous robot navigation in unknown environments utilizing PSO for path planning
Autorzy:
Krell, Evan
Sheta, Alaa
Balasubramanian, Arun Prassanth Ramaswamy
King, Scott A.
Powiązania:
https://bibliotekanauki.pl/articles/91555.pdf
Data publikacji:
2019
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
mobile robot
particle swarm optimization (PSO)
path planning
Opis:
The autonomous navigation of robots in unknown environments is a challenge since it needs the integration of a several subsystems to implement different functionality. It needs drawing a map of the environment, robot map localization, motion planning or path following, implementing the path in real-world, and many others; all have to be implemented simultaneously. Thus, the development of autonomous robot navigation (ARN) problem is essential for the growth of the robotics field of research. In this paper, we present a simulation of a swarm intelligence method is known as Particle Swarm Optimization (PSO) to develop an ARN system that can navigate in an unknown environment, reaching a pre-defined goal and become collision-free. The proposed system is built such that each subsystem manipulates a specific task which integrated to achieve the robot mission. PSO is used to optimize the robot path by providing several waypoints that minimize the robot traveling distance. The Gazebo simulator was used to test the response of the system under various envirvector representing a solution to the optimization problem.onmental conditions. The proposed ARN system maintained robust navigation and avoided the obstacles in different unknown environments. vector representing a solution to the optimization problem.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 4; 267-282
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computer-aided system for layout of fire hydrants on boards designed vessel using the Particle Swarm Optimization algorithm
Autorzy:
Gomułka, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/34600515.pdf
Data publikacji:
2023
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship
fire hydrant
design
layout
particle swarm optimization
Opis:
The functional layout of fire safety equipment in technical spaces of ships is a time-consuming process. When designing a ship fire protection system, the designer must manually position each system component in such a way as to meet the requirements of regulations arising from the technical specification, various legal regulations of maritime conventions and classification societies of the vessel to be designed. Layout of fire hydrants assisted by a computer that is based on pre-defined criteria and various constraints could significantly support the designer in working easier and faster. This paper presents a prototype computer-aided design system that enables optimal placement of fire hydrants using the metaheuristic Particle Swarm Optimization (PSO) algorithm. This algorithm was used in Rhinoceros 3D software with its Grasshopper plugin for visualizing the arrangement of fire safety equipment. Various solution arrangements compared with the fire hydrant placement in real ships are illustrated by a case study. Demonstrating how design work can be facilitated and what potential benefits can be achieved are presented as well.
Źródło:
Polish Maritime Research; 2023, 4; 4-16
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on the mill feeding system of an elastic variable universe fuzzy control based on particle swarm optimization algorithm
Autorzy:
Tian, Niu
Huang, Songwei
He, Lifang
Du, Lingpan
Yang, Sheping
Huang, Bin
Powiązania:
https://bibliotekanauki.pl/articles/24085898.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
fuzzy control
contraction-expansion factor
particle swarm optimization
Opis:
The grinding process in the concentrator is a part of the largest energy consumption, but also the most likely to cause a waste of resources, so the optimization of the grinding process is a very important link.The traditional fuzzy controller relies solely on the expert knowledge summary to construct control rules, which can cause significant steady-state errors in the model. In order to solve the above problem, this paper proposes an elastic variable universe fuzzy control based on Particle Swarm Optimization (PSO) algorithm. The elastic universe fuzzy control model does not need precise fuzzy rules, but only needs to input the general trend of the rules, and the division of the universe is performed by the contraction-expansionfactor. The control performance is directly related to the contraction-expansionfactor, so this article also proposes using particle swarm optimization to optimize the scaling factor to achieve the optimal value. Finally, simulation models of traditional fuzzy control and elastic universe fuzzy control of feeding system of mill were built using Python to verify the control effect. Itssimulation results show that the time of the reaction of the fuzzy control system in the elastic variable theory universe based on particle swarm optimization was shorter by 34.48% comparing to the traditional one. Elastic variable universe fuzzy control based on particle swarm optimization (PSO) effectively improved the control accuracy of the mill feeding system and improved the response speed of the system to a certain extent.
Źródło:
Physicochemical Problems of Mineral Processing; 2023, 59, 3; art. no. 169942
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bainite transformation time model optimization for Austempered Ductile Iron with the use of heuristic algorithms
Autorzy:
Olejarczyk-Wożeńska, Izabela
Opaliński, Andrzej
Mrzygłód, Barbara
Regulski, Krzysztof
Kurowski, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/29520068.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
heuristic optimization
bainite
ADI
Particle Swarm Optimization
Evolutionary Optimization Algorithm
Opis:
The paper presents the application of heuristic optimization methods in identifying the parameters of a model for bainite transformation time in ADI (Austempered Ductile Iron). Two algorithms were selected for parameter optimization – Particle Swarm Optimization and Evolutionary Optimization Algorithm. The assumption of the optimization process was to obtain the smallest normalized mean square error (objective function) between the time calculated on the basis of the identified parameters and the time derived from the experiment. As part of the research, an analysis was also made in terms of the effectiveness of selected methods, and the best optimization strategies for the problem to be solved were selected on their basis.
Źródło:
Computer Methods in Materials Science; 2022, 22, 3; 125-136
2720-4081
2720-3948
Pojawia się w:
Computer Methods in Materials Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid PSO-GA algorithm for Reversible Circuits Synthesis
Hybrydowy algorytm PSO-GA dla syntezy układów odwracalnych
Autorzy:
Podlaski, K.
Powiązania:
https://bibliotekanauki.pl/articles/153468.pdf
Data publikacji:
2014
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
reversible circuits
reversible logic synthesis
particle swarm optimization (PSO)
genetic algorithms
układy odwracalne
synteza układów odwracalnych
particle swarm optimization
algorytmy genetyczne
Opis:
In the domain of Reversible Circuits there is still lack of good synthesis algorithms. There are many heuristic propositions, unfortunately, their results for a given reversible function usually are circuits far from optimal implementations. There are some propositions of using Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) for this purpose. In this paper a new hybrid PSO-GA algorithm is proposed. Comparison of the proposed algorithm with the existing ones gives promising results.
W dobie poszukiwania układów cyfrowych o niskim zużyciu energii układy odwracalne stanowią ciekawą alternatywę dla aktualnie stosowanych układów cyfrowych. Jednym z najistotniejszych zagadnień w dziedzinie budowy układów cyfrowych jest synteza układu reprezentującego zadaną funkcję. Niestety do dzisiaj nie ma dobrych rozwiązań w dziedzinie syntezy układów odwracalnych, istniejące rozwiązania są bardzo czasochłonne bądź generują układy o dużej redundancji. Ciekawą alternatywą dla obecnie stosowanych metod heurystycznych jest wykorzystanie algorytmów ewolucyjnych np. Particle Swarm Optimization (PSO) lub algorytmów genetycznych (GA). W niniejszym artykule zaproponowano nowy hybrydowy algorytm PSO-GA dostosowany do syntezy odwracalnych układów cyfrowych. Stworzony algorytm zastosowano do syntezy układów dla wybranych funkcji testowych (tzw. benchmarków) a wyniki porównano z wynikami otrzymywanymi za pomocą algorytmów heurystycznych. Wygenerowane układy okazały się mniej redundantne niż układy otrzymane w syntezie metodami heurystycznymi.
Źródło:
Pomiary Automatyka Kontrola; 2014, R. 60, nr 7, 7; 474-476
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The multi-constrained multicast routing improved by hybrid bacteria foraging-particle swarm optimization
Autorzy:
Sahoo, Satya Prakash
Kabat, Manas Ranjan
Powiązania:
https://bibliotekanauki.pl/articles/305674.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
QoS routing
multicasting
bacteria foraging optimization
particle swarm optimization (PSO)
Opis:
To solve multicast routing under multiple constraints, it is required to generate a multicast tree that ranges from a source to the destinations with minimum cost subject to several constraints. In this paper, PSO has been embedded with BFO to improve the convergence speed and avoid premature convergence that will be used for solving QoS multicast routing problem. The algorithm proposed here generates a set of delay compelled links to every destination present in the multicast group. Then the Bacteria Foraging Algorithm (BFA) selects the paths to all the destinations sensibly from the set of least delay paths to construct a multicast tree. The robustness of the algorithm being proposed had been established through the simulation. The efficiency and effectiveness of the algorithm being proposed was validated through the comparison study with other existing meta-heuristic algorithms. It shows that our proposed algorithm IBF-PSO outperforms its competitive algorithms.
Źródło:
Computer Science; 2019, 20 (2); 245-269
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization for tuning PSS-PID controller of synchronous generator
Autorzy:
Derrar, A.
Naceri, A.
Powiązania:
https://bibliotekanauki.pl/articles/384775.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
synchronous generator
PSS
particle swarm optimization (PSO)
PID controller
Opis:
In this paper the design an optimal PSS-PID controller for single machine connected to an infinite bus (SMIB). We presented a novel application of particle swarm optimization (PSO) for the optimal tuning of the new PSS-PID controller. The proposed approach has superior features, including easy implementation, stable convergence characteristic and good computational efficiency. The synchronous generator is modeled and the PSO algorithm is implemented in Simulink of Matlab. The obtained results have proved that (PSO) are a powerful tools for optimizing the PSS parameters, and more robustness of the system IEEE SMIB.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 1; 48-52
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fixing Design Inconsistencies of Polymorphic Methods Using Swarm Intelligence
Autorzy:
George, Renu
Samuel, Philip
Powiązania:
https://bibliotekanauki.pl/articles/1818478.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
UML models
software design inconsistency
polymorphism
particle swarm optimization
Opis:
Background: Modern industry is heavily dependent on software. The complexity of designing and developing software is a serious engineering issue. With the growing size of software systems and increase in complexity, inconsistencies arise in software design and intelligent techniques are required to detect and fix inconsistencies. Aim: Current industrial practice of manually detecting inconsistencies is time consuming, error prone and incomplete. Inconsistencies arising as a result of polymorphic object interactions are hard to trace. We propose an approach to detect and fix inconsistencies in polymorphic method invocations in sequence models. Method: A novel intelligent approach based on self regulating particle swarm optimization to solve the inconsistency during software system design is presented. Inconsistency handling is modelled as an optimization problem that uses a maximizing fitness function. The proposed approach also identifies the changes required in the design diagrams to fix the inconsistencies. Result: The method is evaluated on different software design models involving static and dynamic polymorphism and inconsistencies are detected and resolved. Conclusion: Ensuring consistency of design is highly essential to develop quality software and solves a major design issue for practitioners. In addition, our approach helps to reduce the time and cost of developing software.
Źródło:
e-Informatica Software Engineering Journal; 2021, 15, 1; 7--27
1897-7979
Pojawia się w:
e-Informatica Software Engineering Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problem strojenia algorytmu optymalizacji rojem cząstek w optymalizacji ciągłej
The problem of tuning the particle swarm optimization algorithm in continuous optimization
Autorzy:
Mrozek, Adam
Badura, Dariusz
Powiązania:
https://bibliotekanauki.pl/articles/592187.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Optymalizacja
Optymalizacja rojem cząstek
Strojenie
Optimization
Particle Swarm Optimization
Tuning
Opis:
Optymalizacja wybranego zagadnienia, polegająca na znalezieniu analitycznego rozwiązania wyznaczającego ekstremum opisującego to zagadnienie funkcji, jest bardzo często złożona. Analityczne rozwiązanie staje się czasem niemożliwe, szczególnie w przypadku, gdy funkcja jest sformułowana w sposób uwikłany. W wielu przypadkach nie istnieją też metody automatycznego rozwiązywania takich formuł. Do rozwiązywania wielu problemów optymalizacyjnych skutecznym narzędziem okazała się optymalizacja rojem cząstek (ang. Particle Swarm Optimization, PSO). Sam algorytm bywa także stosowany jako część innych niedeterministycznych algorytmów, tworząc konstrukcje hybrydowe. Biorąc pod uwagę skuteczność znajdowania rozwiązania, wśród innych podobnych metod optymalizacji algorytm PSO nie plasuje się na czołowym miejscu. Stąd liczne próby modyfikacji oraz ustalenia najbardziej optymalnych i uniwersalnych parametrów algorytmu PSO. W artykule przedstawiono wyniki badań efektywności podstawowej wersji algorytmu optymalizacji rojem cząstek (PSO) dla problemów ciągłych o różnej skali złożoności. Autorzy podjęli także próbę oceny kosztu strojenia tego algorytmu dla małych problemów.
The optimization of the chosen issue of finding an analytical solution to determine the extreme describing this function is very often complex. An analytical solution is sometimes impossible, especially when the function is formulated in an entangled way. In many cases, there are no methods for automatically solving such formulas. Optimization of the particle swarm (Particle Swarm Optimization, PSO) has proved to be an effective tool for solving many optimization problems. Hence numerous attempts to modify and determine the most optimal and universal parameters of the PSO algorithm. The algorithm itself is also used as a part of other non-deterministic algorithms to create hybrid constructions. The article presents the results of research on the effectiveness of the basic version of the particle swarm optimization algorithm (PSO) for continuous problems of varying complexity scale. The authors also attempted to evaluate the cost of tuning this algorithm for small problems. The carried out computational experiments confirm the hypotheses advanced.
Źródło:
Studia Ekonomiczne; 2018, 355; 61-80
2083-8611
Pojawia się w:
Studia Ekonomiczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Coordinated control strategy for microgrid stability maintenance under isolated island operation
Autorzy:
Wu, Pan
Xu, Xiaowei
Powiązania:
https://bibliotekanauki.pl/articles/1841281.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
coordinated control
isolated island operation
microgrid
particle swarm optimization
Opis:
In this study, the inverter in a microgrid was adjusted by the particle swarm optimization (PSO) based coordinated control strategy to ensure the stability of the isolated island operation. The simulation results showed that the voltage at the inverter port reduced instantaneously, and the voltage unbalance degree of its port and the port of point of common coupling (PCC) exceeded the normal standard when the microgrid entered the isolated island mode. After using the coordinated control strategy, the voltage rapidly recovered, and the voltage unbalance degree rapidly reduced to the normal level. The coordinated control strategy is better than the normal control strategy.
Źródło:
Archives of Electrical Engineering; 2021, 70, 2; 285-295
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Propeller optimization for small unmanned aerial vehicles
Autorzy:
Kusznir, T.
Smoczek, J.
Powiązania:
https://bibliotekanauki.pl/articles/246608.pdf
Data publikacji:
2017
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
unmanned aerial vehicles
particle swarm optimization (PSO)
airfoil modelling
Opis:
Small-unmanned aerial vehicle propellers usually have a low figure of merit due to operating in the low Reynold’s number region due to their size and velocity. The airflow on the airfoil becomes increasingly laminar in this region thus increasing the profile drag and consequently reducing the figure of merit of the rotor. In the article, the airfoil geometries are parameterized using the Class/Shape function transformation. Particle swarm optimization is used to design an airfoil, operating in a Reynolds number of 100,000, which has a high lift to drag ratio. To avoid exceeding geometric constraints of the airfoil, a deterministic box constraint is added to the algorithm. The optimized airfoil is then used for a preliminary design of a rotor; given some design, constraints on the tip chord the rotor radius and the blade root chord, with parameters that achieve the highest theoretical figure of merit. The rotor parameters are obtained using a combination of momentum theory and blade element theory. The figure of merit of an optimal propeller with the same geometric parameters is then compared using the optimized airfoil and the Clark Y airfoil. The optimization is done in MATLAB while the aerodynamic coefficients are obtained from XFOIL. The results of the numerical simulation are presented in the article.
Źródło:
Journal of KONES; 2017, 24, 2; 125-132
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Function optimization using metaheuristics
Autorzy:
Pilski, M.
Seredyński, F.
Powiązania:
https://bibliotekanauki.pl/articles/92887.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
particle swarm optimization (PSO)
artificial immune system
genetic algorithm
function optimization
Opis:
The paper presents the results of comparison of three metaheuristics that currently exist in the problem of function optimization. The first algorithm is Particle Swarm Optimization (PSO) - the algorithm has recently emerged. The next one is based on a paradigm of Artificial Immune System (AIS). Both algorithms are compared with Genetic Algorithm (GA). The algorithms are applied to optimize a set of functions well known in the area of evolutionary computation. Experimental results show that it is difficult to unambiguously select one best algorithm which outperforms other tested metaheuristics.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 77-91
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
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