Unit commitment credible optimization algorithm based on block chain

Through the SCUC solution architecture and SCUC trusted solution smart contracts on the blockchain-off-chain collaboration, the problem that blockchain is difficult to support large-scale discrete SCUC model solving is solved, and the efficient and trusted solution of the SCUC model is achieved. The transparency and efficiency of the results are enhanced, and the problem of insufficient verifiability and efficiency of the solution results in the prior art is solved.

CN119090069AActive Publication Date: 2024-12-06SHANGHAI JIAOTONG UNIV
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
CN202411155383.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-21
Publication Date
2024-12-06
Estimated Expiration
2044-08-21

AI Technical Summary

Technical Problem

The existing trusted optimization method based on blockchain cannot effectively support large-scale, discrete SCUC model solution, resulting in insufficient verifiability and efficiency of the solution results, especially in the province and inter-provincial power spot markets. The differences in optimal solutions and the questions about transaction results.

Method used

A trusted optimization algorithm for unit combination based on blockchain is proposed. By establishing an on-chain-off-chain collaboration SCUC solution architecture, the collaboration of on-chain search and off-chain solution layer is used to divide the SCUC model solution space and compare To ensure the trustworthiness and efficiency of the optimal solution, SCUC trustworthy solution smart contract is designed to achieve trustworthy solution.

Benefits of technology

It realizes efficient and trustworthy solution of the SCUC model, breaks the "black box" state of the solution process, enhances the transparency and verifiability of market members to the results, reduces the complexity of blockchain operations, improves the solution efficiency, and can Tolerate cheating of some nodes to ensure the accuracy of the results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090069A_ABST
    Figure CN119090069A_ABST
Patent Text Reader

Abstract

The invention discloses a block chain-based unit commitment credible optimization algorithm, relates to the field of energy block chains, and provides a unit commitment credible solution method based on a block chain on-chain and off-chain collaboration thought, which comprises the following steps of: firstly, providing a thought of'on-chain segmentation comparison optimization and off-chain parallel fault-tolerant solution ', establishing an on-chain and off-chain collaboration SCUC solution architecture, and establishing an on-chain and off-chain collaboration SCUC solution architecture; the limitation that a traditional block chain technology is difficult to support an SCUC model solving task is solved. Then, a unit commitment solution space fault-tolerant segmentation method is established to give consideration to the reliability of an SCUC model solution result and the efficiency of a solution process in a block chain environment, and finally, a corresponding SCUC credible solution smart contract is designed. The SCUC model credible solving method provided by the invention has the advantages that the optimality can be verified, and the Byzantine fault tolerance and the solving efficiency are met.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of energy blockchain, and in particular to a trusted optimization algorithm for unit combination based on blockchain. Background Art

[0002] The security constrained unit commitment (SCUC) model solves the problem of determining the start-up and shutdown status of the generator set, which is the core link of the spot market clearing. Ensuring the optimality and accuracy of the SCUC solution directly affects the economy and security of the spot market transaction results.

[0003] SCUC is a large-scale mixed-integer linear program (MILP) optimization problem. Most existing studies are devoted to improving the solution efficiency and optimality of the solution results of the centralized solution of the SCUC model. However, how to improve the verifiability of the solution results of the SCUC model and meet the trust demands of market members for the optimality and fairness of the clearing results is also an urgent problem to be solved. The SCUC model has high-dimensional discrete characteristics. In practice, only local optimal solutions can be found. There are still differences in the start-up and shutdown plans of units with multiple local optimal solutions with similar target values. Selecting different local optimal solutions will directly affect the benefits of some units. In the centralized solution mode, the solution process of the SCUC model is in a "black box state", the verifiability of the solution results is poor, and it is difficult for market members to verify and judge the quality of the local optimal solution. Especially in the early stage of the construction of intra-provincial and inter-provincial electricity spot markets, the clearing results of the spot market may deviate from the original quantity and price range, and the start-up and shutdown plans of units may deviate from the original expectations, which may further cause some market members to question the clearing results.

[0004] As a technical tool with multi-party co-governance and mutual supervision as its core idea, blockchain has been widely discussed and applied in the energy field due to its decentralization and immutability. It has the natural potential to support the trusted solution of the SCUC model. In the blockchain environment, market operators, market regulators, and market players can serve as blockchain consensus nodes to jointly perform the solution and verification tasks of the SCUC model. Any tampering of the solution results by any node will be discovered and blocked by other nodes; only the results that the nodes agree on on the chain can be used as the basis for market transaction results. Blockchain can break the "black box" of the SCUC model solution process by storing rules on the chain and multi-party supervision and execution, giving each market player the right to supervise and verify, and ensuring the fairness and transparency of transaction results.

