• 제목/요약/키워드: Constraint Optimization Problem

검색결과 346건 처리시간 0.025초

Topology Optimization of Plane Structures using Modal Strain Energy for Fundamental Frequency Maximization

  • Lee, Sang-Jin;Bae, Jung-Eun
    • Architectural research
    • /
    • 제12권1호
    • /
    • pp.39-47
    • /
    • 2010
  • This paper describes a topology optimization technique which can maximize the fundamental frequency of the structures. The fundamental frequency maximization is achieved by means of the minimization of modal strain energy as an inverse problem so that the strain energy based resizing algorithm is directly used in this study. The strain energy to be minimized is therefore employed as the objective function and the initial volume of structures is used as the constraint function. Multi-frequency problem is considered by the introduction of the weight which is used to combine several target modal strain energy terms into one scalar objective function. Several numerical examples are presented to investigate the performance of the proposed topology optimization technique. From numerical tests, it is found to be that the proposed optimization technique is extremely effective to maximize the fundamental frequency of structure and can successfully consider the multi-frequency problems in the topology optimization process.

Two-Dimensional Trajectory Optimization for Soft Lunar Landing Considering a Landing Site

  • Park, Bong-Gyun;Ahn, Jong-Sun;Tahk, Min-Jea
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제12권3호
    • /
    • pp.288-295
    • /
    • 2011
  • This paper addresses minimum-fuel, two-dimensional trajectory optimization for a soft lunar landing from a parking orbit to a desired landing site. The landing site is usually not considered when performing trajectory optimization so that the landing problem can be handled. However, for precise trajectories for landing at a desired site to be designed, the landing site has to be considered as the terminal constraint. To convert the trajectory optimization problem into a parameter optimization problem, a pseudospectral method was used, and C code for feasible sequential quadratic programming was used as a numerical solver. To check the reliability of the results obtained, a feasibility check was performed.

Jaya algorithm to solve single objective size optimization problem for steel grillage structures

  • Dede, Tayfun
    • Steel and Composite Structures
    • /
    • 제26권2호
    • /
    • pp.163-170
    • /
    • 2018
  • The purpose of this paper is to present a new and efficient optimization algorithm called Jaya for optimum design of steel grillage structure. Constrained size optimization of this type of structure based on the LRFD-AISC is carried out with integer design variables by using cross-sectional area of W-shapes. The objective function of the problem is to find minimum weight of the grillage structure. The maximum stress ratio and the maximum displacement in the inner point of steel grillage structure are taken as the constraint for this optimization problem. To calculate the moment and shear force of the each member and calculate the joint displacement, the finite elements analysis is used. The developed computer program for the analysis and design of grillage structure and the optimization algorithm for Jaya are coded in MATLAB. The results obtained from this study are compared with the previous works for grillage structure. The results show that the Jaya algorithm presented in this study can be effectively used in the optimal design of grillage structures.

부등호 제약조건 처리 알고리즘 개발 및 전력계통 해석 적용 (A Development of Inequality Constrained Algorithm and Applying to Power System Analysis)

  • 양민욱;김건중
    • 전기학회논문지
    • /
    • 제62권10호
    • /
    • pp.1349-1353
    • /
    • 2013
  • The optimal analysis has objective functions, equality constraint functions and inequality functions. Objective functions may be used with inequality function, because occasionally variables are moved to non-analytic condition with calculating objective functions. But inequality constraint functions are very complicated problem in a optimal analysis. this paper suggest a method to solve inequality constraint functions.

Quasiconcave Bilevel Programming Problem

  • Arora S.R.;Gaur Anuradha
    • Management Science and Financial Engineering
    • /
    • 제12권1호
    • /
    • pp.113-125
    • /
    • 2006
  • Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

