• Title/Summary/Keyword: Algorithm optimization

Search Result 5,658, Processing Time 0.03 seconds

A Biologically Inspired Intelligent PID Controller Tuning for AVR Systems

  • Kim Dong-Hwa;Cho Jae-Hoon
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.5
    • /
    • pp.624-636
    • /
    • 2006
  • This paper proposes a hybrid approach involving Genetic Algorithm (GA) and Bacterial Foraging (BF) for tuning the PID controller of an AVR. Recently the social foraging behavior of E. coli bacteria has been used to solve optimization problems. We first illustrate the proposed method using four test functions and the performance of the algorithm is studied with an emphasis on mutation, crossover, variation of step sizes, chemotactic steps, and the life time of the bacteria. Further, the proposed algorithm is used for tuning the PID controller of an AVR. Simulation results are very encouraging and this approach provides us a novel hybrid model based on foraging behavior with a possible new connection between evolutionary forces in social foraging and distributed non-gradient optimization algorithm design for global optimization over noisy surfaces.

Trajectory Optimization and Optimal Explicit Guidance Algorithm Design for a Satellite Launch Vehicle (위성발사체의 궤적최적화와 최적 유도 알고리듬 설계)

  • Roh, Woong-Rae;Kim, Yodan;Song, Taek-Lyul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.2
    • /
    • pp.173-182
    • /
    • 2001
  • Ascent trajectory optimization and optimal explicit guidance problems for a satellite launch vehicle in a 2-dimensional pitch plane are studied. The trajectory optimization problem with boundary conditions is formulated as a nonlinear programming problem by parameterizing the pitch attitude control variable, and is solved by using the SQP algorithm. The flight constraints such as gravity-turn are imposed. An optimal explicit guidance algorithm in the exoatmospheric phase is also presented, the guidance algorithm provides steering command and time-to-go value directly using the current states of the vehicle and the desired orbit insertion conditions. To verify the optimality and accuracy of the algorithm simulations are performed.

  • PDF

Optimization of the braced dome structures by using Jaya algorithm with frequency constraints

  • Grzywinski, Maksym;Dede, Tayfun;Ozdemir, Yaprak Itir
    • Steel and Composite Structures
    • /
    • v.30 no.1
    • /
    • pp.47-55
    • /
    • 2019
  • The aim of this paper is to present new and an efficient optimization algorithm called Jaya for the optimum mass of braced dome structures with natural frequency constraints. Design variables of the bar cross-section area and coordinates of the structure nodes were used for size and shape optimization, respectively. The effectiveness of Jaya algorithm is demonstrated through three benchmark braced domes (52-bar, 120-bar, and 600-bar). The algorithm applied is an effective tool for finding the optimum design of structures with frequency constraints. The Jaya algorithm has been programmed in MATLAB to optimize braced dome.

