Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Particle Swarm Optimization" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 122
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
A novel fuzzy c-regression model algorithm using a new error measure and particle swarm optimization
Autorzy:
Soltani, M.
Chaari, A.
Ben Hmida, F.
Powiązania:
https://bibliotekanauki.pl/articles/330134.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model rozmyty Takagi-Sugeno
algorytm grupowania
metoda najmniejszych kwadratów
optymalizacja rojem cząstek
Takagi-Sugeno fuzzy models
noise clustering algorithm
fuzzy c-regression model
orthogonal least squares
particle swarm optimization (PSO)
Opis:
This paper presents a new algorithm for fuzzy c-regression model clustering. The proposed methodology is based on adding a second regularization term in the objective function of a Fuzzy C-Regression Model (FCRM) clustering algorithm in order to take into account noisy data. In addition, a new error measure is used in the objective function of the FCRM algorithm, replacing the one used in this type of algorithm. Then, particle swarm optimization is employed to finally tune parameters of the obtained fuzzy model. The orthogonal least squares method is used to identify the unknown parameters of the local linear model. Finally, validation results of two examples are given to demonstrate the effectiveness and practicality of the proposed algorithm.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 617-628
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 122

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