[0005] However, the technical characteristics of blockchain multi-party synchronization and redundant calculations make it often only good at performing simple numerical and logical calculation tasks. The SCUC model solves complex optimization tasks such as traditional blockchain computing complexity and running time, which makes it impossible to execute. At present, domestic and foreign scholars have proposed some blockchain solutions for complex optimization tasks. The mainstream ideas can be divided into the following four categories: The first category is "off-chain solution, on-chain evidence", that is, the solution task is transferred to the off-chain by a third-party organization, and only the solution result is sent to the chain for evidence to ensure the consistency of the solution result, but it is difficult to ensure the correctness of the solution result. The second category takes "model simplification" as the core idea, decomposing the model solution process into a series of simple calculation steps, so that it is compatible with the blockchain smart contract language environment, but it is only applicable to application scenarios where the optimization model is easy to simplify. The third category takes "blockchain coordination level" as the core idea, splitting the optimization model into an upper-level coordination problem and several lower-level sub-problems solved locally, where the upper-level coordination problem is solved on the chain, and the lower-level sub-problems are solved locally by the participating entities, but it is necessary to be decomposable as a prerequisite. The fourth category takes the Proof of Solution (PoSo) consensus mechanism as its core idea, adopts the "off-chain solution, on-chain verification" method, executes complex optimization solution process off-chain, sends the solution result to the chain, and each consensus node verifies the optimal solution on the chain, but it is only applicable to scenarios with optimality criteria such as continuous optimization.

[0006] In summary, the existing blockchain-based trusted optimization methods cannot support the solution of the SCUC model, a large-scale, discrete model, and it is urgent to propose an efficient and trusted solution algorithm that is suitable for it. Summary of the invention

[0007] The purpose of the present invention is to provide a blockchain-based unit combination trusted optimization algorithm to solve the problems raised in the above background technology.

[0008] To achieve the above object, the present invention provides the following technical solutions:

[0009] The blockchain-based unit commitment trusted optimization algorithm includes the following steps:

[0010] (1) Establishing the SCUC model and the on-chain-off-chain collaborative SCUC solution architecture, the architecture includes an on-chain optimization layer and an off-chain solution layer, wherein the on-chain optimization layer is composed of a group of blockchain consensus nodes, responsible for dividing the SCUC model solution space into a number of redundant sub-solution spaces, distributing them to the off-chain solution layer, and obtaining the optimal solution of the original model by comparing the correct solution results submitted by the off-chain solution layer; the off-chain solution layer is composed of a group of solution nodes, each of which searches for the local optimal solution of the original model in the corresponding sub-solution space distributed by the on-chain optimization layer, and submits it to the on-chain optimization layer;

[0011] (2) Establish a fault-tolerant partitioning method for the unit combination solution space to take into account the reliability of the SCUC model solution results and the efficiency of the solution process under the blockchain environment;

[0012] (3) Design the corresponding SCUC trusted solution smart contract;

[0013] The steps of establishing the SCUC model in step (1) are as follows:

[0014] The SCUC model aims to minimize the total power generation cost, and its objective function is expressed as:

[0015]

[0016] Among them, T is the total number of time periods in the scheduling cycle; I is the total number of units that can be started and stopped; are the electricity cost, startup cost and shutdown cost of the i-th unit in time period t respectively;

[0017] Electricity cost

[0018]

[0019] Where K is the number of segmented quotations of unit i in time period t; and are the bid and winning bid of unit i in the kth segment in time period t; α i,t is the online status of unit i in time period t (1 means the unit is online, 0 means the unit is not online); is the minimum technical output cost of unit i in period t;

[0020] Startup costs

[0021]

[0022] Among them, β i,t Indicates whether the unit i performs the startup action within the time period t (1 indicates the startup action is performed, 0 indicates the startup action is not performed); is the startup cost of unit i;

[0023] Shutdown costs

[0024]

[0025] Among them, γ i,t Indicates whether unit i executes shutdown action in time period t (1 indicates shutdown action is executed, 0 indicates no shutdown action is executed); is the shutdown cost of unit i;

[0026] Constraints

[0027] Power balance constraints

[0028]

[0029] Among them, P i,t is the output of unit i in period t; N is the number of nodes; D n,t is the load of node n in time period t; is the minimum technical output of unit i in period t;

[0030] System spare capacity constraints

[0031]

