Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Day-ahead reactive power optimization method based on branch-bound method and primal-dual interior point method

A technology of branch and bound method and optimization method, applied in reactive power compensation, reactive power adjustment/elimination/compensation, AC network circuit, etc., can solve the problem of difficult to achieve reasonable control of control equipment

Active Publication Date: 2015-06-10
HOHAI UNIV
View PDF2 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This kind of method artificially fixes the action time of the equipment, and it is difficult to realize the reasonable regulation of the control equipment.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Day-ahead reactive power optimization method based on branch-bound method and primal-dual interior point method
  • Day-ahead reactive power optimization method based on branch-bound method and primal-dual interior point method
  • Day-ahead reactive power optimization method based on branch-bound method and primal-dual interior point method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0062] The technical solution of the invention will be described in detail below in conjunction with the accompanying drawings.

[0063] A day-ahead reactive power optimization method based on the branch and bound method and the primal dual interior point method involved in the present invention, its algorithm flow is as follows figure 1 shown, including the following steps:

[0064] Step 1. Considering the adjacent period adjustment gear limit and the whole day adjustment frequency limit of the discrete control equipment, add them as constraints into the optimization model, and establish the mathematical model of the day-ahead reactive power optimization problem:

[0065] min Σ t = 1 N T ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a day-ahead reactive power optimization method based on a branch-bound method and a primal-dual interior point method and belongs to the reactive power optimization technology field of a power system. The method is characterized in that constraints of discrete variables in each period, adjusting gears in adjacent period and whole-day operation times are considered, and primary problems are branched and combined with branched branch-cutting strategies according to the periods, so that all discrete variables gradually approach to discrete values and meet the coupling constraints among the period; the primary problems are decomposed into a series of single-period reactive power optimization sub-problems only containing continuous variables after being branched according to the periods, the sub-problems are solved by adopting the primal-dual interior point method, and the calculated amount is reduced. The day-ahead reactive power optimization method is excellent in convergence, high in reliability and steady in calculation result.

Description

technical field [0001] The invention discloses a day-ahead reactive power optimization method based on a branch and bound method and a primal dual interior point method, and belongs to the technical field of reactive power optimization of electric power systems. Background technique [0002] The current reactive power optimization problem is essentially a large-scale nonlinear dynamic mixed integer programming problem. The existence of a large number of discrete control variables and coupling constraints between time periods makes it very difficult to solve. Currently, there are mainly four methods for solving reactive power optimization: (1) Simultaneous solution method. Document 1 "Dynamic Reactive Power Optimization Algorithm Considering the Constraints on the Number of Actions of Control Equipment" (Proceedings of the Chinese Society for Electrical Engineering, 2004, Vol. 24, No. 3, Page 34) describes the limit of the number of actions of discrete control equipment as an...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H02J3/18
CPCH02J3/18H02J2203/20Y02E40/30
Inventor 赵晋泉居俐洁戴则梅陈刚
Owner HOHAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com