• 제목/요약/키워드: Chance-constrained model

검색결과 20건 처리시간 0.024초

Dynamic Economic Dispatch for Microgrid Based on the Chance-Constrained Programming

  • Huang, Daizheng;Xie, Lingling;Wu, Zhihui
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권3호
    • /
    • pp.1064-1072
    • /
    • 2017
  • The power of controlled generators in microgrids randomly fluctuate because of the stochastic volatility of the outputs of photovoltaic systems and wind turbines as well as the load demands. To address and dispatch these stochastic factors for daily operations, a dynamic economic dispatch model with the goal of minimizing the generation cost is established via chance-constrained programming. A Monte Carlo simulation combined with particle swarm optimization algorithm is employed to optimize the model. The simulation results show that both the objective function and constraint condition have been tightened and that the operation costs have increased. A higher stability of the system corresponds to the higher operation costs of controlled generators. These operation costs also increase along with the confidence levels for the objective function and constraints.

A New Solution for Stochastic Optimal Power Flow: Combining Limit Relaxation with Iterative Learning Control

  • Gong, Jinxia;Xie, Da;Jiang, Chuanwen;Zhang, Yanchi
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권1호
    • /
    • pp.80-89
    • /
    • 2014
  • A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit relaxation approach narrows the solution space by introducing regulatory factors, according to the relationship between the constraint equations and the optimization variables. The regulatory factors are designed by ILC method to ensure the optimality of final solution under a predefined confidence level. The optimization algorithm for S-OPF is completed based on the combination of limit relaxation and ILC and tested on the IEEE 14-bus system.

다중 평가지표에 기반한 도로용량 증대 소요예산 추정 (Budget Estimation Problem for Capacity Enhancement based on Various Performance Criteria)

  • 김주영;이상민;조종석
    • 대한교통학회지
    • /
    • 제26권5호
    • /
    • pp.175-184
    • /
    • 2008
  • 도로용량 증대를 위한 소요예산 추정문제는 관련주체인 이용자와 공급자의 입장을 모두 반영할 필요가 있다. 본 연구에서는 총통행시간, 형평성, 환경비용을 평가지표로 설정하고, 3가지 평가지표에 대한 관련주체의 요구사항이 만족되는 대안 중 소요예산을 최소화하는 최적 도로용량 증대 대안을 선정하는 문제를 모형화하였다. 일반적으로 도로용량 증대를 위한 소요예산 추정문제는 Network Design Problem(NDP)로 다루어지며, 이용자와 공급자의 다른 입장을 고려하기 위해 Bi-level 최적화문제로 모형화된다. 본 연구에서는 장래 교통수요의 불확실성을 반영하기 위해 확률모형(Stochastic model)을 적용하고, 평가지표별 신뢰도를 차별화하기 위해 Chance-constrained model(CCM)를 적용하였으며, 3가지 평가지표의 제약식을 만족하면서 소요예산을 최소화하는 목적함수를 만족하는 최적대안을 선정하기 위해 렉시코그라픽(Lexicographic) 최적화문제로 접근하였다. 예제 네트워크를 통하여 분석한 결과, 평가지표별 신뢰도 및 교통수요 변화율이 클수록 더욱 많은 소요예산이 요구되며, 평가지표별 신뢰도가 클수록 장래 교통수요의 변화에 더욱 탄력적으로 대응할 수 있는 대안이 선정되었다. 제안된 모델은 다양한 관련주체의 입장을 모두 고려한 최적 도로용량 증대 대안과 소요예산을 선정함과 동시에, 도로용량 증대량의 변화에 따른 평가지표간 상쇄관계(Tradeoff)와 도로 네트워크 개선을 위한 예산 배분의 포트폴리오를 정책결정자에게 제공 가능하다.

SCHEDULING REPETITIVE PROJECTS WITH STOCHASTIC RESOURCE CONSTRAINTS

  • I-Tung Yang
    • 국제학술발표논문집
    • /
    • The 1th International Conference on Construction Engineering and Project Management
    • /
    • pp.881-885
    • /
    • 2005
  • Scheduling repetitive projects under limitations on the amounts of available resources (labor and equipment) has been an active subject because of its practical relevance. Traditionally, the limitation is specified as a deterministic (fixed) number, such as 1000 labor-hours. The limitation, however, is often exposed to uncertainty and variability, especially when the project is lengthy. This paper presents a stochastic optimization model to treat the situations where the limitations of resources are expressed as probability functions in lieu of deterministic numbers. The proposed model transfers each deterministic resource constraint into a corresponding stochastic one and then solves the problem by the use of a chance-constrained programming technique. The solution is validated by comparison with simulation results to show that it can satisfy the resource constraints with a probability beyond the desired confidence level.

  • PDF

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.

확률제약 계획모형법을 이용한 농업용수의 경제적 가치 평가 (Valuation of Irrigation Water: A Chance-Constrained Programming Approach)

  • 권오상;이태호;허정회
    • 한국수자원학회논문집
    • /
    • 제42권4호
    • /
    • pp.281-295
    • /
    • 2009
  • 본고는 경제적 최적화모형인 확률제약 계획모형법을 이용하여, 농업용수 부존량 감소에 따른 농업이윤의 감소분을 계측하고 이를 통해 농업용수의 경제적 가치를 분석하고자 한다. 이를 위해 국가 전체 농업자원배분을 최적화 모형으로 구축하고, 농업용수를 포함하는 자원부존제약조건과, 각 상품의 가격이 형성되는 시장조건, 국제무역 및 관련정책변수의 영향들을 반영하고, 용수의 경우 그 이용량이 연도별로 불안정할 수 있다는 것까지 반영한다. 농업용수감소량이 농업부문 이윤에 미치는 영향을 시나리오를 주어 분석하면, 농업용수의 톤당 경제적 가치는 $303{\sim}1,093$원/$m^3$의 분포를 가지는 것으로 나타난다. 동일한 양의 용수량이 줄어들더라도 용수의 공급이 불안정할수록 경제적 가치 손실이 크며, 아울러 많은 양의 용수손실이 발생할수록 경제적 손실이 커 용수감소의 한계피해는 용수감소량의 증가 함수인 것으로 파악된다.

