• Title/Summary/Keyword: robust optimization problems

Search Result 123, Processing Time 0.027 seconds

Generation Scheduling with Large-Scale Wind Farms using Grey Wolf Optimization

  • Saravanan, R.;Subramanian, S.;Dharmalingam, V.;Ganesan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1348-1356
    • /
    • 2017
  • Integration of wind generators with the conventional power plants will raise operational challenges to the electric power utilities due to the uncertainty of wind availability. Thus, the Generation Scheduling (GS) among the online generating units has become crucial. This process can be formulated mathematically as an optimization problem. The GS problem of wind integrated power system is inherently complex because the formulation involves non-linear operational characteristics of generating units, system and operational constraints. As the robust tool is viable to address the chosen problem, the modern bio-inspired algorithm namely, Grey Wolf Optimization (GWO) algorithm is chosen as the main optimization tool. The intended algorithm is implemented on the standard test systems and the attained numerical results are compared with the earlier reports. The comparison clearly indicates the intended tool is robust and a promising alternative for solving GS problems.

Robust Rear Center-Hinge Bracket Optimization Based on Taguchi Method (다구찌 방법을 활용한 Rear Center-Hinge Bracket 강건 설계)

  • Jung, Sebin;Kim, Minho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.22 no.3
    • /
    • pp.203-209
    • /
    • 2014
  • The rear center-hinge bracket is designed for supporting and folding the rear-seat backrest. This bracket needs to be strong enough to be able to rigidly hold the rear-seat backrest and to withstand luggage loads from the car trunk that are generated when a vehicle is driving on the roads. Particularly, current accident studies report that many serious occupant injuries occurred when the rear-seat back easily folded inward toward the car interior, driven by the luggage loads in the trunk. Given this fact, the robust design of the rear center-hinge bracket that mainly supports the rear backrest has become more important for providing customer safety and preventing high warranty and durability problems. However, none of the studies have emphasized its significant role and considered its robust optimization. Therefore, this paper presents how the hinge-bracket design is optimized based on an application of the finite-element method coupled with the parameter design using Taguchi's design experiment. Finally, Taguchi method's application optimizes a robust center-hinge bracket that shows more rigid performance although it has lighter weight and thinner thickness.

Development of an Efficient Optimization Technique for Robust Design by Approximating Probability Constratints (확률조건의 근사화를 통한 효율적인 강건 최적설계 기법의 개발)

  • Jeong, Do-Hyeon;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.12
    • /
    • pp.3053-3060
    • /
    • 2000
  • Alternative formulation is presented for robust optimization problems and an efficient computational scheme for reliability estimation is proposed. Both design variables and design parameters considered as random variables about their nominal values. To ensure the robustness of objective performance a new cost function bounding the performance and a new constraint limiting the performance variation are introduced. The constraint variations are regulated by considering the probability of feasibility. Each probability constraint is transformed into a sub-optimization problem and then is resolved with the modified advanced first order second moment(AFOSM) method for computational efficiency. The proposed robust optimization method has advantages that the mean value and the variation of the performance function are controlled simultaneously and the second order sensitivity information is not required even in case of gradient based optimization. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.

Reconfigurable Multidisciplinary Design Optimization Framework (재구성이 가능한 다분야통합최적설계 프레임웍의 개발)

  • Lee, Jang-Hyo;Lee, Se-Jung
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.3
    • /
    • pp.207-216
    • /
    • 2009
  • Modern engineering design problems involve complexity of disciplinary coupling and difficulty of problem formulation. Multidisciplinary design optimization can overcome the complexity and design optimization software or frameworks can lessen the difficulty. Recently, a growing number of new multidisciplinary design optimization techniques have been proposed. However, each technique has its own pros and cons and it is hard to predict a priori which technique is more efficient than others for a specific problem. In this study, a software system has been developed to directly solve MDO problems with minimal input required. Since the system is based on MATLAB, it can exploit the optimization toolbox which is already developed and proven to be effective and robust. The framework is devised to change an MDO technique to another as the optimization goes on and it is called a reconfigurable MDO framework. Several numerical examples are shown to prove the validity of the reconfiguration idea and its effectiveness.

Trajectory Optimization for Impact Angle Control based on Sequential Convex Programming (순차 컨벡스 프로그래밍을 이용한 충돌각 제어 비행궤적 최적화)

  • Kwon, Hyuck-Hoon;Shin, Hyo-Sub;Kim, Yoon-Hwan;Lee, Dong-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.159-166
    • /
    • 2019
  • Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