Optimization Algorithm for Real-time Load Dispatch Problem Using Shut-off and Swap Method (발전정지와 교환방법을 적용한 실시간급전문제 최적화 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.219-224
    • /
    • 2017
  • In facing the lack of a deterministic algorithm for economic load dispatch optimization problem, only non-deterministic heuristic algorithms have been suggested. Worse still, there is a near deficiency of research devoted to real-time load dispatch optimization algorithm. In this paper, therefore, I devise a shut-off and swap algorithm to solve real-time load dispatch optimization problem. With this algorithm in place, generators with maximum cost-per-unit generation power are to be shut off. The proposed shut-off criteria use only quadratic function in power generation cost function without valve effect nonlinear absolute function. When applied to the most prevalent economic load dispatch benchmark data, the proposed algorithm is proven to largely reduce the power cost of known algorithms.

DSP Optimization for Rain Detection and Removal Algorithm (비 검출 및 제거 알고리즘의 DSP 최적화)

  • Choi, Dong Yoon;Seo, Seung Ji;Song, Byung Cheol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.96-105
    • /
    • 2015
  • This paper proposes a DSP optimization solution of rain detection and removal algorithm. We propose rain detection and removal algorithms considering camera motion, and also presents optimization results in algorithm level and DSP level. At algorithm level, this paper utilizes a block level binary pattern analysis, and reduces the operation time by using the fast motion estimation algorithm. Also, the algorithm is optimized at DSP level through inter memory optimization, EDMA, and software pipelining for real-time operation. Experiment results show that the proposed algorithm is superior to the other algorithms in terms of visual quality as well as processing speed.

Development of the new meta-heuristic optimization algorithm inspired by a vision correction procedure: Vision Correction Algorithm (시력교정 과정에서 착안된 새로운 메타휴리스틱 최적화 알고리즘의 개발: Vision Correction Algorithm)

  • Lee, Eui Hoon;Yoo, Do Guen;Choi, Young Hwan;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.3
    • /
    • pp.117-126
    • /
    • 2016
  • In this study, a new meta-heuristic optimization algorithm, Vision Correction Algorithm (VCA), designed according to the optical properties of glasses was developed. The VCA is a technique applying optometry and vision correction procedure to optimization algorithm through the process of myopic/hyperopic correction-brightness adjustment-compression enforcement-astigmatism adjustment. The proposed VCA unlike the conventional meta-heuristic algorithm is an automatically adjusting global/local search rate and global search direction based on accumulated optimization results. The proposed algorithm was applied to the representative optimization problem (mathematical and engineering problem) and results of the application are compared with that of the present algorithms.

Spacecraft Radiator Design Optimization Approach of Combining Optimization Algorithm with Thermal Analysis (최적화알고리즘과 열해석을 통합한 위성방열판 설계의 최적화 방법에 관한 연구)

  • Kim, Hui-Kyung
    • Aerospace Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.24-29
    • /
    • 2013
  • A spacecraft radiator is a thermal control method to eject internally dissipated heat into the space generated from operation of unit boxes. The efficiency of thermal design may be improved by optimizing radiator design. In this paper, the optimization approach method of node-based radiator design was suggested which is to combine numerical thermal analysis with optimization algorithm. This method has meaning that it can be used practically to implement the spacecraft radiator design regardless of thermal analysis and optimization algorithm software and maintain the same basic concept of an ordinary radiator design approach based on node division of a thermal model. The overall analysis framework with thermal analysis and optimization algorithm would be presented.

Mathematical Proof for Structural Optimization with Equivalent Static Loads Transformed from Dynamic Loads (동하중에서 변환된 등가정하중에 의한 최적화 방법의 수학적 고찰)

  • Park, Gyung-Jin;Kang, Byung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.2
    • /
    • pp.268-275
    • /
    • 2003
  • Generally, structural optimization is carried out based on external static loads. All forces have dynamic characteristics in the real world. Mathematical optimization with dynamic loads is extremely difficult in a large-scale problem due to the behaviors in the time domain. The dynamic loads are often transformed into static loads by dynamic factors, design codes, and etc. Therefore, the optimization results can give inaccurate solutions. Recently, a systematic transformation has been proposed as an engineering algorithm. Equivalent static loads are made to generate the same displacement field as the one from dynamic loads at each time step of dynamic analysis. Thus, many load cases are used as the multiple leading conditions which are not costly to include in modern structural optimization. In this research, it is mathematically proved that the solution of the algorithm satisfies the Karush-Kuhn-Tucker necessary condition. At first, the solution of the new algorithm is mathematically obtained. Using the termination criteria, it is proved that the solution satisfies the Karush-Kuhn-Tucker necessary condition of the original dynamic response optimization problem. The application of the algorithm is discussed.

Hybrid BFPSO Approach for Effective Tuning of PID Controller for Load Frequency Control Application in an Interconnected Power System

  • Anbarasi, S.;Muralidharan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1027-1037
    • /
    • 2017
  • Penetration of renewable energy sources makes the modern interconnected power systems to have more intelligence and flexibility in the control. Hence, it is essential to maintain the system frequency and tie-line power exchange at nominal values using Load Frequency Control (LFC) for efficient, economic and reliable operation of power systems. In this paper, intelligent tuning of the Proportional Integral Derivative (PID) controller for LFC in an interconnected power system is considered as a main objective. The chosen problem is formulated as an optimization problem and the optimal gain parameters of PID controllers are computed with three innovative swarm intelligent algorithms named Particle Swarm Optimization (PSO), Bacterial Foraging Optimization Algorithm (BFOA) and hybrid Bacterial Foraging Particle Swarm Optimization (BFPSO) and a comparative study is made between them. A new objective function designed with necessary time domain specifications using weighted sum approach is also offered in this report and compared with conventional objective functions. All the simulation results clearly reveal that, the hybrid BFPSO tuned PID controller with proposed objective function has better control performances over other optimization methodologies.

Optimum design of shape and size of truss structures via a new approximation method

  • Ahmadvand, Hosein;Habibi, Alireza
    • Structural Engineering and Mechanics
    • /
    • v.76 no.6
    • /
    • pp.799-821
    • /
    • 2020
  • The optimum design of truss structures is one of the significant categories in structural optimization that has widely been applied by researchers. In the present study, new mathematical programming called Consistent Approximation (CONAP) method is utilized for the simultaneous optimization of the size and shape of truss structures. The CONAP algorithm has already been introduced to optimize some structures and functions. In the CONAP algorithm, some important parameters are designed by employing design sensitivities to enhance the capability of the method and its consistency in various optimum design problems, especially structural optimization. The cross-sectional area of the bar elements and the nodal coordinates of the truss are assumed to be the size and shape design variables, respectively. The displacement, allowable stress and the Euler buckling stress are taken as the design constraints for the problem. In the proposed method, the primary optimization problem is replaced with a sequence of explicit sub-problems. Each sub-problem is efficiently solved using the sequential quadratic programming (SQP) algorithm. Several truss structures are designed by employing the CONAP method to illustrate the efficiency of the algorithm for simultaneous shape and size optimization. The optimal solutions are compared with some of the mathematical programming algorithms, the approximation methods and metaheuristic algorithms those reported in the literature. Results demonstrate that the accuracy of the optimization is improved and the convergence rate speeds up.