CN107346471A - Networking matching process is planned as a whole in a kind of inter-provincial interconnection electricity consumption transaction - Google Patents
Networking matching process is planned as a whole in a kind of inter-provincial interconnection electricity consumption transaction Download PDFInfo
- Publication number
- CN107346471A CN107346471A CN201710505033.5A CN201710505033A CN107346471A CN 107346471 A CN107346471 A CN 107346471A CN 201710505033 A CN201710505033 A CN 201710505033A CN 107346471 A CN107346471 A CN 107346471A
- Authority
- CN
- China
- Prior art keywords
- transaction
- province
- value
- provincial
- inter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005611 electricity Effects 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000006855 networking Effects 0.000 title claims description 20
- 238000005457 optimization Methods 0.000 claims description 18
- 238000009826 distribution Methods 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 230000000694 effects Effects 0.000 abstract description 3
- 230000002708 enhancing effect Effects 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 12
- 238000013178 mathematical model Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000010248 power generation Methods 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
Interconnection electricity consumption transaction is planned as a whole to calculate matching process between the present invention program is related to different provinces, is specifically included in and meets that power network transprovincially under area's transaction limits and security restriction constraint, determines that each province needs to buy or sell quantity of electricity value in real time；Security constraint value and trading volume minimum value are determined, establishes Optimized model object function, Optimized model object function is solved, obtains optimal contact transaction total amount value；Solve the trading volume matching value between each province, each province is formed into set A by the use of the transaction value for needing to buy as element, the transaction value for needing to sell forms set B as element, and descending arrangement is done to set A and set B interior elements, the maximum province of the transaction value that the province for the trading volume maximum that acquisition needs are bought and needs are sold is traded.The real-time recommendation of quantity of electricity transaction transprovincially is realized, improves inter-provincial electric network coordination linkage ability, enhancing electric power energy utilization rate, and the technique effect with optimizing network resource utilization.
Description
Technical Field
The invention belongs to the technical field of electric power design and automatic matching of electricity utilization transactions, and particularly relates to a comprehensive inter-provincial interconnection line electricity utilization transaction networking matching method capable of realizing inter-regional power generation control and electricity utilization transaction.
Background
In recent years, the supply and demand situation of the power market in China is greatly changed, the capacity of large and medium-sized units put into production every year is over 10GW, the increase amplitude of industrial power utilization cannot be synchronously increased, the utilization hour of thermal power is reduced, and the standby capacity of the units during shutdown is obviously increased. Meanwhile, the load rate is reduced, the peak-valley difference is increased, and the new energy grid connection is increased continuously, so that great difficulty is brought to the peak regulation and new energy consumption of the power grid.
For the case that the current regional power grid connection is weak, the adjustment and control of the tie line become very important. The high-quality tie line plan is a key service for realizing resource optimization configuration in a large range and a whole-network unified coordination plan in the existing scheduling mode. The tie-line plan is made according to the load prediction and the starting-up condition of each province. According to the current load, the output is adjusted to enable the inter-provincial tie line trading value to be consistent with a tie line plan, however, the output changes suddenly due to inaccurate load prediction, and if the inter-provincial unit trips and the output of new energy resources such as wind power or photovoltaic energy and the like with large enough prediction is not predicted, the actual curve cannot meet the tie line plan curve, the tie line plan needs to be modified, and the tie line plan is modified in a trading mode.
Inter-provincial interregional tie transactions can occur in several situations:
the output is less than the load, namely the output of all units in the province can not meet the load when the output is added to the maximum, and the province needs to be supplied with power through an external province;
the output is greater than the load, namely when the output of all the units in the province is reduced to the minimum, the output is still greater than the load, and redundant electricity needs to be sold to the province through a connecting line.
As can be seen from the above, when the output and load do not meet the requirements, it is necessary to omit electricity from the external province or sell electricity from the local province to the external province. At present, the power grid of China enters the era of networking across large areas and provinces (areas). With the rapid development of national economy and power systems, national networking is a necessary trend, and the method has important significance for the reasonable utilization of power resources and the reasonable distribution of energy.
Disclosure of Invention
The invention aims to overcome the defects of the optimization technology, solves the matching relation between the power force and the load between the provinces at present to a certain extent, provides a comprehensive inter-provincial interconnection line power utilization transaction networking matching method capable of realizing inter-regional power generation control and power utilization transaction, and has the technical effects of improving the inter-provincial power grid coordination linkage capacity, enhancing the power energy utilization rate and optimizing and utilizing resources.
The invention provides a comprehensive networking matching control method for power utilization transaction of an inter-area tie line, which comprises the following steps of:
(1-1) determining the electric power quantity value required to be purchased or sold by each province, and determining a cross-province transaction total quantity constraint value and a tie line transaction quantity constraint value;
(1-2) determining a safety constraint value and a transaction amount minimum value, and establishing an optimization model objective function, wherein the establishment conditions of the optimization model objective function comprise a trans-provincial transaction total amount constraint value, a transaction amount constraint value of a transaction unit participating in electricity purchasing and a transaction amount constraint value of a transaction unit participating in electricity selling;
(1-3) solving an optimization model objective function to obtain an optimal contact transaction total value;
(1-4) rounding the best contact transaction total value obtained by the solution in (1-3), and randomly selecting a transaction total value to subtract the value which does not satisfy ∑ xiA value of 0, wherein xiRepresenting the trading volume value of the ith province, wherein i is a positive integer;
(1-5) solving the transaction matching quantity value of each province, forming a set A by taking the transaction quantity value required to be purchased of each province as an element, forming a set B by taking the transaction quantity value required to be sold as an element, and carrying out descending order arrangement on the elements in the set A and the set B to obtain the province with the maximum transaction quantity required to be purchased and the province with the maximum transaction quantity value required to be sold for transaction, and preferably carrying out transaction on the two provinces if the transaction quantity required to be purchased of the two provinces is equal to the transaction quantity required to be sold.
2. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the step (1-5) further comprises: after trading, if the transaction amount required to be purchased is not equal to the transaction amount required to be sold, absolute difference is made between the transaction amount required to be purchased and the transaction amount required to be sold, the difference is used as an element to participate in sequencing with other provinces requiring electricity purchasing or electricity selling, and the step (1-5) is repeated.
3. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the method for rounding the best contact transaction total amount in the step (1) to (4) adopts a rounding method and a residual random distribution method.
4. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method as claimed in claim 1, wherein the inter-provincial transaction total amount constraint value satisfies ∑ xi＝0：
Wherein x isiRepresents the transaction amount of the ith province, i being a positive integer.
The unit transaction electric power constraint value participating in the electricity purchase transaction satisfies si-xi-b≥0：
Wherein s isiRepresenting the upper spare capacity, x, of the ith province participating in the transactioniRepresents the transaction amount of the ith province, i is a positive integer, and b represents the slack of the transaction amount subtracted from the upper standby.
5. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the unit transaction electric power constraint value participating in the electricity selling transaction meets the following requirements: p is a radical ofi-xi-b≤0
Wherein p isiLower spare capacity, x, representing the ith province involved in the transactioniRepresenting the transaction amount of the ith province, i being a positive integer,bindicating the slack of the lower standby minus the transaction amount.
6. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the optimization model objective function is:
wherein,means, s, of the i-th province reserve to the lower reserve capacityiRepresenting the upper spare capacity, p, of the ith province participating in the transactioniRepresenting the lower spare capacity of the ith province participating in the transaction; x is the number ofiRepresents the transaction amount of the ith province, i is a positive integer, θ ∈ [0,1 [)]For the set parameters, the closer theta is to 1, the larger the operation safety boundary of each province power grid is guaranteed as much as possible, and the closer theta is to 0, the smaller the transaction amount is guaranteed as much as possible but the lowest transaction requirements are met;the method is mainly used for ensuring that the self power and electricity quantity is balanced as much as possible and the provincial trading volume is minimum.
The beneficial effects of this scheme are embodied in:
1. according to the method, safety constraint, a unit output value, each province load and a tie line transaction plan are considered, an inter-province tie line transaction automatic matching mathematical model based on overall network planning is established on the basis, the sum of transaction amounts of each province is guaranteed to be small while the safety constraint is considered, finally, the solved transaction amount is rounded in combination with the actual situation of electric power transaction, and the transaction object of each province is found out through a maximum matching algorithm. The method has the technical effects of improving the coordination linkage capacity of the power grid, enhancing the utilization rate of electric power energy and optimizing and utilizing resources.
2. The optimized model objective function guarantees the minimum total transaction amount of each province while considering the safety constraint, and the constraint conditions comprise total transaction amount constraint of each province, unit transaction electric quantity constraint participating in electricity purchasing transaction and unit transaction electric quantity constraint participating in electricity selling transaction. The establishment and the use of the mathematical model can help the electric power company which needs to consider the trans-provincial junctor transaction and the safety constraint to make an operation plan, improve the scientificity and the effectiveness of the decision and contribute to the improvement of the intelligent operation level of the transaction business.
Drawings
FIG. 1 is a diagram illustrating the distribution of power values required to purchase and sell in each province of the present invention;
FIG. 2 is a diagram showing the distribution of electric power values required for purchase and sale transactions in the same province at different time points;
FIG. 3 is a main flow chart of the inter-area tie line electricity utilization transaction overall planning and networking matching control method of the present invention;
FIG. 4 is a sub-flow diagram of the solution of the optimization model objective function of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and the detailed description. It should be understood that the detailed description and specific examples, while indicating the invention, are intended for purposes of illustration only and are not intended to limit the scope of the invention.
As shown in fig. 1, fig. 2 and fig. 3, the present invention provides a method for controlling the overall networking of the electric transactions of the inter-area tie lines, including the following steps:
s1, determining the quantity value required to be purchased by each province, the electric load of the transaction quantity value sold by each province, and determining the cross-province transaction total quantity constraint value and a contact transaction line; and obtaining a tie line plan through the load prediction of each province and the starting condition of the generator set of each province, wherein the mode of modifying the tie line plan is through transaction.
As shown in FIGS. 1 and 2, each of the I-shaped lines represents the power purchasing and selling capacity of each province, wherein siRepresenting the upper spare capacity, p, of the ith province participating in the transactioniRepresenting the lower spare capacity, m, of the ith province participating in the transactioniIndicating the midpoint of the upper and lower spares of the ith province.
As shown in fig. 3 and 4, S2 determines the safety constraint value and the minimum transaction amount value, and establishes an optimization model objective function, where the establishment conditions of the optimization model objective function include a total provincial-crossing transaction amount constraint value, a transaction amount constraint value of the electricity purchasing transaction unit and a transaction amount constraint value of the electricity selling transaction unit;
s3, solving the optimization model objective function to obtain the optimal contact transaction total value;
s4 rounding the best contact transaction total value solved in S3, and randomly selecting one transaction total value to subtract the value which does not satisfy ∑ xiA value of 0, wherein xiThe transaction quantity value of the ith province is represented, i is a positive integer, the transaction quantity of each province obtained by solving is further optimized by considering the actual situation of electric power transaction, and the total transaction quantity of each province is ensured to be equal to zero, namely ∑ xiRounding each province transaction amount by rounding off in the case of 0 to guarantee ∑ xi0, randomChoose a transaction amount to subtract out unsatisfied ∑ xiA slight deviation is accepted as 0, since the model itself is left with a margin, and does not affect the final result.
S5, solving the trading volume value of each province, forming a set A by using the trading volume value required to be purchased as an element for each province, forming a set B by using the trading volume value required to be sold as an element, and arranging the elements in the set A and the set B in a descending order to obtain the province with the maximum trading volume required to be purchased and the province with the maximum trading volume value required to be sold for trading, wherein if the trading volume required to be purchased of the two provinces is equal to the trading volume required to be sold, the two provinces are preferably traded.
The step S5 further includes: after the transaction, if the transaction amount required to be purchased is not equal to the transaction amount required to be sold, making an absolute difference between the transaction amount required to be purchased and the transaction amount required to be sold, taking the difference as an element to participate in the ordering with other provinces requiring electricity purchasing or electricity selling, and repeating the step S5.
And the result is obtained by adopting Python language to write an optimization program on the basis of establishing a model which considers the safety constraint and simultaneously ensures the minimum total transaction amount of each province, so that the solution calculation of the model is realized, and the result is finally obtained.
The cross provincial transaction total amount constraint value satisfies ∑ xi0, wherein xiRepresents the transaction power of the ith province, i being a positive integer.
The unit transaction electric quantity constraint value participating in the electricity purchase transaction meets the following requirements: si-xiB.gtoreq.0, wherein siUpper reserve, x, representing the ith province participating in the transactioniRepresents the transaction amount of the ith province, i is a positive integer, and b represents the slack of the transaction amount subtracted from the upper standby.
The unit transaction electric quantity constraint value participating in the electricity selling transaction meets the following requirements: p is a radical ofi-xiB.ltoreq.0, wherein piIndicating the lower reserve of the ith province, x, participating in the transactioniRepresenting the transaction amount of the ith province, i being a positive integer, b representing the next decreaseSlack in transacted volume.
The optimization model objective function is:wherein,represents the midpoint of the first province upper spare and lower spare, siIndicating the reserve of the ith province, p, participating in the transactioniIndicating a next-up for the ith province participating in the transaction; x is the number ofiRepresents the transaction amount of the ith province, i is a positive integer, θ ∈ [0,1 [)]Is a parameter given by people and is mainly used for adjusting the balance between the safety constraint and the transaction amount;the method is mainly used for ensuring that the balance province transaction amount is the minimum as far as possible when the electric power and the electric quantity of the province transaction amount are guaranteed to be balanced, and the province with the midpoint close to the x axis is not transacted as far as possible.
Constraint conditions are as follows:
∑ x in the provincial transaction total amount constraint formulai＝0，xiIndicating the transaction amount of the ith province, i ═ 1, …, n.
Unit transaction electricity quantity constraint ∑ s participating in electricity purchase transactioni-nb ≧ 0 wherein, siIndicating the upper reserve of the ith province participating in the transaction, i ═ 1, …, n indicating the ith province participating in the transaction, and b indicating the slack of the upper reserve minus the transaction amount.
Unit transaction electricity quantity constraint ∑ p participating in electricity selling transactioni-nb.ltoreq.0, wherein piIndicating the lower reserve of the ith province participating in the transaction, i ═ 1, …, n indicating the ith province participating in the transaction, and b indicating the slack of the lower reserve minus the transaction amount.
And the result is obtained by adopting Python language to write an optimization program on the basis of establishing a model which considers the safety constraint and simultaneously ensures the minimum total transaction amount of each province, so that the solution calculation of the model is realized, and the result is finally obtained.
A unit combination model that considers cross-provincial tie transactions and safety constraints is an improvement of the power system scheduling model. The power system scheduling model is complex, and particularly the dynamic scheduling model has the characteristics of high dimensionality, discreteness and nonlinearity in mathematics. The solving method of the academic world research comprises an artificial intelligence algorithm such as a heuristic method, a dynamic programming method, a Lagrange multiplier method, a branch and bound method, a genetic algorithm, a particle swarm algorithm, an ant colony algorithm and the like. At present, with the maturity of planning software, the solution of an optimization model is realized based on Python, so that the time for engineering technicians to develop programs can be reduced, more time is put into the establishment of the model and the design of a scheme, and the accuracy and the robustness of the model solution can be improved.
The model solution adopts a Langrange multiplier method and introduces a Lagrange function, and the L expression is L (x, lambda, v) ═ f (x) + lambda ∑ xi+μ∑(si-xi-b)+ν∑(pi-xiB) solving the above optimization problem at this time, the following conditions (and also our solving conditions) must be satisfied:
λ≥0
μ≥0
ν≥0
λ∑x*＝0
μ(si-x*-b)＝0,i＝1,2,….n
ν(pi-x*-b)＝0,i＝1,2,….n
the mathematical model takes the tie line plan and the cross-provincial transaction amount into consideration and integrates the tie line plan and the cross-provincial transaction amount as decision variables, and overall optimization is realized. The optimized objective function guarantees the minimum total transaction amount of each province while considering safety constraints, and the constraint conditions comprise total transaction amount constraints of each province, unit transaction electric quantity constraints participating in electricity purchasing transactions and unit transaction electric quantity constraints participating in electricity selling transactions. The establishment and the use of the mathematical model can help the electric power company which needs to consider the trans-provincial junctor transaction and the safety constraint to make an operation plan, improve the scientificity and the effectiveness of the decision and contribute to the improvement of the intelligent operation level of the transaction business.
It should be understood that although the present description refers to embodiments, not every embodiment contains only a single technical solution, and such description is for clarity only, and those skilled in the art should take the description as a whole, and the technical solutions in the embodiments may be appropriately combined to form other embodiments understood by those skilled in the art.
Claims (6)
1. The utility model provides an inter-provincial junctor power consumption trade overall planning networking matching method which characterized in that: the method comprises the following steps:
(1-1) determining the electric power quantity value required to be purchased or sold by each province, and determining a cross-province transaction total quantity constraint value and a tie line transaction quantity constraint value;
(1-2) determining a safety constraint value and a transaction amount minimum value, and establishing an optimization model objective function, wherein the establishment conditions of the optimization model objective function comprise a trans-provincial transaction total amount constraint value, a transaction amount constraint value of a transaction unit participating in electricity purchasing and a transaction amount constraint value of a transaction unit participating in electricity selling;
(1-3) solving an optimization model objective function to obtain an optimal contact transaction total value;
(1-4) rounding the best contact transaction total value obtained by the solution in (1-3), and randomly selecting a transaction total value to subtract the value which does not satisfy ∑ xiA value of 0, wherein xiRepresenting the trading volume value of the ith province, wherein i is a positive integer;
(1-5) solving the transaction matching quantity value of each province, forming a set A by taking the transaction quantity value required to be purchased of each province as an element, forming a set B by taking the transaction quantity value required to be sold as an element, and carrying out descending order arrangement on the elements in the set A and the set B to obtain the province with the maximum transaction quantity required to be purchased and the province with the maximum transaction quantity value required to be sold for transaction, and preferably carrying out transaction on the two provinces if the transaction quantity required to be purchased of the two provinces is equal to the transaction quantity required to be sold.
2. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the step (1-5) further comprises: after trading, if the transaction amount required to be purchased is not equal to the transaction amount required to be sold, absolute difference is made between the transaction amount required to be purchased and the transaction amount required to be sold, the difference is used as an element to participate in sequencing with other provinces requiring electricity purchasing or electricity selling, and the step (1-5) is repeated.
3. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the method for rounding the best contact transaction total amount in the step (1) to (4) adopts a rounding method and a residual random distribution method.
4. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method as claimed in claim 1, wherein the inter-provincial transaction total amount constraint value satisfies ∑ xi＝0：
Wherein x isiRepresents the transaction amount of the ith province, i being a positive integer.
The participationThe unit transaction electric power constraint value of the electricity purchase transaction satisfies si-xi-b≥0：
Wherein s isiRepresenting the upper spare capacity, x, of the ith province participating in the transactioniRepresents the transaction amount of the ith province, i is a positive integer, and b represents the slack of the transaction amount subtracted from the upper standby.
5. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the unit transaction electric power constraint value participating in the electricity selling transaction meets the following requirements: p is a radical ofi-xi-b≤0
Wherein p isiLower spare capacity, x, representing the ith province involved in the transactioniRepresents the transaction amount of the ith province, i is a positive integer, and b represents the slack of the lower standby minus the transaction amount.
6. The inter-provincial interconnecting line electricity consumption transaction overall planning networking matching method according to claim 1, characterized in that: the optimization model objective function is:
wherein,means, s, of the i-th province reserve to the lower reserve capacityiRepresenting the upper spare capacity, p, of the ith province participating in the transactioniRepresenting the lower spare capacity of the ith province participating in the transaction; x is the number ofiRepresents the transaction amount of the ith province, i is a positive integer, θ ∈ [0,1 [)]For the set parameters, the closer theta is to 1, the larger the operation safety boundary of each province power grid is guaranteed as much as possible, and the closer theta is to 0, the smaller the transaction amount is guaranteed as much as possible but the lowest transaction requirements are met;the method is mainly used for ensuring that the self power and electricity quantity is balanced as much as possible and the provincial trading volume is minimum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710505033.5A CN107346471B (en) | 2017-06-28 | 2017-06-28 | Inter-provincial tie line electricity utilization transaction overall networking matching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710505033.5A CN107346471B (en) | 2017-06-28 | 2017-06-28 | Inter-provincial tie line electricity utilization transaction overall networking matching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107346471A true CN107346471A (en) | 2017-11-14 |
| CN107346471B CN107346471B (en) | 2021-12-10 |
Family
ID=60256649
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710505033.5A Active CN107346471B (en) | 2017-06-28 | 2017-06-28 | Inter-provincial tie line electricity utilization transaction overall networking matching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107346471B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119316A (en) * | 2019-05-17 | 2019-08-13 | 中国石油大学(华东) | A kind of associated task scheduling strategy based on slackness and Ant ColonySystem |
| CN111062784A (en) * | 2019-12-18 | 2020-04-24 | 贵州电力交易中心有限责任公司 | Intelligent bidirectional recommendation system for electric power user transaction |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004229415A (en) * | 2003-01-23 | 2004-08-12 | Tokyo Electric Power Co Inc:The | Information processing method, equipment and program about market price of electric power |
| CN103345712A (en) * | 2013-06-19 | 2013-10-09 | 国家电网公司 | Method for optimizing medium and long term trans-regional trans-provincial deals and assessing modes of medium and long term trans-regional trans-provincial deals |
| CN103427422A (en) * | 2013-04-28 | 2013-12-04 | 中国南方电网有限责任公司 | Calculation method for evaluating inter-provincial electricity transaction ideality of power grid |
| CN103955776A (en) * | 2014-05-14 | 2014-07-30 | 国家电网公司 | Method for optimizing interprovincial and interregional transaction based on physical route optimization |
| CN104463367A (en) * | 2014-12-05 | 2015-03-25 | 国家电网公司 | Power transaction stream optimization method involving power transmission paths |
-
2017
- 2017-06-28 CN CN201710505033.5A patent/CN107346471B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004229415A (en) * | 2003-01-23 | 2004-08-12 | Tokyo Electric Power Co Inc:The | Information processing method, equipment and program about market price of electric power |
| CN103427422A (en) * | 2013-04-28 | 2013-12-04 | 中国南方电网有限责任公司 | Calculation method for evaluating inter-provincial electricity transaction ideality of power grid |
| CN103345712A (en) * | 2013-06-19 | 2013-10-09 | 国家电网公司 | Method for optimizing medium and long term trans-regional trans-provincial deals and assessing modes of medium and long term trans-regional trans-provincial deals |
| CN103955776A (en) * | 2014-05-14 | 2014-07-30 | 国家电网公司 | Method for optimizing interprovincial and interregional transaction based on physical route optimization |
| CN104463367A (en) * | 2014-12-05 | 2015-03-25 | 国家电网公司 | Power transaction stream optimization method involving power transmission paths |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119316A (en) * | 2019-05-17 | 2019-08-13 | 中国石油大学(华东) | A kind of associated task scheduling strategy based on slackness and Ant ColonySystem |
| CN111062784A (en) * | 2019-12-18 | 2020-04-24 | 贵州电力交易中心有限责任公司 | Intelligent bidirectional recommendation system for electric power user transaction |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107346471B (en) | 2021-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kong et al. | Bi-level multi-time scale scheduling method based on bidding for multi-operator virtual power plant | |
| CN106845807B (en) | Settlement method and device based on peak regulation auxiliary service | |
| Chen et al. | Research on day-ahead transactions between multi-microgrid based on cooperative game model | |
| Gao et al. | Demand-side response strategy of multi-microgrids based on an improved co-evolution algorithm | |
| Kong et al. | A multi-agent optimal bidding strategy in microgrids based on artificial immune system | |
| CN105137756B (en) | Coordination control method and system for power grid of iron and steel enterprise | |
| CN109858774B (en) | Source network load planning method for improving system safety and coordination | |
| CN112381263A (en) | Block chain distributed data storage based multi-microgrid day-ahead robust electric energy transaction method | |
| CN111311012A (en) | Multi-agent-based micro-grid power market double-layer bidding optimization method | |
| Yang et al. | Multi-Objective optimal scheduling of island microgrids considering the uncertainty of renewable energy output | |
| CN116054241B (en) | Robust energy management method for new energy micro-grid group system | |
| Liu et al. | Behavior analysis of photovoltaic-storage-use value chain game evolution in blockchain environment | |
| CN113327124A (en) | Low-carbon P2P energy consumption trading method in multi-energy-carbon emission combined market | |
| Ma et al. | Energy storage capacity optimization for improving the autonomy of grid-connected microgrid | |
| CN107346471B (en) | Inter-provincial tie line electricity utilization transaction overall networking matching method | |
| CN116070732A (en) | Master-slave game collaborative operation optimization method of cross-border comprehensive energy system considering demand response | |
| Tao et al. | Research on multi-microgrids scheduling strategy considering dynamic electricity price based on blockchain | |
| Hu et al. | Coordinated scheduling model of power system with active distribution networks based on multi-agent system | |
| CN114493688A (en) | Electric-gas coupling virtual power plant scheduling method and device and electronic equipment | |
| Chen et al. | Coordinated Energy Dispatch and Flexibility Support for Microgrid Cluster Using Rule-based Stackelberg Gaming Approach | |
| Gu et al. | An Auto-Tuned Robust Dispatch Strategy for Virtual Power Plants to Provide Multi-Stage Real-Time Balancing Service | |
| CN110556821B (en) | Multi-microgrid double-layer optimization scheduling method considering interactive power control and bilateral bidding transaction | |
| CN117332937A (en) | Multi-energy complementary virtual power plant economic dispatching method considering demand response | |
| CN116542770A (en) | Virtual power plant market trading mechanism based on energy shift and energy level | |
| Bedoya et al. | A bilateral transactive energy framework for electric power distribution systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A coordinated networking matching method for inter provincial tie line power transaction Effective date of registration: 20220304 Granted publication date: 20211210 Pledgee: Xi'an Science and Technology Financial Service Center Co.,Ltd. Pledgor: XI'AN TUJI INFORMATION TECHNOLOGY CO.,LTD. Registration number: Y2022610000075 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |