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ę "search algorithm" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 64
Tytuł:
Ship Collision Avoidance by Distributed Tabu Search
Autorzy:
Kim, D.
Hirayama, K.
Okimoto, M.
Powiązania:
https://bibliotekanauki.pl/articles/116919.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Safety of Navigation
Collision Avoidance
Distributed Tabu Search Algorithm (DTSA)
Distributed Local Search Algorithm (DLSA)
Quasi-Local Minimum (QLM)
Tabu Search Algorithm
Local Search Algorithm
Distributed Tabu Search
Opis:
More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Single-objective optimal power flow for electric power systems based on crow search algorithm
Autorzy:
Fathy, A.
Abdelaziz, A.
Powiązania:
https://bibliotekanauki.pl/articles/140618.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
crow search algorithm
distribution network
optimal power flow
Opis:
This paper presents the application of a recent meta-heuristic optimization technique named a crow search algorithm (CSA) in solving the problem of an optimal power flow (OPF) for electric power systems. Various constrained objective functions, total fuel cost, active power loss and pollutant emission are proposed. The generators’ output powers, generators’ terminal voltages, transmission lines’ taps and the shunt capacitors’ reactive powers are considered as variables to be designed. The proposed methodology based on the CSA is applied on an IEEE 30-bus system and IEEE 118-bus system. The obtained results via the CSA are compared to others and they ensure the superiority of the CSA in solving the OPF problem in electric power systems.
Źródło:
Archives of Electrical Engineering; 2018, 67, 1; 123-138
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm combined with a local search method for identifying susceptibility genes
Autorzy:
Yang, C -H.
Moi, S. -H.
Lin, Y. -D.
Chuang, L. -Y.
Powiązania:
https://bibliotekanauki.pl/articles/91586.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithms
identifying susceptibility genes
local search algorithm
Opis:
Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning Search Algorithms: An Educational View
Autorzy:
Janota, M.
Šimák, V.
Hrbček, J.
Powiązania:
https://bibliotekanauki.pl/articles/116502.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Search Algorithm
Learning Search Algorithms
educational view
Artificial Intelligence Method
Search Method
Labyrinth
Dijkstra algorithm
Opis:
Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of multiunit projects using tabu search algorithm
Autorzy:
Podolski, M.
Powiązania:
https://bibliotekanauki.pl/articles/347178.pdf
Data publikacji:
2015
Wydawca:
Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
Tematy:
construction works scheduling
optimization
job scheduling
tabu search algorithm
Opis:
The paper describes problems of discrete optimization in scheduling of multiunit projects. A model of this kind of project with possibility of using many workgroups by the contractor has been presented. It leads to reduction of project duration. For solving NP-hard optimization problem, a tabu search algorithm has been applied in the model. The example of mod-el and application of the algorithm are also included in the paper.
Źródło:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2015, 1; 110-122
1731-8157
Pojawia się w:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cryptographically Strong Elliptic Curves of Prime Order
Autorzy:
Barański, Marcin
Gliwa, Rafał
Szmidt, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/1844627.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Mersenne primes
elliptic curves
security requirements
search algorithm
Magma
Opis:
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 2; 207-212
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fault Current Limiter optimal sizing considering different Microgrid operational modes using Bat and Cuckoo Search Algorithm
Autorzy:
Arani, A. A. K.
Bayati, N.
Mohammadi, R.
Gharehpetian, G. B.
Sadeghi, S. H.
Powiązania:
https://bibliotekanauki.pl/articles/140644.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fault current limiter (FCL)
Bat Algorithm (BA)
Cuckoo Search Algorithm (CSA)
microgrid (MG)
Opis:
Nowadays, the development of smart grids has been the focus of attention due to its advantages for power systems. One of the aspects of smart grids defined by using distributed generation (DG) in a low voltage network is a microgrid (MG). Based on its operational states, MG can operate in different configurations such as grid-connected mode or off-grid mode. The switching between these states is one of the challenging issues in this technical area. The fault currents in different buses have higher value compared to islanded mode of MG when the MG is connected to the main grid, which influences the protection equipment. In this situation, some electrical devices may be damaged due to the fault currents. Application of a fault current limiter (FCL) is considered as an effective way to overcome this challenge. The optimal size of these FCLs can optimize the performance of an MG. In this paper, an index for FCL size optimization has been used. In addition, two optimization algorithms (Bat Algorithm and Cuckoo Search Algorithm) have been applied to the problem. The application of an FCL has been studied in grid-connected and islanded-mode. In addition, the application of the capacitor bank in both modes has been investigated. The results of simulations carried out by MATLAB have been presented and compared.
Źródło:
Archives of Electrical Engineering; 2018, 67, 2; 321--332
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of convolutional neural networks using the fuzzy gravitational search algorithm
Autorzy:
Poma, Yutzil
Melin, Patricia
González, Claudia I.
Martínez, Gabriela E.
Powiązania:
https://bibliotekanauki.pl/articles/384794.pdf
Data publikacji:
2020
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
neural networks
convolutional neural network
fuzzy gravitational search algorithm
deep learning
Opis:
This paper presents an approach to optimize a Convolutional Neural Network using the Fuzzy Gravitational Search Algorithm. The optimized parameters are the number of images per block that are used in the training phase, the number of filters and the filter size of the convolutional layer. The reason for optimizing these parameters is because they have a great impact on performance of the Convolutional Neural Networks. The neural network model presented in this work can be applied for any image recognition or classification applications; nevertheless, in this paper, the experiments are performed in the ORL and Cropped Yale databases. The results are compared with other neural networks, such as modular and monolithic neural networks. In addition, the experiments were performed manually, and the results were obtained (when the neural network is not optimized), and comparison was made with the optimized results to validate the advantage of using the Fuzzy Gravitational Search Algorithm.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 1; 109-120
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of rapid and reliable cuckoo search algorithm for global maximum power point tracking of solar PV systems in partial shading condition
Autorzy:
Bentata, Khadidja
Mohammedi, Ahmed
Benslimane, Tarak
Powiązania:
https://bibliotekanauki.pl/articles/1845531.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
photovoltaic system
maximum power point tracking
partial shading
cuckoo search algorithm
Opis:
The solar photovoltaic output power fluctuates according to solar irradiation, temperature, and load impedance variations. Due to the operating point fluctuations, extracting maximum power from the PV generator, already having a low power conversion ratio, becomes very complicated. To reach a maximum power operating point, a maximum power point tracking technique (MPPT) should be used. Under partial shading condition, the nonlinear PV output power curve contains multiple maximum power points with only one global maximum power point (GMPP). Consequently, identifying this global maximum power point is a difficult task and one of the biggest challenges of partially shaded PV systems. The conventional MPPT techniques can easily be trapped in a local maximum instead of detecting the global one. The artificial neural network techniques used to track the GMPP have a major drawback of using huge amount of data covering all operating points of PV system, including different uniform and non-uniform irradiance cases, different temperatures and load impedances. The biological intelligence techniques used to track GMPP, such as grey wolf algorithm and cuckoo search algorithm (CSA), have two main drawbacks; to be trapped in a local MPP if they have not been well tuned and the precision-transient tracking time complex paradox. To deal with these drawbacks, a Distributive Cuckoo Search Algorithm (DCSA) is developed, in this paper, as GMPP tracking technique. Simulation results of the system for different partial shading patterns demonstrated the high precision and rapidity, besides the good reliability of the proposed DCSA- GMPPT technique, compared to the conventional CSA-GMPPT.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 495-526
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Failure Correction of a Linear Array of Coupled Parallel Vertical Dipole Antennas
Autorzy:
Patidar, Hemant
Mahanti, Gautam Kumar
Muralidharan, R.
Singh, Prasanna Kumar
Powiązania:
https://bibliotekanauki.pl/articles/308045.pdf
Data publikacji:
2020
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
array failure correction
cuckoo search algorithm
wide null depth
mutual coupling
Opis:
In this paper, a cuckoo search algorithm based on the combined characteristics of the brood parasite behavior and Levy flights is applied to correct the radiation pattern of a linear antenna array composed of parallel dipoles with faulty elements. An effort is made to restore the radiation pattern similar to one without any faulty elements, and the difference in the values of side lobe level and wide null depth of both patterns, as well as the voltage standing wave ratio obtained from the new voltage excitations become diminished. The examples presented in this paper show the effectiveness of this algorithm in correcting the radiation pattern of a linear array of 36 and 120 dipole antennas with four and ten failed elements, respectively. The results show that the matching condition and the wide null control produced by Cuckoo Search algorithm are more efficient in comparison with the benchmark failure correction algorithm. The approach adopted herein may be applied to other array configurations as well.
Źródło:
Journal of Telecommunications and Information Technology; 2020, 1; 62-69
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of rapid and reliable cuckoo search algorithm for global maximum power point tracking of solar PV systems in partial shading condition
Autorzy:
Bentata, Khadidja
Mohammedi, Ahmed
Benslimane, Tarak
Powiązania:
https://bibliotekanauki.pl/articles/1845518.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
photovoltaic system
maximum power point tracking
partial shading
cuckoo search algorithm
Opis:
The solar photovoltaic output power fluctuates according to solar irradiation, temperature, and load impedance variations. Due to the operating point fluctuations, extracting maximum power from the PV generator, already having a low power conversion ratio, becomes very complicated. To reach a maximum power operating point, a maximum power point tracking technique (MPPT) should be used. Under partial shading condition, the nonlinear PV output power curve contains multiple maximum power points with only one global maximum power point (GMPP). Consequently, identifying this global maximum power point is a difficult task and one of the biggest challenges of partially shaded PV systems. The conventional MPPT techniques can easily be trapped in a local maximum instead of detecting the global one. The artificial neural network techniques used to track the GMPP have a major drawback of using huge amount of data covering all operating points of PV system, including different uniform and non-uniform irradiance cases, different temperatures and load impedances. The biological intelligence techniques used to track GMPP, such as grey wolf algorithm and cuckoo search algorithm (CSA), have two main drawbacks; to be trapped in a local MPP if they have not been well tuned and the precision-transient tracking time complex paradox. To deal with these drawbacks, a Distributive Cuckoo Search Algorithm (DCSA) is developed, in this paper, as GMPP tracking technique. Simulation results of the system for different partial shading patterns demonstrated the high precision and rapidity, besides the good reliability of the proposed DCSA-GMPPT technique, compared to the conventional CSA-GMPPT.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 495-526
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of the Morphological Parameters of a Metal Foam for the Highest Sound Absorption Coefficient Using Local Search Algorithm
Autorzy:
Jafari, Mohammad Javad
Khavanin, Ali
Ebadzadeh, Touraj
Fazlali, Mahmood
Sharak, Mohsen Niknam
Madvari, Rohollah Fallah
Powiązania:
https://bibliotekanauki.pl/articles/176536.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
SAC
Sound Absorption Coefficient
LSA
Local Search Algorithm
metal foam
optimization
Opis:
Due to its unique features, the metal foam is considered as one of the newest acoustic absorbents. It is a navel approach determining the structural properties of sound absorbent to predict its acoustical behavior. Unfortunately, direct measurements of these parameters are often difficult. Currently, there have been acoustic models showing the relationship between absorbent morphology and sound absorption coefficient (SAC). By optimizing the effective parameters on the SAC, the maximum SAC at each frequency can be obtained. In this study, using the Benchmarking method, the model presented by Lu was validated in MATLAB coding software. Then, the local search algorithm (LSA) method was used to optimize the metal foam morphology parameters. The optimized parameters had three factors, including porosity, pore size, and metal foam pore opening size. The optimization was applied to a broad band of frequency ranging from 500 to 8000 Hz. The predicted values were in accordance with benchmark data resulted from Lu model. The optimal range of the parameters including porosity of 50 to 95%, pore size of 0.09 to 4.55 mm, and pore opening size of 0.06 to 0.4 mm were applied to obtain the highest SAC for the frequency range of 500 to 800 Hz. The optimal amount of pore opening size was 0.1 mm in most frequencies to have the highest SAC. It was concluded that the proposed method of the LSA could optimize the parameters affecting the SAC according to the Lu model. The presented method can be a reliable guide for optimizing microstructure parameters of metal foam to increase the SAC at any frequency and can be used to make optimized metal foam.
Źródło:
Archives of Acoustics; 2020, 45, 3; 487-497
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive ant-colony algorithm for semantic query routing
Autorzy:
Gómez Santillán, C.
Cruz Reyes, L.
Schaeffer, E.
Meza, E.
Rivera Zarate, G.
Powiązania:
https://bibliotekanauki.pl/articles/384885.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
parameter tuning
search algorithm
peer-to-peer
adaptive algorithm
local environment
ant colony algorithms
Opis:
The most prevalent P2P application today is file sha ring, both among scientific users and the general public. Afundamental process in file sharing systems is the search mechanism. The unstructured nature of real-world largescale complex systems poses a challenge to the search me thods, because global routing and directory services are impractical to implement. This paper presents a new antcolony algorithm, Adaptive Neighboring-Ant Search (AdaNAS), for the semantic query routing problem (SQRP) in a P2P network. The proposed algorithm incor porates an adaptive control parameter tuning technique for runtime estimation of the time-to-live (TTL) of the ants. AdaNAS uses three strategies that take advantage of the local environment: learning, characterization, and explo ration. Two classical learning rules are used to gain ex perience on past performance using three new learning functions based on the distance traveled and the resources found by the ants. The experimental results show that the AdaNAS algorithm outperforms the NAS algorithm where the TTLvalue is not tuned at runtime.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 85-94
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Weryfikacja poprawności działania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących
Verification of correct operation of a tabu search algorithm for elastic task model scheduling in control and measurement systems
Autorzy:
Powroźnik, P.
Powiązania:
https://bibliotekanauki.pl/articles/152993.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
szeregowanie zadań
elastyczny model
algorytm tabu search
task scheduling
elastic task model
tabu search algorithm
Opis:
W artykule przedstawiono ideę zastosowania algorytmu tabu search do wyznaczenia okresu zadań w elastycznym modelu szeregowania zadań. Wyniki przeprowadzonych symulacji dowodzą przydatność algorytmu w doborze parametrów czasowych w elastycznym modelu szeregowania zadań. Rozdział pierwszy zawiera tło zastosowania teorii szeregowania zadań w systemach pomiarowo - sterujących. Rozdział drugi wprowadza czytelnika do zastosowania elastycznego modelu szeregowania zadań w systemach pomiarowo - sterujących. Rozdział ten zawiera krótki przegląd literaturowy prezentowanej tematyki [1, 2, 3]. Rozdział trzeci przedstawia ideę zastosowania wybranego algorytmu heurystycznego tabu serach w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Rysunek pierwszy przedstawia schemat blokowy szeregowania zadań przy zastosowaniu algorytmu tabu search. Rozdział czwarty zawiera wyniki z przeprowadzonych symulacji zastosowania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Podsumowanie zawiera najważniejsze wnioski wynikające ze stosowania omawianego algorytmu w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących.
In this paper use of a tabu search algorithm for elastic task model scheduling is presented. The results of simulations confirm usefulness of this method for assigning the time parameters in elastic task model scheduling. In the first section, the background of application of task model scheduling to control and measurement systems is outlined. The second section deals with introduction to using the elastic task model scheduling for control and measurement systems. This section provides a brief literature review of the presented subjects [1, 2, 3]. The third section presents an idea of applying the selected tabu search heuristic algorithm to the elastic task model scheduling in control and measurement systems. The block diagram of the elastic task model scheduling with use of the tabu search algorithm is shown in Fig. 1. The fourth section contains the results of simulations carried out for the elastic task model scheduling with use of the tabu search algorithm in control and measurement systems. At the end there are presented the main conclusions drawn from using the tabu search algorithm for assigning the task time parameters in the elastic task model scheduling in control and measurement systems.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 11, 11; 1345-1347
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Real-time validation of an automatic generation control system considering HPA-ISE with crow search algorithm optimized cascade FOPDN-FOPIDN controller
Autorzy:
Babu, Naladi Ram
Chiranjeevi, Tirumalasetty
Devarapalli, Ramesh
Knypiński, Łukasz
Garcìa Màrquez, Fausto Pedro
Powiązania:
https://bibliotekanauki.pl/articles/27312009.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
crow search algorithm
dish-stirling solar system
AGC
RT Lab
FOPDN-FOPIDN controller
Opis:
This article validates the application of RT-Lab for the AGC studies of three-area systems. All the areas are employed with thermal-DSTS systems. A new controller named cascade FOPDN-FOPPIDN is employed. Its parameters are optimized using a CSA, subjecting to a new PI named HPA-ISE. The responses of the FOPDN-FOPIDN controller are related and are superior over PIDN and TIDN controllers. Moreover, the dominance of HPA-ISE is verified with ISE, and it performs better in terms of system dynamics. Further, the system performance reliability is analyzed with the AC-HVDC and is better than the AC system. Besides, sensitivity analysis recommends that the proposed FOPDN-FOPIDN at diverse conditions is robust and more reliability.
Źródło:
Archives of Control Sciences; 2023, 33, 2; 371--390
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 64

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