Solving the bi-objective scheduling of switched capacitors using an interactive best-compromise approach

被引:2
作者
Kuo, CC [1 ]
Chang, HC [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Elect Engn, Taipei, Taiwan
关键词
interactive best-compromise; Bi-objective; genetic algorithm; daily scheduling of capacitors; loss minimization; switching operations;
D O I
10.1016/S0378-7796(98)00030-3
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An interactive best-compromise approach together with a new formulation for the bi-objective daily scheduling of switched capacitors is presented. Also, a global optimization technique known as genetic algorithm is applied for optimization applications. It can provide a flexible best-compromise solution as dictated by decision makers of electric utility companies. Quantitative measures can also be supplied to aid the decisionmaking process. The objectives include both concerns of line loss reduction and minimum number of switching operations. Also, the load and operating constraints of the system are considered for increased realism. To demonstrate the effectiveness of the proposed method, comparative studies are conducted on an actual system with rather encouraging results. (C) 1998 Elsevier Science S.A. All rights reserved.
引用
收藏
页码:133 / 140
页数:8
相关论文
共 11 条