[0032] in, is the maximum output of unit i in time period t; M is the total number of inter-provincial tie lines; is the transmission power of inter-provincial tie line m in time period t; η i is the unit confidence factor; P t up , P t down are the system positive reserve constraint relaxation factor and the system negative reserve constraint relaxation factor for time period t respectively; are the system positive reserve demand and system negative reserve demand in time period t respectively;

[0033] Constraints on winning bids for unit tranches

[0034]

[0035] in, is the declared quantity of the kth segment quotation of unit i in time period t;

[0036] Unit ramp rate constraint

[0037]

[0038] in, and are the maximum ramp-up rate and maximum ramp-down rate of unit i in time period t respectively;

[0039] Minimum continuous start and stop time constraints for units

[0040]

[0041] in, and are the continuous start-up and shutdown times of unit i in time period t, respectively; and are the minimum continuous start time and minimum continuous shutdown time of unit i respectively;

[0042] Energy Constraint

[0043]

[0044] Among them, E n,t is the net injected power of node n in period t; n is the set of all units on node n; F l,t is the branch power flow of line l in time period t; SF n,l is the output power transfer distribution factor of node n to line l; The upper and lower limits of the transmission power of line l in time period t respectively;

[0045] The steps of establishing the fault-tolerant partitioning method of the unit combination solution space in step (2) are as follows: first, a 0-1 variables are selected in the unit combination model, and the complete solution space Ω is partitioned into X=2 a Segmentation Unit Then, the segmented units are reassembled into N sub-solution spaces Each sub-solution space contains [X(f+1) / N] split units, which are distributed to the solving nodes for optimization. Each solving node performs optimization in parallel according to the divided sub-solution space and submits the solution results to the chain. The consensus node compares all solution results through cross-communication verification and takes the solution result that meets the constraints and has the lowest total power generation cost as the final optimal solution;

[0046] In the on-chain optimization layer, based on the classic branch-and-bound idea of ​​discrete optimization problems, the original solution space is divided into a set of segmentation units using the 0-1 variables in the unit commitment model, and the segmentation units are combined into N sub-solution spaces, which are distributed to the solving nodes for optimization, where N is the number of solving nodes. In order to ensure that the proposed method can still obtain the optimal solution in the case of tampering with the solution results or offline failure of some solving nodes, and to ensure the optimization efficiency, the sub-solution space division meets the following conditions:

[0047] Load balancing: The sub-solution spaces that each solving node is responsible for optimizing are of the same size, as shown in formula (12):

[0048]

[0049] Among them, J is the number of nodes to be solved, The sub-solution space that node j is responsible for searching for the best solution, |·| represents the number of segmentation units contained in the solution space;

[0050] Byzantine fault tolerance: Assuming that there are no more than f cheating nodes among the solving nodes, which may disrupt the solving process by submitting wrong solution results or not submitting solution results, then any f+1 solving nodes should restore the complete solution space, as shown in formula (13):

[0051]

[0052] Among them, Ω is the solution space of the unit commitment model;

[0053] Minimum redundancy: The sub-solution space that each solution node is responsible for optimizing should minimize redundancy, as shown in formula (14):

[0054]

[0055] The step (3) of designing the corresponding SCUC trusted solution smart contract includes three stages: SCUC model preparation, fault-tolerant segmentation of solution space, and optimal solution verification and comparison, including the following functions:

[0056] 1) SCUC model preparation stage

[0057] ① Model data upload function: The market operation organization collects the relevant parameters of each generator set and the market boundary conditions, establishes the SCUC model, converts the model into JSON format and uploads it to the blockchain, including the objective function and various constraints, as shown in equations (1) to (11), for each solution node to access and download, to ensure the consistency of the subsequent solution process;

[0058] 2) Solution space segmentation stage

[0059] ②Solution space partition function: select a 0-1 variable in the SCUC model and partition the solution space Ω into X=2 a Segmentation Unit Then the segmentation units are reassembled into N sub-solution spaces to form the allocation scheme M as shown in formula (15):

[0060]

[0061] The number of rows N of the matrix M is the number of sub-solution spaces, and the number of columns X is the number of segmentation units; the element M ij =1 indicates subsolution space Contains split unit M ij = 0 means sub-solution space Does not include split unit

[0062] 3) Optimal solution verification and comparison stage

[0063] ③ Local optimal solution publishing function: Each solving node independently searches for the local optimal solution in the corresponding sub-solution space off-chain, and publishes the calculated local optimal solution L i Submit to blockchain;

[0064] ④Constraint verification function: collect the local optimal solution L of each solution node iAfter that, verify whether each local optimal solution satisfies the constraint conditions such as equation (5)-equation (11), and remove the local optimal solution that does not meet the constraint conditions;

