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

  Lista filtrów

Dostawca treści

Wyrównaj
    Wyświetlanie 1-29 z 29
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    Optimization of electric and magnetic field intensities in proximity of power lines using genetic and particle swarm algorithms
    Autorzy:
    Król, K.
    Machczyński, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/141588.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    power line
    electric field
    magnetic field
    optimization
    genetic algorithm
    particle swarm algorithm
    Opis:
    The paper presents optimization of power line geometrical parameters aimed to reduce the intensity of the electric field and magnetic field intensity under an overhead power line with the use of a genetic algorithm (AG) and particle swarm optimization (PSO). The variation of charge distribution along the conductors as well as the sag of the overhead line and induced currents in earth wires were taken into account. The conductor sag was approximated by a chain curve. The charge simulation method (CSM) and the method of images were used in the simulations of an electric field, while a magnetic field were calculated using the Biot–Savart law. Sample calculations in a three-dimensional system were made for a 220 kV single – circuit power line. A comparison of the used optimization algorithms was made.
    Źródło:
    Archives of Electrical Engineering; 2018, 67, 4; 829-843
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    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ł:
    Design of a Superconducting Antenna Integrated with a Diplexer for Radio-Astronomy Applications
    Autorzy:
    Donelli, M.
    Febvre, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/309365.pdf
    Data publikacji:
    2014
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    diplexer
    microwave antenna
    optimization techniques
    particle swarm algorithm
    radio astronomy
    Opis:
    This paper presents the design of a compact frontend diplexer for radio-astronomy applications based on a self complementary Bow-tie antenna, a 3 dB T-junction splitter and two pass-band fractal lters. The whole diplexer structure has been optimized by using an evolutionary algorithm. In particular the problem of the diplexer design is recast into an optimization one by dening a suitable cost function which is then minimized by mean of an evolutionary algorithm namely the Particle Swarm Optimization (PSO). An X band diplexer prototype was fabricated and assessed demonstrating a good agreement between numerical and experimental results.
    Źródło:
    Journal of Telecommunications and Information Technology; 2014, 3; 113-118
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    Allocation of real power generation based on computing over all generation cost: an approach of Salp Swarm Algorithm
    Autorzy:
    Devarapalli, Ramesh
    Sinha, Nikhil Kumar
    Rao, Bathina Venkateswara
    Knypiński, Łukasz
    Lakshmi, Naraharisetti Jaya Naga
    García Márquez, Fausto Pedro
    Powiązania:
    https://bibliotekanauki.pl/articles/1841291.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    economic load dispatch
    heuristic algorithms
    optimization
    Particle Swarm
    Algorithm
    Salp Swarm Algorithm
    ekonomiczna wysyłka ładunku
    algorytmy heurystyczne
    optymalizacja
    rój cząstek
    algorytm
    Opis:
    Economic Load Dispatch (ELD) is utilized in finding the optimal combination of the real power generation that minimizes total generation cost, yet satisfying all equality and inequality constraints. It plays a significant role in planning and operating power systems with several generating stations. For simplicity, the cost function of each generating unit has been approximated by a single quadratic function. ELD is a subproblem of unit commitment and a nonlinear optimization problem. Many soft computing optimization methods have been developed in the recent past to solve ELD problems. In this paper, the most recently developed population-based optimization called the Salp Swarm Algorithm (SSA) has been utilized to solve the ELD problem. The results for the ELD problem have been verified by applying it to a standard 6-generator system with and without due consideration of transmission losses. The finally obtained results using the SSA are compared to that with the Particle Swarm Optimization (PSO) algorithm. It has been observed that the obtained results using the SSA are quite encouraging.
    Źródło:
    Archives of Electrical Engineering; 2021, 70, 2; 337-349
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    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ł:
    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ł
    Tytuł:
    An Analytical Study for the Role of Fuzzy Logic in Improving Metaheuristic Optimization Algorithms
    Autorzy:
    Vij, Sonakshi
    Jain, Amita
    Tayal, Devendra
    Castillo, Oscar
    Powiązania:
    https://bibliotekanauki.pl/articles/385121.pdf
    Data publikacji:
    2018
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    fuzzy logic
    metaheuristics
    evolutionary computing
    genetic algorithm
    particle swarm optimization (PSO)
    ant colony optimization
    fuzzy evolutionary algorithm
    fuzzy cuckoo
    fuzzy simulated annealing
    fuzzy swarm intelligence
    fuzzy differential evolution
    tabu
    fuzzy mutation
    fuzzy natural selection
    fuzzy fitness function
    big bang big crunch
    fuzzy bacterial
    neuro fuzzy logic
    logika rozmyta
    metaheurystyka
    obliczenia ewolucyjne
    algorytm genetyczny
    optymalizacja roju cząstek
    optymalizacja kolonii mrówek
    Opis:
    The research applications of fuzzy logic have always been multidisciplinary in nature due to its ability in handling vagueness and imprecision. This paper presents an analytical study in the role of fuzzy logic in the area of metaheuristics using Web of Science (WoS) as the data source. In this case, 178 research papers are extracted from it in the time span of 1989-2016. This paper analyzes various aspects of a research publication in a scientometric manner. The top cited research papers, country wise contribution, topmost organizations, top research areas, top source titles, control terms and WoS categories are analyzed. Also, the top 3 fuzzy evolutionary algorithms are extracted and their top research papers are mentioned along with their topmost research domain. Since neuro fuzzy logic poses feasible options for solving numerous research problems, hence a section is also included by the authors to present an analytical study regarding research in it. Overall, this study helps in evaluating the recent research patterns in the field of fuzzy metaheuristics along with envisioning the future trends for the same. While on one hand this helps in providing a new path to the researchers who are beginners in this field as they can start exploring it through the analysis mentioned here, on the other hand it provides an insight to professional researchers too who can dig a little deeper in this field using knowledge from this study.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 4; 11-27
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimal design of RC frames using a modified hybrid PSOGSA algorithm
    Optymalny projekt ramy RC z wykorzystaniem zmodyfikowanego algorytmu hybrydowego PSOGSA
    Autorzy:
    Chutani, S.
    Singh, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/230376.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    projekt optymalny
    konstrukcja żelbetowa
    optymalizacja demokratyczna roju cząstek
    samoadaptacyjny algorytm
    grawitacyjnego wyszukiwania
    projektowanie
    Indie
    norma indyjska
    optimum design
    reinforced concrete structure
    democratic particle swarm optimization
    selfadaptive gravitational search algorithm
    design
    Indian standard
    Opis:
    The present study has been taken up to emphasize the role of the hybridization process for optimizing a given reinforced concrete (RC) frame. Although various primary techniques have been hybrid in the past with varying degree of success, the effect of hybridization of enhanced versions of standard optimization techniques has found little attention. The focus of the current study is to see if it is possible to maintain and carry the positive effects of enhanced versions of two different techniques while using their hybrid algorithms. For this purpose, enhanced versions of standard particle swarm optimization (PSO) and a standard gravitational search algorithm (GSA), were considered for optimizing an RC frame. The enhanced version of PSO involves its democratization by considering all good and bad experiences of the particles, whereas the enhanced version of the GSA is made self-adaptive by considering a specific range for certain parameters, like the gravitational constant and a set of agents with the best fitness values. The optimization process, being iterative in nature, has been coded in C++. The analysis and design procedure is based on the specifications of Indian codes. Two distinct advantages of enhanced versions of standard PSO and GSA, namely, better capability to escape from local optima and a faster convergence rate, have been tested for the hybrid algorithm. The entire formulation for optimal cost design of a frame includes the cost of beams and columns. The variables of each element of structural frame have been considered as continuous and rounded off appropriately to consider practical limitations. An example has also been considered to emphasize the validity of this optimum design procedure.
    W niniejszym artykule przedstawiono bardziej realistyczny i optymalny projekt żlbetowych ram konstrukcyjnych (RC) poprzez hybrydyzację ulepszonych wersji standardowej optymalizacji roju cząsteczek (PSO) oraz standardowy algorytm wyszukiwania grawitacyjnego (GSA). Podejście proponowane w niniejszej pracy koncentruje się na hybrydyzacji ulepszonych wersji standardowej optymalizacji roju cząsteczek (PSO) oraz standardowym algorytmie wyszukiwania grawitacyjnego (GSA). PSO została zdemokratyzowana poprzez uwzględnienie wszystkich dobrych i złych doświadczeń w zakresie cząsteczek, podczas gdy GSA został zmieniony na samodostosowujący, uwzględniając określony zakres dla niektórych parametrów, takich jak np. stała grawitacyjna i zestaw czynników o najlepszych wartościach sprawności. Optymalny rozmiar i wzmocnienie elementów zostały określone dzięki zastosowaniu techniki w środowisku komputerowym, w którym cały proces analizy, projektowania i optymalizacji został zakodowany w C++. Procedura analizy i projektowania przebiega zgodnie ze specyfikacjami kodów indyjskich. Okazało się, że zastosowanie samodostosowującego algorytmu wyszukiwania grawitacyjnego wraz z demokratyczną techniką optymalizacji roju cząsteczek zapewnia dwie wyraźne przewagi nad standardową PSO i GSA, a mianowicie lepszą zdolność do ucieczki od lokalnej optymalności i szybszy współczynnik konwergencji. Całe sformułowanie dla optymalnego projektu kosztów ramy obejmuje zarówno koszt belek i słupów. W tym podejściu, zmienne każdego elementu ramy konstrukcyjnej zostały uznane za funkcje ciągłe i zaokrąglone odpowiednio do zastosowania praktycznego znaczenia niniejszego badania. Rozważono kilka przykładów, które podkreślają ważność optymalnej procedury projektowania, a wyniki porównano z wcześniejszymi badaniami, w celu sprawdzenia ich skuteczności i efektywności. Proponowany algorytm pokonuje ograniczenia dwóch indywidualnych algorytmów, biorąc pod uwagę ich hybrydę, a tym samym poprawia ogólną wydajność. Wprowadzono niezbędne zmiany, aby badanie było zgodne z wcześniejszymi badaniami. Porównanie z innymi wcześniej stosowanymi technikami hybrydowymi pokazuje, że czas potrzebny na przeprowadzenie procesu optymalizacji w niniejszym badaniu – z wykorzystaniem techniki MPSOGSA – został znacznie zmniejszony. Ponadto, podczas projektowania ram RC obniżono całkowity koszt za pomocą techniki MPSOGSA. Obniżenie kosztów w obszarze stali odgrywa większą rolę w optymalizacji, w porównaniu do redukcji kosztów w przekroju poprzecznym elementów ramy, co zostało szczegółowo przeanalizowane na przykładzie.
    Źródło:
    Archives of Civil Engineering; 2017, 63, 4; 123-134
    1230-2945
    Pojawia się w:
    Archives of Civil Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-29 z 29

      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