.png){kind=icon}
返回
Solving Multi-Objective Economic Dispatch Problem Via Semidefinite Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2013.2245688.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a solution formulti-objective economic dispatch problem with transmission losses semidefinite programming (SDP) formulation. The vector objective is reduced to an equivalent scalar objective through the weighted sum method. The resulting optimization problem is formulated as a convex optimization via SDP relaxation. The convex optimization problem was solved to obtain Pareto-optimal solutions. The diversity of the solution set was improved by a nonlinear selection of the weight factor. Simulations were performed on IEEE 30-bus, 57-bus, and 118-bus test systems to investigate the effectiveness of the proposed approach. Solutions were compared to those from one of the well-known evolutionary methods. Results show that SDP has an inherently good convergence property and a lower but comparable diversity property.
Keyword:
Economic dispatch
multi-objective optimization
semidefinite programming (SDP)
weighted sum method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Printable cellulose-based electroconductive composites for sensing elements in paper electronics
OAAI
OAAI分享收藏
查看更多内容