확률제약조건계획법(確率制約條件計劃法)을 이용(利用)한 자본예산모형(資本豫算模型) (A New Chance-Constrained Programming Approach to Capital Budgeting)

  • 이주호
    • 대한산업공학회지
    • /
    • 제6권2호
    • /
    • pp.21-29
    • /
    • 1980
  • 본(本) 연구(硏究)는 투자안(投資案)들간의 상호관계(相互關係) 및 위험(危險)을 고려한 자본예산문제(資本豫算問題)를 다루고 있다. 기존(旣存)의 개발(開發)된 모형(模型)은 확률제약조건계획모형(確率制約條件計劃模型) 및 기대효용극대화모형(期待效用極大化模型)의 두 범주(範疇)로 구분(區分)될 수 있다. 전자의 경우 목적함수(目的凾數)가 다소 제약적(制約的)이며 위험(危險)을 직접적인 형태로 고려하지 않고 있는 반면에 후자는 기대효용(期待效用)에 대한 근사치(近似値)를 사용하기 때문에 투자결정(投資決定)이 최적화(最摘化)되지 못할 가능성이 있다. 본(本) 연구(硏究)는 목적함수(目的凾數)를 보다 일반적(一般的)인 형태로 수정(修正) 보완(補完)함으로써 현실적용성(現實適用性)을 높이고자 하였다. 해법절차(解法節次)로는, 자본예산문제(資本豫算問題)를 우선 비선형(非線型) 0-1 정수계획(整數計劃) 문제로 정식화(定式化)하고, 이를 선형(線型) 0-1 정수계획(整數計劃)문제로 변형(變形)하여 원문제(原問題)의 하한(下限)을 찾은 후 B&B 연산법(演算法)으로 원문제(原問題)의 최적해(最適解)를 구하고 있다.

  • PDF

자율주행 버스의 주행 안전을 위한 차량 간 통신 및 모델 예측 제어 기반 종 방향 거동 계획 (Proactive Longitudinal Motion Planning for Improving Safety of Automated Bus using Chance-constrained MPC with V2V Communication)

  • 조아라;유진수;곽지섭;권우진;이경수
    • 자동차안전학회지
    • /
    • 제15권4호
    • /
    • pp.16-22
    • /
    • 2023
  • This paper presents a proactive longitudinal motion planning algorithm for improving the safety of an automated bus. Since the field of view (FOV) of the autonomous vehicle was limited depending on onboard sensors' performance and surrounding environments, it was necessary to implement vehicle-to-vehicle (V2V) communication for overcoming the limitation. After a virtual V2V-equipped target was constructed considering information obtained from V2V communication, the reference motion of the ego vehicle was determined by considering the state of both the V2V-equipped target and the sensor-detected target. Model predictive control (MPC) was implemented to calculate the optimal motion considering the reference motion and the chance constraint, which was deduced from manual driving data. The improvement in driving safety was confirmed through vehicle tests along actual urban roads.

A Multi-period Behavioral Model for Portfolio Selection Problem

  • Pederzoli, G.;Srinivasan, R.
    • 한국경영과학회지
    • /
    • 제6권2호
    • /
    • pp.35-49
    • /
    • 1981
  • This paper is concerned with developing a Multi-period Behavioral Model for the portfolio selection problem. The unique feature of the model is that it treats a number of factors and decision variables considered germane in decision making on an interrelated basis. The formulated problem has the structure of a Chance Constrained programming Model. Then empoloying arguments of Central Limit Theorem and normality assumption the stochastic model is reduced to that of a Non-Linear Programming Model. Finally, a number of interesting properties for the reduced model are established.

  • PDF

0 - 1 목표계획모형의 재구조화에 관한 연구-기회제약계획법(CCP)과 계층화 분석과정(AHP)의 결합 가능성을 중심으로- (A Study of the Reformulation of 0-1 Goal Programming)

  • 이영찬;민재형
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.525-529
    • /
    • 1996
  • Decision environments involve a high degree of uncertainty as well as multiple, conflicting goals. Although traditional goal programming offers a means of considering multiple, conflicting goals and arrives at a satisficing solution in a deterministic manner, its major drawback is that decision makers often specify aspiration level of each goal as a single number. To overcome the problem of setting aspiration levels, chance constrained programming can be incorporated into goal programming formulation so that sampling information can be utilized to describe uncertainty distribution. Another drawback of goal programming is that it does not provide a systematic approach to set priorities and trade-offs among conflicting goals. To overcome this weekness, the analytic hierarchy process(AHP) is used in the model. Also, most goal programming models in the literature are of a linear form, although some nonlinear models have been presented. Consideration of risk in technological coefficients and right hand sides, however, leads to nonlinear goal programming models, which require a linear approximation to be solved. In this paper, chance constrained reformulation with linear approximation is presented for a 0-1 goal programming problem whose technological coefficients and right hand sides are stochastic. The model is presented with a numerical example for the purpose of demonstration.

  • PDF