구속된 다물체 시스템에 대한 운동 방정식의 미분 방정식화 및 동역학 해석 (A Formulation of the Differential Equation on the Equations of Motion and Dynamic Analysis for the Constrained Multibody Systems)

  • 이동찬;이상호;한창수
    • 한국자동차공학회논문집
    • /
    • 제5권1호
    • /
    • pp.154-161
    • /
    • 1997
  • This paper presents the method to eliminate the constraint reaction in the Lagrange multiplier form equation of motion by using a generalized coordinate driveder from the velocity constraint equation. This method introduces a matrix method by considering the m dimensional space spanned by the rows of the constraint jacobian matrix. The orthogonal vectors defining the constraint manifold are projected to null vectors by the tangential vectors defined on the constraint manifold. Therefore the orthogonal projection matrix is defined by the tangential vectors. For correcting the generalized position coordinate, the optimization problem is formulated. And this correction process is analyzed by the quasi Newton method. Finally this method is verified through 3 dimensional vehicle model.

  • PDF

DIntrusion Detection in WSN with an Improved NSA Based on the DE-CMOP

  • Guo, Weipeng;Chen, Yonghong;Cai, Yiqiao;Wang, Tian;Tian, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5574-5591
    • /
    • 2017
  • Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.

ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Son, Pham Tien
    • 대한수학회보
    • /
    • 제51권1호
    • /
    • pp.287-301
    • /
    • 2014
  • In this paper, we prove a necessary optimality theorem for a nonsmooth optimization problem in the face of data uncertainty, which is called a robust optimization problem. Recently, the robust optimization problems have been intensively studied by many authors. Moreover, we give examples showing that the convexity of the uncertain sets and the concavity of the constraint functions are essential in the optimality theorem. We present an example illustrating that our main assumptions in the optimality theorem can be weakened.

FPSO Riser 지지구조의 설계최적화에 대한 근사화 기법의 비교 연구 (A Comparative Study of Approximation Techniques on Design Optimization of a FPSO Riser Support Structure)

  • 심천식;송창용
    • 한국전산구조공학회논문집
    • /
    • 제24권5호
    • /
    • pp.543-551
    • /
    • 2011
  • 본 논문에서는 해양작업 상태의 하중조건을 고려한 부유식 원유생산 저장 하역장치에 설치된 라이져 보강구조의 강도설계에 관련하여 다양한 근사화 기법 기반 설계최적화 및 그 성능을 비교하고자 한다. 설계최적화 문제는 하중조건별 구조강도의 제한조건 하에서 중량을 최소화하여 설계변수인 구조 부재치수가 결정되도록 정식화된다. 비교 연구를 위해 사용된 근사화 기법은 반응표면법 기반 순차적 근사최적화(RBSAO), 크리깅 기반 순차적 근사최적화(KBSAO), 그리고 개선된 이동최소자승법(MLSM) 기반 근사최적화 기법인 CF-MLSM와 Post-MLSM이다. RBSAO와 KBSAO의 적용을 위하여 상용프로세스 통합 설계최적화(PIDO) 코드를 사용하였다. 본 연구에 적용한 MLSM 기반 근사최적화 기법들은 제한조건의 가용성을 보장할 수 있도록 새롭게 개발되었다. 다양한 근사화 모델 기반 설계최적화 기법에 의한 결과는 설계 해의 개선 및 수렴속도 등의 수치적 성능을 기준으로 실제 비근사 설계최적화 결과와 비교 검토하였다.

설계 민감도와 신뢰도 분석에 근거한 전자기기의 다목적 최적화 (Multi-Objective Optimization of Electromagnetic Device Based on Design Sensitivity Analysis and Reliability Analysis)

  • 렌지얀;장전해;박찬혁;고창섭
    • 전기학회논문지
    • /
    • 제62권1호
    • /
    • pp.49-56
    • /
    • 2013
  • In this paper, for constrained optimization problem, one multi-objective optimization algorithm that ensures both performance robustness and constraint feasibility is proposed when uncertainties are involved in design variables. In the proposed algorithm, the gradient index of objective function assisted by design sensitivity with the help of finite element method is applied to evaluate robustness; the reliability calculated by the sensitivity-assisted Monte Carlo simulation method is used to assess the feasibility of constraint function. As a demonstration, the performance and numerical efficiency of the proposed method is investigated through application to the optimal design of TEAM problem 22--a superconducting magnetic energy storage system.