• Title/Summary/Keyword: optimization algorithm

Search Result 5,708, Processing Time 0.036 seconds

Optimization of Controller Parameters using A Memory Cell of Immune Algorithm (면역알고리즘의 기억세포를 이용한 제어기 파라메터의 최적화)

  • Park, Jin-Hyeon;Choe, Yeong-Gyu
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.8
    • /
    • pp.344-351
    • /
    • 2002
  • The proposed immune algorithm has an uncomplicated structure and memory-cell mechanism as the optimization algorithm which imitates the principle of humoral immune response. We use the proposed algorithm to solve parameter optimization problems. Up to now, the applications of immune algorithm have been optimization problems with non-varying system parameters. Therefore the usefulness of memory-cell mechanism in immune algorithm is without. This paper proposes the immune algorithm using a memory-cell mechanism which can be the application of system with nonlinear varying parameters. To verified performance of the proposed immune algorithm, the speed control of nonlinear DC motor are performed. The results of Computer simulations represent that the proposed immune algorithm shows a fast convergence speed and a good control performances under the varying system parameters.

Structural damage identification using cloud model based fruit fly optimization algorithm

  • Zheng, Tongyi;Liu, Jike;Luo, Weili;Lu, Zhongrong
    • Structural Engineering and Mechanics
    • /
    • v.67 no.3
    • /
    • pp.245-254
    • /
    • 2018
  • In this paper, a Cloud Model based Fruit Fly Optimization Algorithm (CMFOA) is presented for structural damage identification, which is a global optimization algorithm inspired by the foraging behavior of fruit fly swarm. It is assumed that damage only leads to the decrease in elementary stiffness. The differences on time-domain structural acceleration data are used to construct the objective function, which transforms the damaged identification problem of a structure into an optimization problem. The effectiveness, efficiency and accuracy of the CMFOA are demonstrated by two different numerical simulation structures, including a simply supported beam and a cantilevered plate. Numerical results show that the CMFOA has a better capacity for structural damage identification than the basic Fruit Fly Optimization Algorithm (FOA) and the CMFOA is not sensitive to measurement noise.

Hybrid of the fuzzy logic controller with the harmony search algorithm to PWR in-core fuel management optimization

  • Mahmoudi, Sayyed Mostafa;Rad, Milad Mansouri;Ochbelagh, Dariush Rezaei
    • Nuclear Engineering and Technology
    • /
    • v.53 no.11
    • /
    • pp.3665-3674
    • /
    • 2021
  • One of the important parts of the in-core fuel management is loading pattern optimization (LPO). The loading pattern optimization as a reasonable design of the in-core fuel management can improve both economic and safe aspects of the nuclear reactor. This work proposes the hybrid of fuzzy logic controller with harmony search algorithm (HS) for loading pattern optimization in a pressurized water reactor. The music improvisation process to find a pleasing harmony is inspiring the harmony search algorithm. In this work, the adjustment of the harmony search algorithm parameters such as the bandwidth and the pitch adjustment rate are increasing performance of the proposed algorithm which is done through a fuzzy logic controller. Hence, membership functions and fuzzy rules are designed to improve the performance of the HS algorithm and achieve optimal results. The objective of the method is finding an optimum core arrangement according to safety and economic aspects such as reduction of power peaking factor (PPF) and increase of effective multiplication factor (Keff). The proposed approach effectiveness has been tried in two cases, Michalewicz's bivariate function problem and NEACRP LWR core. The results show that by using fuzzy harmony search algorithm the value of the fitness function is improved by 15.35%. Finally, with regard to the new solutions proposed in this research it could be used as a trustworthy method for other optimization issues of engineering field.

Maximum Power Point Tracking of Photovoltaic using Improved Particle Swarm Optimization Algorithm (개선된 입자 무리 최적화 알고리즘 이용한 태양광 패널의 최대 전력점 추적)

  • Kim, Jae-Jung;Kim, Chang-Bok
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.4
    • /
    • pp.291-298
    • /
    • 2020
  • This study proposed a model that can track MPP faster than the existing MPPT algorithm using the particle swarm optimization algorithm (PSO). The proposed model highly sets the acceleration constants of gbest and pbest in the PSO algorithm to quickly track the MPP point and eliminates the power instability problem. In addition, this algorithm was re-executed by detecting the change in power of the solar panel according to the rapid change in solar radiation. As a result of the experiment, MPP time was 0.03 seconds and power was 131.65 for 691.5 W/m2, and MPP was tracked at higher power and speed than the existing P&O and INC algorithms. The proposed model can be applied when a change in the amount of power is detected by partial shading in a Photovoltaic power plant with Photovoltaic connected in parallel. In order to improve the MPPT algorithm, this study needs a comparative study on optimization algorithms such as moth flame optimization (MFO) and whale optimization algorithm (WOA).