[0065] ⑤ Final optimal solution comparison function: compare all local optimal solutions that meet the constraints, and take the local optimal solution with the minimum total power generation cost as the final optimal solution G.

[0066] Compared with the prior art, the present invention has the following beneficial effects:

[0067] The present invention proposes the idea of ​​"on-chain segmentation and comparison optimization, and off-chain parallel fault-tolerant solution", establishes an on-chain and off-chain collaborative SCUC solution architecture, transfers the discrete optimization model solution process to the off-chain, and reduces the computational burden of the blockchain; the present invention considers Byzantine fault tolerance, load balancing and minimum redundancy, and establishes a fault-tolerant segmentation method for the unit combination solution space to take into account the reliability of the solution result and the efficiency of the solution process; the present invention designs a SCUC trusted solution smart contract and provides a practical SCUC trusted solution solution. BRIEF DESCRIPTION OF THE DRAWINGS

[0068] Figure 1 This is a schematic diagram of the SCUC solution architecture based on blockchain on-chain and off-chain collaboration in the present invention.

[0069] Figure 2 This is a flow chart of the SCUC trusted solution based on smart contracts in the present invention.

[0070] Figure 3 It is a comparison chart of the start-stop status results of the unit in the centralized normal solution and the centralized cheating solution in the present invention.

[0071] Figure 4 This is a comparison chart of solution results for different scenarios based on the SCUC trusted solution method in the present invention.

[0072] Figure 5 This is a diagram of the start and stop states of the units solved by the algorithm in the present invention and the centralized normal solution. DETAILED DESCRIPTION

[0073] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0074] In an embodiment of the present invention, a blockchain-based unit commitment trusted optimization algorithm includes the following steps:

[0075] (1) Establishing the SCUC model and the on-chain-off-chain collaborative SCUC solution architecture, which includes an on-chain optimization layer and an off-chain solution layer, such as Figure 1 As shown in the figure, the on-chain optimization layer consists of a group of blockchain consensus nodes, which is responsible for dividing the SCUC model solution space into several redundant sub-solution spaces, distributing them to the off-chain solution layer, and obtaining the optimal solution of the original model by comparing the correct solution results submitted by the off-chain solution layer; the off-chain solution layer consists of a group of solution nodes, each of which searches for the local optimal solution of the original model in the corresponding sub-solution space distributed by the on-chain optimization layer, and submits it to the on-chain optimization layer;

[0076] (2) Establish a fault-tolerant partitioning method for the unit combination solution space to take into account the reliability of the SCUC model solution results and the efficiency of the solution process under the blockchain environment;

[0077] (3) Design the corresponding SCUC trusted solution smart contract;

[0078] The steps of establishing the SCUC model in step (1) are as follows:

[0079] The SCUC model aims to minimize the total power generation cost, and its objective function is expressed as:

[0080]

[0081] Among them, T is the total number of time periods in the scheduling cycle; I is the total number of units that can be started and stopped; are the electricity cost, startup cost and shutdown cost of the i-th unit in time period t respectively;

[0082] Electricity cost

[0083]

[0084] Where K is the number of segmented quotations of unit i in time period t; and are the bid and winning bid of unit i in the kth segment in time period t; α i,t is the online status of unit i in time period t (1 means the unit is online, 0 means the unit is not online); is the minimum technical output cost of unit i in period t;

[0085] Startup costs

[0086]

[0087] Among them, β i,t Indicates whether the unit i performs the startup action within the time period t (1 indicates the startup action is performed, 0 indicates the startup action is not performed); is the startup cost of unit i;

[0088] Shutdown costs

[0089]

[0090] Among them, γ i,t Indicates whether unit i executes shutdown action in time period t (1 indicates shutdown action is executed, 0 indicates no shutdown action is executed); is the shutdown cost of unit i;

[0091] Constraints

[0092] Power balance constraints

[0093]

[0094] Among them, P i,t is the output of unit i in period t; N is the number of nodes; D n,t is the load of node n in time period t; is the minimum technical output of unit i in period t;

[0095] System spare capacity constraints

[0096]

[0097] in, is the maximum output of unit i in time period t; M is the total number of inter-provincial tie lines; is the transmission power of inter-provincial tie line m in time period t; η i is the unit confidence factor; P t up , P t down are the system positive reserve constraint relaxation factor and the system negative reserve constraint relaxation factor for time period t respectively; are the system positive reserve demand and system negative reserve demand in time period t respectively;

[0098] Constraints on winning bids for unit tranches

[0099]

[0100] in, is the declared quantity of the kth segment quotation of unit i in time period t;

[0101] Unit ramp rate constraint

[0102]

