• 제목/요약/키워드: Multi-objective Programming

검색결과 161건 처리시간 0.026초

Electricity Cost Minimization for Delay-tolerant Basestation Powered by Heterogeneous Energy Source

  • Deng, Qingyong;Li, Xueming;Li, Zhetao;Liu, Anfeng;Choi, Young-june
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권12호
    • /
    • pp.5712-5728
    • /
    • 2017
  • Recently, there are many studies, that considering green wireless cellular networks, have taken the energy consumption of the base station (BS) into consideration. In this work, we first introduce an energy consumption model of multi-mode sharing BS powered by multiple energy sources including renewable energy, local storage and power grid. Then communication load requests of the BS are transformed to energy demand queues, and battery energy level and worst-case delay constraints are considered into the virtual queue to ensure the network QoS when our objective is to minimize the long term electricity cost of BSs. Lyapunov optimization method is applied to work out the optimization objective without knowing the future information of the communication load, real-time electricity market price and renewable energy availability. Finally, linear programming is used, and the corresponding energy efficient scheduling policy is obtained. The performance analysis of our proposed online algorithm based on real-world traces demonstrates that it can greatly reduce one day's electricity cost of individual BS.

하이브리드 알고리즘을 응용하여 안전도제약을 만족시키는 최적전력조류 (Security Constrained Optimal Power Flow by Hybrid Algorithms)

  • 김규호;이상봉;이재규;유석구
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권6호
    • /
    • pp.305-311
    • /
    • 2000
  • This paper presents a hybrid algorithm for solving optimal power flow(OPF) in order to enhance a systems capability to cope with outages, which is based on combined application of evolutionary computation and local search method. The efficient algorithm combining main advantages of two methods is as follows : Firstly, evolutionary computation is used to perform global exploitation among a population. This gives a good initial point of conventional method. Then, local methods are used to perform local exploitation. The hybrid approach often outperforms either method operating alone and reduces the total computation time. The objective function of the security constrained OPF is the minimization of generation fuel costs and real power losses. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). In OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The method proposed is applied to IEEE 30 buses system to show its effectiveness.

  • PDF

배전계통에서 부하불평형을 고려한 분산형 전원의 운영 계획 (Planning for Operation of Dispersed Generation Systems considering Load Unbalance in Distribution Systems)

  • 이유정;유석구
    • 조명전기설비학회논문지
    • /
    • 제17권5호
    • /
    • pp.118-125
    • /
    • 2003
  • 본 연구에서는 배전계통에서 부하불평형을 고려한 분산형 전원의 운영에 대한 계획을 제안하였다. 또한, 배전계통의 실제 부하구성 분포를 고려하기 위하여 부하모형은 가정용, 산업용, 상업용, 사무용 및 농업용 부하 등의 집단 부하로 모형화 하였다. 또한, 목적함수로는 계통 유효전력손실을 사용하였고 분산형전원의 수 또는 총용량 및 모선 전압을 제약조건으로 정식화하였으며, 이 목적함수와 제약조건에 대한 부정확한 성질을 평가하기 위하여 퍼지 Goal Programing으로 모델링 하였으며, GA를 사용하여 최적해를 탐색하였다.

선수제약 다기간 선형계획 배낭문제 (The Cardinality Constrained Multi-Period Linear Programming Knapsack Problem)

  • 원중연
    • 산업경영시스템학회지
    • /
    • 제38권4호
    • /
    • pp.64-71
    • /
    • 2015
  • In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ${\cdots}$, m. The total production time for periods from 1 to i is given by $b_i$ for each i = 1, ${\cdots}$, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[$O(n^2logn)$, $O(mn^2)$] where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

표적군 기반 공격 편대군 조합 최적화 모형 (Combinatorial Optimization Model of Air Strike Packages based on Target Groups)

  • 조상현;이문걸;장영배
    • 대한산업공학회지
    • /
    • 제42권6호
    • /
    • pp.386-394
    • /
    • 2016
  • In this research, in order to optimize the multi-objective function effectively, we suggested the optimization model to maximize the total destruction of ground targets and minimize the total damage of aircrafts and cost of air munitions by using goal programming. To satisfy the various variables and constraints of this mathematical model, the concept of air strike package is applied. As a consequence, effective attack can be possible by identifying the prior ground targets more quickly. This study can contribute to maximize the ROK air force's combat power and preservation of high value air asset in the war.

주간 단위로한 확률론적 년간 최적 저수지 경제 운용에 관한 연구 (A Study on Optimal Economic Operation of Hydro-reservoir System by Stochastic Dynamic Programming with Weekly Interval)

  • 송영길;김영태;한병률
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 정기총회 및 창립40주년기념 학술대회 학회본부
    • /
    • pp.106-108
    • /
    • 1987
  • Until now, inflow has been handled an independent log-normal random variable in the problem of planning the long-term operation of a multi-reservoir hydrothermal electric power generation system. This paper introduces the detail study for making rule curve by applying weekly time interval for handling inflows. The hydro system model consists of a set of reservoirs and ponds. Thermal units are modeld by one equivalent thermal unit. Objective is minimizing the total cost that the summation of the fuel cost of equivalent thermal unit at each time interval. For optimization, stochastic dynamic programming(SDP) algorithm using successive approximations is used.

  • PDF

