期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到834篇文章
< 1 2 … 42 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Quick Method for Judging the Feasibility of Security-Constrained Unit Commitment Problems within Lagrangian Relaxation Framework 认领 引用 被引量：2
1
作者 Sangang Guo 《Energy and Power Engineering》 2012年第6期432-438,共7页
Generally, the procedure for Solving Security constrained unit commitment (SCUC) problems within Lagrangian Relaxation framework is partitioned into two stages: one is to obtain feasible SCUC states;the other is to so... Generally, the procedure for Solving Security constrained unit commitment (SCUC) problems within Lagrangian Relaxation framework is partitioned into two stages: one is to obtain feasible SCUC states;the other is to solve the economic dispatch of generation power among all the generating units. The core of the two stages is how to determine the feasibility of SCUC states. The existence of ramp rate constraints and security constraints increases the difficulty of obtaining an analytical necessary and sufficient condition for determining the quasi-feasibility of SCUC states at each scheduling time. However, a numerical necessary and sufficient numerical condition is proposed and proven rigorously based on Benders Decomposition Theorem. Testing numerical example shows the effectiveness and efficiency of the condition. 展开更多
关键词 Security Constrained Unit Commitment (SCUC) Lagrangian Relaxation Benders Decomposition Feasibility Theorem Ramp Rate Constraint
暂未订购 下载PDF
Extended Sequential Truncation Technique for Adaptive Dynamic Programming Based Security-Constrained Unit Commitment with Optimal Power Flow Constraints 认领 引用
2
作者 Danli Long Hua Wei 《Journal of Power and Energy Engineering》 2014年第4期687-693,共7页
Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to t... Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the “curse of dimension” problem of dynamic programming, the approach solves the Bellman’s equation of SCUC approximately by solving a sequence of simplified single stage optimization problems. An extended sequential truncation technique is proposed to explore the state space of the approach, which is superior to traditional sequential truncation in daily cost for unit commitment. Different test cases from 30 to 300 buses over a 24 h horizon are analyzed. Extensive numerical comparisons show that the proposed approach is capable of obtaining the optimal unit commitment schedules without any network and bus voltage violations, and minimizing the operation cost as well. 展开更多
关键词 Power System Operation and Planning Priority Order Adaptive Dynamic Programming Unit Commitment
暂未订购 下载PDF
Integration of power-to-hydrogen in day-ahead security-constrained unit commitment with high wind penetration 认领 引用 被引量：28
3
作者 Mingfei BAN Jilai YU +1 位作者 Mohammad SHAHIDEHPOUR Yiyun YAO 《Journal of Modern Power Systems and Clean Energy》 SCIE EI 2017年第3期337-349,共13页
The increasing integration of variable wind generation has aggravated the imbalance between electricity supply and demand. Power-to-hydrogen(P2H) is a promising solution to balance supply and demand in a variable powe... The increasing integration of variable wind generation has aggravated the imbalance between electricity supply and demand. Power-to-hydrogen(P2H) is a promising solution to balance supply and demand in a variable power grid, in which excess wind power is converted into hydrogen via electrolysis and stored for later use. In this study, an energy hub(EH) with both a P2H facility(electrolyzer) and a gas-to-power(G2P) facility(hydrogen gas turbine) is proposed to accommodate a high penetration of wind power. The EH is modeled and integrated into a security-constrained unit commitment(SCUC) problem, and this optimization problem is solved by a mixed-integer linear programming(MILP) method with the Benders decomposition technique. Case studies are presented to validate the proposed model and elaborate on the technological potential of integrating P2H into a power system with a high level of wind penetration(HWP). 展开更多
关键词 Electricity and natural gas coordination Power-to-hydrogen(P2H) Wind generation Security-constrained unit commitment(SCUC) Energy hub(EH)
A Comprehensive Review of Security-constrained Unit Commitment 认领 引用 被引量：12
4
作者 Nan Yang Zhenqiang Dong +5 位作者 Lei Wu Lei Zhang Xun Shen Daojun Chen Binxin Zhu Yikui Liu 《Journal of Modern Power Systems and Clean Energy》 SCIE EI CSCD 2022年第3期562-576,共15页
Security-constrained unit commitment(SCUC)has been extensively studied as a key decision-making tool to determine optimal power generation schedules in the operation of electricity market.With the development of emerg... Security-constrained unit commitment(SCUC)has been extensively studied as a key decision-making tool to determine optimal power generation schedules in the operation of electricity market.With the development of emerging power grids,fruitful research results on SCUC have been obtained.Therefore,it is essential to review current work and propose future directions for SCUC to meet the needs of developing power systems.In this paper,the basic mathematical model of the standard SCUC is summarized,and the characteristics and application scopes of common solution algorithms are presented.Customized models focusing on diverse mathematical properties are then categorized and the corresponding solving methodologies are discussed.Finally,research trends in the field are prospected based on a summary of the state-of-the-art and latest studies.It is hoped that this paper can be a useful reference to support theoretical research and practical applications of SCUC in the future. 展开更多
关键词 Security-constrained unit commitment electricity market accurate model AC power flow data-driven
Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment 认领 引用 被引量：4
5
作者 Lu Nan Yikui Liu +2 位作者 Lei Wu Tianqi Liu Chuan He 《Journal of Modern Power Systems and Clean Energy》 SCIE EI CSCD 2021年第6期1458-1467,共10页
Contingency analysis is an important building block in the stability and reliability analysis of power grid operations. However, due to the large number of transmission lines,in practice only a limited number of conti... Contingency analysis is an important building block in the stability and reliability analysis of power grid operations. However, due to the large number of transmission lines,in practice only a limited number of contingencies could be evaluated. This paper proposes a graph theory based N-1 contingency selection method to effectively identify the most critical contingencies, which can be used in security-constrained unit commitment(SCUC) problems to derive secure and economic operation decisions of the power grid. Specifically, the power flow transferring path identification algorithm and the vulnerability index are put forward to rank individual contingencies according to potential transmission line overloads. Effectiveness of the proposed N-1 contingency selection method is quantified by applying the corresponding SCUC solution to the full N-1 security evaluation, i. e., quantifying total post-contingency generation-load imbalance in all N-1 contingencies. Numerical results on several benchmark IEEE systems, including5-bus, 24-bus, and 118-bus systems, show effectiveness of the proposed method. Compared with existing contingency selection methods which usually resort to full power flow calculations,the proposed method relies on power gird topology to effectively identify critical contingencies for facilitating the optimal scheduling of SCUC problems. 展开更多
关键词 Concentric relaxation contingency analysis graph theory security-constrained unit commitment(SCUC) shortest path vulnerability index
A Fast Calculation Method for Long-term Security-constrained Unit Commitment of Large-scale Power Systems with Renewable Energy 认领 引用 被引量：7
6
作者 Qian Yang Jianxue Wang +1 位作者 Hongrui Yin Qingtao Li 《Journal of Modern Power Systems and Clean Energy》 SCIE EI CSCD 2022年第5期1127-1137,共11页
With the increase in the penetration rate of renewable energy, the planning and operation of power systems will face huge challenges. To ensure the sufficient utilization of renewable energy, the reasonable arrangemen... With the increase in the penetration rate of renewable energy, the planning and operation of power systems will face huge challenges. To ensure the sufficient utilization of renewable energy, the reasonable arrangement for the long-term power generation plan has become more crucial. Security-constrained unit commitment(SCUC) is a critical technical means to optimize the long-term power generation plan. However, the plentiful power sources and the complex grid structure in largescale power systems will bring great difficulties to long-term SCUC. In this paper, we propose a fast calculation method for long-term SCUC of large-scale power systems with renewable energy. First, a method for unit status reduction based on temporal decomposition is proposed, which will reduce plenty of binary variables and intertemporal constraints in SCUC. Then,an efficient redundant constraint identification(RCI) method is developed to reduce the number of network constraints. Furthermore, a joint accelerated calculation framework for status reduction and RCI is formed, which can reduce the complexity of long-term SCUC while ensuring a high-precision feasible solution. In case studies, numerical results based on two test systems ROTS2017 and NREL-118 are analyzed, which verify the effectiveness and scalability of the proposed calculation method. 展开更多
关键词 Accelerated calculation framework long-term security-constrained unit commitment(SCUC) redundant constraints identification renewable energy unit status reduction
Security region based security-constrained unit commitment 认领 引用 被引量：8
7
作者 YU YiXin QIN Chao 《Science China(Technological Sciences)》 SCIE EI CAS 2013年第11期2732-2744,共13页
As the issues of security and stability of power systems are becoming increasingly significant,it is necessary to consider the constraints of the static voltage stability and transient stability,which are closely rela... As the issues of security and stability of power systems are becoming increasingly significant,it is necessary to consider the constraints of the static voltage stability and transient stability,which are closely related to the active power dispatch of power systems,in the daily power dispatch,i.e.the unit commitment.However,due to the complexity of these constraints and limitation of the existing analysis methods,there has been no unit commitment model reported so far that can deal with these security constraints.On the other hand,as lack of effective measures to evaluate the security margin of dispatch schemes,it is difficult for power system operators to integrate both the security and economy of power systems in unit commitment.To resolve the above-mentioned issues,a security region based security-constrained unit commitment model is presented in the paper,which gives consideration to both the security and economy of power systems.For the first time,the active power flow constraint,the static voltage stability constraint and the transient stability constraint are taken into account in unit commitment at the same time.The model presented in the paper takes the operating cost,the branch transmission capacity margin,the static voltage stability margin and the transient stability margin as sub-objectives.By adjusting the weighting factors of sub-objectives,it is convenient to adjust the preference on the security and economy of power systems and reach a balance.The IEEE RTS-24 test system is adopted to validate the correctness and the efficiency of the proposed model. 展开更多
关键词 unit commitment security region static voltage stability transient stability multi-objective optimization
暂未订购 下载PDF
Stochastic Security-constrained Unit Commitment Considering Electric Vehicles, Energy Storage Systems, and Flexible Loads with Renewable Energy Resources 认领 引用 被引量：5
8
作者 Ali Gholami Trojani Mahmoud Samiei Moghaddam Javad Mohamadi Baigi 《Journal of Modern Power Systems and Clean Energy》 SCIE EI CSCD 2023年第5期1405-1414,共10页
In this paper, a new formulation for modeling the problem of stochastic security-constrained unit commitment along with optimal charging and discharging of large-scale electric vehicles, energy storage systems, and fl... In this paper, a new formulation for modeling the problem of stochastic security-constrained unit commitment along with optimal charging and discharging of large-scale electric vehicles, energy storage systems, and flexible loads with renewable energy resources is presented. The uncertainty of renewable energy resources is considered as a scenario-based model. In this paper, a multi-objective function which considers the reduction of operation cost, no-load and startup/shutdown costs, unserved load cost, load shifting, carbon emission, optimal charging and discharging of energy storage systems, and power curtailment of renewable energy resources is considered. The proposed formulation is a mixed-integer linear programming(MILP) model, of which the optimal global solution is guaranteed by commercial solvers. To validate the proposed formulation, several cases and networks are considered for analysis, and the results demonstrate the efficiency. 展开更多
关键词 Electric vehicle energy storage system flexible load renewable energy resource unit commitment
Transfer-based Approximate Dynamic Programmingfor Rolling Security-constrained Unit Commitment with Uncertainties 认领 引用 被引量：1
9
作者 Jianquan Zhu Kai Zeng +3 位作者 Jiajun Chen Wenmeng Zhao Wenhao Liu Wenkai Zhu 《Protection and Control of Modern Power Systems》 SCIE EI 2024年第5期42-53,共12页
This paper studies the rolling security-constrained unit commitment(RSCUC)problem with AC power flow and uncertainties.For this NP-hard problem,it is modeled as a Markov decision process,which is then solved by a tran... This paper studies the rolling security-constrained unit commitment(RSCUC)problem with AC power flow and uncertainties.For this NP-hard problem,it is modeled as a Markov decision process,which is then solved by a transfer-based approximate dynamic programming(TADP)algorithm proposed in this paper.Different from traditional approximate dynamic programming(ADP)algorithms,TADP can obtain the commitment states of most units in advance through a decision transfer technique,thus reducing the action space of TADP significantly.Moreover,compared with traditional ADP algorithms,which require to determine the commitment state of each unit,TADP only needs determine the unit with the smallest on-state probability among all on-state units,thus further reducing the action space.The proposed algorithm can also prevent the iter-ative update of value functions and the reliance on rolling forecast information,which makes more sense in the rolling decision-making process of RSCUC.Finally,nu-merical simulations are carried out on a modified IEEE 39-bus system and a real 2778-bus system to demonstrate the effectiveness of the proposed algorithm. 展开更多
关键词 Rolling security-constrained unit com-mitment approximate dynamic programming decision transfer probability-based decision priority criterion uncertainty
Strength-constrained unit commitment in IBR dominant power systems 认领 引用
10
作者 Yong-Kyu Kim Sang-Ho Lee Gyu-Sub Lee 《iEnergy》 EI 2025年第2期121-131,共11页
In this paper,a strength-constrained unit commitment(UC)model incorporating system strength constraints based on the weighted short-circuit ratio(WSCR)is proposed.This model facilitates the comprehensive assessment of... In this paper,a strength-constrained unit commitment(UC)model incorporating system strength constraints based on the weighted short-circuit ratio(WSCR)is proposed.This model facilitates the comprehensive assessment of area-wide system strength in power systems with high inverter-based resource(IBR)penetration,thereby contributing to the mitigation of weak grid issues.Unlike traditional models,this approach considers the interactions among multiple IBRs.The UC problem is initially formulated as a mixed-integer nonlinear programming(MINLP)model,reflecting WSCR and bus impedance matrix modification constraints.To enhance computational tractability,the model is transformed into a mixed-integer linear programming(MILP)form.The effectiveness of the proposed approach is validated through simulations on the IEEE 5-bus,IEEE 39-bus,and a modified Korean power system,demonstrating the ability of the proposed UC model enhancing system strength compared to the conventional methodologies. 展开更多
关键词 Unit commitment system strength inverter-based resource power system stability mixed-integer programming
暂未订购 下载PDF
Problem-structure-informed quantum approximate optimization for large-scale unit commitment with limited qubits 认领 引用
11
作者 Jingxian Zhou Ziqing Zhu +1 位作者 Linghua Zhu Siqi Bu 《iEnergy》 EI 2025年第4期215-218,共4页
As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and soluti... As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex. 展开更多
关键词 Unit commitment problem quadratic unconstrained binary optimization quantum approximate optimization algorithm
暂未订购 下载PDF
Exact quantum algorithm for unit commitment optimization based on partially connected quantum neural networks 认领 引用
12
作者 Jian Liu Xu Zhou +1 位作者 Zhuojun Zhou Le Luo 《Chinese Physics B》 SCIE EI CAS CSCD 2025年第10期303-312,共10页
The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a f... The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a fundamental problem in the field of power systems that aims to satisfy the power balance constraint with minimal cost.In this paper,we focus on the implementation of the UC solution using exact quantum algorithms based on the quantum neural network(QNN).This method is tested with a ten-unit system under the power balance constraint.In order to improve computing precision and reduce network complexity,we propose a knowledge-based partially connected quantum neural network(PCQNN).The results show that exact solutions can be obtained by the improved algorithm and that the depth of the quantum circuit can be reduced simultaneously. 展开更多
关键词 quantum computing quantum algorithm unit commitment quantum neural network noisy intermediate-scale quantum era
暂未订购 下载PDF
Optimal Intelligence Planning of Wind Power Plants and Power System Storage Devices in Power Station Unit Commitment Based 认领 引用 被引量：1
13
作者 Yuchen Hao Dawei Su Zhen Lei 《Energy Engineering》 EI 2022年第5期2081-2104,共24页
Renewable energy sources(RES)such as wind turbines(WT)and solar cells have attracted the attention of power system operators and users alike,thanks to their lack of environmental pollution,independence of fossil fuels... Renewable energy sources(RES)such as wind turbines(WT)and solar cells have attracted the attention of power system operators and users alike,thanks to their lack of environmental pollution,independence of fossil fuels,and meager marginal costs.With the introduction of RES,challenges have faced the unit commitment(UC)problem as a traditional power system optimization problem aiming to minimize total costs by optimally determining units’inputs and outputs,and specifying the optimal generation of each unit.The output power of RES such as WT and solar cells depends on natural factors such as wind speed and solar irradiation that are riddled with uncertainty.As a result,the UC problem in the presence of RES faces uncertainties.The grid consumed load is not always equal to and is randomly different from the predicted values,which also contributes to uncertainty in solving the aforementioned problem.The current study proposes a novel two-stage optimization model with load and wind farm power generation uncertainties for the security-constrained UC to overcome this problem.The new model is adopted to solve the wind-generated power uncertainty,and energy storage systems(ESSs)are included in the problem for further management.The problem is written as an uncertain optimization model which are the stochastic nature with security-constrains which included undispatchable power resources and storage units.To solve the UC programming model,a hybrid honey bee mating and bacterial foraging algorithm is employed to reduce problem complexity and achieve optimal results. 展开更多
关键词 Unit commitment security-constrained programming wind farms uncertainty honey bee mating algorithm bacterial foraging algorithm
暂未订购 下载PDF
An immune-tabu hybrid algorithm for thermal unit commitment of electric power systems 认领 引用 被引量：1
14
作者 Wei LI Hao-yu PENG +2 位作者 Wei-hang ZHU De-ren SHENG Jian-hong CHEN 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS 2009年第6期877-889,共13页
This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment （TUC） problem in power plant optimization. The mathematical model of the TUC problem is established by a... This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment （TUC） problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm （IA） is used as the initial solution of the tabu search （TS） algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry. 展开更多
关键词 Immune algorithm （IA） Tabu search （TS） Optimization method Unit commitment
暂未订购 下载PDF
Improved Unit Commitment with Accurate Dynamic Scenarios Clustering Based on Multi-Parametric Programming and Benders Decomposition 认领 引用
15
作者 Zhang Zhi Haiyu Huang +6 位作者 Wei Xiong Yijia Zhou Mingyu Yan Shaolian Xia Baofeng Jiang Renbin Su Xichen Tian 《Energy Engineering》 EI 2024年第6期1557-1576,共20页
Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenario... Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenarios,which threatens the robustness of stochastic unit commitment and hinders its application. This paper providesa stochastic unit commitment with dynamic scenario clustering based on multi-parametric programming andBenders decomposition. The stochastic unit commitment is solved via the Benders decomposition, which decouplesthe primal problem into the master problem and two types of subproblems. In the master problem, the committedgenerator is determined, while the feasibility and optimality of generator output are checked in these twosubproblems. Scenarios are dynamically clustered during the subproblem solution process through the multiparametric programming with respect to the solution of the master problem. In other words, multiple scenariosare clustered into several representative scenarios after the subproblem is solved, and the Benders cut obtainedby the representative scenario is generated for the master problem. Different from the conventional stochasticunit commitment, the proposed approach integrates scenario clustering into the Benders decomposition solutionprocess. Such a clustering approach could accurately cluster representative scenarios that have impacts on theunit commitment. The proposed method is tested on a 6-bus system and the modified IEEE 118-bus system.Numerical results illustrate the effectiveness of the proposed method in clustering scenarios. Compared withthe conventional clustering method, the proposed method can accurately select representative scenarios whilemitigating computational burden, thus guaranteeing the robustness of unit commitment. 展开更多
关键词 Stochastic programming unit commitment scenarios clustering Benders decomposition multi-parametric programming
暂未订购 下载PDF
Solving Fuel-Based Unit Commitment Problem Using Improved Binary Bald Eagle Search 认领 引用
16
作者 Sharaz Ali Mohammed Azmi Al-Betar +1 位作者 Mohamed Nasor Mohammed A.Awadallah 《Journal of Bionic Engineering》 SCIE EI CSCD 2024年第6期3098-3122,共25页
The Unit Commitment Problem(UCP)corresponds to the planning of power generation schedules.The objective of the fuel-based unit commitment problem is to determine the optimal schedule of power generators needed to meet... The Unit Commitment Problem(UCP)corresponds to the planning of power generation schedules.The objective of the fuel-based unit commitment problem is to determine the optimal schedule of power generators needed to meet the power demand,which also minimizes the total operating cost while adhering to different constraints such as power generation limits,unit startup,and shutdown times.In this paper,four different binary variants of the Bald Eagle Search(BES)algorithm,were introduced,which used two variants using S-shape,U-shape,and V-shape transfer functions.In addition,the best-performing variant(using an S-shape transfer function)was selected and improved further by incorporating two binary operators:swap-window and window-mutation.This variation is labeled Improved Binary Bald Eagle Search(IBBESS2).All five variants of the proposed algorithm were successfully adopted to solve the fuel-based unit commitment problem using seven test cases of 4-,10-,20-,40-,60-,80-,and 100-unit.For comparative evaluation,34 comparative methods from existing literature were compared,in which IBBESS2 achieved competitive scores against other optimization techniques.In other words,the proposed IBBESS2 performs better than all other competitors by achieving the best average scores in 20-,40-,60-,80-,and 100-unit problems.Furthermore,IBBESS2 demonstrated quicker convergence to an optimal solution than other algorithms,especially in large-scale unit commitment problems.The Friedman statistical test further validates the results,where the proposed IBBESS2 is ranked the best.In conclusion,the proposed IBBESS2 can be considered a powerful method for solving large-scale UCP and other related problems. 展开更多
关键词 Swarm intelligence Bald eagle search Unit commitment problem Optimization
Grid Integration of Wind Generation Considering Remote Wind Farms:Hybrid Markovian and Interval Unit Commitment 认领 引用
17
作者 Bing Yan Haipei Fan +5 位作者 Peter B.Luh Khosrow Moslehi Xiaoming Feng Chien Ning Yu Mikhail A.Bragin Yaowen Yu 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2017年第2期205-215,共11页
Grid integration of wind power is essential to reduce fossil fuel usage but challenging in view of the intermittent nature of wind.Recently,we developed a hybrid Markovian and interval approach for the unit commitment... Grid integration of wind power is essential to reduce fossil fuel usage but challenging in view of the intermittent nature of wind.Recently,we developed a hybrid Markovian and interval approach for the unit commitment and economic dispatch problem where power generation of conventional units is linked to local wind states to dampen the effects of wind uncertainties.Also,to reduce complexity,extreme and expected states are considered as interval modeling.Although this approach is effective,the fact that major wind farms are often located in remote locations and not accompanied by conventional units leads to conservative results.Furthermore,weights of extreme and expected states in the objective function are difficult to tune,resulting in significant differences between optimization and simulation costs.In this paper,each remote wind farm is paired with a conventional unit to dampen the effects of wind uncertainties without using expensive utility-scaled battery storage,and extra constraints are innovatively established to model pairing.Additionally,proper weights are derived through a novel quadratic fit of cost functions.The problem is solved by using a creative integration of our recent surrogate Lagrangian relaxation and branch-and-cut.Results demonstrate modeling accuracy,computational efficiency,and significant reduction of conservativeness of the previous approach. 展开更多
关键词 Branch-and-cut interval optimization Markov decision process remote wind farms surrogate Lagrangian relaxation(SLR) unit commitment
暂未订购 下载PDF
Improved Real-Coded Genetic Algorithm Solution for Unit Commitment Problem Considering Energy Saving and Emission Reduction Demands 认领 引用
18
作者 潘谦 何星 +2 位作者 蔡云泽 王治华 苏凡 《Journal of Shanghai Jiaotong university(Science)》 EI 2015年第2期218-223,共6页
Unit commitment(UC), as a typical optimization problem in electric power system, faces new challenges as energy saving and emission reduction get more and more important in the way to a more environmentally friendly s... Unit commitment(UC), as a typical optimization problem in electric power system, faces new challenges as energy saving and emission reduction get more and more important in the way to a more environmentally friendly society. To meet these challenges, we propose a UC model considering energy saving and emission reduction. By using real-number coding method, swap-window and hill-climbing operators, we present an improved real-coded genetic algorithm(IRGA) for UC. Compared with other algorithms approach to the proposed UC problem, the IRGA solution shows an improvement in effectiveness and computational time. 展开更多
关键词 genetic algorithm(GA) unit commitment(UC) improved real-number encoding
暂未订购 下载PDF
Optimizing Combination of Units Commitment Based on Improved Genetic Algorithms 认领 引用
19
作者 LAI Yifei ZHANG Qianhua JIA Junping 《Wuhan University Journal of Natural Sciences》 CAS 2007年第6期1003-1007,共5页
GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms, such as natural selection, genetic recombination and survival of the fittest. B... GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms, such as natural selection, genetic recombination and survival of the fittest. By use of coding betterment, the dynamic changes of the mutation rate and the crossover probability, the dynamic choice of subsistence, the reservation of the optimal fitness value, a modified genetic algorithm for optimizing combination of units in thermal power plants is proposed. And through taking examples, test result are analyzed and compared with results of some different algorithms. Numerical results show available value for the unit commitment problem with examples. 展开更多
关键词 generating units unit commitment genetic algorithms
暂未订购 下载PDF
A Literature Review of Stochastic Programming and Unit Commitment 认领 引用 被引量：2
20
作者 Hang Dai Ni Zhang Wencong Su 《Journal of Power and Energy Engineering》 2015年第4期206-214,共9页
The study of unit commitment (UC) aims to find reasonable schedules for generators to optimize power systems’ operation. Many papers have been published that solve UC through different methods. Articles that systemat... The study of unit commitment (UC) aims to find reasonable schedules for generators to optimize power systems’ operation. Many papers have been published that solve UC through different methods. Articles that systematically summarize UC problems’ progress in order to update researchers interested in this field are needed. Because of its promising performance, stochastic programming (SP) has become increasingly researched. Most papers, however, present SP’s UC solving approaches differently, which masks their relationships and makes it hard for new researchers to quickly obtain a general idea. Therefore, this paper tries to give a structured bibliographic survey of SP’s applications in UC problems. 展开更多
关键词 Unit Commitment Stochastic Programming Review
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 42 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