[0103] in, and are the maximum ramp-up rate and maximum ramp-down rate of unit i in time period t respectively;

[0104] Minimum continuous start and stop time constraints for units

[0105]

[0106] in, and are the continuous start-up and shutdown times of unit i in time period t, respectively; and are the minimum continuous start time and minimum continuous shutdown time of unit i respectively;

[0107] Energy Constraint

[0108]

[0109] Among them, E n,t is the net injected power of node n in time period t; n is the set of all units on node n; F l,t is the branch power flow of line l in time period t; SF n,l is the output power transfer distribution factor of node n to line l; The upper and lower limits of the transmission power of line l in time period t respectively;

[0110] The steps of establishing the fault-tolerant partitioning method of the unit combination solution space in step (2) are as follows: first, a 0-1 variables are selected in the unit combination model, and the complete solution space Ω is partitioned into X=2 a Segmentation Unit Then, the segmentation units are reassembled into N sub-solution spaces Each sub-solution space contains [X(f+1) / N] split units, which are distributed to the solving nodes for optimization. Each solving node performs optimization in parallel according to the divided sub-solution space and submits the solution results to the chain. The consensus node compares all solution results through cross-communication verification and takes the solution result that meets the constraints and has the lowest total power generation cost as the final optimal solution;

[0111] In the on-chain optimization layer, based on the classic branch-and-bound idea of ​​discrete optimization problems, the original solution space is divided into a set of segmentation units using the 0-1 variables in the unit commitment model, and the segmentation units are combined into N sub-solution spaces, which are distributed to the solving nodes for optimization, where N is the number of solving nodes. In order to ensure that the proposed method can still obtain the optimal solution in the case of tampering with the solution results or offline failure of some solving nodes, and to ensure the optimization efficiency, the sub-solution space division meets the following conditions:

[0112] Load balancing: The sub-solution spaces that each solving node is responsible for optimizing are of the same size, as shown in formula (12):

[0113]

[0114] Among them, J is the number of nodes to be solved, The sub-solution space that node j is responsible for searching for the best solution, |·| represents the number of segmentation units contained in the solution space;

[0115] Byzantine fault tolerance: Assuming that there are no more than f cheating nodes among the solving nodes, which may disrupt the solving process by submitting wrong solution results or not submitting solution results, then any f+1 solving nodes should restore the complete solution space, as shown in formula (13):

[0116]

[0117] Among them, Ω is the solution space of the unit commitment model;

[0118] Minimum redundancy: The sub-solution space that each solution node is responsible for optimizing should minimize redundancy, as shown in formula (14):

[0119]

[0120] The step (3) of designing the corresponding SCUC trusted solution smart contract includes three stages: SCUC model preparation, fault-tolerant segmentation of solution space, and optimal solution verification and comparison, including the following functions:

[0121] 1) SCUC model preparation stage

[0122] ① Model data upload function: The market operation organization collects the relevant parameters of each generator set and the market boundary conditions, establishes the SCUC model, converts the model into JSON format and uploads it to the blockchain, including the objective function and various constraints, as shown in equations (1) to (11), for each solution node to access and download, to ensure the consistency of the subsequent solution process;

[0123] 2) Solution space segmentation stage

[0124] ②Solution space partition function: select a 0-1 variable in the SCUC model and partition the solution space Ω into X=2 a Segmentation Unit Then the segmentation units are reassembled into N sub-solution spaces to form the allocation scheme M as shown in formula (15):

[0125]

[0126] The number of rows N of the matrix M is the number of sub-solution spaces, and the number of columns X is the number of segmentation units; the element M ij =1 indicates subsolution space Contains split unit M ij = 0 means sub-solution space Does not include split unit

[0127] 3) Optimal solution verification and comparison stage

[0128] ③ Local optimal solution publishing function: Each solving node independently searches for the local optimal solution in the corresponding sub-solution space off-chain, and publishes the calculated local optimal solution L i Submit to blockchain;

[0129] ④Constraint verification function: collect the local optimal solution L of each solution node i After that, verify whether each local optimal solution satisfies the constraint conditions such as equation (5)-equation (11), and remove the local optimal solution that does not meet the constraint conditions;

[0130] ⑤ Final optimal solution comparison function: compare all local optimal solutions that meet the constraints, and take the local optimal solution with the minimum total power generation cost as the final optimal solution G.

[0131] Case Analysis

[0132] 1Environmental testing and node selection

