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ł
Tytuł:
Power system oscillation damping controller design: a novel approach of integrated HHO-PSO algorithm
Autorzy:
Devarapalli, Ramesh
Kumar, Vikash
Powiązania:
https://bibliotekanauki.pl/articles/1845528.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Harris hawk optimization
power system stabilizers
STATCOM
FACTS
particle swarm optimization
Opis:
The hybridization of a recently suggested Harris hawk’s optimizer (HHO) with the traditional particle swarm optimization (PSO) has been proposed in this paper. The velocity function update in each iteration of the PSO technique has been adopted to avoid being trapped into local search space with HHO. The performance of the proposed Integrated HHO-PSO (IHHOPSO) is evaluated using 23 benchmark functions and compared with the novel algorithms and hybrid versions of the neighbouring standard algorithms. Statistical analysis with the proposed algorithm is presented, and the effectiveness is shown in the comparison of grey wolf optimization (GWO), Harris hawks optimizer (HHO), barnacles matting optimization (BMO) and hybrid GWO-PSO algorithms. The comparison in convergence characters with the considered set of optimization methods also presented along with the boxplot. The proposed algorithm is further validated via an emerging engineering case study of controller parameter tuning of power system stability enhancement problem. The considered case study tunes the parameters of STATCOM and power system stabilizers (PSS) connected in a sample power network with the proposed IHHOPSO algorithm. A multi-objective function has been considered and different operating conditions has been investigated in this papers which recommends proposed algorithm in an effective damping of power network oscillations.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 553-591
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Toward the best combination of optimization with fuzzy systems to obtain the best solution for the GA and PSO algorithms using parallel processing
Autorzy:
Valdez, Fevrier
Kawano, Yunkio
Melin, Patricia
Powiązania:
https://bibliotekanauki.pl/articles/384329.pdf
Data publikacji:
2020
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
genetic algorithms
particle swarm optimization (PSO)
fuzzy logic
parallel processing
Opis:
In general, this paper focuses on finding the best configuration for PSO and GA, using the different migration blocks, as well as the different sets of the fuzzy systems rules. To achieve this goal, two optimization algorithms were configured in parallel to be able to integrate a migration block that allow us to generate diversity within the subpopulations used in each algorithm, which are: the particle swarm optimization (PSO) and the genetic algorithm (GA). Dynamic parameter adjustment was also performed with a fuzzy system for the parameters within the PSO algorithm, which are the following: cognitive, social and inertial weight parameter. In the GA case, only the crossover parameter was modified.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 1; 55-64
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the efficiency of population-based optimization in finding best parameters for RGB-D visual odometry
Autorzy:
Kostusiak, Aleksander
Skrzypczyński, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/384397.pdf
Data publikacji:
2019
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
particle swarm optimization (PSO)
evolutionary algorithm
visual odometry
RGB-D
Opis:
Visual odometry estimates the transformations between consecutive frames of a video stream in order to recover the camera’s trajectory. As this approach does not require to build a map of the observed environment, it is fast and simple to implement. In the last decade RGBD cameras proliferated in roboTIcs, being also the sensors of choice for many practical visual odometry systems. Although RGB-D cameras provide readily available depth images, that greatly simplify the frame-to-frame transformations computaTIon, the number of numerical parameters that have to be set properly in a visual odometry system to obtain an accurate trajectory estimate remains high. Whereas seƫng them by hand is certainly possible, it is a tedious try-and-error task. Therefore, in this article we make an assessment of two population-based approaches to parameter opTImizaTIon, that are for long time applied in various areas of robotics, as means to find best parameters of a simple RGB-D visual odometry system. The optimization algorithms investigated here are particle swarm optimization and an evolutionary algorithm variant. We focus on the optimization methods themselves, rather than on the visual odometry algorithm, seeking an efficient procedure to find parameters that minimize the estimated trajectory errors. From the experimental results we draw conclusions as to both the efficiency of the optimization methods, and the role of particular parameters in the visual odometry system.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2019, 13, 2; 5-14
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Economical Optimization of Capacitor Placement for Large-Scale Practical Distorted Distribution Network
Autorzy:
Khalil Selim, T. M.
Gorpinich, A. V.
Powiązania:
https://bibliotekanauki.pl/articles/262779.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
Tematy:
capacitor placement
distribution network
losses reduction
selective particle swarm optimization
Opis:
This paper presents the optimization of large-scale practical distorted distribution network for maximum losses reduction and voltage profile improvement based on two-stage methodology for capacitor placement problem. In the first stage, a fuzzy expert system (FES) is used to find the optimal capacitor locations, and in the second stage, a selective particle swarm optimization (SPSO) is used to find the optimal capacitor sizing. The problem is posed as an optimization problem with objective to minimize the total cost of power and energy losses and capacitor banks including constraints for bus voltage and total harmonic distortion (THD) limits. Simulation results show the benefits from optimization and the effect of harmonics on optimal capacitor placement.
Źródło:
Electrical Power Quality and Utilisation. Journal; 2013, 16, 2; 21-29
1896-4672
Pojawia się w:
Electrical Power Quality and Utilisation. Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Increased Performance of a Hybrid Optimizer for Simulation Based Controller Parameterization
Autorzy:
Neugebauer, R.
Hipp, K.
Hellmich, A.
Schlegel, H.
Powiązania:
https://bibliotekanauki.pl/articles/384707.pdf
Data publikacji:
2012
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
controller parameterization
simulation based optimization
particle swarm optimization (PSO)
Nelder-Mead
Opis:
The controller parameterization is often carried out by applying basic empirical formulas within an integrated automatic design. Hence, the determined settings are often insufficiently verified by the resulting system behavior. In this paper an approach for the controller parameterization by using methods of simulation based optimization is presented. This enables the user to define specific restrictions e.g. the complementary sensitivity function (CSF) to influence the dynamic behavior of the control loop. Furthermore it is possible to choose alternative optimization criteria. A main influence factor for practical offline as well as controller internal optimization methods is the execution time, which can be reduced by applying a hybrid optimization strategy. Thus, the paper presents a performance comparison between the straight global Particle-Swarm-Optimization (PSO) algorithm and the combination of the global PSO with the local optimization algorithm of Nelder-Mead (NM) to a hybrid optimizer (HO) based on examples.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2012, 6, 1; 42-45
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Power system oscillation damping controller design: a novel approach of integrated HHO-PSO algorithm
Autorzy:
Devarapalli, Ramesh
Kumar, Vikash
Powiązania:
https://bibliotekanauki.pl/articles/1845539.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Harris hawk optimization
power system stabilizers
STATCOM
FACTS
particle swarm optimization
Opis:
The hybridization of a recently suggested Harris hawk’s optimizer (HHO) with the traditional particle swarm optimization (PSO) has been proposed in this paper. The velocity function update in each iteration of the PSO technique has been adopted to avoid being trapped into local search space with HHO. The performance of the proposed Integrated HHO-PSO (IHHOPSO) is evaluated using 23 benchmark functions and compared with the novel algorithms and hybrid versions of the neighbouring standard algorithms. Statistical analysis with the proposed algorithm is presented, and the effectiveness is shown in the comparison of grey wolf optimization (GWO), Harris hawks optimizer (HHO), barnacles matting optimization (BMO) and hybrid GWO-PSO algorithms. The comparison in convergence characters with the considered set of optimization methods also presented along with the boxplot. The proposed algorithm is further validated via an emerging engineering case study of controller parameter tuning of power system stability enhancement problem. The considered case study tunes the parameters of STATCOM and power system stabilizers (PSS) connected in a sample power network with the proposed IHHOPSO algorithm. A multi-objective function has been considered and different operating conditions has been investigated in this papers which recommends proposed algorithm in an effective damping of power network oscillations.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 553-591
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of Square-shaped Bolted Joints Based on Improved Particle Swarm Optimization Algorithm
Autorzy:
Chen, Kui
Yang, Cheng
Zhao, Yongsheng
Niu, Peng
Niu, NaNa
Hongchao, Wu
Powiązania:
https://bibliotekanauki.pl/articles/27312779.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
particle swarm optimization algorithm
bolt connection
bolted joint
fractal theory
Opis:
The bolted joint is widely used in heavy-duty CNC machine tools, which has huge influence on working precision and overall stiffness of CNC machine. The process parameters of group bolt assembly directly affect the stiffness of the connected parts. The dynamic model of bolted joints is established based on the fractal theory, and the overall stiffness of joint surface is calculated. In order to improve the total stiffness of bolted assembly, an improved particle swarm optimization algorithm with combination of time-varying weights and contraction factor is proposed. The input parameters are preloading of bolts, fractal dimension, roughness, and object thickness. The main goal is to maximize the global rigidity. The optimization results show that improved algorithm has better convergence, faster calculation speed, preferable results, and higher optimization performance than standard particle swarm optimization algorithm. Moreover, the global rigidity optimization is achieved.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 3; art. no. 168487
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Vibroacoustic Real Time Fuel Classification in Diesel Engine
Autorzy:
Bąkowski, A.
Kekez, M.
Radziszewski, L.
Sapietova, A.
Powiązania:
https://bibliotekanauki.pl/articles/177686.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fuel recognition
classification trees
particle swarm optimization (PSO)
random forest
Opis:
Five models and methodology are discussed in this paper for constructing classifiers capable of recognizing in real time the type of fuel injected into a diesel engine cylinder to accuracy acceptable in practical technical applications. Experimental research was carried out on the dynamic engine test facility. The signal of in-cylinder and in-injection line pressure in an internal combustion engine powered by mineral fuel, biodiesel or blends of these two fuel types was evaluated using the vibro-acoustic method. Computational intelligence methods such as classification trees, particle swarm optimization and random forest were applied.
Źródło:
Archives of Acoustics; 2018, 43, 3; 385-395
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization of an iterative learning controller for the single-phase inverter with sinusoidal output voltage waveform
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Gałkowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/200271.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
iterative learning control
sine wave inverter
particle swarm optimization (PSO)
Opis:
This paper presents the application of a particle swarm optimization (PSO) to determine iterative learning control (ILC) law gains for an inverter with an LC output filter. Available analytical tuning methods derived for a given type of ILC law are not very straightforward if additional performance requirements of the closed-loop system have to be met. These requirements usually concern the dynamics of a response to a reference signal, the dynamics of a disturbance rejection, the immunity against expected level of system and measurement noise, the robustness to anticipated variations of parameters, etc. An evolutionary optimization approach based on the swarm intelligence is proposed here. It is shown that in the case of the ILC applied to the LC filter, a cost function based on mean squares can produce satisfactory tuning effects. The efficacy of the procedure is illustrated by performing the optimization for various noise levels and various requested dynamics.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 3; 649-660
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Magnetic Particle Swarm Optimization
Autorzy:
Prampero, P. S.
Attux, R.
Powiązania:
https://bibliotekanauki.pl/articles/91715.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
Magnetic Particle Swarm Optimization
multimodal search
metaheuristics
sensitivity analysis
convergence
Opis:
This paper presents and analyzes a search paradigm called Magnetic Particle Swarm Optimization. This paradigm gives support to two algorithms that combine elements of the behavior of magnetic dipoles within a framework that includes several elements that are known to be essential to effective multimodal search. The algorithms are applied to a variety of functions and their performance is compared with those of a number of related well-established metaheuristics. In addition to that, convergence and sensitivity analyses are presented for the first time.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 59-72
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Traffic fatalities prediction based on support vector machine
Autorzy:
Li, T.
Yang, Y.
Wang, Y.
Chen, C.
Yao, J.
Powiązania:
https://bibliotekanauki.pl/articles/223743.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
traffic accident
support vector machine
SVM
particle swarm optimization (PSO)
PSO
prediction model
optimal parameters
wypadek drogowy
Particle Swarm Optimization
model prognostyczny
optymalne parametry
Opis:
To effectively predict traffic fatalities and promote the friendly development of transportation, a prediction model of traffic fatalities is established based on support vector machine (SVM). As the prediction accuracy of SVM largely depends on the selection of parameters, Particle Swarm Optimization (PSO) is introduced to find the optimal parameters. In this paper, small sample and nonlinear data are used to predict fatalities of traffic accident. Traffic accident statistics data of China from 1981 to 2012 are chosen as experimental data. The input variables for predicting accident are highway mileage, vehicle number and population size while the output variables are traffic fatality. To verify the validity of the proposed prediction method, the back-propagation neural network (BPNN) prediction model and SVM prediction model are also used to predict the traffic fatalities. The results show that compared with BPNN prediction model and SVM model, the prediction model of traffic fatalities based on PSO-SVM has higher prediction precision and smaller errors. The model can be more effective to forecast the traffic fatalities. And the method using particle swarm optimization algorithm for parameter optimization of SVM is feasible and effective. In addition, this method avoids overcomes the problem of “over learning” in neural network training progress.
Źródło:
Archives of Transport; 2016, 39, 3; 21-30
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fault diagnosis of power transformer based on improved particle swarm optimization OS-ELM
Autorzy:
Li, Yuancheng
Ma, Longqiang
Powiązania:
https://bibliotekanauki.pl/articles/140428.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
power transformer
fault diagnosis
improved particle swarm optimization
OS-ELM
parameter optimization
Opis:
A transformer is an important part of power transmission and transformation equipment. Once a fault occurs, it may cause a large-scale power outage. The safety of the transformer is related to the safe and stable operation of the power system. Aiming at the problem that the diagnosis result of transformer fault diagnosis method is not ideal and the model is unstable, a transformer fault diagnosis model based on improved particle swarm optimization online sequence extreme learning machine (IPSO-OS-ELM) algorithm is proposed. The improved particle swarmoptimization algorithm is applied to the transformer fault diagnosis model based on the OS-ELM, and the problems of randomly selecting parameters in the hidden layer of the OS-ELM and its network output not stable enough, are solved by optimization. Finally, the effectiveness of the improved fault diagnosis model in improving the accuracy is verified by simulation experiments.
Źródło:
Archives of Electrical Engineering; 2019, 68, 1; 161-172
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Design of a Predictive PID Controller Using Particle Swarm Optimization
Autorzy:
Mustafa, Norhaida
Hashim, Fazida Hanim
Powiązania:
https://bibliotekanauki.pl/articles/1844451.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
proportional integral derivative controller
particle swarm optimization (PSO) algorithm
optimization
predictive PID
Opis:
The proportional-integral-derivative (PID) controller is widely used in various industrial applications such as process control, motor drives, magnetic and optical memory, automotive, flight control and instrumentation. PID tuning refers to the generation of PID parameters (Kp, Ki, Kd) to obtain the optimum fitness value for any system. The determination of the PID parameters is essential for any system that relies on it to function in a stable mode. This paper proposes a method in designing a predictive PID controller system using particle swarm optimization (PSO) algorithm for direct current (DC) motor application. Extensive numerical simulations have been done using the Mathwork’s Matlab simulation environment. In order to gain full benefits from the PSO algorithm, the PSO parameters such as inertia weight, iteration number, acceleration constant and particle number need to be carefully adjusted and determined. Therefore, the first investigation of this study is to present a comparative analysis between two important PSO parameters; inertia weight and number of iteration, to assist the predictive PID controller design. Simulation results show that inertia weight of 0.9 and iteration number 100 provide a good fitness achievement with low overshoot and fast rise and settling time. Next, a comparison between the performance of the DC motor with PID-PSO, with PID of gain 1, and without PID were also discussed. From the analysis, it can be concluded that by tuning the PID parameters using PSO method, the best gain in performance may be found. Finally, when comparing between the PID-PSO and its counterpart, the PI-PSO, the PID-PSO controller gives better performance in terms of robustness, low overshoot (0.005%), low minimum rise time (0.2806 seconds) and low settling time (0.4326 seconds).
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 4; 737-743
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Estimation of composite load model parameters using improved particle swarm optimization
Autorzy:
Regulski, P.
Gonzalez-Longatt, F.
Terzija, V.
Powiązania:
https://bibliotekanauki.pl/articles/410557.pdf
Data publikacji:
2012
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
load modeling
parameter estimation
particle swarm optimization (PSO)
composite load model
Opis:
Power system loads are one of its crucial elements to be modeled in stability studies. However their static and dynamic characteristics are very often unknown and usually changing in time (daily, weekly, monthly and seasonal variations). Taking this into account, a measurement-based approach for determining the load characteristics seems to be the best practice, as it updates the parameters of a load model directly from the system measurements. To achieve this, a Parameter Estimation tool is required, so a common approach is to incorporate the standard Nonlinear Least Squares, or Genetic Algorithms, as a method providing more global capabilities. In this paper a new solution is proposed -an Improved Particle Swarm Optimization method. This method is an Artificial Intelligence type technique similar to Genetic Algorithms, but easier for implementation and also computationally more efficient. The paper provides results of several experiments proving that the proposed method can achieve higher accuracy and show better generalization capabilities than the Nonlinear Least Squares method. The computer simulations were carried out using a one-bus and an IEEE 39-bus test system.
Źródło:
Present Problems of Power System Control; 2012, 2; 41-51
2084-2201
Pojawia się w:
Present Problems of Power System Control
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new auto adaptive fuzzy hybrid particle swarm optimization and genetic algorithm
Autorzy:
Dziwiński, Piotr
Bartczuk, Łukasz
Paszkowski, Józef
Powiązania:
https://bibliotekanauki.pl/articles/1837533.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
hybrid methods
Particle Swarm Optimization
Genetic Algorithm
fuzzy systems
multimodal function
Opis:
The social learning mechanism used in the Particle Swarm Optimization algorithm allows this method to converge quickly. However, it can lead to catching the swarm in the local optimum. The solution to this issue may be the use of genetic operators whose random nature allows them to leave this point. The degree of use of these operators can be controlled using a neuro-fuzzy system. Previous studies have shown that the form of fuzzy rules should be adapted to the fitness landscape of the problem. This may suggest that in the case of complex optimization problems, the use of different systems at different stages of the algorithm will allow to achieve better results. In this paper, we introduce an auto adaptation mechanism that allows to change the form of fuzzy rules when solving the optimization problem. The proposed mechanism has been tested on benchmark functions widely adapted in the literature. The results verify the effectiveness and efficiency of this solution.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 2; 95-111
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quantum-inspired particle swarm optimization algorithm with performance evaluation of fused images
Autorzy:
Le, Z
Xinman, Z.
Xuebin, X
Dong, W.
Jie, L.
Yang, L.
Powiązania:
https://bibliotekanauki.pl/articles/174501.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
multifocus image fusion
quantum particle swarm optimization
perfect reconstruction
superior speed
Opis:
In order to improve and accelerate the speed of image integration, an optimal and intelligent method for multi-focus image fusion is presented in this paper. Based on particle swarm optimization and quantum theory, quantum particle swarm optimization (QPSO) intelligent search strategy is introduced in salience analysis of a contrast visual masking system, combined with the segmentation technique. The superiority of QPSO is quantum parallelism. It has stronger search ability and quicker convergence speed. When compared with other classical or novel fusion methods, several metrics for image definition are exploited to evaluate the performance of all the adopted methods objectively. Experiments are performed on both artificial multi-focus images and digital camera multi-focus images. The results show that QPSO algorithm is more efficient than non-subsampled contourlet transform, genetic algorithm, binary particle swarm optimization, etc. The simulation results demonstrate that QPSO is a satisfying image fusion method with high accuracy and high speed.
Źródło:
Optica Applicata; 2013, 43, 4; 679-691
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle Swarm Optimization Fuzzy Systems for the Age Reduction Imperfect Maintenance Model
Autorzy:
Li, Che-Hua
Powiązania:
https://bibliotekanauki.pl/articles/301843.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
imperfect maintenance
preventive maintenance
reliability
fuzzy modeling
particle swarm optimization (PSO)
Opis:
This research includes two topics: (1) the modeling of periodic preventive maintenance policies over an infi nite time span for repairable systems with the reduction of the degradation rate after performing an imperfect preventive maintenance (PM) activity; (2) the parameter estimation of failure distribution and the restoration effect of PM from the proposed PM policy for deteriorating systems. The concept of the improvement factor method is applied to measure the restoration effect on the degradation rate for a system after each PM. An improvement factor is presented as a function of the system's age and the cost of each PM. A periodic PM model is then developed. The optimal PM interval and the optimal replacement time for the proposed model can be obtained by minimizing the objective functions of the cost rate through the algorithms provided by this research. An example of using Weibull failure distribution is provided to investigate the proposed model. The method is proposed to estimate the parameters of the failure process and the improvement effect after each PM by analyzing maintenance and failure log data. In this method, a PSO-based method is proposed for automatically constructing a fuzzy system with an appropriate number of rules to approach the identifi ed system. In the PSO-based method, each individual in the population is constructed to determine the number of fuzzy rules and the premise part of the fuzzy system, and then the recursive least-squares method is used to determine the consequent part of the fuzzy system constructed by the corresponding individual. Consequently, an individual corresponds to a fuzzy system. Subsequently, a fi tness function is defi ned to guide the searching procedure to select an appropriate fuzzy system with the desired performance. Finally, two identifi cation problems of nonlinear systems are utilized to illustrate the effectiveness of the proposed method for fuzzy modeling.
Źródło:
Eksploatacja i Niezawodność; 2008, 4; 28-34
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization of artificial-neural-network-based on-line trained speed controller for battery electric vehicle
Autorzy:
Ufnalski, B.
Grzesiak, L.
Powiązania:
https://bibliotekanauki.pl/articles/201631.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
electric vehicle
speed control
adaptive ANN controller
particle swarm optimization (PSO)
Opis:
The paper presents implementation of PSO (Particle Swarm Optimization) to ANN-based speed controller tuning. Selected learning parameters are optimized according to the control objective function. A battery electric vehicle is considered as a potential plant for an adaptive speed controller. The need for adaptivity in the control algorithm is justified by variations of a total weight of the vehicle. A sizable section of the paper deals with selection of a combined objective function able to effectively evaluate the quality of a solution.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 3; 661-667
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance Comparison of Optimization Methods for Flat-Top Sector Beamforming in a Cellular Network
Autorzy:
Nandi, Pampa
Roy, Jibendu Sekhar
Powiązania:
https://bibliotekanauki.pl/articles/2142316.pdf
Data publikacji:
2022
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
flat-top sector beam
particle swarm optimization
real-coded genetic algorithm
Opis:
The flat-top radiation pattern is necessary to form an appropriate beam in a sectored cellular network and to pro vide users with best quality services. The flat-top pattern offers sufficient power and allows to minimize spillover of signal to adjacent sectors. The flat-top sector beam pattern is relied upon In sectored cellular networks, in multiple-input multiple-output (MIMO) systems and ensures a nearly constant gain in the desired cellular sector. This paper presents a comparison of such optimization techniques as real-coded genetic algorithm (RGA) and particle swarm optimization (PSO), used in cellular networks in order to achieve optimum flat-top sector patterns. The individual parameters of flat-top sector beams, such as cellular coverage, ripples in the flat-top beam, spillover of radiation to the adjacent sectors and side lobe level (SLL) are investigated through optimization performed for 40◦ and 60◦ sectors. These parameters are used to compare the performance of the optimized RGA and PSO algorithms. Overall, PSO outperforms the RGA algorithm.
Źródło:
Journal of Telecommunications and Information Technology; 2022, 3; 39--46
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of a particle swarm optimization to a physically-based erosion model
Zastosowanie optymalizacji zbioru rozproszonych czasteczek do modelu erozji opartego na podstawach fizycznych
Autorzy:
Santos, C A G
Pinto, L.E.M.
De Macedo Machado Freire, P.K.
Mishra, S.K.
Powiązania:
https://bibliotekanauki.pl/articles/81761.pdf
Data publikacji:
2010
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
particle swarm optimization
application
erosion model
erosion simulation
run-off
optimization
erosion parameter
Opis:
The difficulties involved in calibration of physically based erosion models have been partly attributable to the lack of robust optimization tools. This paper presents the essential concepts and application to optimize channel and plane parameters in an erosion model, with a global optimization method known as Repulsive Particle Swarm (RPS), a variant of Particle Swarm Optimization (PSO) method. The physically-based erosion model that which was chosen is called WESP (watershed erosion simulation program). The optimization technique was tested with the field data collected in an experimental watershed located in a semi-arid region of Brazil. On the basis of these results, the recommended erosion parameter values for a semi-arid region are given, which could serve as an initial estimate for other similar areas.
Trudności w kalibracji modeli erozji opartych na podstawach fizycznych przyczyniły się do braku ogólnych narzędzi optymalizacji. W pracy przedstawiono podstawowe koncepcje i zastosowanie do zoptymalizowania parametrów kanału i płaszczyzny w modelu erozji, globalną metodą optymalizacji znaną jako Repulsive Particle Swarm (RPS), wariantem metody Particle Swarm Optimisation (SPO). Fizycznie uzasadniony model erozji, który został wybrany jest nazywany WESP (watershed erosion simulation program). Technika optymalizacji została wypróbowana na danych terenowych zebranych w zlewni eksperymentalnej zlokalizowanej w umiarkowanie suchym regionie Brazylii. Na podstawie tych wyników przedstawiono wartości rekomendowanego parametru erozji dla umiarkowanie suchego regionu, który może służyć jako początkowe oszacowanie dla podobnych obszarów.
Źródło:
Annals of Warsaw University of Life Sciences - SGGW. Land Reclamation; 2010, 42, 1; 39-49
0208-5771
Pojawia się w:
Annals of Warsaw University of Life Sciences - SGGW. Land Reclamation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Soft-constrained predictive control for an overhead crane
Autorzy:
Smoczek, J.
Szpytko, J.
Powiązania:
https://bibliotekanauki.pl/articles/242511.pdf
Data publikacji:
2017
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
overhead crane
predictive control
recursive least square estimation
particle swarm optimization (PSO)
Opis:
Reduction of transient and residual payload swing in crane systems is a key control objective to guarantee the safety and efficiency requirements. The fast and accurate payload positioning with swing suppression within the acceptable range to avoid accidents is the challenging problem due to the underactuated nature of crane systems. Since the actuated motion causes undesirable payload swing, the efficient control method should be developed to ensure fast and precise payload positioning and meet the safety requirements. The standard model predictive control method is not suitable for underactuated mechanical systems. In this article the two, soft and hard-constrained antisway predictive control strategies are compared in experiments carried out on a laboratory scaled overhead travelling crane. The both control schemes are developed based on the linear parameter-varying model of a planar crane system. The recursive least square algorithm with parameter projection is used to estimate the model parameters. The soft-constrained optimization problem is solved using the particle swarm optimization algorithm with the inertia weight linearly decreasing during iteration. The metaheuristic optimizer is applied to determine the sequence of optimal control increments subject to the hard constraint of the control input and soft constraint of the payload swing. The comparison of hard and soft-constrained predictive controllers is carried out on a laboratory stand for different payload deflection constraints.
Źródło:
Journal of KONES; 2017, 24, 3; 291-298
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-swarm that learns
Autorzy:
Trojanowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/969816.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
particle swarm optimization (PSO)
multi-swarm
dynamic optimization
memory
clusters
clustering evolving data streams
quantum particles
Opis:
This paper studies particle swarm optimization approach enriched by two versions of an extension aimed at gathering information during the optimization process. Application of these extensions, called memory mechanisms, increases computational cost, but it is spent to a benefit by incorporating the knowledge about the problem into the algorithm and this way improving its search abilities. The first mechanism is based on the idea of storing explicit solutions while the second one applies one-pass clustering algorithm to build clusters containing search experiences. The main disadvantage of the former mechanism is lack of good rules for identification of outdated solutions among the remembered ones and as a consequence unlimited growth of the memory structures as the optimization process goes. The latter mechanism uses other form of knowledge representation and thus allows us to control the amount of allocated resources more efficiently than the former one. Both mechanisms have been experimentally verified and their advantages and disadvantages in application for different types of optimized environments are discussed.
Źródło:
Control and Cybernetics; 2010, 39, 2; 359-375
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization and discrete artificial bee colony algorithms for solving production scheduling problems
Autorzy:
Witkowski, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/298169.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
Discrete Artificial Bee Colony
particle swarm optimization (PSO)
production scheduling problem
makespan
Opis:
This paper shows the use of Discrete Artificial Bee Colony (DABC) and Particle Swarm Optimization (PSO) algorithm for solving the job shop scheduling problem (JSSP) with the objective of minimizing makespan. The Job Shop Scheduling Problem is one of the most difficult problems, as it is classified as an NP-complete one. Stochastic search techniques such as swarm and evolutionary algorithms are used to find a good solution. Our objective is to evaluate the efficiency of DABC and PSO swarm algorithms on many tests of JSSP problems. DABC and PSO algorithms have been developed for solving real production scheduling problem too. The experiment results indicate that this problem can be effectively solved by PSO and DABC algorithms.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2019, 22(1); 61-74
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effectiveness of the MPSO algorithm in optimization of the coil arrangement
Skuteczność algorytmu MPSO w optymalizacji układu cewek
Autorzy:
Borowska, B.
Powiązania:
https://bibliotekanauki.pl/articles/159534.pdf
Data publikacji:
2010
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Elektrotechniki
Tematy:
elektromagnetyzm
optymalizacja
algorytm PSO
pole magnetyczne
electromagnetism
optimization
particle swarm optimization (PSO)
magnetic field
Opis:
One of the most important problems in designing of various constructions is optimization of technical facilities. The optimization process leads to find the best solution of a considered problem, and the solution should meet established criteria. Evolutionary algorithms have been found to be effective in solving such optimization problems. In the following paper, a modification of the PSO algorithm has been proposed in order to determine an optimal geometry of the coil arrangement evoking, in a defined active area, magnetic field of the largest possible gradient, and simultaneously keep this gradient relatively stable. The computations confirmed high efficiency of the proposed method. The results were also compared with the achievements of other evolutionary algorithms.
Jednym z najważniejszych zagadnień w projektowaniu różnych konstrukcji jest optymalizacja urządzeń technicznych. Jej celem jest znalezienie najlepszego rozwiązania rozpatrywanego zagadnienia o najlepszych w sensie przyjętych kryteriów parametrach. Do rozwiązywania tego typu zadań m.in. stosuje się algorytmy ewolucyjne. Aby algorytm był skuteczny często niezbędne jest jednak przeprowadzenie bardzo dużej liczby obliczeń. W celu redukcji kosztów obliczeń w artykule zaproponowano algorytm MPSO będący modyfikacją algorytmu PSO do problemu wyznaczenia optymalnej konstrukcji. Zadaniem zaproponowanego algorytmu było wyznaczenie optymalnej geometrii układu cewek generujących w zdefiniowanym obszarze aktywnym pola magnetycznego o możliwie dużym gradiencie przy zachowaniu jak największej stałości tego gradientu. Na podstawie przeprowadzonych badań, dokonano porównania efektywności zaproponowanej metody MPSO z osiągnięciami standardowego algorytmu optymalizacji cząsteczkowej PSO oraz algorytmu Θ-PSO zaproponowanego przez Zhong i innych [24]. Przeprowadzone obliczenia potwierdziły skuteczność algorytmu MPSO.
Źródło:
Prace Instytutu Elektrotechniki; 2010, 246; 35-44
0032-6216
Pojawia się w:
Prace Instytutu Elektrotechniki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Setpoint weighted PID controller tuning for unstable system using heuristic algorithm
Autorzy:
Rajinikanth, V.
Latha, K.
Powiązania:
https://bibliotekanauki.pl/articles/229344.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
setpoint weighted PID
unstable system
particle swarm optimization (PSO)
bacterial foraging optimization
objective function
Opis:
Most of the real time chemical process loops are unstable in nature and designing a suitable controller for such systems are difficult than open loop stable processes. In this work, an attempt is made with a two degree of freedom setpoint weighted PID controller tuning procedure for a class of unstable systems using the recent heuristic algorithms such as Particle Swarm Optimization and Bacterial Foraging Optimization. The problem considered in this study is to aptly tune the controller in order to enhance the overall closed loop performance. A novel objective function proposed in this study is used to monitor the heuristic algorithms in order to get the optimal controller parameters like Kp, Ki, Kd, and alpha with minimized iteration number. The proposed method is validated with a simulation study and this helps to accomplish enhanced system performance such as smooth reference tracking, satisfactory disturbance rejection, and error minimization for a class of unstable systems.
Źródło:
Archives of Control Sciences; 2012, 22, 4; 481-505
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Learning System by the Least Squares Support Vector Machine Method and its Application in Medicine
Autorzy:
Szewczyk, P.
Baszun, M.
Powiązania:
https://bibliotekanauki.pl/articles/307897.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
classification
Grid-Search
particle swarm optimization (PSO)
patients diagnosis
support vector machine (SVM)
Opis:
In the paper it has been presented the possibility of using the least squares support vector machine to the initial diagnosis of patients. In order to find some optimal parameters making the work of the algorithm more detailed, the following techniques have been used: K-fold Cross Validation, Grid-Search, Particle Swarm Optimization. The result of the classification has been checked by some labels assigned by an expert. The created system has been tested on the artificially made data and the data taken from the real database. The results of the computer simulations have been presented in two forms: numerical and graphic. All the algorithms have been implemented in the C# language.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 3; 109-113
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Economic dispatch in power system networks including renewable energy resources using various optimization techniques
Autorzy:
Hafiz, Abrar Mohamed
Abdelrahman, M. Ezzat
Temraz, Hesham
Powiązania:
https://bibliotekanauki.pl/articles/1841222.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Economic Dispatch (ED)
Particle Swarm Optimization (PSO)
Sine-Cosine
Algorithm (SCA)
Photovoltaic (PV)
Opis:
Economic dispatch (ED) is an essential part of any power system network. ED is how to schedule the real power outputs from the available generators to get the minimum cost while satisfying all constraints of the network. Moreover, it may be explained as allocating generation among the committed units with the most effective minimum way in accordance with all constraints of the system. There are many traditional methods for solving ED, e.g., Newton-Raphson method Lambda-Iterative technique, Gaussian-Seidel method, etc. All these traditional methods need the generators’ incremental fuel cost curves to be increasing linearly. But practically the input-output characteristics of a generator are highly non-linear. This causes a challenging non-convex optimization problem. Recent techniques like genetic algorithms, artificial intelligence, dynamic programming and particle swarm optimization solve nonconvex optimization problems in a powerful way and obtain a rapid and near global optimum solution. In addition, renewable energy resources as wind and solar are a promising option due to the environmental concerns as the fossil fuels reserves are being consumed and fuel price increases rapidly and emissions are getting higher. Therefore, the world tends to replace the old power stations into renewable ones or hybrid stations. In this paper, it is attempted to enhance the operation of electrical power system networks via economic dispatch. An ED problem is solved using various techniques, e.g., Particle Swarm Optimization (PSO) technique and Sine-Cosine Algorithm (SCA). Afterwards, the results are compared. Moreover, case studies are executed using a photovoltaic-based distributed generator with constant penetration level on the IEEE 14 bus system and results are observed. All the analyses are performed on MATLAB software.
Źródło:
Archives of Electrical Engineering; 2021, 70, 3; 643-655
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
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ł:
Error mitigation algorithm based on bidirectional fitting method for collision avoidance of Unmanned Surface Vehicle
Autorzy:
Song, L.
Chen, Z.
Mao, Y.
Dong, Z.
Xiang, Z.
Powiązania:
https://bibliotekanauki.pl/articles/260298.pdf
Data publikacji:
2018
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
Unmanned Surface Vehicle
position prediction
error mitigation
autoregressive model
particle swarm optimization (PSO)
Opis:
Radars and sensors are essential devices for an Unmanned Surface Vehicle (USV) to detect obstacles. Their precision has improved significantly in recent years with relatively accurate capability to locate obstacles. However, small detection errors in the estimation and prediction of trajectories of obstacles may cause serious problems in accuracy, thereby damaging the judgment of USV and affecting the effectiveness of collision avoidance. In this study, the effect of radar errors on the prediction accuracy of obstacle position is studied on the basis of the autoregressive prediction model. The cause of radar error is also analyzed. Subsequently, a bidirectional adaptive filtering algorithm based on polynomial fitting and particle swarm optimization is proposed to eliminate the observed errors in vertical and abscissa coordinates. Then, simulations of obstacle tracking and prediction are carried out, and the results show the validity of the algorithm. Finally, the method is used to simulate the collision avoidance of USV, and the results show the validity and reliability of the algorithm.
Źródło:
Polish Maritime Research; 2018, 4; 13-20
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ł:
Particle swarm optimization based fuzzy clustering approach to identify optimal number of clusters
Autorzy:
Chen, M.
Ludwig, S. A.
Powiązania:
https://bibliotekanauki.pl/articles/91549.pdf
Data publikacji:
2014
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
optimization
fuzzy clustering
cluster analysis
particle swarm optimization (PSO)
PSO
fuzzy Sammon mapping
Sammon mapping
Opis:
Fuzzy clustering is a popular unsupervised learning method that is used in cluster analysis. Fuzzy clustering allows a data point to belong to two or more clusters. Fuzzy c-means is the most well-known method that is applied to cluster analysis, however, the shortcoming is that the number of clusters need to be predefined. This paper proposes a clustering approach based on Particle Swarm Optimization (PSO). This PSO approach determines the optimal number of clusters automatically with the help of a threshold vector. The algorithm first randomly partitions the data set within a preset number of clusters, and then uses a reconstruction criterion to evaluate the performance of the clustering results. The experiments conducted demonstrate that the proposed algorithm automatically finds the optimal number of clusters. Furthermore, to visualize the results principal component analysis projection, conventional Sammon mapping, and fuzzy Sammon mapping were used.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 1; 43-56
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parameter estimation of photovoltaic module relied on golden jackal optimization
Autorzy:
Nguyen, Thuan Thanh
Powiązania:
https://bibliotekanauki.pl/articles/27309949.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
golden jackal optimization
henry gas solubility optimization
particle swarm optimization
PV parameter estimation
single diode model
Opis:
Due to the nonlinear current-voltage (I-V) relationship of the photovoltaic (PV) module, building a precise mathematical model of the PV module is necessary for evaluating and optimizing the PV systems. This paper proposes a method of building PV parameter estimation models based on golden jackal optimization (GJO). GJO is a recently developed algorithm inspired by the idea of the hunting behavior of golden jackals. The explored and exploited searching strategies of GJO are built based on searching for prey as well as harassing and grabbing prey of golden jackals. The performance of GJO is considered on the commercial KC200GT module under various levels of irradiance and temperature. Its performance is compared to well-known particle swarm optimization (PSO), recent Henry gas solubility optimization (HGSO) and some previous methods. The obtained results show that GJO can estimate unknown PV parameters with high precision. Furthermore, GJO can also provide better efficiency than PSO and HGSO in terms of statistical results over several runs. Thus, GJO can be a reliable algorithm for the PV parameter estimation problem under different environmental conditions.
Źródło:
Archives of Electrical Engineering; 2023, 72, 4; 987--1003
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective Improved Particle Swarm Optimisation for Transmission Congestion and Voltage Profile Management using Multilevel UPFC
Autorzy:
Rao, Mallavolu Malleswara
Ramadas, Geetha
Powiązania:
https://bibliotekanauki.pl/articles/1193696.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
congestion
unified power flow controller
improved particle swarm optimization
modular multilevel converter
voltage profile
Opis:
This paper proposes a multiobjective improved particle swarm optimisation (IPSO) for placing and sizing the series modular multilevel converter-based unified power flow controller (MMC-UPFC) FACTS devices to manage the transmission congestion and voltage profile in deregulated electricity markets. The proposed multiobjective IPSO algorithm is perfect for accomplishing the close ideal distributed generation (DG) sizes while conveying smooth assembly qualities contrasted with another existing algorithm. It tends to be reasoned that voltage profile and genuine power misfortunes have generous upgrades along ideal speculation on DGs in both the test frameworks. The proposed system eliminates the congestion and the power system can be easily used to solve complex and non-linear optimisation problems in a real-time manner.
Źródło:
Power Electronics and Drives; 2019, 4, 39; 79-93
2451-0262
2543-4292
Pojawia się w:
Power Electronics and Drives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
PSO based optimal location and sizing of SVC for novel multiobjective voltage stability analysis during N – 2 line contingency
Autorzy:
Mangaiyarkarasi, S. P
Sree Renga Raja, T.
Powiązania:
https://bibliotekanauki.pl/articles/140430.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
N – 2 contingency analysis
voltage severity
particle swarm optimization (PSO)
SVC
power system planning
Opis:
In this paper voltage stability is analysed based not only on the voltage deviations from the nominal values but also on the number of limit violating buses and severity of voltage limit violations. The expression of the actual state of the system as a numerical index like severity, aids the system operator in taking better security related decisions at control centres both during a period of contingency and also at a highly stressed operating condition. In contrary to conventional N – 1 contingency analysis, Northern Electric Reliability Council (NERC) recommends N – 2 line contingency analysis. The decision of the system operator to overcome the present contingency state of the system must blend harmoniously with the stability of the system. Hence the work presents a novel N – 2 contingency analysis based on the continuous severity function of the system. The study is performed on 4005 possible combinations of N – 2 contingency states for the practical Indian Utility 62 bus system. Static VAr Compensator is used to improve voltage profile during line contingencies. A multi- objective optimization with the objective of minimizing the voltage deviation and also the number of limit violating bus with optimal location and optimal sizing of SVC is achieved by Particle Swarm Optimization algorithm.
Źródło:
Archives of Electrical Engineering; 2014, 63, 4; 535-550
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Grid-tied converter operated under unbalanced and distorted grid voltage conditions
Autorzy:
Gałecki, A.
Michalczuk, M.
Kaszewski, A.
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/200867.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
grid tied converter
AC/DC converter
current controller
resonant controller
particle swarm optimization (PSO)
Opis:
The paper presents a three-phase grid-tied converter operated under unbalanced and distorted grid voltage conditions, using a multi-oscillatory current controller to provide high quality phase currents. The aim of this study is to introduce a systematic design of the current control loop. A distinctive feature of the proposed method is that the designer needs to define the required response and the disturbance characteristic, rather than usually unintuitive coefficients of controllers. Most common approach to tuning a state-feedback controller use linear-quadratic regulator (LQR) technique or pole-placement method. The tuning process for those methods usually comes down to guessing several parameters. For more complex systems including multi-oscillatory terms, control system tuning is unintuitive and cannot be effectively done by trial and error method. This paper proposes particle swarm optimization to find the optimal weights in a cost function for the LQR procedure. Complete settings for optimization procedure and numerical model are presented. Our goal here is to demonstrate an original design workflow. The proposed method has been verified in experimental study at a 10 kW laboratory setup.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 389-398
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new technique to design planar dipole antennas by using Bezier curve and Particle Swarm Optimization
Autorzy:
Homsup, N.
Silabut, W.
Kesornpatumanum, V.
Boonek, P.
Kuhirun, W.
Powiązania:
https://bibliotekanauki.pl/articles/140461.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
planar dipole antenna
Bézier curve
particle swarm optimization (PSO)
small antenna
dual band antenna
Opis:
This research presents a new technique which includes the principle of a Bezier curve and Particle Swarm Optimization (PSO) together, in order to design the planar dipole antenna for the two different targets. This technique can improve the characteristics of the antennas by modifying copper textures on the antennas with a Bezier curve. However, the time to process an algorithm will be increased due to the expansion of the solution space in optimization process. So as to solve this problem, the suitable initial parameters need to be set. Therefore this research initialized parameters with reference antenna parameters (a reference antenna operates on 2.4 GHz for IEEE 802.11 b/g/n WLAN standards) which resulted in the proposed designs, rapidly converted into the goals. The goal of the first design is to reduce the size of the antenna. As a result, the first antenna is reduced in the substrate size from areas of 5850 mm2 to 2987 mm2 (48.93% approximately) and can also operates at 2.4 GHz (2.37 GHz to 2.51 GHz). The antenna with dual band application is presented in the second design. The second antenna is operated at 2.4 GHz (2.40 GHz to 2.49 GHz) and 5 GHz (5.10 GHz to 5.45 GHz) for IEEE 802.11 a/b/g/n WLAN standards.
Źródło:
Archives of Electrical Engineering; 2016, 65, 3; 513-525
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unsupervised classification and particle swarm optimization
Klasyfikacja nienadzorowana i optymalizacja rojem cząstek
Autorzy:
Truszkowski, A.
Topczewska, M.
Powiązania:
https://bibliotekanauki.pl/articles/341179.pdf
Data publikacji:
2012
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
klasyfikacja nienadzorowana
analiza skupień
optymalizacja rojem cząstek
unsupervised classification
clustering
particle swarm optimization (PSO)
Opis:
This article considers three algorithms of unsupervised classification -K-means, Gbest and the Hybrid method, the last two have been proposed in [14]. All three algorithms belong to the class of non-hierarchical methods. At first, the initial split of objects into known in advance number of classes is performed. If it is necessary, some objects are then moved into other clusters to achieve better split - between cluster variation should be much larger than within cluster variation. The first algorithm described in this paper (K-means) is wellknown classical method. The second one (Gbest) is based on the particle swarm intelligence idea. While the third is a hybrid of two mentioned algorithms. Several indices assessing the quality of obtained clusters are calculated.
W niniejszym artykule porównywane są trzy algorytmy analizy skupień - metoda k-średnich, algorytm gbest oraz metoda hybrydowa. Algorytmy gbest oraz hybrydowy zostały zaproponowane w publikacji [14]. Wszystkie trzy metody nalezą a do rodziny metod niehierarchicznych, w których na początku tworzony jest podział obiektów na znaną z góry liczbę klastrów. Następnie, niektóre obiekty przenoszone są pomiędzy klastrami, by uzyskać jak najlepszy podział - wariancja pomiędzy skupieniami powinna być znacznie większa niż wariancja wewnątrz skupień. Pierwszy algorytm (k-means) jest znaną, klasyczną metodą. Drugi oparty jest na idei inteligencji roju cząstek. Natomiast trzeci jest metodą hybrydową łączącą dwa wymienione wcześniej algorytmy. Do porównania uzyskanych skupień wykorzystano kilka różnych indeksów szacujących jakość otrzymanych skupień.
Źródło:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2012, 9; 119-132
1644-0331
Pojawia się w:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling Microcystis Cell Density in a Mediterranean Shallow Lake of Northeast Algeria (Oubeira Lake), Using Evolutionary and Classic Programming
Autorzy:
Arif, Salah
Djellal, Adel
Djebbari, Nawel
Belhaoues, Saber
Touati, Hassen
Guellati, Fatma Zohra
Bensouilah, Mourad
Powiązania:
https://bibliotekanauki.pl/articles/2174666.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
microcystis cell density
Multiple Linear Regression
Support Vector Machine
Particle Swarm Optimization
Genetic Algorithm
Bird Swarm Algorithm
Opis:
Caused by excess levels of nutrients and increased temperatures, freshwater cyanobacterial blooms have become a serious global issue. However, with the development of artificial intelligence and extreme learning machine methods, the forecasting of cyanobacteria blooms has become more feasible. We explored the use of multiple techniques, including both statistical [Multiple Regression Model (MLR) and Support Vector Machine (SVM)] and evolutionary [Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Bird Swarm Algorithm (BSA)], to approximate models for the prediction of Microcystis density. The data set was collected from Oubeira Lake, a natural shallow Mediterranean lake in the northeast of Algeria. From the correlation analysis of ten water variables monitored, six potential factors including temperature, ammonium, nitrate, and ortho-phosphate were selected. The performance indices showed; MLR and PSO provided the best results. PSO gave the best fitness but all techniques performed well. BSA had better fitness but was very slow across generations. PSO was faster than the other techniques and at generation 20 it passed BSA. GA passed BSA a little further, at generation 50. The major contributions of our work not only focus on the modelling process itself, but also take into consideration the main factors affecting Microcystis blooms, by incorporating them in all applied models.
Źródło:
Geomatics and Environmental Engineering; 2023, 17, 2; 31--68
1898-1135
Pojawia się w:
Geomatics and Environmental Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the hybridization of the artificial Bee Colony and Particle Swarm Optimization Algorithms
Autorzy:
El-Abd, M.
Powiązania:
https://bibliotekanauki.pl/articles/91658.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
Artificial Bee Colony Algorithm
ABC
particle swarm optimization (PSO)
PSO
hybridization
hybrid algorithm
CEC05
Opis:
In this paper we investigate the hybridization of two swarm intelligence algorithms; namely, the Artificial Bee Colony Algorithm (ABC) and Particle Swarm Optimization (PSO). The hybridization technique is a component-based one, where the PSO algorithm is augmented with an ABC component to improve the personal bests of the particles. Three different versions of the hybrid algorithm are tested in this work by experimenting with different selection mechanisms for the ABC component. All the algorithms are applied to the well-known CEC05 benchmark functions and compared based on three different metrics, namely, the solution reached, the success rate, and the performance rate.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 2; 147-155
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy ranking based non-dominated sorting genetic algorithm-II for network overload alleviation
Autorzy:
Pandiarajan, K.
Babulal, C. K.
Powiązania:
https://bibliotekanauki.pl/articles/141059.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
non-dominated sorting genetic algorithm
generation rescheduling
particle swarm optimization (PSO)
differential evolution
overload index
Opis:
This paper presents an effective method of network overload management in power systems. The three competing objectives 1) generation cost 2) transmission line overload and 3) real power loss are optimized to provide pareto-optimal solutions. A fuzzy ranking based non-dominated sorting genetic algorithm-II (NSGA-II) is used to solve this complex nonlinear optimization problem. The minimization of competing objectives is done by generation rescheduling. Fuzzy ranking method is employed to extract the best compromise solution out of the available non-dominated solutions depending upon its highest rank. N-1 contingency analysis is carried out to identify the most severe lines and those lines are selected for outage. The effectiveness of the proposed approach is demonstrated for different contingency cases in IEEE 30 and IEEE 118 bus systems with smooth cost functions and their results are compared with other single objective evolutionary algorithms like Particle swarm optimization (PSO) and Differential evolution (DE). Simulation results show the effectiveness of the proposed approach to generate well distributed pareto-optimal non-dominated solutions of multi-objective problem
Źródło:
Archives of Electrical Engineering; 2014, 63, 3; 367-384
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cellular particle swarm optimization with a simple adaptive local search strategy for the permutation flow shop scheduling problem
Autorzy:
Seck-Tuoh-Mora, Juan C.
Medina-Marin, Joselito
Martinez-Gomez, Erick S.
Hernandez-Gress, Eva S.
Hernandez-Romero, Norberto
Volpi-Leon, Valeria
Powiązania:
https://bibliotekanauki.pl/articles/230060.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop
particle swarm optimization (PSO)
local search strategy
hybrid search method
cellular automata
scheduling
Opis:
Permutation flow shop scheduling problem deals with the production planning of a number of jobs processed by a set of machines in the same order. Several metaheuristics have been proposed for minimizing the makespan of this problem. Taking as basis the previous Alternate Two-Phase PSO (ATPPSO) method and the neighborhood concepts of the Cellular PSO algorithm proposed for continuous problems, this paper proposes the improvement of ATPPSO with a simple adaptive local search strategy (called CAPSO-SALS) to enhance its performance. CAPSO-SALS keeps the simplicity of ATPPSO and boosts the local search based on a neighborhood for every solution. Neighbors are produced by interchanges or insertions of jobs which are selected by a linear roulette scheme depending of the makespan of the best personal positions. The performance of CAPSO-SALS is evaluated using the 12 different sets of Taillard’s benchmark problems and then is contrasted with the original and another previous enhancement of the ATPPSO algorithm. Finally, CAPSO-SALS is compared as well with other ten classic and state-of-art metaheuristics, obtaining satisfactory results.
Źródło:
Archives of Control Sciences; 2019, 29, 2; 205-226
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Maintenance policy of degradation components based on the two-phase Wiener process
Autorzy:
Song, Minqiao
Zhang, Yingzhi
Yang, Fang
Wang, Xiaofeng
Guo, Guiming
Powiązania:
https://bibliotekanauki.pl/articles/28328273.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
condition-based maintenance
two-phase inspection
two-phase Wiener process
Particle Swarm Optimization
sensitivity analysis
Opis:
This paper proposes a condition-based maintenance policy for the two-phase Wiener degradation process components. The main contribution of this article is to provide the time distribution of degradation failures for the two-phase Wiener process degradationcomponent, as well as the modeling and solving methods for two-phase maintenance. The two-phase maintenance policy includes two-phase inspection and preventive replacement maintenance operations. The established optimization maintenance policy model aims to minimize long-term operation costs. The specific cost calculation equation and the solution method of the maintenance model are given. The feasibility of the maintenance policy model is verified using the two-phase degradation data of the Liquid Coupling Devices. The Particle swarm optimization algorithm can stably solve the described problem, and the results show that the two-phase maintenance policy can be more economical and improve components availability. After that, we also analyzed the impact of the cost parameters on the maintenance policy through sensitivity analysis.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 4; art. no. 172537
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Jacking and energy consumption control over network for jack-up rig: simulation and experiment
Autorzy:
Do, Viet-Dung
Dang, Xuan-Kien
Tran, Tien-Dat
Pham, Thi Duyen-Anh
Powiązania:
https://bibliotekanauki.pl/articles/32912855.pdf
Data publikacji:
2022
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
networked control system
environmental forces
energy consumption
Fuzzy Particle Swarm Optimization
jacking system
time-delay
Opis:
Oil and gas projects differ from regular investment projects in that they are frequently large-scale, categorised as vital national projects, highly technological, and associated with significant risks. Drilling rigs are a crucial component of the oil and gas sector and the majority of the systems and equipment aboard drilling rigs are operated automatically. Consequently, it is crucial to address the topic of an advanced control theory for off-shore systems. Network technology connected to control is progressively being used to replace outdated technologies, together with other contemporary technologies. In this study, we examine how to adapt a networked control jacking system to the effects of internal and external disturbances with a time delay, using a Fuzzy controller (FC)-based particle swarm optimisation. To demonstrate the benefit of the proposed approach, the developed Fuzzy Particle Swarm Optimisation (FPSO) controller is compared with the fuzzy controller. Finally, the results from simulations and experiments utilising Matlab software and embedded systems demonstrate the suitability of the proposed approach.
Źródło:
Polish Maritime Research; 2022, 3; 89-98
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamics of Stochastic vs. Greedy Heuristics in Traveling Salesman Problem
Autorzy:
Białogłowski, M.
Staniaszek, M.
Laskowski, W.
Grudniak, M.
Powiązania:
https://bibliotekanauki.pl/articles/91276.pdf
Data publikacji:
2018
Wydawca:
Warszawska Wyższa Szkoła Informatyki
Tematy:
traveling salesman problem
Nearest Neighbor
Monte Carlo
Simulated Annealing
Genetic Algorithm
particle swarm optimization (PSO)
Opis:
We studied the relative performance of stochastic heuristics in order to establish the relations between the fundamental elements of their mechanisms. The insights on their dynamics, abstracted from the implementation details, may contribute to the development of an efficient framework for design of new probabilistic methods. For that, we applied four general optimization heuristics with varying number of hyperparameters to traveling salesman problem. A problem-specific greedy approach (Nearest Neighbor) served as a reference for the results of: Monte Carlo, Simulated Annealing, Genetic Algorithm, and Particle Swarm Optimization. The more robust heuristics – with higher configuration potential, i.e. with more hyperparameters – outperformed the smart ones, being surpassed only by the method specifically designed for the task.
Źródło:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2018, 12, 19; 7-24
1896-396X
2082-8349
Pojawia się w:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmu optymalizacji rojem cząstek do znajdowania ekstremów globalnych wybranych funkcji testowych
A particle swarm optimization algorithm for finding global extrema of some benchmark functions
Autorzy:
Figielska, E.
Wiatrak, M.
Powiązania:
https://bibliotekanauki.pl/articles/91471.pdf
Data publikacji:
2015
Wydawca:
Warszawska Wyższa Szkoła Informatyki
Tematy:
optymalizacja rojem cząstek
ekstremum globalne
funkcje testowe
particle swarm optimization (PSO)
global extremum
benchmark functions
Opis:
Praca dotyczy zastosowania algorytmu optymalizacji rojem cząstek do znajdowania ekstremów globalnych dla wybranych funkcji jedno i wielomodalnych. Na podstawie wyników eksperymentu obliczeniowego wyłoniono warianty ustawień parametrów algorytmu zapewniające jego największą skuteczność.
In this paper, we present the particle swarm optimization algorithm for finding the global extrema of several single and multimodal functions. The values of the algorithm parameters which ensure its best performance are determined on the basis of the computational results.
Źródło:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2015, 9, 13; 7-19
1896-396X
2082-8349
Pojawia się w:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization for solving a class of type-1 and type-2 fuzzy nonlinear equations
Autorzy:
Sadiqbatcha, S.
Jafarzadeh, S.
Ampatzidis, Y.
Powiązania:
https://bibliotekanauki.pl/articles/91663.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
type-1 fuzzy sets
type-2 fuzzy sets
polynomial
exponential equation
particle swarm optimization (PSO)
Opis:
This paper proposes a modified particle swarm optimization (PSO) algorithm that can be used to solve a variety of fuzzy nonlinear equations, i.e. fuzzy polynomials and exponential equations. Fuzzy nonlinear equations are reduced to a number of interval nonlinear equations using alpha cuts. These equations are then sequentially solved using the proposed methodology. Finally, the membership functions of the fuzzy solutions are constructed using the interval results at each alpha cut. Unlike existing methods, the proposed algorithm does not impose any restriction on the fuzzy variables in the problem. It is designed to work for equations containing both positive and negative fuzzy sets and even for the cases when the support of the fuzzy sets extends across 0, which is a particularly problematic case.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 2; 103-110
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Semantic segmentation and PSO based method for segmenting liver and lesion from CT images
Autorzy:
Nayantara, Vaidehi P.
Surekha, Kamath
Manjunath, K.N.
Rajagopal, Kadavigere
Powiązania:
https://bibliotekanauki.pl/articles/2146955.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
liver lesion segmentation
computed tomography
semantic segmentation
SegNet
particle swarm optimization-based clustering
Hounsfield Unit
Opis:
The liver is a vital organ of the human body and hepatic cancer is one of the major causes of cancer deaths. Early and rapid diagnosis can reduce the mortality rate. It can be achieved through computerized cancer diagnosis and surgery planning systems. Segmentation plays a major role in these systems. This work evaluated the efficacy of the SegNet model in liver and particle swarm optimization-based clustering technique in liver lesion segmentation. Over 2400 CT images were used for training the deep learning network and ten CT datasets for validating the algorithm. The segmentation results were satisfactory. The values for Dice Coefficient and volumetric overlap error achieved were 0.940 ± 0.022 and 0.112 ± 0.038, respectively for liver and the results for lesion delineation were 0.4629 ± 0.287 and 0.6986 ± 0.203, respectively. The proposed method is effective for liver segmentation. However, lesion segmentation needs to be further improved for better accuracy.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 3; 635--640
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja cyklu roboczego manipulatora z parami obrotowymi
Optimization of work cycle of manipulator with revolute joints
Autorzy:
Posiadała, B.
Tomala, M.
Powiązania:
https://bibliotekanauki.pl/articles/171143.pdf
Data publikacji:
2014
Wydawca:
Poltegor-Instytut Instytut Górnictwa Odkrywkowego
Tematy:
manipulator
aktuator
modelowanie dynamiki
optymalizacja pracy
metoda roju cząstek
actuator
dynamics modelling
optimization
particle swarm optimization (PSO)
Opis:
W artykule przedstawiono zagadnienie optymalizacji cyklu roboczego manipulatora wyposażonego w kinematyczne pary obrotowe. Jako kryterium optymalizacji przyjęto minimalizację obciążeń w aktuatorach manipulatora oraz minimalizację całkowitego czasu wykonania przez manipulator cyklu roboczego, polegającego na transporcie końcówki roboczej z jednego punktu trójwymiarowej przestrzeni do innego. W pracy zamieszczono przykładowe wyniki obliczeń numerycznych.
In this work, the problem of work cycle optimization of manipulator with revolute joints has been presented. The optimization purposes to minimize torques in actuators of the manipulator and total time of the work cycle. The work cycle is to move end-effector from one point of spatial workspace to another. An exemplary computation has been performed and results of the computation have been attached to the paperwork.
Źródło:
Górnictwo Odkrywkowe; 2014, 55, 4-5; 71-75
0043-2075
Pojawia się w:
Górnictwo Odkrywkowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative Study of Optimised Artificial Intelligence Based First Order Sliding Mode Controllers for Position Control of a DC Motor Actuator
Autorzy:
Nyong-Bassey, B. E.
Akinloye, B.
Powiązania:
https://bibliotekanauki.pl/articles/385114.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
adaptive fuzzy control
DC motor position control
genetic algorithm
particle swarm optimization (PSO)
sliding mode control
Opis:
This paper aims at critically reviewing various sliding mode control measures applied to Permanent Magnet DC Motor actuator for position control. At first, a hybrid sliding mode controller was examined with its advantages and disadvantages. Then, the smooth sliding mode controller in the same manner. The shortcomings of the two methods were overcome by proper switch design and also using tanh-sinh hyperbolic function. The sliding mode controller switches on when either disturbance or noise is detected. Genetic Algorithm Computational tuning technique is employed to optimize the gains of the controllers for optimal response.The performance of the proposed controller architecture, as well as the reviewed controllers, have been compared for performance evaluation with respect to several operating conditions. This includes load torque disturbance injection, noise injection in a feedback loop, motor nonlinearity exhibited by parameters variation, and a step change in reference input demand.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 3; 58-71
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of the Shunt Active Power Filter apparent power ratio using particle swarm optimization
Autorzy:
Kouzou, A.
Mahmoudi, M. O.
Boucherit, M. S.
Powiązania:
https://bibliotekanauki.pl/articles/229885.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
effective apparent power
shunt active power filter
particle swarm optimization (PSO)
harmonics
unbalanced voltages
unbalanced load
Opis:
The main objective of this present paper is the study of the Shunt Active Power Filter (APF) compensations capability for different perturbations in AC power system such as current unbalance, phase shift current and undesired harmonics generated by nonlinear load and/or by the power system voltage. This capability is determined by the maximum rate of the apparent power that can be delivered. This study is based on the definition of the effective apparent power as defined in IEEE 1459-2000 which was proved to be the suitable amount to be concerned in the design process of different devices.
Źródło:
Archives of Control Sciences; 2010, 20, 1; 47-76
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid method for the optimal reactive power dispatch and the control of voltagesin an electrical energy network
Autorzy:
Benchabira, Aissa
Khiat, Mounir
Powiązania:
https://bibliotekanauki.pl/articles/140740.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
electrical energy network
interior point method (IPM)
optimal reactive power dispatch (ORPD)
particle swarm optimization (PSO)
Opis:
This paper presents the resolution of the optimal reactive power dispatch (ORPD) problem and the control of voltages in an electrical energy system by using a hybrid algorithm based on the particle swarmoptimization (PSO) method and interior point method (IPM). The IPM is based on the logarithmic barrier (LB-IPM) technique while respecting the non-linear equality and inequality constraints. The particle swarmoptimization-logarithmic barrier-interior point method (PSO-LB-IPM) is used to adjust the control variables, namely the reactive powers, the generator voltages and the load controllers of the transformers, in order to ensure convergence towards a better solution with the probability of reaching the global optimum. The proposed method was first tested and validated on a two-variable mathematical function using MATLAB as a calculation and execution tool, and then it is applied to the ORPD problem to minimize the total active losses in an electrical energy network. To validate the method a testwas carried out on the IEEE electrical energy network of 57 buses.
Źródło:
Archives of Electrical Engineering; 2019, 68, 3; 535-551
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling electric power generators using particle swarm optimization combined with the Lagrangian relaxation method
Autorzy:
Balci, H. H.
Valenzuela, J. F.
Powiązania:
https://bibliotekanauki.pl/articles/907641.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja rojem cząstek
jednostka wytwórcza
relaksacja Lagrange'a
particle swarm optimization (PSO)
unit commitment
Lagrange relaxation
Opis:
This paper describes a procedure that uses particle swarm optimization (PSO) combined with the Lagrangian Relaxation (LR) framework to solve a power-generator scheduling problem known as the unit commitment problem (UCP). The UCP consists of determining the schedule and production amount of generating units within a power system subject to operating constraints. The LR framework is applied to relax coupling constraints of the optimization problem. Thus, the UCP is separated into independent optimization functions for each generating unit. Each of these sub-problems is solved using Dynamic Programming (DP). PSO is used to evolve the Lagrangian multipliers. PSO is a population based search technique, which belongs to the swarm intelligence paradigm that is motivated by the simulation of social behavior to manipulate individuals towards better solution areas. The performance of the PSO-LR procedure is compared with results of other algorithms in the literature used to solve the UCP. The comparison shows that the PSO-LR approach is efficient in terms of computational time while providing good solutions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 411-421
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytmy stadne w problemach optymalizacji
Swarm Algorithms in Optimization Problems
Autorzy:
Filipowicz, B.
Kwiecień, J.
Powiązania:
https://bibliotekanauki.pl/articles/274567.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
optymalizacja nieliniowa
algorytm PSO
algorytm pszczeli
algorytm świetlika
nonlinear optimization
particle swarm optimization (PSO)
bee algorithm
firefly algorithm
Opis:
W artykule przedstawiono zastosowanie algorytmu optymalizacji rojem cząstek, algorytmu pszczelego i algorytmu świetlika do wyznaczenia optymalnego rozwiązania wybranych testowych funkcji ciągłych. Przedstawiono i porównano wyniki badań dla funkcji Rosenbrocka, Rastrigina i de Jonga.
This paper presents particle swarm optimization, bee algorithm and firefly algorithm, used for optimal solution of selected continuous well-known functions. Results of these algorithms are compared to each other on Rosenbrock, Rastrigin and de Jong functions.
Źródło:
Pomiary Automatyka Robotyka; 2011, 15, 12; 152-157
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An arma type pi-sigma artificial neural network for nonlinear time series forecasting
Autorzy:
Akdeniz, E.
Egrioglu, E.
Bas, E.
Yolcu, U.
Powiązania:
https://bibliotekanauki.pl/articles/91816.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
high order artificial neural networks
pi-sigma neural network, forecasting
recurrent neural network
particle swarm optimization (PSO)
Opis:
Real-life time series have complex and non-linear structures. Artificial Neural Networks have been frequently used in the literature to analyze non-linear time series. High order artificial neural networks, in view of other artificial neural network types, are more adaptable to the data because of their expandable model order. In this paper, a new recurrent architecture for Pi-Sigma artificial neural networks is proposed. A learning algorithm based on particle swarm optimization is also used as a tool for the training of the proposed neural network. The proposed new high order artificial neural network is applied to three real life time series data and also a simulation study is performed for Istanbul Stock Exchange data set.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 2; 121-132
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An adaptive particle swarm optimization algorithm for robust trajectory tracking of a class of under actuated system
Autorzy:
Kumar, V. E.
Jerome, J.
Powiązania:
https://bibliotekanauki.pl/articles/141105.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
inverted pendulum
LQR controller
particle swarm optimization (PSO)
genetic algorithm
adaptive inertia weight factor
state feedback control
Opis:
This paper presents an adaptive particle swarm optimization (APSO) based LQR controller for optimal tuning of state feedback controller gains for a class of under actuated system (Inverted pendulum). Normally, the weights of LQR controller are chosen based on trial and error approach to obtain the optimum controller gains, but it is often cumbersome and tedious to tune the controller gains via trial and error method. To address this problem, an intelligent approach employing adaptive PSO (APSO) for optimum tuning of LQR is proposed. In this approach, an adaptive inertia weight factor (AIWF), which adjusts the inertia weight according to the success rate of the particles, is employed to not only speed up the search process but also to increase the accuracy of the algorithm towards obtaining the optimum controller gain. The performance of the proposed approach is tested on a bench mark inverted pendulum system, and the experimental results of APSO are compared with that of the conventional PSO and GA. Experimental results prove that the proposed algorithm remarkably improves the convergence speed and precision of PSO in obtaining the robust trajectory tracking of inverted pendulum.
Źródło:
Archives of Electrical Engineering; 2014, 63, 3; 345-365
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ARL-Wavelet-BPF optimization using PSO algorithm for bearing fault diagnosis
Autorzy:
Ahsan, Muhammad
Bismor, Dariusz
Manzoor, Muhammad Arslan
Powiązania:
https://bibliotekanauki.pl/articles/27322619.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
signal-to-noise ratio
asymmetric real Laplace wavelet
bandpass filter
particle swarm optimization
spectral kurtosis
fault frequency
Opis:
Rotating element bearings are the backbone of every rotating machine. Vibration signals measured from these bearings are used to diagnose the health of the machine, but when the signal-to-noise ratio is low, it is challenging to diagnose the fault frequency. In this paper, a new method is proposed to enhance the signal-to-noise ratio by applying the Asymmetric Real Laplace wavelet Bandpass Filter (ARL-wavelet-BPF). The Gaussian function of the ARL-wavelet represents an excellent BPF with smooth edges which helps to minimize the ripple effects. The bandwidth and center frequency of the ARL-wavelet-BPF are optimized using the Particle Swarm Optimization (PSO) algorithm. Spectral kurtosis (SK) of the envelope spectrum is employed as a fitness function for the PSO algorithm which helps to track the periodic spikes generated by the fault frequency in the vibration signal. To validate the performance of the ARL-wavelet-BPF, different vibration signals with low signal-to-noise ratio are used and faults are diagnosed.
Źródło:
Archives of Control Sciences; 2023, 33, 3; 589--606
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using particle swarm optimization to accurately identify syntactic phrases in free text
Autorzy:
Tambouratzis, G.
Powiązania:
https://bibliotekanauki.pl/articles/91802.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
parsing of natural language
machine translation
syntactically-derived phrasing
particle swarm optimization (PSO)
PSO
parameter optimization
Adaptive PSO
AdPSO
Opis:
The present article reviews the application of Particle Swarm Optimization (PSO) algorithms to optimize a phrasing model, which splits any text into linguistically-motivated phrases. In terms of its functionality, this phrasing model is equivalent to a shallow parser. The phrasing model combines attractive and repulsive forces between neighbouring words in a sentence to determine which segmentation points are required. The extrapolation of phrases in the specific application is aimed towards the automatic translation of unconstrained text from a source language to a target language via a phrase-based system, and thus the phrasing needs to be accurate and consistent to the training data. Experimental results indicate that PSO is effective in optimising the weights of the proposed parser system, using two different variants, namely sPSO and AdPSO. These variants result in statistically significant improvements over earlier phrasing results. An analysis of the experimental results leads to a proposed modification in the PSO algorithm, to prevent the swarm from stagnation, by improving the handling of the velocity component of particles. This modification results in more effective training sequences where the search for new solutions is extended in comparison to the basic PSO algorithm. As a consequence, further improvements are achieved in the accuracy of the phrasing module.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 1; 63-77
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Performance Study on Synchronous and Asynchronous Update Rules for A Plug-In Direct Particle Swarm Repetitive Controller
Autorzy:
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/141272.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
repetitive process control
particle swarm optimization (PSO)
synchronous and asynchronous update rules
dynamic optimization problem
repetitive disturbance rejection
optimal control
Opis:
In this paper two different update schemes for the recently developed plug-in direct particle swarm repetitive controller (PDPSRC) are investigated and compared. The proposed approach employs the particle swarm optimizer (PSO) to solve in on-line mode a dynamic optimization problem (DOP) related to the control task in the constant-amplitude constant-frequency voltage-source inverter (CACF VSI) with an LC output filter. The effectiveness of synchronous and asynchronous update rules, both commonly used in static optimization problems (SOPs), is assessed and compared in the case of PDPSRC. The performance of the controller, when synthesized using each of the update schemes, is studied numerically.
Źródło:
Archives of Electrical Engineering; 2014, 63, 4; 635-646
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling of Curvature of the Railway Track Geometrical Layout Using Particle Swarm Optimization
Autorzy:
Palikowska, Katarzyna Małgorzata
Powiązania:
https://bibliotekanauki.pl/articles/504485.pdf
Data publikacji:
2014
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
Particle Swarm Optimization algorithm cubic C-Bezier curve
curvature of the railway track layout dynamic interactions
transition curve
Opis:
A method of railway track geometrical layout design, based on an application of cubic C-Bezier curves for describing the layout curvature is presented in the article. The control points of a cubic C-Bezier curve are obtained in an optimization process carried out using Particle Swarm Optimization algorithm. The optimization criteria are based on the evaluation of the dynamic interactions and satisfaction of geometrical design requirements.
Źródło:
Logistics and Transport; 2014, 21, 1; 73-82
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the Bit-flipping Method for Decoding Low-density Parity-check Codes in Wireless Networks by Using the Artificial Spider Algorithm
Autorzy:
Ghaffoori, Ali Jasim
Abdul-Adheem, Wameedh Riyadh
Powiązania:
https://bibliotekanauki.pl/articles/2055251.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
low-density parity-check
LDPC
hard-decision Bit-Flipping
BF
particle swarm optimization
PSO
artificial spider algorithm
ASA
Opis:
In this paper, the performance of Low-Density Parity-Check (LDPC) codes is improved, which leads to reduce the complexity of hard-decision Bit-Flipping (BF) decoding by utilizing the Artificial Spider Algorithm (ASA). The ASA is used to solve the optimization problem of decoding thresholds. Two decoding thresholds are used to flip multiple bits in each round of iteration to reduce the probability of errors and accelerate decoding convergence speed while improving decoding performance. These errors occur every time the bits are flipped. Then, the BF algorithm with a low-complexity optimizer only requires real number operations before iteration and logical operations in each iteration. The ASA is better than the optimized decoding scheme that uses the Particle Swarm Optimization (PSO) algorithm. The proposed scheme can improve the performance of wireless network applications with good proficiency and results. Simulation results show that the ASA-based algorithm for solving highly nonlinear unconstrained problems exhibits fast decoding convergence speed and excellent decoding performance. Thus, it is suitable for applications in broadband wireless networks.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 1; 109--114
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization of a neural network model for predicting the flashover voltage on polluted cap and pin insulator
Autorzy:
Belkebir, Amel
Bourek, Yacine
Benguesmia, Hani
Powiązania:
https://bibliotekanauki.pl/articles/2146737.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
Tematy:
flashover voltage
particle swarm optimization
prediction
artificial pollution
neural network
napięcie przeskoku
optymalizacja roju cząstek
prognozowanie
sieć neuronowa
Opis:
This paper proposes training an artificial neural network (ANN) by a particle swarm optimization (PSO) technique to predict the flashover voltage of outdoor insulators. The analysis follows a series of real-world tests on high-voltage insulators to form a database for implementing artificial intelligence concepts. These tests are performed in various degrees of artificial contamination (distilled brine). Each contamination level shows the amount of contamination in milliliters per area of the isolator. The acquisition database provides values of flashover voltage corresponding to their electrical conductivity in each isolation zone and different degrees of artificial contamination. The results show that ANN trained by PSO can not only provide better prediction results, but also reduce the amount of computation efforts. It is also a more powerful model because: it does not get stuck in a local optimum. In addition, it also has the advantages of simple logic, simple implementation, and underlying intelligence. Compared to the results obtained by practical tests, the results obtained present that the PSO-ANN technique is very effective to predict flashover of high-voltage polluted insulators.
Źródło:
Diagnostyka; 2022, 23, 3; art. no 2022309
1641-6414
2449-5220
Pojawia się w:
Diagnostyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów rojowych do optymalizacji parametrów w modelach układów regulacji
Application of swarm intelligence algorithms to optimization of control system models
Autorzy:
Tomera, M.
Powiązania:
https://bibliotekanauki.pl/articles/269153.pdf
Data publikacji:
2015
Wydawca:
Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
Tematy:
algorytmy rojowe
optymalizacja parametrów
algorytm mrówkowy
algorytm sztucznej kolonii pszczół
algorytm optymalizacji rojem cząstek
swarm intelligence
swarm based optimization
ant colony optimization
Artificial Bee Colony
particle swarm optimization (PSO)
Opis:
W pracy przedstawione zostały algorytmy rojowe, takie jak: algorytm mrówkowy, zmodyfikowany algorytm mrówkowy, algorytm sztucznej kolonii pszczół oraz algorytm optymalizacji rojem cząstek. Dla tych algorytmów przygotowane zostało oprogramowanie w Matlabie, pozwalające na optymalizację parametrów poszukiwanych modeli matematycznych, wyznaczanych na podstawie przeprowadzonych testów identyfikacyjnych lub na optymalizację parametrów regulatorów zastosowanych w modelach matematycznych układów sterowania.
The paper presents the swarm intelligence algorithms, such as: ant colony algorithm (ACO), the modified ant colony algorithm (MACO), the artificial bee colony algorithm (ABC) and the particle swarm optimization algorithm (PSO). Ant colony optimization (ACO) based upon the observation of the behavior of ant colonies looking for food in the surrounding anthill. Feeding ants it is based on finding the shortest path transitions between a food source and the anthill. In the process of foraging ants on their paths crossing from the nest to a food source and back, they leave a pheromone trail. The work presents also the modified ant colony algorithm (MACO). This algorithm is based on searching the solution space surrounded by the best solution obtained in the previous iteration. If you find a local minimum, the proposed algorithm uses pheromone to find a new solution space, while retaining the position information current local minimum. The artificial bee colony algorithm is one of the well-known swarm intelligence algorithms. In the past decade there has been created several different algorithms based on the observation of the behavior of cooperative bees. Among them, the most frequently analyzed and used is bee algorithm proposed in 2005 by Dervis Karaboga and was be used in the proposed paper. The particle swarm optimization algorithm (PSO) is based on adjusting the change speed of the moving particles to a speed of particles movement in the neighborhood. Particle optimization algorithm is one of the computational techniques derived on the basis of swarm behavior such as flocks of birds and schools of fish, which is the basis for the functioning of the exchange of information to enable them to cooperate. It was noticed that the animals in the herd tend to maintain the optimum distance from their neighbors, by appropriate adjustment of their speed. This method allows the synchronous and collision-free motion, often accompanied by sudden changes of direction and due to the rearrangement of the optimal formation. For these algorithms has been prepared the software in Matlab, allowing to optimization of the mathematical models designated on the basis of the carried out identification tests and control parameters used in the mathematical model of the control system.
Źródło:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2015, 46; 97-102
1425-5766
2353-1290
Pojawia się w:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on preventive maintenance strategy of Coating Machine based on dynamic failure rate
Autorzy:
Gu, Dongwei
Nie, Ruihua
Han, Wenbo
Chen, Guang
Jia, Ligang
Powiązania:
https://bibliotekanauki.pl/articles/24200819.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
dynamic preventive maintenance model
DM
BP-LSTM
dynamic failure rate threshold
preventive maintenance strategy
Genetic-Particle Swarm Optimization
GPSO
Opis:
In this paper, a dynamic preventive maintenance strategy is proposed for the problem of high maintenance cost rate due to excessive maintenance caused by unreasonable maintenance threshold setting when complex electromechanical equipment maintenance strategy is formulated. Increasing failure rate factor and decreasing service age factor are introduced to describe the evolution rules of failure rate during the maintenance of the coating machine, and the BP-LSTM (BP-Long Short Term Memory Network, BP-LSTM) model is combined to predict the failure rate of the coating machine. A Dynamic preventive maintenance Model (DM) that relies on dynamic failure rate thresholds to classify the three preventive maintenance modes of minor, medium and major repairs is constructed. A dynamic preventive maintenance strategy optimization process based on Genetic-Particle Swarm Optimization (GPSO) algorithm with the lowest cost rate per unit time in service phase is built to solve the difficult problem of dynamic failure rate threshold finding. Based on the historical operating data of the coating machine, a case study of the dynamic preventive maintenance strategy of the coating machine was conducted to verify the effectiveness of the model and the developed maintenance strategy proposed in this paper. The results show that the maintenance strategy developed in this paper can ensure better economy and applicability.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 1; atr. no. 20
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Feature selection using particle swarm optimization in text categorization
Autorzy:
Aghdam, M. H.
Heidari, S.
Powiązania:
https://bibliotekanauki.pl/articles/91792.pdf
Data publikacji:
2015
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
classification system
feature selection
text categorization
particle swarm optimization (PSO)
system klasyfikacji
wybór funkcji
kategoryzacja tekstu
optymalizacja rojem cząstek
Opis:
Feature selection is the main step in classification systems, a procedure that selects a subset from original features. Feature selection is one of major challenges in text categorization. The high dimensionality of feature space increases the complexity of text categorization process, because it plays a key role in this process. This paper presents a novel feature selection method based on particle swarm optimization to improve the performance of text categorization. Particle swarm optimization inspired by social behavior of fish schooling or bird flocking. The complexity of the proposed method is very low due to application of a simple classifier. The performance of the proposed method is compared with performance of other methods on the Reuters-21578 data set. Experimental results display the superiority of the proposed method.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 4; 231-238
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of different optimization techniques and Artificial Neural Networks (ANN) for coal-consumption forecasting: a case study
Zastosowanie różnych technik optymalizacji i sztucznych sieci neuronowych (SSN) do prognozowania zużycia węgla: studium przypadku
Autorzy:
Seker, Mustafa
Unal Kartal, Neslihan
Karadirek, Selin
Gulludag, Cevdet Bertan
Powiązania:
https://bibliotekanauki.pl/articles/2173847.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Gospodarki Surowcami Mineralnymi i Energią PAN
Tematy:
coal consumption
metaheuristic optimization
grey wolf optimization
particle swarm optimization
whale optimization
zużycie węgla
optymalizacja metaheurystyczna
optymalizacja szarego wilka
optymalizacja roju cząstek
optymalizacja wielorybów
Opis:
The demand for energy on a global scale increases day by day. Unlike renewable energy sources, fossil fuels have limited reserves and meet most of the world’s energy needs despite their adverse environmental effects. This study presents a new forecast strategy, including an optimization-based S-curve approach for coal consumption in Turkey. For this approach, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO), and Whale Optimization Algorithm (WOA) are among the meta-heuristic optimization techniques used to determine the optimum parameters of the S-curve. In addition, these algorithms and Artificial Neural Network (ANN) have also been used to estimate coal consumption. In evaluating coal consumption with ANN, energy and economic parameters such as installed capacity, gross generation, net electric consumption, import, export, and population energy are used for input parameters. In ANN modeling, the Feed Forward Multilayer Perceptron Network structure was used, and Levenberg-Marquardt Back Propagation has used to perform network training. S-curves have been calculated using optimization, and their performance in predicting coal consumption has been evaluated statistically. The findings reveal that the optimization-based S-curve approach gives higher accuracy than ANN in solving the presented problem. The statistical results calculated by the GWO have higher accuracy than the PSO, WOA, and GA with R2 = 0.9881, RE = 0.011, RMSE = 1.079, MAE = 1.3584, and STD = 1.5187. The novelty of this study, the presented methodology does not need more input parameters for analysis. Therefore, it can be easily used with high accuracy to estimate coal consumption within other countries with an increasing trend in coal consumption, such as Turkey.
Zapotrzebowanie na energię w skali globalnej rośnie z dnia na dzień. W przeciwieństwie do odnawialnych źródeł energii, paliwa kopalne mają ograniczone rezerwy i zaspokajają większość światowego zapotrzebowania na energię pomimo ich niekorzystnego wpływu na środowisko. Niniejsze opracowanie przedstawia nową strategię prognozowania, w tym oparte na optymalizacji podejście oparte na krzywej S dla zużycia węgla w Turcji. W tym podejściu algorytmy optymalizacji genetycznej (GA) i optymalizacji roju cząstek (PSO), optymalizacja Gray Wolf (GWO) i algorytm optymalizacji wielorybów (WOA) należą do metaheurystycznych technik optymalizacji stosowanych do określenia optymalnych parametrów krzywej S. Ponadto algorytmy te oraz sztuczna sieć neuronowa (SSN) zostały również wykorzystane do oszacowania zużycia węgla. Przy ocenie zużycia węgla za pomocą SSN jako parametry wejściowe wykorzystuje się parametry energetyczne i ekonomiczne, takie jak moc zainstalowana, produkcja brutto, zużycie energii elektrycznej netto, import, eksport i energia ludności. W modelowaniu SSN wykorzystano strukturę Feed Forward Multilayer Perceptron Network, a do uczenia sieci wykorzystano propagację wsteczną Levenberg-Marquardt. Krzywe S zostały obliczone za pomocą optymalizacji, a ich skuteczność w przewidywaniu zużycia węgla została oceniona statystycznie. Wyniki pokazują, że podejście oparte na optymalizacji opartej na krzywej S zapewnia większą dokładność niż SSN w rozwiązaniu przedstawionego problemu. Wyniki statystyczne obliczone przez GWO mają wyższą dokładność niż PSO, WOA i GA z R2 = 0,9881, RE = 0,011, RMSE = 1,079, MAE = 1,3584 i STD = 1,5187. Nowość tego badania, prezentowana metodyka nie wymaga dodatkowych parametrów wejściowych do analizy. Dzięki temu może być z łatwością wykorzystany z dużą dokładnością do oszacowania zużycia węgla w innych krajach o tendencji wzrostowej zużycia węgla, takich jak Turcja.
Źródło:
Gospodarka Surowcami Mineralnymi; 2022, 38, 2; 77--112
0860-0953
Pojawia się w:
Gospodarka Surowcami Mineralnymi
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Repulsive self - adaptive acceleration particle swarm optimization approach
Autorzy:
Ludwig, S. A.
Powiązania:
https://bibliotekanauki.pl/articles/91874.pdf
Data publikacji:
2014
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
adaptive Particle Swarm Optimization
adaptive PSO
optimization
Repulsive Self-adaptive Acceleration PSO
RSAPSO
velocity weights
optimal solution of the problem
function evaluations
Opis:
Adaptive Particle Swarm Optimization (PSO) variants have become popular in recent years. The main idea of these adaptive PSO variants is that they adaptively change their search behavior during the optimization process based on information gathered during the run. Adaptive PSO variants have shown to be able to solve a wide range of difficult optimization problems efficiently and effectively. In this paper we propose a Repulsive Self-adaptive Acceleration PSO (RSAPSO) variant that adaptively optimizes the velocity weights of every particle at every iteration. The velocity weights include the acceleration constants as well as the inertia weight that are responsible for the balance between exploration and exploitation. Our proposed RSAPSO variant optimizes the velocity weights that are then used to search for the optimal solution of the problem (e.g., benchmark function). We compare RSAPSO to four known adaptive PSO variants (decreasing weight PSO, time-varying acceleration coefficients PSO, guaranteed convergence PSO, and attractive and repulsive PSO) on twenty benchmark problems. The results show that RSAPSO achives better results compared to the known PSO variants on difficult optimization problems that require large numbers of function evaluations.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 3; 189-204
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A statistical approach for off-line signature verification (SV)
Autorzy:
Das, M.T.
Dulger, L.C.
Dulger, H.E.
Powiązania:
https://bibliotekanauki.pl/articles/332991.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
weryfikacja podpisu
sieci neuronowe
offline signature verification (SV)
particle swarm optimization (PSO)
neural networks (NN)
chi-square test
PSO-NN
Opis:
This paper includes off line Signature Verification (SV) process with test results using the proposed algorithm Particle Swarm Optimization-Neural Network (PSO-NN) together with statistical analysis, Chi-square test. The verification process is performed in four steps. Signature images are scanned (data acquisition) and image processing is applied to make images suitable for extracting features (pre-processing). Each pre-processed image is then used to extract relevant geometric parameters (feature extraction) that can distinguish signatures of different volunteers. Finally, the proposed verification algorithm is tested on the database that includes 1350 skilled and genuine signatures taken from 25 volunteers. The Chi-square test is applied to see how the signature data fits with probability test function.
Źródło:
Journal of Medical Informatics & Technologies; 2009, 13; 33-39
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A modified particle swarm optimization procedure for triggering fuzzy flip-flop neural networks
Autorzy:
Kowalski, Piotr A.
Słoczyński, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/2055168.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fuzzy neural network
fuzzy flip-flop neuron
particle swarm optimization
training procedure
sieć neuronowa rozmyta
optymalizacja rojem cząstek
procedura szkoleniowa
Opis:
The aim of the presented study is to investigate the application of an optimization algorithm based on swarm intelligence to the configuration of a fuzzy flip-flop neural network. Research on solving this problem consists of the following stages. The first one is to analyze the impact of the basic internal parameters of the neural network and the particle swarm optimization (PSO) algorithm. Subsequently, some modifications to the PSO algorithm are investigated. Approximations of trigonometric functions are then adopted as the main task to be performed by the neural network. As a result of the numerical verification of the problem, a set of rules are developed that can be helpful in constructing a fuzzy flip-flop type neural network. The obtained results of the computations significantly simplify the structure of the neural network in relation to similar conditions known from the literature.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 4; 577--586
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wild Image Retrieval with HAAR Features and Hybrid DBSCAN Clustering For 3D Cultural Artefact Landmarks Reconstruction
Autorzy:
Pitchandi, Perumal
Powiązania:
https://bibliotekanauki.pl/articles/2201730.pdf
Data publikacji:
2022
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
outliers removal
culturalartefact objects
3D reconstruction
particle swarm optimization
PSO
spatial clustering
density based spatial clustering
noise clustering algorithm
Opis:
In this digital age large amounts of information, images and videos can be found in the web repositories which accumulate this information. These repositories include personal, historic, cultural, and business event images. Image mining is a limited field in research where most techniques look at processing images instead of mining. Very limited tools are found for mining these images, specifically 3D (Three Dimensional) images. Open source image datasets are not structured making it difficult for query based retrievals. Techniques extracting visual features from these datasets result in low precision values as images lack proper descriptions or numerous samples exist for the same image or images are in 3D. This work proposes an extraction scheme for retrieving cultural artefact based on voxel descriptors. Image anomalies are eliminated with a new clustering technique and the 3D images are used for reconstructing cultural artefact objects. Corresponding cultural 3D images are grouped for a 3D reconstruction engine’s optimized performance. Spatial clustering techniques based on density like PVDBSCAN (Particle Varied Density Based Spatial Clustering of Applications with Noise) eliminate image outliers. Hence, PVDBSCAN is selected in this work for its capability to handle a variety of outliers. Clustering based on Information theory is also used in this work to identify cultural object’s image views which are then reconstructed using 3D motions. The proposed scheme is benchmarked with DBSCAN (Density-Based Spatial Clustering of Applications with Noise) to prove the proposed scheme’s efficiency. Evaluation on a dataset of about 31,000 cultural heritage images being retrieved from internet collections with many outliers indicate the robustness and cost effectiveness of the proposed method towards a reliable and just-in-time 3D reconstruction than existing state-of-the-art techniques.
Źródło:
Advances in Science and Technology. Research Journal; 2022, 16, 3; 269--281
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimum placement of multi type DG units for loss reduction in a radial distribution system considering the distributed generation
Autorzy:
Shanmugapriyan, J.
Karuppiah, N.
Muthubalaji, S.
Tamilselvi, S.
Powiązania:
https://bibliotekanauki.pl/articles/201758.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
distributed generation
distributed generation suitability index
particle swarm optimization (PSO)
differential evolution
voltage profile
optymalizacja roju cząstek
ewolucja różnicowa
generacja rozproszona
Opis:
Due to the increasing need for electricity, insertion of distributed generation (DG) into a distribution system attracts the attention of the deregulated power market. Placing DG in the distribution system inherently reduces the power loss and improves the system voltage profile. The choice of DG, proper placement and sizing of DG all play a vital role. This paper presents an effective methodology to identify the optimum location of multi type DG in the distribution system. The particle swarm optimization (PSO) algorithm and differential evolution (DE) are applied to identify the proper location and size of DG using the distributed generation suitability index (DGSI). The optimum location of DG is identified through DGSI and optimum sizing is done by means of the power loss minimization technique using evolutionary algorithms. The effective power loss reduction and improved system voltage profile are evaluated using sixteen combinations of different types of DGs with the standard IEEE 33-bus test system. The results reveal that power loss reduction and voltage profile improvement are effectively addressed by the DE algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 3; 345-354
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid MPPT algorithm for PV systems under partially shaded conditions using a stochastic evolutionary search and a deterministic hill climbing
Autorzy:
Basiński, K.
Ufnalski, B.
Grzesiak, L. M.
Powiązania:
https://bibliotekanauki.pl/articles/1193446.pdf
Data publikacji:
2017
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
maximum power point tracking
photovoltaic system
hybrid part-stochastic part-deterministic search rule
particle swarm optimization (PSO)
partial shading
hill climbing
Opis:
A hybrid maximum power point tracking method has been proposed for the photovoltaic system using a stochastic evolutionary search and a deterministic hill climbing algorithm. The proposed approach employs the particle swarm optimizer (PSO) to solve a dynamic optimization problem related to the control task in a PV system. The position of the best particle is updated by the hill climbing algorithm, and the position of the rest of the particles by the classic PSO rule. The presented method uses the re-randomization mechanism, which places five consecutive particles randomly, but in specified intervals. This mechanism helps track the maximum power point under partially shaded conditions.
Źródło:
Power Electronics and Drives; 2017, 2, 37/2; 49-59
2451-0262
2543-4292
Pojawia się w:
Power Electronics and Drives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on the influence of airflow resistance of layered porous structures on the sound absorption coefficient
Autorzy:
Flach, Artur
Powiązania:
https://bibliotekanauki.pl/articles/24201972.pdf
Data publikacji:
2022
Wydawca:
Politechnika Poznańska. Instytut Mechaniki Stosowanej
Tematy:
airflow resistance
anechoic wedges
transfer matrix method
optimization
PSO
particle swarm optimization
opór przepływu powietrza
kliny akustyczne
metoda macierzy przejścia
optymalizacja
optymalizacja roju cząstek
Opis:
The paper presents the research on the influence of airflow resistance on the sound absorption coefficient of layered porous structures. For the calculation of the sound absorption coefficient, the models of layered sound-absorbing structures were developed with the use of numerical computational models. Using the developed models, optimization was carried out to maximize the average sound absorption coefficient of the structures for a given frequency range. As a result of the research, the dependence of the change in airflow resistance for the successive layers of the material was determined. The results of the work will be particularly useful in the design of wedges used in anechoic chambers.
Źródło:
Vibrations in Physical Systems; 2022, 33, 3; art. no. 2022311
0860-6897
Pojawia się w:
Vibrations in Physical Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja rojowa nastaw przesuwników fazowych w systemie elektroenergetycznym
Swarm optimization of settings of phase shifting transformers in a power system
Autorzy:
Korab, R.
Owczarek, R.
Połomski, M.
Powiązania:
https://bibliotekanauki.pl/articles/269100.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
Tematy:
power system
phase shifting transformer
particle swarm optimization (PSO)
active power losses
system elektroenergetyczny
przesuwnik fazowy
optymalizacja rojem cząstek
straty mocy czynnej
Opis:
W artykule przedstawiono zastosowanie algorytmu rojowego PSO do optymalizacji nastaw grupy przesuwników fazowych w systemie elektroenergetycznym. Jako kryterium optymalizacji zastosowano minimalizację strat mocy czynnej w sieci testowej IEEE 118. Przeanalizowano wpływ maksymalnej dozwolonej prędkości cząstek na efektywność algorytmu optymalizacji. Wyniki badań pokazują ważność tego parametru.
In response to the growing problem of unscheduled flows, a larger and larger number of transmission system operators in Europe equip their systems with phase shifting transformers (PSTs). PSTs are special transformers which installed in a transmission line enable regulation of the voltage phase angle and thereby change of the active power flow in the line. However, the use of several PSTs installed geographically close to each other must be coordinated in order to efficiently use those devices and avoid their adverse interactions. The coordination of a group of such devices leads to a multidimensional optimization problem. In this paper, the coordination problem was solved by optimization of settings of all analyzed PSTs, based on the swarm algorithm. This approach was examined and tested on an IEEE 118-bus test system. The minimization of active power losses in this system was used as the optimization criterion. The impact of maximum allowed velocity of particles on the effectiveness of the optimization algorithm was analyzed. The result shows that the improved effectiveness of the proposed approach can be obtained by careful selection of this parameter.
Źródło:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2017, 53; 99-102
1425-5766
2353-1290
Pojawia się w:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimization with adjusted PSO method on example of cutting process of hardened 18CrMo4 steel
Optymalizacja wielokryterialna skorygowaną metodą PSO na przykładzie procesu skrawania stali 18CrMo4 w stanie zahartowanym
Autorzy:
Stryczek, R.
Pytlak, B.
Powiązania:
https://bibliotekanauki.pl/articles/1366141.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
toczenie na twardo
metoda optymalizacji wielocząsteczkowej (PSO)
obliczenia ewolucyjne
optymalizacja wielokryterialna
entropia
hard turning
particle swarm optimization (PSO) method
evolutionary computations
multi-objective optimization
entropy
Opis:
W pracy zaproponowano zmodyfikowaną metodę optymalizacji wielocząsteczkowej (PSO) dla problemów optymalizacji wielokryterialnej z dyskretną przestrzenią decyzyjną. W metodzie PSO zmieniono sposób określania momentu bezwładności, współczynnika uczenia oraz współczynnika społecznego. Dodatkowo wprowadzono elitaryzm oraz innowacyjny mechanizm hamowania cząstek chroniący je przed przekraczaniem dopuszczalnych granic przestrzeni decyzyjnej. Zaproponowane podejście zostało zweryfikowane na szeregu aktualnych funkcjach testowych oraz problemie optymalizacji procesu skrawania stali 18CrMo4 w stanie zahartowanym, gdzie porównano je z wynikami uzyskanymi za pomocą algorytmów genetycznych (GA). Uzyskane wyniki wskazują, że zaproponowane podejście jest względnie szybkie i wysoce konkurencyjne w stosunku do innych metod optymalizacji. Autorzy uzyskali bardzo różnorodne, zbieżne i w pełnym zakresie przebiegi frontu Pareto w przestrzeni kryteriów. W celu oceny jakości wygenerowanego zbioru Pareto dla każdego z prezentowanych przykładów wyznaczono ocenę opartą na pomiarze entropii oraz wskaźnika jakości IGD.
In this paper a Modified Particle Swarm Optimization (PSO) method for multi-objective (MO) problems with a discrete decision space is proposed. In the PSO method the procedure to determine inertia weight, learning factor and social factor is modified. In addition, both an elitism strategy and innovative deceleration mechanism preventing the particles from going beyond the limits of decision space are introduced. The proposed approach has been applied to a series of currently used test functions as well as to optimization problems connected with finish hard turning operation, where the obtained results have been compared with those obtained by means of Genetic Algorithms (GA). The results indicate that the proposed approach is relatively quick, and thus it is highly competitive with other optimization methods. The authors have obtained a very good diversity, convergence and a maximum range of the Pareto front in the criteria space. In order to assess the quality of the generated Pareto set for each of presented examples, a rating has been determined based on the entropy measurement and inverted generational distance (IGD).
Źródło:
Eksploatacja i Niezawodność; 2014, 16, 2; 236-245
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mobile Robot Path Planning with Obstacle Avoidance using Particle Swarm Optimization
Planowanie bezkolizyjnej ścieżki ruchu robota mobilnego przy użyciu algorytmu rojowego
Autorzy:
Chołodowicz, E.
Figurowski, D.
Powiązania:
https://bibliotekanauki.pl/articles/274869.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
mobile robot
path planning
obstacle avoidance
particle swarm optimization (PSO)
dynamic environment
robot mobilny
planowanie ścieżki ruchu
unikanie przeszkód
algorytm rojowy
dynamiczne środowisko
Opis:
This paper presents a constrained Particle Swarm Optimization (PSO) algorithm for mobile robot path planning with obstacle avoidance. The optimization problem is analyzed in static and dynamic environments. A smooth path based on cubic splines is generated by the interpolation of optimization solution; the fitness function takes into consideration the path length and obstaclegenerated repulsive zones. World data transformation is introduced to reduce the optimization algorithm computational complexity. Different scenarios are used to test the algorithm in simulation and real-world experiments. In the latter case, a virtual robot following concept is exploited as part of the control strategy. The path generated by the algorithm is presented in results along with its execution by the mobile robot.
W artykule przedstawiono algorytm rojowy z ograniczeniami realizujący planowanie bezkolizyjnej ścieżki ruchu robota mobilnego. Problem optymalizacyjny został przeanalizowany dla środowiska statycznego i dynamicznego. Do stworzenia gładkiej ścieżki ruchu wykorzystano interpolację rozwiązania optymalizacji przy użyciu sześciennych funkcji sklejanych. Funkcja kosztu uwzględnia długość ścieżki ruchu oraz penalizację za naruszenie przestrzeni przeszkód. Wprowadzono transformację świata w celu redukcji złożoności obliczeniowej algorytmu optymalizacji. Przeprowadzono zróżnicowane scenariusze badawcze testujące algorytm w eksperymentach symulacyjnych i rzeczywistych. W przypadku tych ostatnich wykorzystano ideę podążania za wirtualnym robotem. Zaprezentowano wyniki obrazujące wygenerowaną ścieżkę ruchu oraz ocenę jej realizacji przez robota mobilnego.
Źródło:
Pomiary Automatyka Robotyka; 2017, 21, 3; 59-68
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Predicting and minimizing the blasting cost in limestone mines using a combination of gene expression programming and particle swarm optimization
Autorzy:
Bastami, Reza
Bazzazi, Abbas Aghajani
Shoormasti, Hadi Hamidian
Ahangari, Kaveh
Powiązania:
https://bibliotekanauki.pl/articles/1853861.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
kopalnia wapienia
wybuch detonacyjny
regresja nieliniowa
blasting cost
limestone mine
gene expression programming
non-linear multivariate regression
particle swarm optimization algorithm
environmental impacts
Opis:
Blasting cost prediction and optimization is of great importance and significance to achieve optimal fragmentation through controlling the adverse consequences of the blasting process. By gathering explosive data from six limestone mines in Iran, the present study aimed to develop a model to predict blasting cost, by gene expression programming method. The model presented a higher correlation coefficient (0.933) and a lower root mean square error (1088) comparing to the linear and nonlinear multivariate regression models. Based on the sensitivity analysis, spacing and ANFO value had the most and least impact on blasting cost, respectively. In addition to achieving blasting cost equation, the constraints such as frag-mentation, fly rock, and back break were considered and analyzed by the gene expression programming method for blasting cost optimization. The results showed that the ANFO value was 9634 kg, hole dia-meter 76 mm, hole number 398, hole length 8.8 m, burden 2.8 m, spacing 3.4 m, hardness 3 Mhos, and uniaxial compressive strength 530 kg/cm2 as the blast design parameters, and blasting cost was obtainedas 6072 Rials/ton, by taking into account all the constraints. Compared to the lowest blasting cost among the 146-research data (7157 Rials/ton), this cost led to a 15.2% reduction in the blasting cost and optimal control of the adverse consequences of the blasting process.
Źródło:
Archives of Mining Sciences; 2020, 65, 4; 835-850
0860-7001
Pojawia się w:
Archives of Mining Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization algorithm for number and wells placement
Algorytm optymalizacji liczby i położenia odwiertów
Autorzy:
Łętkowski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1834980.pdf
Data publikacji:
2019
Wydawca:
Instytut Nafty i Gazu - Państwowy Instytut Badawczy
Tematy:
optimization
reservoir simulation
swarm intelligence
particle swarm optimization (PSO)
optimal number of wells
optimal well placement
optymalizacja
symulacje złożowe
inteligencja roju
optymalizacja rojem cząstek
optymalna liczba odwiertów
optymalne położenie odwiertów
Opis:
Determination of the optimal number and placement of production wells is crucial for the effective depletion of the hydrocarbon reservoir. Due to the strongly non-linearity of the problem and the occurrence of multiple local minimums in the response function the non-gradient optimization methods in combination with reservoir simulations are most commonly used for its solution. However, it should be noted that most of the research works dedicated to this issue describe the process of placement optimization but not the number of drilling wells assuming that it was arbitrary set. This is partly due to the fact that known and used optimization methods operate on a fixed number of optimization parameters, therefore the number of production wells can not change during the optimization process. The paper is dedicated to the attempt to build an algorithm that allows simultaneous optimization of the number and position of production wells with respect to the discounted profit in a given period of operation. The basic optimization method in the presented algorithm is the Particle Swarm Optimization (PSO) – one of the most effective non-gradient optimization methods that belongs to the group of methods applying the swarm’s intelligence. Taking into account the number of drilling wells in the optimization process means that the algorithm operates on a variable number of parameters. The objective algorithm starts optimization from an arbitrarily set number of producers, reducing it gradually. Efficiency tests conducted on the sample reservoir PUNQ-S3 indicated a satisfactory convergence of the proposed method. The computing program created implements the mechanisms of convergence enhancement by improving the boundary conditions for the optimization method. The minimum separation distance control between production wells was also introduced at the initial stage of optimization process. Although the algorithm is characterized by satisfactory convergence it would be advisable to improve it by using a hybrid method to increase its effectiveness in the local optimization phase and to introduce minimum well spacing during the entire optimization process.
Określenie optymalnej liczby i położenia odwiertów eksploatacyjnych jest kluczowe dla efektywnej eksploatacji złoża węglowodorowego. Ze względu na silnie nieliniowy charakter problemu oraz występowanie w funkcji odpowiedzi wielokrotnych minimów lokalnych do jego rozwiązania najczęściej wykorzystywane są bezgradientowe metody optymalizacyjne w połączeniu z symulacjami złożowymi. Należy jednak zauważyć, że większość prac poświęconych temu zagadnieniu opisuje proces optymalizacji położenia, a nie liczby odwiertów, przyjmując, że jest ona dana arbitralnie. Wynika to po części z faktu, że znane i stosowane metody optymalizacyjne operują na stałej liczbie parametrów optymalizacyjnych, w związku z czym liczba odwiertów wydobywczych nie może zmieniać się w trakcie procesu optymalizacji. Artykuł jest poświęcony próbie zbudowania algorytmu umożliwiającego równoczesną optymalizację liczby i położenia odwiertów wydobywczych ze względu na zdyskontowany zysk w zadanym okresie eksploatacji. Podstawową metodą optymalizacyjną w prezentowanym algorytmie jest optymalizacja rojem cząstek (ang. PSO) – jedna z najbardziej efektywnych metod optymalizacji bezgradientowej, należąca do grupy metod wykorzystujących inteligencję roju. Próby efektywności metody przeprowadzone na przykładzie złoża testowego PUNQ-S3 wskazały na zadowalającą zbieżność zaproponowanej metody, dla której na początkowym etapie zastosowano kontrolę minimalnej odległości pomiędzy odwiertami. Jakkolwiek algorytm charakteryzuje się zadowalającą zbieżnością, to jednak wskazane byłoby jego udoskonalenie poprzez wykorzystanie metody hybrydowej w celu zwiększenia jego efektywności w fazie optymalizacji lokalnej oraz wprowadzenie kontroli odległości minimalnej w trakcie całego procesu optymalizacji.
Źródło:
Nafta-Gaz; 2019, 75, 12; 744-750
0867-8871
Pojawia się w:
Nafta-Gaz
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Photovoltaic power prediction based on improved grey wolf algorithm optimized back propagation
Autorzy:
He, Ping
Dong, Jie
Wu, Xiaopeng
Yun, Lei
Yang, Hua
Powiązania:
https://bibliotekanauki.pl/articles/27309934.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
BP neural network
photovoltaic power generation
PSO–GWO model
PSO–GWO–BP prediction model
particle swarm optimization
gray wolf optimization
back propagation
standard grey wolf algorithm
Opis:
At present, the back-propagation (BP) network algorithm widely used in the short-term output prediction of photovoltaic power stations has the disadvantage of ignoring meteorological factors and weather conditions in the input. The existing traditional BP prediction model lacks a variety of numerical optimization algorithms, such that the prediction error is large. The back-propagation (BP) neural network is easy to fall into local optimization thus reducing the prediction accuracy in photovoltaic power prediction. In order to solve this problem, an improved grey wolf optimization (GWO) algorithm is proposed to optimize the photovoltaic power prediction model of the BP neural network. So, an improved grey wolf optimization algorithm optimized BP neural network for a photovoltaic (PV) power prediction model is proposed. Dynamic weight strategy, tent mapping and particle swarm optimization (PSO) are introduced in the standard grey wolf optimization (GWO) to construct the PSO–GWO model. The relative error of the PSO–GWO–BP model predicted data is less than that of the BP model predicted data. The average relative error of PSO–GWO–BP and GWO–BP models is smaller, the average relative error of PSO–GWO–BP model is the smallest, and the prediction stability of the PSO–GWO–BP model is the best. The model stability and prediction accuracy of PSO–GWO–BP are better than those of GWO–BP and BP.
Źródło:
Archives of Electrical Engineering; 2023, 72, 3; 613--628
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cross‐Comparison of Evolutionary Algorithms for Optimizing Design of Sustainable Supply Chain Network under Disruption Risks
Autorzy:
Al-Zuheri, Atiya
Powiązania:
https://bibliotekanauki.pl/articles/2023790.pdf
Data publikacji:
2021
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
comparison
genetic algorithm
particle swarm optimization
sustainable supply chain design
disruption risk
porównanie
algorytm genetyczny
optymalizacja rojem cząstek
projektowanie zrównoważonego łańcucha dostaw
ryzyko zakłóceń
Opis:
Optimization of a sustainable supply chain network design (SSCND) is a complex decision-making process which can be done by the optimal determination of a set of decisions and constraints such as the selection of suppliers, transportation-related facilities and distribution centres. Different optimization techniques have been applied to handle various SSCND problems. Meta- heuristic algorithms are developed from these techniques that are commonly used to solving supply chain related problems. Among them, Genetic algorithms (GA) and particle swarm optimization (PSO) are implemented as optimization solvers to obtain supply network design decisions. This paper aims to compare the performance of these two evolutionary algorithms in optimizing such problems by minimizing the total cost that the system faces to potential disruption risks. The mechanism and implementation of these two evolutionary algorithms is presented in this paper. Also, using an optimization considers ordering, purchasing, inventory, transportation, and carbon tax cost, a numerical real-life case study is presented to demonstrate the validity of the effectiveness of these algorithms. A comparative study for the algorithms performance has been carried out based on the quality of the obtained solution and the results indicate that the GA performs better than PSO in finding lower-cost solution to the addressed SSCND problem. Despite a lot of research literature being done regarding these two algorithms in solving problems of SCND, few studies have compared the optimization performance between GA and PSO, especially the design of sustainable systems under risk disruptions.
Źródło:
Advances in Science and Technology. Research Journal; 2021, 15, 4; 342-351
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The influence of inertia weight on the Particle Swarm Optimization algorithm
Autorzy:
Cekus, D.
Skrobek, D.
Powiązania:
https://bibliotekanauki.pl/articles/122644.pdf
Data publikacji:
2018
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
particle swarm optimization (PSO)
PSO algorithm
inertia weight
trajectory
optymalizacja rojem cząstek
PSO
algorytm PSO
metoda PSO
algorytm optymalizacji rojem cząstek
trajektoria
współczynnik wagowy
Opis:
The paper presents the use of the Particle Swarm Optimization (PSO) algorithm to find the shortest trajectory connecting two defined points while avoiding obstacles. The influence of the inertia weight and the number of population adopted in the first iteration of the PSO algorithm was examined for the length of the sought trajectory. Simulation results showed that the proposed method achieved significant improvement compared to the linearly decreasing method technique that is widely used in literature.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 4; 5-11
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Early prediction of remaining discharge time for lithium-ion batteries considering parameter correlation between discharge stages
Wczesne przewidywanie czasu pozostałego do rozładowania baterii litowo-jonowej z uwzględnieniem korelacji parametrów z różnych etapów procesu rozładowania
Autorzy:
Yu, Jinsong
Yang, Jie
Tang, Diyin
Dai, Jing
Powiązania:
https://bibliotekanauki.pl/articles/1365259.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
lithium-ion battery
parameter correlation
particle swarm optimization (PSO)
particle filter
remaining discharge time prognostics
bateria litowo-jonowa
korelacja parametrów
optymalizacja rojem cząstek
filtr cząsteczkowy
prognozowanie czasu do rozładowania
Opis:
In this paper, we propose a method for making early predictions of remaining discharge time (RDT) that considers information about future battery discharge process. Instead of analyzing the entire degradation process of a battery, as in the existing literature, we obtain the information about future battery condition by decomposing the discharge model into three stages, according to level of voltage loss. Correlation between model parameters at the first and last stages of discharge process allows the values of model parameters in the future to be used to predict the value of parameters at early stages of discharge. The particle swarm optimization (PSO) and particle filter (PF) algorithms are employed to update parameters when new voltage data is available. A case study demonstrates that the proposed approach predicts RDT more accurately than the benchmark PF-based prediction method, regardless of the degradation period of the battery.
W pracy zaproponowano metodę wczesnego przewidywania czasu pozostałego do rozładowania baterii (RDT), która uwzględnia informacje na temat przyszłego procesu jej rozładowywania. Zamiast analizować cały proces degradacji baterii, jak to ma miejsce w literaturze przedmiotu, wykorzystano informacje o przyszłym stanie baterii uzyskane na drodze podziału modelu procesu rozładowania na trzy etapy, według poziomu utraty napięcia. Korelacje między parametrami modelu uzyskanymi na pierwszym i ostatnim etapie procesu rozładowania baterii umożliwiają wykorzystanie przyszłych wartości parametrów do przewidywania wartości parametrów we wczesnych etapach rozładowania. Do aktualizacji parametrów zgodnie z napływającymi nowymi danymi napięciowymi wykorzystano algorytm optymalizacji rojem cząstek (PSO) i algorytm filtra cząsteczkowego (PF). Studium przypadku pokazuje, że proponowane podejście pozwala bardziej precyzyjnie prognozować RDT niż metoda prognozowania oparta na PF, niezależnie od okresu degradacji baterii.
Źródło:
Eksploatacja i Niezawodność; 2019, 21, 1; 81-89
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Intelligent financial time series forecasting: A complex neuro-fuzzy approach with multi-swarm intelligence
Autorzy:
Li, C.
Chiang, T. W.
Powiązania:
https://bibliotekanauki.pl/articles/331280.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
zbiór rozmyty
system neuronowo-rozmyty
optymalizacja rojem cząstek
szereg czasowy
complex fuzzy set
complex neuro fuzzy system
hierarchical multi swarm
particle swarm optimization (PSO)
recursive least squares estimator
time series forecasting
Opis:
Financial investors often face an urgent need to predict the future. Accurate forecasting may allow investors to be aware of changes in financial markets in the future, so that they can reduce the risk of investment. In this paper, we present an intelligent computing paradigm, called the Complex Neuro-Fuzzy System (CNFS), applied to the problem of financial time series forecasting. The CNFS is an adaptive system, which is designed using Complex Fuzzy Sets (CFSs) whose membership functions are complex-valued and characterized within the unit disc of the complex plane. The application of CFSs to the CNFS can augment the adaptive capability of nonlinear functional mapping, which is valuable for nonlinear forecasting. Moreover, to optimize the CNFS for accurate forecasting, we devised a new hybrid learning method, called the HMSPSO-RLSE, which integrates in a hybrid way the so-called Hierarchical Multi-Swarm PSO (HMSPSO) and the well known Recursive Least Squares Estimator (RLSE). Three examples of financial time series are used to test the proposed approach, whose experimental results outperform those of other methods.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 787-800
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applied TVA-PSO for optimal energy efficient integration of renewable energy sources based maximizing TEC levels
Autorzy:
Lasmari, Adel
Zellagui, Mohamed
Powiązania:
https://bibliotekanauki.pl/articles/41186676.pdf
Data publikacji:
2023
Wydawca:
Politechnika Warszawska, Instytut Techniki Cieplnej
Tematy:
renewable distributed generation
optimal energy efficient integration
electric distribution networks
TEC levels
time-varying acceleration particle swarm optimization
odnawialna generacja
optymalna integracja
dystrybucja energii elektrycznej
optymalizacja
Opis:
After the rapid increase in the population demography and industrial revolution, many researchers focus on maintaining the balance between the consumption and the production; in this regard, decentralized production plays an important role to achieve this balance, because of its technical economic aspect such as power losses reduction and voltage profile improvement. These advantages can better exploited through the optimal assessment of Distributed Generation (DG). This paper is interested in the study of the optimal location and size of one and multiple DG based on photovoltaic solar sources PV-DG in Radial Distribution Network (RDN) using the Time Varying Acceleration Particle Swarm Optimization Algorithm (TVA-PSO). This algorithm implemented to maximize the Multi-Objective Functions (MOF) based on the Environmental Pollution Reduction Level (EPRL), the Voltage Deviation Level (VDL), Active Power Loss Level (APLL), the Net Saving Level (NSL), and finally the Short Circuit Level (SCL). The proposed method is tested on the standard IEEE 33-, 69-and 118-bus RDN. Outcomes proves that the proposed TVA-PSO is more efficient to solve the optimal allocation of multiple DGs with high convergence rate and minimum power loss reduction.
Źródło:
Journal of Power Technologies; 2023, 103, 2; 123-137
1425-1353
Pojawia się w:
Journal of Power Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja liczby i położenia odwiertów eksploatacyjnych z wykorzystaniem mapy potencjału produktywności
Optimization of the number and placement of exploitation wells using a productivity potential map
Autorzy:
Łętkowski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/31344029.pdf
Data publikacji:
2022
Wydawca:
Instytut Nafty i Gazu - Państwowy Instytut Badawczy
Tematy:
optymalizacja
symulacje złożowe
inteligencja roju
optymalizacja rojem cząstek
optymalna liczba odwiertów
optymalne położenie odwiertów
mapa potencjału produktywności
optimization
reservoir simulation
swarm intelligence
particle swarm optimization
optimal number of wells
optimal well placement
productivity potential map
Opis:
Jednym z podstawowych elementów planu zagospodarowania złoża węglowodorów jest określenie liczby i położenia odwiertów eksploatacyjnych (produkcyjnych i zatłaczających). Należy jednak zauważyć, że zdecydowana większość prac poświęcona temu zagadnieniu opisuje proces optymalizacji położenia, a nie liczby odwiertów, przyjmując, że jest ona zadana arbitralnie. Wynika to z faktu, że znane i stosowane metody optymalizacyjne operują na stałej liczbie parametrów optymalizacyjnych, w związku z czym liczba odwiertów wydobywczych nie może zmieniać się w trakcie procesu optymalizacji. W artykule przedstawiono modyfikację podstawowej metody optymalizacyjnej uwzględniającą zmianę liczby odwiertów w czasie optymalizacji, przy czym optymalizacja położenia i liczby odwiertów przebiega równocześnie. Podstawową metodą optymalizacyjną w skonstruowanym algorytmie jest optymalizacja rojem cząstek (ang. PSO) – jedna z najbardziej efektywnych metod optymalizacji bezgradientowej, należąca do grupy metod stochastycznych. Została ona zmodyfikowana dla potrzeb przyjętego problemu optymalizacyjnego poprzez zmianę postaci funkcji celu oraz wprowadzenie zmiennej progowej, co pozwoliło na operowanie zmienną liczbą odwiertów. W celu poprawienia zbieżności algorytm uzupełniono o mechanizm mutacji oparty na mapie potencjału produktywności. Testy zbieżności metody przeprowadzone na przykładzie złoża testowego PUNQ-S3 wskazały na zadowalającą efektywność zaproponowanego rozwiązania. Algorytm potrzebował 150 iteracji i 750 wywołań funkcji celu, aby 2,5-krotnie zwiększyć początkową wartość NPV przy równoczesnej 3,5-krotnej redukcji liczby odwiertów produkcyjnych. Z kolei zastosowanie algorytmu do optymalizacji liczby i rozmieszczenia odwiertów zatłaczających przy zadanej liczbie konfiguracji odwiertów wydobywczych pozwoliło na zwiększenie zysku netto o 1/3 przy ponad 2-krotnej redukcji liczby odwiertów
One of the basic elements of the hydrocarbon reservoir development plan is to determine the number and location of production and injection wells. However, it should be noted that most of the research works dedicated to this issue describe the process of placement optimization but not the number of exploitation wells assuming that it was an arbitrary set. This is partly due to the fact that known and used optimization methods operate on a fixed number of optimization parameters, therefore the number of production wells can not change during the optimization process. The paper presents modification of the basic optimization method taking into account the change in the number of wells during optimization. The optimization of the placement and number of wells run simultaneously. The basic optimization method in the constructed algorithm is particle swarm optimization (PSO) – one of the most effective methods of non-gradient optimization, belonging to the group of stochastic methods. It was modified for the needs of the adopted optimization problem by changing the form of the objective function and introducing the threshold variable which allowed to change the number of wells. In order to improve the convergence, the algorithm is supported by a mutation mechanism based on the productivity potential map. The convergence tests carried out based on the example of the PUNQ-S3 benchmark field showed the satisfactory effectiveness of the proposed solution. The algorithm took 150 iterations and 750 objective function calls to increase the starting NPV value by 2.5 times while reducing the number of production wells by 3.5 times. On the other hand, the use of the algorithm to optimize the number and placement of injection wells for a given number of production wells configuration allowed to increase the NPV value profit by 1/3 with a reduction of more than 2 times in the number of wells.
Źródło:
Nafta-Gaz; 2022, 78, 12; 861-871
0867-8871
Pojawia się w:
Nafta-Gaz
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja położenia odwiertów wydobywczych ze względu na czas trwania plateau wydobycia
Well placement optimization for constant production rate
Autorzy:
Łętkowski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/31348130.pdf
Data publikacji:
2022
Wydawca:
Instytut Nafty i Gazu - Państwowy Instytut Badawczy
Tematy:
optymalizacja
symulacje złożowe
inteligencja roju
optymalizacja rojem cząstek
optymalna liczba odwiertów
optymalne położenie odwiertów
mapa potencjału produktywności
optimization
reservoir simulation
swarm intelligence
particle swarm optimization
optimal number of wells
optimal well placement
productivity potential map
Opis:
Określenie optymalnego rozmieszczenia odwiertów eksploatacyjnych na złożu węglowodorów jest kluczowe dla jego efektywnej eksploatacji. Tak sformułowane zagadnienie stanowi złożony problem optymalizacyjny, którego rozwiązanie w postaci lokalizacji odwiertów zależy między innymi od sposobu zdefiniowania funkcji celu. W literaturze najczęściej występują dwie postacie funkcji celu: zysk bieżący netto (NPV) oraz sumaryczne wydobycie ropy naftowej. Rzadziej spotykana jest funkcja celu bazująca na równomierności sczerpania złoża. Artykuł jest poświęcony próbie zastosowania funkcji celu opartej na czasie wydobycia ropy ze stałą wydajnością (tzw. plateau). Optymalizację prowadzono dla sumarycznego wydobycia ropy oraz zysku bieżącego netto w czasie trwania fazy plateau. W tym celu zbudowano hybrydowy algorytm optymalizacyjny bazujący na optymalizacji rojem cząstek. Zastosowanie algorytmu hybrydowego łączącego trzy mechanizmy wynikało z jednej strony z konieczności poprawienia skuteczności podstawowej metody optymalizacyjnej, z drugiej zaś miało na celu ograniczenie tzw. przedwczesnej zbieżności. Cele te zostały zrealizowane poprzez wykorzystanie mapy potencjału produktywności oraz wprowadzenie mechanizmu mutacji. Optymalizację prowadzono dla dwóch różnych sposobów sterowania odwiertami: sterowania grupowego ze stałą wydajnością oraz sterowania indywidualnego. Zbudowany algorytm potwierdził efektywność, uzyskując wzrost wartości funkcji celu w stosunku do wartości pierwotnej od 40% do 300%. We wszystkich analizowanych przypadkach algorytm rozmieścił odwierty produkcyjne poprawnie, co do zasady. Odwierty zostały rozmieszczone w strefie ropnej w bezpiecznej odległości zarówno od kontaktu woda–ropa, jak i ropa–gaz, przy czym stwierdzono pewne różnice w zależności od przyjętej funkcji celu. Przeprowadzone symulacje potwierdziły możliwość zastosowania czasu trwania plateau jako funkcji celu dla optymalizacji położenia odwiertów produkcyjnych.
Determining the optimal placement of production wells in a hydrocarbon reservoir is crucial for the effective exploitation. The problem formulated in this way is a complex optimization problem, the solution of which in the form of the location of the wells depends, inter alia, on the method of defining the objective function. Two forms of the objective function are most often found in the literature. These are the net pay value (NPV) and total oil production. The objective function based on the uniformity of the reservoir depletion is less common. The article is devoted to an attempt to apply the objective function based on the duration of oil production with a constant production rate (the so-called production plateau). The optimization was carried out for the total oil production and for the net pay value for the plateau period. The need to use a hybrid algorithm combining three mechanisms resulted, on the one hand, from the need to improve the effectiveness of the basic optimization method, and on the other hand, to reduce the so-called “premature convergence”. For this purpose, a hybrid optimization algorithm based on particle swarm optimization was built. These goals were achieved through the use of a productivity potential map and a mutation mechanism. Optimization was carried out for two different well control methods: group control with constant production rate and individual well control. The developed algorithm confirmed the effectiveness, obtaining an increase in the value of the objective function in relation to the original value from 40% to 300%. As a rule, the algorithm placed the production wells correctly in all analyzed cases. The well were located in the oil zone at a safe distance from both water-oil and oil-gas contacts, with some differences depending on the target function adopted. The simulations carried out confirmed the possibility of using the plateau duration as a function of the objective for optimizing the location of production wells.
Źródło:
Nafta-Gaz; 2022, 78, 8; 598-607
0867-8871
Pojawia się w:
Nafta-Gaz
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