• Journal of Electrical Engineering and Technology
• /
• 제3권1호
• /
• pp.52-59
• /
• 2008

This paper describes the secant method for solving the economic dispatch (ED) problem with generator constraints and transmission losses. The ED problem is an important optimization problem in the economic operation of a power system. The proposed algorithm involves selection of minimum and maximum incremental costs (lambda values) and then the evaluation of optimal lambda at required power demand is done by secant method. The proposed algorithm has been tested on a power system having 6, 15, and 40 generating units. Studies have been made on the proposed method to solve the ED problem by taking 120 and 200 units with generator constraints. Simulation results of the proposed approach were compared in terms of solution quality, convergence characteristics, and computation efficiency with conventional methods such as lambda iterative method, heuristic methods such as genetic algorithm, and meta-heuristic methods like particle swarm optimization. It is observed from different case studies that the proposed method provides qualitative solutions with less computational time compared to various methods available in the literature.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.266-268
• /
• 2001

As we move to competition, transmission cost become more and more important. At the wholesale competition market, the process of settlement must include the cost of transport. The aim of this paper is to calculate approximate transmission cost at each power sales district office using KEPCO data. We considered investment cost, transmission constraints and marginal losses as cost elements which must be taken into account in transmission cost calculation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5335-5353
• /
• 2019

The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• 조명전기설비학회논문지
• /
• 제24권2호
• /
• pp.16-26
• /
• 2010

본 논문에서 제안하는 전력계통계획 방법론은 계통계획이 신규 자원의 수익에 영향을 미칠 수 있다는 인식 하에 발전 및 송전 투자 결정에 관한 상호 작용을 반영하고, 이것으로 인하여 설비 투자자 및 전력계통계획자의 목적을 동시에 고려할 수 있게 된다. 이러한 관점에서 본 논문은 혼합정수계획 모형에 기초한 전력계통계획 전산모형 프로그램을 개발하고자 한다. 이 소프트웨어는 설비예비율, 발전원별 비율,순동예비력 양, 에너지 및 연료제약 조건, 송전선로 사고 및 손실, 파이 분기 등의 기술적 제약조건을 만족하면서 신규 발전설비, 송전선로, 변전소의 용량뿐만 아니라 건설 시기와 장소를 결정하도록 설계되어 있다. 최종적으로 간단한 Garver 계통을 통하여 본 논문에서 제안된 전산모형 프로그램의 정확성 및 효율성을 검증하고자 한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.739-741
• /
• 2005

The congestion cost caused by transmission capacities is an important issue in a competitive electricity market. To allocate the congestion cost equitably, the active constraints in a constrained dispatch and the sequence of these constraints should be considered. A multi-stage method which was proposed by H.S. Jung reflects the effects of both the active constraints and the sequence. In a multi-stage method, the types of congestion are analyzed in order to consider the sequence, and the relationship between congestion and the active constraints is derived in a mathematical way. But in some cases, the inactive constraints can affect the congestion sequence and it is reasonable to allocate the congestion cost to them.

• Journal of Mechanical Science and Technology
• /
• 제20권6호
• /
• pp.770-781
• /
• 2006

This paper defined design constraints for the compound CVTs (continuously variable trans-missions) by combining power-circulation-mode CVTs and power-split-mode CVTs, which were proposed for connecting 2K-H I-type differential gear to V-belt-type CVU (Continuously Variable Unit). The design constraints are the necessary and sufficient conditions to avoid geometrical interferences among elements in the compound CVTs, and to guarantee smooth assembly between the power-circulation-mode CVT and power-split-mode CVT Two com-pound CVTs were designed and manufactured in accordance with the design constraints. With these compound CVTs, theoretical analysis and performance experiments were conducted. The results showed that the design constraints were valid and effective design method, and that the designed compound CVTs had the improved performance.

• 대한전기학회논문지
• /
• 제37권5호
• /
• pp.272-281
• /
• 1988

The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

• Journal of Electrical Engineering and Technology
• /
• 제10권4호
• /
• pp.1508-1517
• /
• 2015

Optimal Power dispatch is the short-term decision of the optimal output of a number of power generation facilities, to meet the system demand, with the objective of Power dispatching at the lowest possible cost, subject to transmission lines power loss and operational constraints. The operational constraint includes power balance constraint, generator limit constraint, and emission dispatch constraint and valve point effects. In this paper, Opposition based Differential Evolution Algorithm (ODEA) has been proposed to handle the objective function and the operational constraints simultaneously. Furthermore, the valve point loading effects and transmission lines power loss are also considered for the efficient and effective Power dispatch. The ODEA has unique features such as self tuning of its control parameters, self acceleration and migration for searching. As a result, it requires very minimum executions compared with other searching strategies. The effectiveness of the algorithm has been validated through four standard test cases and compared with previous studies. The proposed method out performs the previous methods.

• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.