• 제목/요약/키워드: Constrained problem

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

Noisy 한 CFD 결과에 대한 구속조건을 고려한 EGO 방법 연구 (A STUDY ON CONSTRAINED EGO METHOD FOR NOISY CFD DATA)

  • 배효길;권장혁
    • 한국전산유체공학회지
    • /
    • 제17권4호
    • /
    • pp.32-40
    • /
    • 2012
  • Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

확장된 일반상한제약을 갖는 이차원 선형계획 배낭문제 연구 (On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB Constrain)

  • 원중연
    • 대한산업공학회지
    • /
    • 제27권1호
    • /
    • pp.25-29
    • /
    • 2001
  • We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

  • PDF

PC 클러스터 기반의 Multi-HPSO를 이용한 안전도 제약의 경제급전 (The Security Constrained Economic Dispatch with Line Flow Constraints using the Multi PSO Algorithm Based on the PC Cluster System)

  • 장세환;김진호;박종배;박준호
    • 전기학회논문지
    • /
    • 제58권9호
    • /
    • pp.1658-1666
    • /
    • 2009
  • This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.

Resource-constrained Scheduling at Different Project Sizes

  • Lazari, Vasiliki;Chassiakos, Athanasios;Karatzas, Stylianos
    • 국제학술발표논문집
    • /
    • The 9th International Conference on Construction Engineering and Project Management
    • /
    • pp.196-203
    • /
    • 2022
  • The resource constrained scheduling problem (RCSP) constitutes one of the most challenging problems in Project Management, as it combines multiple parameters, contradicting objectives (project completion within certain deadlines, resource allocation within resource availability margins and with reduced fluctuations), strict constraints (precedence constraints between activities), while its complexity grows with the increase in the number of activities being executed. Due to the large solution space size, this work investigates the application of Genetic Algorithms to approximate the optimal resource alolocation and obtain optimal trade-offs between different project goals. This analysis uses the cost of exceeding the daily resource availability, the cost from the day-by-day resource movement in and out of the site and the cost for using resources day-by-day, to form the objective cost function. The model is applied in different case studies: 1 project consisting of 10 activities, 4 repetitive projects consisting of 40 activities in total and 16 repetitive projects consisting of 160 activities in total, in order to evaluate the effectiveness of the algorithm in different-size solution spaces and under alternative optimization criteria by examining the quality of the solution and the required computational time. The case studies 2 & 3 have been developed by building upon the recurrence of the unit/sub-project (10 activities), meaning that the initial problem is multiplied four and sixteen times respectively. The evaluation results indicate that the proposed model can efficiently provide reliable solutions with respect to the individual goals assigned in every case study regardless of the project scale.

  • PDF

유전해법을 이용한 비선형최적화 문제의 효율적인 해법 (An Efficient Method for Nonlinear Optimization Problems using Genetic Algorithms)

  • 임승환;이동춘
    • 산업경영시스템학회지
    • /
    • 제20권44호
    • /
    • pp.93-101
    • /
    • 1997
  • This paper describes the application of Genetic Algorithms(GAs) to nonlinear constrained mixed optimization problems. Genetic Algorithms are combinatorial in nature, and therefore are computationally suitable for treating discrete and integer design variables. But, several problems that conventional GAs are ill defined are application of penalty function that can be adapted to transform a constrained optimization problem into an unconstrained one and premature convergence of solution. Thus, we developed an improved GAs to solve this problems, and two examples are given to demonstrate the effectiveness of the methodology developed in this paper.

  • PDF

Hopfield neuron based nonlinear constrained programming to fuzzy structural engineering optimization

  • Shih, C.J.;Chang, C.C.
    • Structural Engineering and Mechanics
    • /
    • 제7권5호
    • /
    • pp.485-502
    • /
    • 1999
  • Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

부등호 제약조건 처리 알고리즘 개발 및 전력계통 해석 적용 (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.

구속표면을 가지는 반무한체에 대한 평저펀치의 압입의 연구 (Study of flat punch indentation to semi-infinite body with lpartially constrained free surface by moire method)

  • 김동원
    • 대한기계학회논문집
    • /
    • 제3권4호
    • /
    • pp.164-172
    • /
    • 1979
  • Experimental and numerical results concerning the flat punch indentation to semi-infinite body with partially constrained free surface are presented The distributions of slip line directions are predicted by Moire fringe analysis using Vinckier's method. A mumerical study is made of the same problem by finite element method and the results are compared with the experimental results. It is shown that the contour feature of possible slip line field is similar to that of well-known Prandtl indentation sloution.

OPTIMAL CONDITIONS FOR ENDPOINT CONSTRAINED OPTIMAL CONTROL

  • Kim, Kyung-Eung
    • 대한수학회보
    • /
    • 제45권3호
    • /
    • pp.563-571
    • /
    • 2008
  • We deduce the necessary conditions for the optimality of endpoint constrained optimal control problem. These conditions comprise the adjoint equation, the maximum principle and the transversality condition. We assume that the cost function is merely differentiable. Therefore the technique under Lipschitz continuity hypothesis is not directly applicable. We introduce Fermat's rule and value function technique to obtain the results.

원전 증기발생기 수위제어를 위한 MPC 제어기 개발 (The devlepment of a MPC controller for water level control in the steam generator of a nuclear power plant)

  • 손덕현;한진욱;이환섭;이창구
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.359-359
    • /
    • 2000
  • Generally, level control in the steam generator of a nuclear power plant is difficulty process control, because the low power operating can lead nonminimum phase characteristics(swell and shrink phenomenon) and flow measurement are unreliable and nonlinear characteristics. This paper presents a framework for solving this problem based on the constrained linear model predictive control and introduces the design of method for the level of the controller in the entire operating power of the steam generator, and compares with conventional PI controller.

  • PDF