Comparative Study on Structural Optimal Design Using Micro-Genetic Algorithm (마이크로 유전자 알고리즘을 적용한 구조 최적설계에 관한 비교 연구)

  • 한석영;최성만
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.3
    • /
    • pp.82-88
    • /
    • 2003
  • SGA(Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, ${\mu}GA$(Micro-Genetic Algorithm) has recently been developed. In this study, ${\mu}GA$ which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of ${\mu}GA$ were compared with those of SGA. Solutions of ${\mu}GA$ for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that ${\mu}GA$ is a suitable and very efficient optimization algorithm for structural design.

Optimal Learning of Fuzzy Neural Network Using Particle Swarm Optimization Algorithm

  • Kim, Dong-Hwa;Cho, Jae-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.421-426
    • /
    • 2005
  • Fuzzy logic, neural network, fuzzy-neural network play an important as the key technology of linguistic modeling for intelligent control and decision making in complex systems. The fuzzy-neural network (FNN) learning represents one of the most effective algorithms to build such linguistic models. This paper proposes particle swarm optimization algorithm based optimal learning fuzzy-neural network (PSOA-FNN). The proposed learning scheme is the fuzzy-neural network structure which can handle linguistic knowledge as tuning membership function of fuzzy logic by particle swarm optimization algorithm. The learning algorithm of the PSOA-FNN is composed of two phases. The first phase is to find the initial membership functions of the fuzzy neural network model. In the second phase, particle swarm optimization algorithm is used for tuning of membership functions of the proposed model.

  • PDF

An Optimization Technique For Crane Acceleration Using A Genetic Algorithm (유전자알고리즘을 이용한 크레인가속도 최적화)

  • 박창권;김재량;정원지;홍대선;권장렬;박범석
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.1701-1704
    • /
    • 2003
  • This paper presents a new optimization technique of acceleration curve for a wafer transfer crane movement in which high speed and low vibration are desirable. This technique is based on a genetic algorithm with a penalty function for acceleration optimization under the assumption that an initial profile of acceleration curves constitutes the first generation of the genetic algorithm. Especially the penalty function consists of the violation of constraints and the number of violated constraints. The proposed penalty function makes the convergence rate of optimization process using the genetic algorithm more faster than the case of genetic algorithm without a penalty function. The optimized acceleration of the crane through the genetic algorithm and commercial dynamic analysis software has shown to have accurate movement and low vibration.

  • PDF

Topology optimization of nonlinear single layer domes by a new metaheuristic

  • Gholizadeh, Saeed;Barati, Hamed
    • Steel and Composite Structures
    • /
    • v.16 no.6
    • /
    • pp.681-701
    • /
    • 2014
  • The main aim of this study is to propose an efficient meta-heuristic algorithm for topology optimization of geometrically nonlinear single layer domes by serially integration of computational advantages of firefly algorithm (FA) and particle swarm optimization (PSO). During the optimization process, the optimum number of rings, the optimum height of crown and tubular section of the member groups are determined considering geometric nonlinear behaviour of the domes. In the proposed algorithm, termed as FA-PSO, in the first stage an optimization process is accomplished using FA to explore the design space then, in the second stage, a local search is performed using PSO around the best solution found by FA. The optimum designs obtained by the proposed algorithm are compared with those reported in the literature and it is demonstrated that the FA-PSO converges to better solutions spending less computational cost emphasizing on the efficiency of the proposed algorithm.

Rao-3 algorithm for the weight optimization of reinforced concrete cantilever retaining wall

  • Kalemci, Elif N.;?kizler, S. Banu
    • Geomechanics and Engineering
    • /
    • v.20 no.6
    • /
    • pp.527-536
    • /
    • 2020
  • The paper represents an optimization algorithm for reinforced concrete retaining wall design. The proposed method, called Rao-3 optimization algorithm, is a recently developed algorithm. The total weight of the steel and concrete, which are used for constructing the retaining wall, were chosen as the objective function. Building Code Requirements for Structural Concrete (ACI 318-05) and Rankine's theory for lateral earth pressure were considered for structural and geotechnical design, respectively. Number of the design variables are 12. Eight of those express the geometrical dimensions of the wall and four of those express the steel reinforcement of the wall. The safety against overturning, sliding and bearing capacity failure were regarded as the geotechnical constraints. The safety against bending and shear failure, minimum and maximum areas of reinforcement, development lengths of steel reinforcement were regarded as structural constraints. The performance of proposed algorithm was evaluated with two design examples.

Global Optimization Using Differential Evolution Algorithm (차분진화 알고리듬을 이용한 전역최적화)

  • Jung, Jae-Joon;Lee, Tae-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.11
    • /
    • pp.1809-1814
    • /
    • 2003
  • Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially fur the solution to Chebychev polynomial fitting problem is similar to genetic algorithm(GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than CA, since it employs the difference information as pseudo-sensitivity In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.