[0133] To verify the effectiveness of the proposed SCUC trusted solution method, the present invention takes the actual data of a provincial power grid as an example (including 756 nodes and 120 units) for testing. A Hyperledger Fabric blockchain environment is built in the Ubuntu virtual machine environment, and the SCUC trusted solution smart contract is written in Go language. GAMS software is used to call CPLEX as the solver off-chain, and the computer configuration is Win10, 13th generation i5-13400F, RTX4060, 8G independent graphics, 16G memory and 1TBSSD.

[0134] In the example, we set a=3, N=4, and f=1, and divide the complete solution space into 8 partition units. As shown in Section 3.1, each sub-solution space should have no less than 4 partition units, and the allocation matrix is ​​shown in Equation (16).

[0135]

[0136] 2. Fault Tolerance Test

[0137] In order to verify the fault tolerance of the SCUC trusted solution method proposed in this invention, this invention compares and analyzes the centralized cheating solution and the situation where there are different numbers of cheating solution nodes under this method. The cheating party affects the revenue of the unit by tampering with the online status of some units. For example, some units are forced to shut down during certain periods of time and excluded from the power generation plan, thereby increasing the revenue of other units.

[0138] In the case of centralized cheating solution, it is assumed that units 100 and 101 are forced to shut down during the daytime, that is, α 100,t ,α 101,t =0(t∈[20,64]), the solution is shown in Table 1. The total power generation cost is 195.46 million yuan, which is about 0.2% higher than the normal solution.

[0139] Table 1 Comparison between centralized normal solution and centralized cheating solution

[0140] Concentrated normal solution Centralized cheating solution Total power generation cost (10,000 yuan) 19508 19546 Calculation time(s) 40.04 41.13

[0141] Figure 3 The online status of all units in time period 2 under the centralized normal solution and centralized cheating solution is listed. By comparison, it can be seen that during the cheating solution, due to the forced shutdown of units 100 and 101, the units that should have been shut down can be started up to increase output. It can be seen that although the cheating of the centralized solution method has a small impact on the total power generation cost, it still causes a significant change in the unit output, affecting fair competition in the market and the rational allocation of resources.

[0142] In order to test the fault tolerance of the method proposed in this invention, 6 test scenarios are set. The cheating node numbers and cheating behaviors of each scenario are shown in Table 2 and Table 3 respectively. The solution results of each scenario are shown in Figure 4 shown.

[0143] Table 2. Cheating solution node numbers in each scenario

[0144] Scene number Cheat Solver Node Scenario 1 Node 1 Scenario 2 Node 2 Scene 3 Node 1, Node 2 Scene 4 Node 1, Node 4 Scene 5 Node 1, Node 2, Node 4 Scene 6 Node 1, Node 2, Node 3

[0145] Table 3 Node numbers and cheating behaviors

[0146] Solving node number Cheating Node 1 Set units 31, 37, and 45 to be built-in 0 during the period from 12:00 to 24:00 Node 2 Set units 108, 109, and 110 to be built-in 0 during the period from 10:00 to 16:00 Node 3 Set units 56 and 57 to be built-in between 11:00 and 24:00. Node 4 Set units 1, 34, and 35 to be built-in 0 during the period from 14:00 to 16:00

[0147] Depend on Figure 4 It can be seen that when only one solving node cheats, as shown in scenarios 1 and 2, since other nodes have traversed the complete solution space, the solution result of the proposed method is consistent with the normal solution result of the set. Therefore, the proposed method can meet the 1 / 3 fault tolerance.

[0148] When there are multiple cheating nodes, if the sub-solution space responsible for the remaining nodes contains the segmentation unit where the global optimal solution is located (as shown in scenarios 3 and 6), the solution result of the proposed method is still consistent with the normal solution result of the centralized solution; otherwise (as shown in scenarios 4 and 5), the solution result of the proposed method deviates from the normal solution result of the centralized solution. Nevertheless, under the solution space fault-tolerant segmentation method, the solution result is still close to the normal solution result, and the result deviation is less than 2%, which reflects the high robustness of the proposed method.

[0149] Since the final results of scenarios 1, 2, 3 and 6 are consistent with the correct solution results, the present invention compares the start and stop states of each unit in scenario 4 with those in the centralized normal solution, such as Figure 5 As shown. In scenario 4, compared with the centralized cheating solution, in scenario 4, only unit 57 changes from the on state to the off state, and the optimal solutions of the original model of the start and stop states of the other units remain consistent. It can be seen that this method can effectively reduce the unit output change in the case of node cheating.

[0150] Computational efficiency test

[0151] In order to test the computational efficiency of the proposed method, this section compares the solution time of the proposed method with that of the centralized normal solution, as shown in Table 4. The solution time is the average of 10 experiments.

[0152] Table 4 Comparison of normal solution results of centralized normal solution and SCUC trusted solution method