Multi-Objective Soft Computing-Based Approaches to Optimize Inventory-Queuing-Pricing Problem under Fuzzy Considerations

  • Alinezhad, Alireza;Mahmoudi, Amin;Hajipour, Vahid
    • Industrial Engineering and Management Systems
    • /
    • 제15권4호
    • /
    • pp.354-363
    • /
    • 2016
  • Due to uncertain environment, various parameters such as price, queuing length, warranty, and so on influence on inventory models. In this paper, an inventory-queuing-pricing problem with continuous review inventory control policy and batch arrival queuing approach, is presented. To best of our knowledge, (I) demand function is stochastic and price dependent; (II) due to the uncertainty in real-world situations, a fuzzy programming approach is applied. Therefore, the presented model with goal of maximizing total profit of system analyzes the price and order quantity decision variables. Since the proposed model belongs to NP-hard problems, Pareto-based approaches based on non-dominated ranking and sorting genetic algorithm are proposed and justified to solve the model. Several numerical illustrations are generated to demonstrate the model validity and algorithms performance. The results showed the applicability and robustness of the proposed soft-computing-based approaches to analyze the problem.

자기 조직화 맵을 이용한 강화학습 제어기 설계 (Design of Reinforcement Learning Controller with Self-Organizing Map)

  • 이재강;김일환
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권5호
    • /
    • pp.353-360
    • /
    • 2004
  • This paper considers reinforcement learning control with the self-organizing map. Reinforcement learning uses the observable states of objective system and signals from interaction of the system and environment as input data. For fast learning in neural network training, it is necessary to reduce learning data. In this paper, we use the self-organizing map to partition the observable states. Partitioning states reduces the number of learning data which is used for training neural networks. And neural dynamic programming design method is used for the controller. For evaluating the designed reinforcement learning controller, an inverted pendulum on the cart system is simulated. The designed controller is composed of serial connection of self-organizing map and two Multi-layer Feed-Forward Neural Networks.

빔 혹은 멤버레인 구조를 가지는 써모파일 센서의 다목적 최적설계 (The Multi-objective Optimal Design of Thermopile Sensor Having Beam or Membrane Structure)

  • 이준배;김태윤
    • 센서학회지
    • /
    • 제6권1호
    • /
    • pp.6-15
    • /
    • 1997
  • 이 논문은 빔의 구조를 갖거나 멤브레인의 구조를 갖는 써모파일 센서의 다목적 최적설계에 관한 연구이다. 연구대상의 써모파일 센서는 $Si_{3}N_{4}/SiO_{2}$ 박막위에 알루미늄과 다결정 실리콘을 사용하여 열전쌍을 형성하고, 박막중심부에 $RuO_{2}$를 사용하여 적외선 흡수부를 만들어 중심부와 실리콘림부 사이의 온도차이에 따른 Seebeck 효과에 의한 유기전압을 감지하는 센서를 대상으로 하였다. 최적설계의 목적함수는 센서의 감도, 검출능 (detectivity) 및 열시정수를 대상으로 하였다. 패키지를 고려하여 모델링을 하였으며, 기존의 식의 고찰에 의한 단순 설계방법이 아닌 수학적 계획법을 사용한 다목적 최적화 방법을 이용하여 최적해를 구하였다. 최종적인 최적설계 수식화에는 퍼지계획법에서 사용되는 소속함수를 정의하여 설계자가 우선적으로 신뢰할 수 있는 해를 구 할 수 있도록 하였다. 또한, 제한조건으로서 주위 온도변화에 따른 센서의 출력전압변화를 포함시켜 실제 사용되는 환경을 고려하였다.

  • PDF

Comparative Analysis of Optimization Algorithms and the Effects of Coupling Hedging Rules in Reservoir Operations

  • Kim, Gi Joo;Kim, Young-Oh
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2021년도 학술발표회
    • /
    • pp.206-206
    • /
    • 2021
  • The necessity for appropriate management of water resources infrastructures such as reservoirs, levees, and dikes is increasing due to unexpected hydro-climate irregularities and rising water demands. To meet this need, past studies have focused on advancing theoretical optimization algorithms such as nonlinear programming, dynamic programming (DP), and genetic programming. Yet, the optimally derived theoretical solutions are limited to be directly implemented in making release decisions in the real-world systems for a variety of reasons. This study first aims to comparatively analyze the two prominent optimization methods, DP and evolutionary multi-objective direct policy search (EMODPS), under historical inflow series using K-fold cross validation. A total of six optimization models are formed each with a specific formulation. Then, one of the optimization models was coupled with the actual zone-based hedging rule that has been adopted in practice. The proposed methodology was applied to Boryeong Dam located in South Korea with conflicting objectives between supply and demand. As a result, the EMODPS models demonstrated a better performance than the DP models in terms of proximity to the ideal. Moreover, the incorporation of the real-world policy with the optimal solutions improved in all indices in terms of the supply side, while widening the range of the trade-off between frequency and magnitude measured in the sides of demand. The results from this study once again highlight the necessity of closing the gap between the theoretical solutions with the real-world implementable policies.

  • PDF