首页|General Pattern and Neighborhood Search Algorithms for Non-Convex Unit Commitment
General Pattern and Neighborhood Search Algorithms for Non-Convex Unit Commitment
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
维普
This paper presents a new approach to solve mixed-variable unit commitment (UC) problems with non-smooth cost functions based on a generalized pattern search filter (GPS-filter) algorithm.A GPS-filter algorithm does not require any information about the gradient of the objective function while searching for an optimum solution.At the same time,it is available for solving mixed-variable optimization problems,which is very suitable for UC.A new suitable discrete neighborhood structure with UC characteristics is proposed to improve GPS-filter efficiently.A lot of multiple units' states are fixed before search; hence,the polling search of discrete variable is efficient for a few uncertain units.Numerical experiments are included to demonstrate the proposed approach's ability to handle the highly nonlinear,discontinuous,non-smooth cost functions and mixed variables of the UC problem.
optimal power system operationpattern search methodfilter methodunit commitmentneighborhood search
Li Jinghua、Lan Fei
展开 >
College of Electric Engineering, Guangxi University
Project Supported by National Natural Science Foundation of China
NETL
NSTL
万方数据
维普