[0153]

[0154] As can be seen from Table 4, each solution node seeks the best solution in the sub-solution space it is responsible for, and the maximum solution time is 36.55 seconds, which is 8.7% less than that of the centralized solution. The improvement in computing efficiency comes from the fact that the centralized solution needs to seek the best solution in the complete solution space, while the method of the present invention divides the solution space so that each solution node only needs to seek the best solution in a subset of the complete solution space, thereby reducing the solution time.

[0155] Aiming at the verifiability and reliability issues of the traditional centralized solution method of the SCUC model, this paper proposes a trusted solution method for unit combination based on the idea of ​​blockchain on-chain and off-chain collaboration, builds a SCUC trusted solution architecture based on the idea of ​​"on-chain segmentation comparison and optimization, off-chain parallel fault-tolerant solution", proposes a fault-tolerant segmentation method for unit combination solution space, and designs a SCUC trusted solution smart contract. The simulation results based on the Hyperledger Fabric blockchain platform show that compared with the traditional centralized solution method, this method has the following advantages:

[0156] 1) Optimality can be verified: The method proposed in this paper breaks the “black box” of the SCUC model solution process, allowing all participants to participate in and verify the model solution process and results, thus achieving transparency of the solution process and verifiability of the results;

[0157] 2) Satisfying Byzantine fault tolerance: The proposed method can tolerate no more than 1 / 3 of the solving nodes cheating, and can still ensure the accuracy of the final solution of the SCUC model under cheating;

[0158] 3) Solution efficiency: The proposed method divides the solution space of the SCUC model so that each solution node only needs to search for the best solution in a subset of the complete solution space, which reduces the solution time by 8.7% compared with centralized solution.

[0159] The proposed SCUC model trusted solution method solves the problem that traditional "blockchain +" trusted optimization methods are difficult to support the solution of discrete optimization models. In the future, the application of the proposed method in other scenarios involving discrete optimization problems can be further explored.

[0160] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.

[0161] In addition, it should be understood that although the present specification is described according to implementation modes, not every implementation mode contains only one independent technical solution. This description of the specification is only for the sake of clarity. Those skilled in the art should regard the specification as a whole. The technical solutions in each embodiment may also be appropriately combined to form other implementation modes that can be understood by those skilled in the art.

Claims