Performance Evaluation and Parametric Study of MGA in the Solution of Mathematical Optimization Problems (수학적 최적화 문제를 이용한 MGA의 성능평가 및 매개변수 연구)

  • Cho, Hyun-Man;Lee, Hyun-Jin;Ryu, Yeon-Sun;Kim, Jeong-Tae;Na, Won-Bae;Lim, Dong-Joo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2008.04a
    • /
    • pp.416-421
    • /
    • 2008
  • A Metropolis genetic algorithm (MGA) is a newly-developed hybrid algorithm combining simple genetic algorithm (SGA) and simulated annealing (SA). In the algorithm, favorable features of Metropolis criterion of SA are incorporated in the reproduction operations of SGA. This way, MGA alleviates the disadvantages of finding imprecise solution in SGA and time-consuming computation in SA. It has been successfully applied and the efficiency has been verified for the practical structural design optimization. However, applicability of MGA for the wider range of problems should be rigorously proved through the solution of mathematical optimization problems. Thus, performances of MGA for the typical mathematical problems are investigated and compared with those of conventional algorithms such as SGA, micro genetic algorithm (${\mu}GA$), and SA. And, for better application of MGA, the effects of acceptance level are also presented. From numerical Study, it is again verified that MGA is more efficient and robust than SA, SGA and ${\mu}GA$ in the solution of mathematical optimization problems having various features.

  • PDF

A Robust Design of Simulated Annealing Approach : Mixed-Model Sequencing Problem (시뮬레이티드 어닐링 알고리듬의 강건설계 : 혼합모델 투입순서 결정문제에 대한 적용)

  • Kim, Ho-Gyun;Paik, Chun-Hyun;Cho, Hyung-Soo
    • IE interfaces
    • /
    • v.15 no.2
    • /
    • pp.189-198
    • /
    • 2002
  • Simulated Annealing(SA) approach has been successfully applied to the combinatorial optimization problems with NP-hard complexity. To apply an SA algorithm to specific problems, generic parameters as well as problem-specific parameters must be determined. To overcome the embedded nature of SA, long computational time, some studies suggested the parameter design methods of determining SA related parameters. In this study, we propose a new parameter design approach based on robust design method. To show the effectiveness of the proposed method, the extensive computation experiments are conducted on the mixed-model sequencing problems.

Sliding Mode Control for Robot Manipulator Usin Evolution Strategy (Evolution Strategy를 이용한 로봇 매니퓰레이터의 슬라이딩 모드 제어)

  • 김현식;박진현;최영규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.379-382
    • /
    • 1996
  • Evolution Strategy is used as an effective search algorithm in optimization problems and Sliding Mode Control is well known as a robust control algorithm. In this paper, we propose a Sliding Mode Control Method for robot manipulator using Evolution Strategy. Evolution Strategy is used to estimate Sliding Mode Control Parameters such as sliding surface gradient, continuous function boundary layer, unknown plant parameters and switching gain. Experimental results show the proposed control scheme has accurate and robust performances with effective search ability.

  • PDF

Efficient Robust Design Optimization Using Statistical Moments Based on Multiplicative Decomposition Method (곱분해 기법 기반의 통계 모멘트를 이용한 효율적인 강건 최적설계)

  • Cho, Su-Gil;Lee, Min-Uk;Lee, Tae-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.10
    • /
    • pp.1109-1114
    • /
    • 2012
  • The performance of a system can be affected by various variables such as manufacturing tolerances, uncertainties of material properties, and environmental factors acting on the system. Robust design optimization has attracted much attention in the design of products because it can find the best design solution that minimizes the variance of the response while considering the distribution of the variables. However, the computational cost and accuracy of optimization have thus far been a challenging problem. In this study, robust design optimization using the multiplicative decomposition method is proposed in order to solve these problems. Because the proposed method calculates the mean and variance of the system directly from the kriging metamodel using the multiplicative decomposition method, it can be used to search for a robust optimum design accurately and efficiently. Several mathematical and engineering examples are used to demonstrate the feasibility of the proposed method.

Global Optimization of Composite Structures Using Triangular Patch Algorithm (삼각 패치 알고리듬을 이용한 복합 재료 구조물의 전체 최적화)

  • O, Seung-Hwan;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.4
    • /
    • pp.671-684
    • /
    • 2001
  • Several design problems of composite structures are studied via a global optimizer based on attraction regions. MSC/NASTRAN is adopted for static and eigenvalue analysis. The method of modified feasible direction in DOT is used for local optimization. Through the review of global optimization algorithms, the triangular patch algorithm is selected because the algorithm is known to be efficient, robust and powerful for general nonlinear optimization problems. For general applicability, various mechanical properties are considered as design objectives; strain energy, eigenvalue, weight, displacement, and buckling load. In all cases considered, the triangular patch algorithm results in a lot of optimum points and useful design patterns, that are not easy by local algorithms or conventional global algorithms can be determined.