1. Blockchain-based unit combination trusted optimization algorithm, It is characterized in that The steps include: (1) Establishing the SCUC model and the on-chain-off-chain collaborative SCUC solution architecture, the architecture includes an on-chain optimization layer and an off-chain solution layer, wherein the on-chain optimization layer is composed of a group of blockchain consensus nodes, responsible for dividing the SCUC model solution space into a number of redundant sub-solution spaces, distributing them to the off-chain solution layer, and obtaining the optimal solution of the original model by comparing the correct solution results submitted by the off-chain solution layer; the off-chain solution layer is composed of a group of solution nodes, each of which searches for the local optimal solution of the original model in the corresponding sub-solution space distributed by the on-chain optimization layer, and submits it to the on-chain optimization layer; (2) Establish a fault-tolerant partitioning method for the unit combination solution space to take into account the reliability of the SCUC model solution results and the efficiency of the solution process under the blockchain environment; (3) Design the corresponding SCUC trusted solution smart contract; The steps of establishing the SCUC model in step (1) are as follows: The SCUC model aims to minimize the total power generation cost, and its objective function is expressed as: Among them, T is the total number of time periods in the scheduling cycle; I is the total number of units that can be started and stopped; are the electricity cost, startup cost and shutdown cost of the i-th unit in time period t respectively; Electricity cost Where K is the number of segmented quotations of unit i in time period t; and are the bid and winning bid of unit i in the kth segment in time period t; α i,t is the online status of unit i in time period t, 1 means the unit is online, 0 means the unit is not online; is the minimum technical output cost of unit i in period t; Startup costs Among them, β i,t Indicates whether the unit i performs the startup action within the time period t (1 indicates the startup action is performed, 0 indicates the startup action is not performed); is the startup cost of unit i; Shutdown costs Among them, γ i,t Indicates whether unit i executes shutdown action in time period t (1 indicates shutdown action is executed, 0 indicates no shutdown action is executed); is the shutdown cost of unit i; Constraints Power balance constraints Among them, P i,t is the output of unit i in period t; N is the number of nodes; D n,t is the load of node n in time period t; is the minimum technical output of unit i in period t; System spare capacity constraints in, is the maximum output of unit i in time period t; M is the total number of inter-provincial tie lines; is the transmission power of inter-provincial tie line m in time period t; i is the unit confidence factor; P t up , P t down are the system positive reserve constraint relaxation factor and the system negative reserve constraint relaxation factor for time period t respectively; are the system positive reserve demand and system negative reserve demand in time period t respectively; Constraints on winning bids for unit tranches in, is the declared quantity of the kth segment quotation of unit i in time period t; Unit ramp rate constraint in, and are the maximum ramp-up rate and maximum ramp-down rate of unit i in time period t respectively; Minimum continuous start and stop time constraints for units in, and are the continuous start-up and shutdown times of unit i in time period t, respectively; and are the minimum continuous start time and minimum continuous shutdown time of unit i respectively; Energy Constraint Among them, E n,t is the net injected power of node n in time period t; n is the set of all units on node n; F l,t is the branch power flow of line l in time period t; SF n,l is the output power transfer distribution factor of node n to line l; The upper and lower limits of the transmission power of line l in time period t respectively; The steps of establishing the fault-tolerant partitioning method of the unit combination solution space in step (2) are as follows: first, a 0-1 variables are selected in the unit combination model, and the complete solution space Ω is partitioned into X=2 a Segmentation Unit Then, the segmentation units are reassembled into N sub-solution spaces Each sub-solution space contains [X(f+1) / N] split units, which are distributed to the solving nodes for optimization. Each solving node performs optimization in parallel according to the divided sub-solution space and submits the solution results to the chain. The consensus node compares all solution results through cross-communication verification and takes the solution result that meets the constraints and has the lowest total power generation cost as the final optimal solution; In the on-chain optimization layer, based on the classic branch-and-bound idea of ​​discrete optimization problems, the original solution space is divided into a set of segmentation units using the 0-1 variables in the unit commitment model, and the segmentation units are combined into N sub-solution spaces, which are distributed to the solution nodes for optimization, where N is the number of solution nodes, and the sub-solution space division meets the following conditions: Load balancing: The sub-solution spaces that each solving node is responsible for optimizing are of the same size, as shown in formula (12): Among them, J is the number of nodes to be solved, The sub-solution space that node j is responsible for searching for the best solution, |·| represents the number of segmentation units contained in the solution space; Byzantine fault tolerance: Assuming that there are no more than f cheating nodes among the solving nodes, which disrupt the solving process by submitting wrong solution results or not submitting solution results, then any f+1 solving nodes should restore the complete solution space, as shown in formula (13): Among them, Ω is the solution space of the unit commitment model; Minimum redundancy: The sub-solution space that each solution node is responsible for optimizing should minimize redundancy, as shown in formula (14): The step (3) of designing the corresponding SCUC trusted solution smart contract includes three stages: SCUC model preparation, fault-tolerant segmentation of solution space, and optimal solution verification and comparison, including the following functions: 1) SCUC model preparation stage ① Model data upload function: The market operation organization collects the relevant parameters of each generator set and the market boundary conditions, establishes the SCUC model, converts the model into JSON format and uploads it to the blockchain, including the objective function and various constraints, as shown in equations (1) to (11), for each solution node to access and download, to ensure the consistency of the subsequent solution process; 2) Solution space segmentation stage ②Solution space partition function: select a 0-1 variable in the SCUC model and partition the solution space Ω into X=2 a Segmentation Unit Then the segmentation units are reassembled into N sub-solution spaces to form the allocation scheme M as shown in formula (15): The number of rows N of the matrix M is the number of sub-solution spaces, and the number of columns X is the number of segmentation units; the element M ij =1 indicates subsolution space Contains split unit M ij = 0 means sub-solution space Does not include split unit 3) Optimal solution verification and comparison stage ③ Local optimal solution publishing function: Each solving node independently searches for the local optimal solution in the corresponding sub-solution space off-chain, and publishes the calculated local optimal solution L i Submit to blockchain; ④Constraint verification function: collect the local optimal solution L of each solution node i After that, verify whether each local optimal solution satisfies the constraint conditions such as equation (5)-equation (11), and remove the local optimal solution that does not meet the constraint conditions; ⑤ Final optimal solution comparison function: compare all local optimal solutions that meet the constraints, and take the local optimal solution with the minimum total power generation cost as the final optimal solution G.

Citation Information

Patent Citations

  • Two-layer optimization method for security constrained unit commitment based on Benders decomposition

    CN108964012A

  • Unit commitment optimization processing method and device

    CN114784882A

  • Block chain consensus method supporting energy system optimization problem solving and verification

    CN114928449A

  • Security constraint-considered unit commitment optimization acceleration method and device and storage medium

    CN115511067A

  • Power system unit combination method, device and equipment and storage medium

    CN116488256A