A marginal cost bidding space method and apparatus based on secant black-necked crane optimization
By using the secant black-necked crane optimization method, the bidding space boundary is generated and active power bidding and reactive power network loss control are deeply coupled, which solves the problem of ignoring the impact of reactive power in the bidding space modeling of existing technologies, and improves the bidding profit of power generators and the market clearing efficiency.
Patent Information
- Application Number
- CN202611086807.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-07-21
- Publication Date
- 2026-11-17
AI Technical Summary
Existing electricity market bidding space modeling methods neglect the coupled impact of reactive power output on the system network loss distribution and node marginal electricity price, making it difficult for the bidding space to accurately reflect the actual generation cost of the units and system operation constraints, thus restricting the improvement of power generators' bidding profits.
The secant black-necked crane optimization method is adopted. By obtaining historical electricity prices, load and grid topology parameters, bidding space boundary data is generated. Combined with the black-necked crane optimizer and the secant optimization algorithm, the active power bidding strategy and reactive power loss control are deeply coordinated to optimize the optimal bidding bid price and reactive power output.
It achieves deep coupling between active power bidding strategy and reactive power loss control, improves the bidding profit of power generators and market clearing efficiency, and enhances the adaptability and robustness of the method under complex power grid conditions.
Smart Images

Figure CN123118153A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of electricity market transactions, and in particular to a marginal cost bidding space method, apparatus, equipment and storage medium based on secant black-necked crane optimization. Background Technology
[0002] "Peaking carbon emissions" and "carbon neutrality" are important national strategic development goals. As a key sector for reducing energy consumption and improving energy efficiency, the green and low-carbon transformation of the power industry is imperative. The "2024-2025 Energy Conservation and Carbon Reduction Action Plan" explicitly requires efforts from both the energy supply and consumption sides to strictly control the energy industry structure, reduce the proportion of primary energy consumption, and optimize resource allocation. Against this backdrop, deepening power market reform and establishing a location-based marginal price bidding mechanism based on marginal cost have become core tools for guiding the optimal allocation of power resources and achieving cost reduction and efficiency improvement from the market trading side.
[0003] With the deepening of smart grid and new power system construction, the automation and intelligence levels of power systems have significantly improved, leading to increasingly widespread research on the construction of active power bidding space for power generators. The nodal pricing mechanism based on location-based marginal pricing has been widely used to guide electricity market clearing and settlement. This pricing mechanism can scientifically reflect the value of active power in a specific node and time period, and its value is jointly determined by the system's benchmark energy cost, network congestion cost, and transmission line power loss cost. Currently, how power generation operators can scientifically construct a safe and reasonable bidding space and submit optimal bidding strategies based on their own theoretical marginal costs has become a key issue in maximizing power generation profits and preventing malicious market manipulation.
[0004] However, in actual power networks, active power losses in transmission lines are the core physical factor affecting location-based marginal electricity prices and generation marginal costs. Most existing bidding space modeling methods only focus on active power bidding strategies, neglecting the coupled impact of reactive power output from the generation side on system network loss distribution and node marginal electricity prices. This results in the constructed bidding space failing to accurately reflect the actual generation costs of generating units and system operational constraints, thus limiting further improvements in generator bidding profits. Therefore, it is urgent to deeply coordinate and couple the active power strategy bidding of generation entities with the reactive power loss control of the physical power grid, constructing a bidding space optimization method that balances economic efficiency and security, in order to promote the continuous improvement of resource allocation efficiency under the background of power market reform. Summary of the Invention
[0005] The present invention aims to at least partially solve one of the technical problems in the related art.
[0006] To address this, this invention proposes a marginal cost bidding space method based on secant black-necked crane optimization. Historical electricity prices, load, and grid topology parameters are acquired to generate boundary data for the bidding space of each generator node. Using the bid price and reactive power output control quantity as the outer variable combination, the population is initialized through a black-necked crane optimizer under boundary and reactive power constraints. The current variable combination is fixed as the input to the inner layer, and the active power balance equation is solved using the secant optimization algorithm to output the optimal active power output allocation. Through power flow calculation and expected bidding profit assessment, the globally optimal individual is updated, driving the black-necked crane optimizer to iteratively optimize until a preset iteration limit is reached, at which point the final bid price and reactive power output control quantity are output. This invention achieves deep synergistic coupling between active power bidding strategy and reactive power loss control, effectively improving generator bidding profits and market clearing efficiency.
[0007] Another objective of this invention is to propose a marginal cost bidding space device based on secant black-necked crane optimization.
[0008] The third objective of this invention is to provide a computer device.
[0009] A fourth objective of this invention is to provide a non-transitory computer-readable storage medium.
[0010] To achieve the above objectives, this invention proposes a marginal cost bidding space method based on secant black-necked crane optimization, comprising:
[0011] Acquire historical electricity prices, load data, and grid topology parameters to generate bidding space boundary data for each generation node; The bidding price is defined as the outer decision variable, and the bidding space boundary data is used as the feasible value range of the bidding price. The reactive power output control quantity and the bidding price are combined to form the outer decision variable combination. Based on the Black-necked Crane Optimizer, the population of the outer decision variable combination is initialized under the constraints of the bidding space boundary data and reactive power equipment capacity, and the initial outer population data is generated. The current combination of decision variables in the initial outer population data is used as a fixed constant input to the inner layer. The secant optimization algorithm is called to iteratively solve the active power balance equation with the root-finding objective, and outputs the optimal active power output allocation data corresponding to the current combination of decision variables. Power flow calculation is performed based on the optimal active power output allocation data. The fitness value of the current combination of decision variables is calculated according to the objective function oriented towards maximizing expected bidding profits, and the global optimal individual data is updated based on the fitness value. The black-necked crane optimizer is driven by the globally optimal individual data to perform branch update and mutation operations, generating the next generation of outer population data. It is then determined whether the current iteration count has reached the preset upper limit. If not, the next generation of outer population data is returned to the inner layer as the new current outer population data to continue iteration. If the upper limit has been reached, the final bid price and reactive power control quantity in the globally optimal individual data are output as the optimization result.
[0012] The marginal cost bidding space method based on secant black-necked crane optimization according to an embodiment of the present invention may also have the following additional technical features: In one embodiment of the present invention, generating bidding space boundary data for each power generation node includes: Obtain historical electricity market settlement price data for multiple time periods and corresponding total system load data; construct a historical electricity price multinomial regression model with total system load as the independent variable:
[0013] in, It is the electricity market settlement price for the t-th time period in history. It is the total system load demand in the historical time period t. The electricity price characteristic coefficients are obtained by fitting historical data using the least squares method. It is the fitting residual at time t; Obtain the residual sequence between the fitted electricity price value and the measured historical electricity price value, and calculate the conditional variance of the historical electricity price over a specific period:
[0014] in, It is the variance of historical electricity price fluctuations. It is the total number of sampling periods for historical data. It is the average historical electricity price within the sampling period; Obtain the power grid topology parameters and construct a network loss model that takes into account active power loss caused by transmission line resistance:
[0015] in, It is the total active power loss of the entire power transmission line network. It is the collection of all transmission lines within the system. It is a connection node i and nodes j transmission lines k , It is a power transmission line k Resistance value These represent transmission lines respectively. k The above is from the node i Flow to Nodej Active power and reactive power It is a node i The voltage amplitude; Construct marginal cost functions for each node with the objective of minimizing the total operating cost of the system's generator units:
[0016] in, It is a node m The marginal cost of the node It is the system's benchmark marginal price of electricity. It is the marginal network loss coefficient of node m. It is a power transmission line l Network congestion shadow pricing It is a node m For transmission lines l The power transmission distribution factor is calculated; the real-time marginal cost of each node is output after solving. Using the sum of the expected electricity price and the preset multiple of the electricity price volatility as the upper limit of the bidding, and the real-time marginal cost of each node as the lower limit of the bidding, the bidding space boundary data of each power generation node is generated:
[0017]
[0018] in, It is the lower limit of the bidding strategy bid price for the power generation unit at node m in the current trading session. It is the upper limit of the bidding strategy declared by the power generation unit at node m in the current trading session. The historical settlement electricity price fitting value for time period t is calculated from the historical electricity price model. The historical electricity price standard deviation is calculated from the historical electricity price model. It is the market price regulation coefficient.
[0019] In one embodiment of the present invention, the population initialization of the outer layer decision variable combination based on the black-necked crane optimizer under the constraints of the bidding space boundary data and reactive power equipment capacity includes: Obtain the upper and lower limits of the bid price for each node in the bid space boundary data; Obtain the upper and lower limits of the capacity of each reactive power compensation device in the power grid; randomly assign values to the bidding price variable of each individual within the interval formed by the upper and lower limits of the bidding price of each node; and randomly assign values to the reactive power output control variable of each individual within the interval formed by the upper and lower limits of the capacity of each reactive power compensation device. The bidding prices of all nodes in each individual are concatenated with the reactive power output control quantities of all reactive power compensation devices to form a multi-dimensional decision vector:
[0020] in, The bid price submitted by the generator set at node m; Let J be the reactive power output control quantity of the j-th reactive power compensation device in the power grid; BNCO is responsible for searching within the global feasible region to maximize the overall expected profit. F Maximize the optimal combination of pricing and reactive power control, and focus on monitoring the upper and lower limits of node voltage operation and equipment capacity limits.
[0021] In one embodiment of the present invention, the secant optimization algorithm is invoked to iteratively solve the active power balance equation as the root-finding objective, and the optimal active power output allocation data corresponding to the current combination of decision variables is output, including: Obtain the bidding price data and reactive power output control data from the current decision variable combination as fixed constants, and obtain the total system load data and power grid topology parameters; Using the actual active power output of generator units and the active power loss of the entire network as search variables, and the absolute value of the residuals of the system's active power balance equation as the objective function for finding the root:
[0022] When the inner layer iteration reaches the preset upper limit or the root-finding objective function value is less than the preset convergence threshold, the inner layer iteration is terminated, and the optimal active power output allocation data of each generator unit corresponding to the optimal solution is output.
[0023] In one embodiment of the present invention, calculating the fitness value of the current combination of decision variables according to an objective function oriented towards maximizing expected bidding profits includes: Obtain the bidding price data and optimal active power output allocation data in the current decision variable combination, and obtain the fitting coefficients of the basic production cost function for each power generation unit; For each power generation unit, the expected revenue is calculated by multiplying the corresponding output value in the optimal active power output allocation data by the bid price. The expected cost is calculated by substituting the output value into the basic production cost function. The expected profit is obtained by subtracting the expected cost from the expected revenue. The expected profits of all power generation units are then summed.
[0024] in, It is the total expected profit target value of power generation units participating in bidding in the electricity market. This represents the actual bid price submitted by the power generation unit at node m, and is the core decision variable of the bidding space model. It is the first i Each power generation unit has active power output, The first one is obtained by fitting from the historical electricity price model. i The basic production cost function of a power generation unit; Output the overall expected bidding profit under the current combination of decision variables as the fitness value.
[0025] In one embodiment of the present invention, driving the black-necked crane optimizer to perform a branch update operation includes: Get the current iteration round and the preset maximum number of iterations, and calculate the ratio of the current iteration round to the maximum number of iterations; When the ratio is less than or equal to the preset branch threshold, the exploration branch is activated. The location data of random individuals in the current population and the location data of the current individual are obtained. The first position update formula of the Black-necked Crane Optimizer is used to perform a large-scale global search and location of the unit's declared price and reactive power input parameters to generate new exploration location data:
[0026] When the ratio is greater than the preset branch threshold, the predation branch is activated. The position data of the current global best individual and the position data of the current individual are obtained. The second position update formula of the black-necked crane optimizer is used to establish a high-precision fine-tuning of the known high-quality bid range and generate new predation position data:
[0027] Merge all updated individual position data and output the updated population position data for each branch.
[0028] In one embodiment of the present invention, performing a mutation operation and determining the termination of the iteration to output an optimization result includes: Obtain the population data after the branch update and the corresponding fitness values. Sort all individuals from high to low according to the fitness values and filter out the poor individuals in the bottom 20%. Obtain the current decision vector for each inferior individual, and apply a perturbation to the current decision vector using the following Gaussian / Cauchy scale hybrid mutation operator formula to readjust its position within the bidding feasible space, generating new individual position data after mutation:
[0029] The original inferior individuals are replaced with the new individual location data, all unreplaced individuals are merged with the mutated new individuals, and the next generation outer population data is output. Determine whether the current iteration count has reached the preset maximum iteration count. If not, return to the inner layer to continue iterating. If it has reached the maximum, output the final bid price and reactive power control quantity from the currently recorded global optimal individual data as the optimization result to the control terminal.
[0030] To achieve the above objectives, another aspect of the present invention proposes a marginal cost bidding space device based on secant black-necked crane optimization, comprising: The boundary generation module is used to obtain historical electricity prices, load data and power grid topology parameters, and generate the bidding space boundary data for each generation node; The population initialization module is used to define the bidding price as the outer decision variable and use the bidding space boundary data as the feasible value range of the bidding price; it combines the reactive power output control quantity and the bidding price to form the outer decision variable combination; based on the Black-necked Crane optimizer, under the constraints of the bidding space boundary data and reactive power equipment capacity, it performs population initialization on the outer decision variable combination to generate initial outer population data; The clearing assessment module takes the current combination of decision variables from the initial outer population data as a fixed constant input to the inner layer, calls the secant optimization algorithm to iteratively solve the active power balance equation with the root-finding objective, and outputs the optimal active power output allocation data corresponding to the current combination of decision variables; performs power flow calculation based on the optimal active power output allocation data, calculates the fitness value of the current combination of decision variables according to the objective function oriented towards maximizing expected bidding profits, and updates the record of the globally optimal individual data based on the fitness value; The iterative optimization module is used to drive the Black-necked Crane optimizer to perform branch updates and mutation operations based on the globally optimal individual data, generating the next generation of outer population data; it determines whether the current iteration count has reached the preset limit. If not, the next generation of outer population data is returned to the inner layer as the new current outer population data to continue iterating; if it has reached the limit, the final bid price and reactive power control quantity in the globally optimal individual data are output as the optimization result.
[0031] This invention discloses a marginal cost bidding space method and apparatus based on secant black-necked crane optimization. By constructing a historical electricity price regression model and a node marginal cost function, it generates bidding space boundary data for each power generation node. Active power bidding and reactive power output control are jointly used as outer-layer decision variables. The inner layer employs a secant optimization algorithm to solve the active power balance equation, while the outer layer is driven by a black-necked crane optimizer for global search and local development. Through branch updates and mutation operations, iterative optimization is performed, ultimately outputting the optimal bidding strategy and reactive power control scheme. This invention achieves deep synergistic coupling between active power bidding strategy and reactive power network loss control, effectively solving the bidding deviation problem caused by neglecting the impact of reactive power regulation on marginal cost in traditional bidding space modeling. It significantly improves the expected bidding profit of power generators and enhances the adaptability, robustness, and engineering practical value of the method under complex power grid conditions.
[0032] To achieve the above objectives, a third aspect of this application provides a computer device comprising a processor and a memory; wherein the processor runs a program corresponding to the executable program code by reading executable program code stored in the memory, for implementing a marginal cost bidding space method based on secant black-necked crane optimization as described in the first aspect embodiment.
[0033] To achieve the above objectives, a fourth aspect of this application provides a non-transitory computer-readable storage medium storing a computer program that, when executed by a processor, implements a marginal cost bidding space method based on secant black-necked crane optimization as described in the first aspect embodiment.
[0034] Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. Attached Figure Description
[0035] The above and / or additional aspects and advantages of the present invention will become apparent and readily understood from the following description of the embodiments taken in conjunction with the accompanying drawings, wherein: Figure 1 This is a flowchart of a marginal cost bidding space method based on secant black-necked crane optimization according to an embodiment of the present invention; Figure 2 This is a flowchart of the improved secant optimization-black-necked crane optimizer (SOA-BNCO) algorithm for solving the model according to an embodiment of the present invention; Figure 3 This is a schematic diagram of the structure of a marginal cost bidding space device based on secant black-necked crane optimization according to an embodiment of the present invention; Figure 4 It is a computer device according to an embodiment of the present invention. Detailed Implementation
[0036] It should be noted that, unless otherwise specified, the embodiments and features described in the present invention can be combined with each other. The present invention will now be described in detail with reference to the accompanying drawings and embodiments.
[0037] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.
[0038] The following description, with reference to the accompanying drawings, describes a marginal cost bidding space method, apparatus, device, and storage medium based on secant black-necked crane optimization according to embodiments of the present invention.
[0039] Example 1 like Figure 1 As shown, the marginal cost bidding space method based on secant black-necked crane optimization of the present invention includes the following steps: S1 acquires historical electricity prices, load data, and grid topology parameters to generate bidding space boundary data for each generation node.
[0040] In one embodiment of the present invention, a historical electricity price model is constructed primarily to uncover the fluctuation patterns of historical electricity market prices and the inherent mapping relationship between electricity prices and system load, providing a data benchmark and price expectations for the subsequent construction of bidding space. The model construction requires comprehensive consideration of multiple factors, including the physical characteristics of the system, operational constraints, and market demand. Historical electricity price volatility is used to quantify the risk range of historical electricity prices, calculating the conditional variance of historical electricity prices within a specific period to characterize the severity of price fluctuations.
[0041] It should be understood that the objective function for historical electricity price volatility is as follows: First, considering that electricity prices in the electricity market typically exhibit a non-linear variation with load demand, a historical electricity price multinomial regression model is constructed with the total system load as the independent variable:
[0042] in, It is the electricity market settlement price for the t-th time period in history. It is the total system load demand in the historical time period t. The electricity price characteristic coefficients are obtained by fitting historical data using the least squares method. It is the fitting residual for time period t.
[0043] Then, in order to quantify the risk range of historical electricity prices, the conditional variance of historical electricity prices over a specific period is calculated to characterize the degree of price volatility:
[0044] in, It is the variance of historical electricity price fluctuations. It is the total number of sampling periods for historical data. It is the average historical electricity price within the sampling period.
[0045] S2, define the bidding price as the outer layer decision variable, and use the bidding space boundary data as the feasible value range of the bidding price; combine the reactive power output control quantity and the bidding price to form the outer layer decision variable combination; based on the Black-necked Crane optimizer, perform population initialization on the outer layer decision variable combination under the constraints of the bidding space boundary data and reactive power equipment capacity, and generate initial outer layer population data.
[0046] In one embodiment of the present invention, a marginal cost model is constructed based on the current physical operating state of the power grid (taking into account network losses and reactive power optimization control) to calculate the theoretical marginal cost of each node, which serves as the core boundary constraint for bidding space optimization. This step specifically includes: First, the network loss model that takes into account the power loss of transmission lines is as follows:
[0047] in, It is the total active power loss of the entire power transmission line network. It is the collection of all transmission lines within the system. It is a connection node i and nodes j transmission lines k , It is a power transmission line k Resistance value These represent transmission lines respectively. k The above is from the node i Flow to Node j Active power and reactive power It is a node i voltage amplitude Then, to minimize the total operating cost of the system's generator units, the theoretical marginal cost function for each node, taking into account network loss sensitivity, is constructed as follows:
[0048] in, It is a node m The marginal cost of the node It is the system's benchmark marginal price of electricity. It is the marginal network loss coefficient of node m. It is a power transmission line l Network congestion shadow pricing It is a node m For transmission lines l The power transmission distribution factor.
[0049] Secondly, the constraints are: Active power balance constraints Node reactive power balance constraints upper and lower limits of reactive power compensation equipment capacity constraints Voltage operating upper and lower limits.
[0050] in, It is the total number of load nodes. It is the active power load demand of node m. It is the total number of generators, It is a node j Reactive power output of the power generation unit It is the reactive load demand at node j. It is the total number of system nodes, These represent the conductance and susceptance components in the power grid admittance matrix, respectively. node i With nodes j Voltage phase angle difference between It is the first j The lower and upper limits of the reactive power that a reactive power compensation device is allowed to output. It is a node m Permissible lower and upper voltage safety limits.
[0051] S3, the current combination of decision variables in the initial outer population data is used as a fixed constant input to the inner layer. The secant optimization algorithm is called to iteratively solve the active power balance equation with the root-finding objective, and the optimal active power output allocation data corresponding to the current combination of decision variables is output. Power flow calculation is performed according to the optimal active power output allocation data. The fitness value of the current combination of decision variables is calculated according to the objective function guided by the maximization of expected bidding profit, and the global optimal individual data is updated and recorded according to the fitness value.
[0052] In one embodiment of the present invention, the expected price and volatility output by the constructed historical electricity price model are used as an upper limit reference, and the real-time location marginal cost output by the marginal cost model is used as a lower limit support to establish the safe and reasonable range for each power generation node in market bidding, that is, to construct the boundary of the bidding space. The upper and lower boundaries of the bidding space are as follows:
[0053]
[0054] in, It is the lower limit of the bidding strategy bid price for the power generation unit at node m in the current trading session. It is the upper limit of the bidding strategy declared by the power generation unit at node m in the current trading session. The historical settlement electricity price fitting value for time period t is calculated from the historical electricity price model. The historical electricity price standard deviation is calculated from the historical electricity price model. It is the market price regulation coefficient.
[0055] It should be noted that the objective function for optimizing the bidding space in this invention, in order to maximize the economic benefits of power generation units within a reasonable bidding space while ensuring the safe operation of the power grid, incorporates the bid price within the bidding space as a new decision variable, which, together with the variables in the original marginal cost model, constitutes a comprehensive decision space. The objective function is constructed with the goal of maximizing the overall expected bidding profit of each power generation unit in the market as its guiding principle:
[0056] in, It is the total expected profit target value of power generation units participating in bidding in the electricity market. This represents the actual bid price submitted by the power generation unit at node m, and is the core decision variable of this bidding space model. It is the first i Each power generation unit has active power output, The first one is obtained by fitting from the historical electricity price model. i The basic production cost function for each power generation unit.
[0057] It should be understood that, compared with the traditional reactive power optimization control method, the present invention adds harmonic constraints, which are also an important factor affecting voltage quality.
[0058] It should be further explained that, in order to ensure that the bidding space constructed based on marginal cost can satisfy electricity pricing policies and market rules without exceeding the physical safety limit of the power grid when solved using the optimization algorithm (SOA-BNCO), the constraints constructed in this invention include the following three major categories of constraint sets: First, there are constraints on the bidding strategy's scope: the bid price must be strictly limited to a range determined by both historical electricity prices and marginal costs. .
[0059] Then there's the constraint of coupling between the physical network and network loss: due to the final clearing output of the bidding space model. This will directly alter the overall network flow and cause network losses; therefore, it is necessary to couple the physical constraints in the aforementioned marginal cost model, including: System active power balance constraints: ; Reactive power balance constraints: .
[0060] Finally, there are safety boundary constraints: Power generation unit output constraints: ; Reactive power compensation equipment capacity constraints: ; Node voltage safety constraints: .
[0061] S4. Based on the globally optimal individual data, drive the black-necked crane optimizer to perform branch update and mutation operations to generate the next generation of outer population data; determine whether the current iteration count has reached the preset upper limit. If not, return the next generation of outer population data as the new current outer population data to the inner layer to continue iteration; if it has reached the upper limit, output the final bid price and reactive power control quantity in the globally optimal individual data as the optimization result.
[0062] In one embodiment of the present invention, the constructed bidding space model based on marginal cost is solved using a two-layer nested collaborative optimization mechanism based on the secant optimization algorithm-black-necked crane optimizer (SOA-BNCO). This mechanism decouples the strategic game behavior of market participants from the physical losses and voltage of the power grid. Outer layer: The Black-necked Crane Optimizer (BNCO) is used as the outer layer optimization algorithm, and its decision variable vector is defined as follows:
[0063] in, The bid price submitted by the generator set at node m; Let be the reactive power output control quantity of the j-th reactive power compensation device in the power grid. BNCO is responsible for searching within the global feasible region to maximize the overall expected profit. F Maximize the optimal combination of pricing and reactive power control, and focus on monitoring the upper and lower limits of node voltage operation and equipment capacity limits.
[0064] Inner layer: Each time the outer BNCO is updated, a new set of... At that time, due to the quotation and no effort put in The power market clearing system has been fixed, degenerating into a deterministic active power flow balancing problem. At this point, the secant optimization algorithm (SOA) is invoked as the core inner clearing tool. The SOA search space is the actual active power output of the generating units. and the total network active power loss Specifically designed for solving strongly nonlinear equality constraints—the active power balance equations of a system: It should be noted that the SOA algorithm of this invention utilizes its powerful numerical secant approximation root-finding characteristics to achieve ultra-fast clearing of unit output and feed the clearing results back to the outer layer, thus avoiding the non-convergence phenomenon that is very easy to occur when conventional swarm intelligence algorithms solve the power flow balance equation.
[0065] It is worth mentioning that the optimization model of this invention belongs to a complex nonlinear problem with single objective and multiple constraints. The solution algorithm used is a hybrid solution algorithm based on the secant optimization algorithm and the black-necked crane optimizer (SOA-BNCO). The solution process is as follows: Figure 2 As shown, the specific steps are as follows: Step 1: Global parameter initialization and input of historical electricity market data, including the power system network topology parameters, node impedance matrix, and load profiles for each time period. Extract historical electricity price-load datasets and calculate the expected system electricity price using historical electricity price regression and conditional variance models. With electricity price volatility Fitting coefficients for the production cost of the loaded power generation unit. .
[0066] Step 2, Outer Population Initialization: Set the maximum number of iterations for the BNCO algorithm. Exploration Factors and population size Based on the constructed historical electricity price fit values and marginal cost model, the upper and lower boundaries of the bidding space for each node are calculated. , And generate the outer population location within the constrained space. .
[0067] .
[0068] Step 3, Inner Layer Clearing Calculation: For the k-th individual in the outer layer population, fix its corresponding control combination. The inner layer uses this data as a constant input to initiate a secant optimization algorithm to quickly solve for the unit's output distribution and evaluate the residuals of the equation of equilibrium. The average position of the current population is calculated according to the SOA update criterion. The Euclidean distance is used to find the individuals closest to and farthest from the ideal equilibrium point within the active constraint space. Based on the tangent projection of the secant principle, the new position is calculated. Perform a double-random competitive judgment: if the conditions are met, adopt the approach to local optimum update, execute the mutation strategy and update the active clearing solution set. If the number of iterations reaches the inner limit, the inner loop terminates and returns the clearing result to the outer loop: optimal output allocation. and related line network losses .
[0069] Step 4: Combine the active power output with feedback from the inner SOA layer. And the current Perform power flow calculations. Calculate the voltage magnitude at each node. Substituting these data into the generalized fitness function constructed in this invention, the fitness value of the k-th black-necked crane individual is calculated. Identify and record the best individual in the current population. And its corresponding optimal expected profit.
[0070] Step 5: Initiate the outer multi-branch iterative search, enter the t-th iteration loop, and execute the BNCO branch state transition according to the current iteration round t: Branch A (exploration and search phase): When At this time, the foraging space strategy is activated. According to BNCO... Calculate the new search position derived from the current bid space and update the formula. Price and reactive power input parameters of the generating unit Perform a large-scale global search and location. Branch B (Development and Predation Phase): When At that time, activate the surprise development strategy. According to and Establish a high-precision fine-tuning mechanism for known high-quality price ranges.
[0071] Step 6: In the outer-layer iterative evolution, in order to simulate the migratory characteristics of black-necked cranes and escape the local electricity price trap, a probabilistic collision comparison is performed on the individual positions. If the migration threshold constraint is met... Then call type C1 Generate migration coordinate updates with strong directional bias, enabling the bidding strategy to converge towards the feasible region with high profits and low harmonic distortion.
[0072] If the condition is not met, then the following C2 formula is called:
[0073] Generate a diffusion-style variable-step lateral update, after branch merging, using the following formula:
[0074] Unify and complete the basic coordinates within the current evolutionary cycle Refresh.
[0075] Step 7: To prevent some power generators from continuously reporting loss-making electricity prices or excessive compensation for reactive power equipment, targeted mutation treatment is carried out on the bottom 20% of black-necked crane individuals with the worst fitness:
[0076] Applying a Gaussian / Cauchy-scale mixed variation to it introduces an external perturbation; according to the following equation:
[0077] By readjusting their position within the feasible bidding space, the diversity of the outer population can be maintained, thereby increasing the probability of avoiding local extrema.
[0078] Step 8: Evaluate the updated fitness of the population and overwrite the historical best individual with a better combination of bidding and reactive power control. And optimal fitness. Determine whether it satisfies... If so, then the iteration count is incremented. Then return to step 3 to enter the next loop; if the loop does not terminate, output the current best control result to the control terminal.
[0079] The method of this invention effectively solves the bidding deviation problem caused by neglecting the impact of reactive power regulation on marginal cost and the easy non-convergence of the active power balance equation in traditional methods. It significantly improves the expected bidding profit of power generators and market clearing efficiency, and enhances the adaptability, robustness and engineering practical value of the method under complex power grid conditions.
[0080] Example 2 To achieve the above invention, such as Figure 3 As shown, this embodiment also provides a marginal cost bidding space device 10 based on secant black-necked crane optimization, the device 10 comprising: The boundary generation module 100 is used to obtain historical electricity prices, load data and power grid topology parameters, and generate the bidding space boundary data for each generation node.
[0081] The population initialization module 200 is used to define the bidding price as the outer decision variable and use the bidding space boundary data as the feasible value range of the bidding price; to combine the reactive power output control quantity and the bidding price to form the outer decision variable combination; and to perform population initialization on the outer decision variable combination based on the Black-necked Crane optimizer under the constraints of the bidding space boundary data and reactive power equipment capacity, thereby generating initial outer population data.
[0082] The clearing assessment module 300 is used to input the current combination of decision variables in the initial outer population data as a fixed constant into the inner layer, call the secant optimization algorithm to iteratively solve the active power balance equation with the root-finding objective, and output the optimal active power output allocation data corresponding to the current combination of decision variables; perform power flow calculation based on the optimal active power output allocation data, calculate the fitness value of the current combination of decision variables according to the objective function guided by the maximization of expected bidding profit, and update the record of the global optimal individual data based on the fitness value.
[0083] The iterative optimization module 400 is used to drive the black-necked crane optimizer to perform branch update and mutation operations based on the globally optimal individual data, and generate the next generation of outer population data. It determines whether the current iteration count has reached the preset limit. If it has not reached the limit, the next generation of outer population data is returned to the inner layer as the new current outer population data to continue the iteration. If it has reached the limit, the final bid price and reactive power control quantity in the globally optimal individual data are output as the optimization result.
[0084] The device in this invention realizes deep synergistic coupling between active power bidding strategy and reactive power loss control, effectively solving the bidding deviation problem caused by neglecting the impact of reactive power regulation on marginal cost and the easy non-convergence of the active power balance equation in traditional devices. It significantly improves the expected bidding profit of power generators and market clearing efficiency, and enhances the adaptability, robustness and engineering practical value of the device under complex power grid conditions.
[0085] Example 3 To implement the methods of the above embodiments, the present invention also provides a computer device, such as... Figure 4 As shown, the computer device 600 includes a memory 601 and a processor 602; wherein, the processor 602 reads the executable program code stored in the memory 601 to run a program corresponding to the executable program code, so as to implement the various steps of the marginal cost bidding space method based on secant black-necked crane optimization described above.
[0086] Example 4 To implement the above embodiments, this application also proposes a non-transitory computer-readable storage medium storing a computer program that, when executed by a processor, implements a marginal cost bidding space method based on secant black-necked crane optimization as described in the foregoing embodiments.
[0087] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., refer to specific features, structures, materials, or characteristics described in connection with that embodiment or example, which are included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.
[0088] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this invention, "a plurality of" means at least two, such as two, three, etc., unless otherwise explicitly specified.
Claims
1. A marginal cost bidding space method based on secant black-necked crane optimization, characterized in that, include: Acquire historical electricity prices, load data, and grid topology parameters to generate bidding space boundary data for each generation node; The bidding price is defined as the outer decision variable, and the bidding space boundary data is used as the feasible value range of the bidding price. The reactive power output control quantity and the bidding price are combined to form the outer decision variable combination. Based on the Black-necked Crane Optimizer, the population of the outer decision variable combination is initialized under the constraints of the bidding space boundary data and reactive power equipment capacity, and the initial outer population data is generated. The current combination of decision variables in the initial outer population data is used as a fixed constant input to the inner layer. The secant optimization algorithm is called to iteratively solve the active power balance equation with the root-finding objective, and outputs the optimal active power output allocation data corresponding to the current combination of decision variables. Power flow calculation is performed based on the optimal active power output allocation data. The fitness value of the current combination of decision variables is calculated according to the objective function oriented towards maximizing expected bidding profits, and the global optimal individual data is updated based on the fitness value. The black-necked crane optimizer is driven by the globally optimal individual data to perform branch update and mutation operations, generating the next generation of outer population data. It is then determined whether the current iteration count has reached the preset upper limit. If not, the next generation of outer population data is returned to the inner layer as the new current outer population data to continue iteration. If the upper limit has been reached, the final bid price and reactive power control quantity in the globally optimal individual data are output as the optimization result.
2. The method as described in claim 1, characterized in that, Generate the bidding space boundary data for each power generation node, including: Obtain historical electricity market settlement price data for multiple time periods and corresponding total system load data; construct a historical electricity price multinomial regression model with total system load as the independent variable: in, It is the electricity market settlement price for the t-th time period in history. It is the total system load demand in the historical time period t. The electricity price characteristic coefficients are obtained by fitting historical data using the least squares method. It is the fitting residual at time t; Obtain the residual sequence between the fitted electricity price value and the measured historical electricity price value, and calculate the conditional variance of the historical electricity price over a specific period: in, It is the variance of historical electricity price fluctuations. It is the total number of sampling periods for historical data. It is the average historical electricity price within the sampling period; Obtain the power grid topology parameters and construct a network loss model that takes into account active power loss caused by transmission line resistance: in, It is the total active power loss of the entire power transmission line network. It is the collection of all transmission lines within the system. It is a connection node i and nodes j transmission lines k , It is a power transmission line k Resistance value These represent transmission lines respectively. k The above is from the node i Flow to Node j Active power and reactive power It is a node i The voltage amplitude; Construct marginal cost functions for each node with the objective of minimizing the total operating cost of the system's generator units: in, It is a node m The marginal cost of the node It is the system's benchmark marginal price of electricity. It is the marginal network loss coefficient of node m. It is a power transmission line l Network congestion shadow pricing It is a node m For transmission lines l The power transmission distribution factor is calculated; the real-time marginal cost of each node is output after solving. Using the sum of the expected electricity price and the preset multiple of the electricity price volatility as the upper limit of the bidding, and the real-time marginal cost of each node as the lower limit of the bidding, the bidding space boundary data of each power generation node is generated: in, It is the lower limit of the bidding strategy bid price for the power generation unit at node m in the current trading session. It is the upper limit of the bidding strategy declared by the power generation unit at node m in the current trading session. The historical settlement electricity price fitting value for time period t is calculated from the historical electricity price model. The historical electricity price standard deviation is calculated from the historical electricity price model. It is the market price regulation coefficient.
3. The method as described in claim 1, characterized in that, Based on the Black-necked Crane optimizer, population initialization is performed on the combination of outer-layer decision variables under the constraints of the bidding space boundary data and reactive power equipment capacity, including: Obtain the upper and lower limits of the bid price for each node in the bid space boundary data; Obtain the upper and lower limits of the capacity of each reactive power compensation device in the power grid; randomly assign a value to the bid price variable of each individual within the interval formed by the upper and lower limits of the bid price of each node; and randomly assign a value to the reactive power output control variable of each individual within the interval formed by the upper and lower limits of the capacity of each reactive power compensation device. The bidding prices of all nodes in each individual are concatenated with the reactive power output control quantities of all reactive power compensation devices to form a multi-dimensional decision vector: in, The bid price submitted by the generator set at node m; Let J be the reactive power output control quantity of the j-th reactive power compensation device in the power grid; BNCO is responsible for searching within the global feasible region to maximize the overall expected profit. F Maximize the optimal combination of pricing and reactive power control, and focus on monitoring the upper and lower limits of node voltage operation and equipment capacity limits.
4. The method as described in claim 1, characterized in that, The secant optimization algorithm is invoked to iteratively solve the active power balance equation, outputting the optimal active power output allocation data corresponding to the current combination of decision variables, including: Obtain the bidding price data and reactive power output control data from the current decision variable combination as fixed constants, and obtain the total system load data and power grid topology parameters; Using the actual active power output of generator units and the active power loss of the entire network as search variables, and the absolute value of the residuals of the system's active power balance equation as the objective function for finding the root: When the inner layer iteration reaches the preset upper limit or the root-finding objective function value is less than the preset convergence threshold, the inner layer iteration is terminated, and the optimal active power output allocation data of each generator unit corresponding to the optimal solution is output.
5. The method as described in claim 1, characterized in that, The fitness value of the current decision variable combination is calculated according to the objective function oriented towards maximizing expected bidding profits, including: Obtain the bidding price data and optimal active power output allocation data in the current decision variable combination, and obtain the fitting coefficients of the basic production cost function for each power generation unit; For each power generation unit, the expected revenue is calculated by multiplying the corresponding output value in the optimal active power output allocation data by the bid price. The expected cost is calculated by substituting the output value into the basic production cost function. The expected profit is obtained by subtracting the expected cost from the expected revenue. The expected profits of all power generation units are then summed. in, It is the total expected profit target value of power generation units participating in bidding in the electricity market. This represents the actual bid price submitted by the power generation unit at node m, and is the core decision variable of the bidding space model. It is the first i Each power generation unit has active power output, The first one is obtained by fitting from the historical electricity price model. i The basic production cost function of a power generation unit; Output the overall expected bidding profit under the current combination of decision variables as the fitness value.
6. The method as described in claim 1, characterized in that, The Black-necked Crane optimizer is driven to perform branch update operations, including: Get the current iteration round and the preset maximum number of iterations, and calculate the ratio of the current iteration round to the maximum number of iterations; When the ratio is less than or equal to the preset branch threshold, the exploration branch is activated. The location data of random individuals in the current population and the location data of the current individual are obtained. The first position update formula of the Black-necked Crane Optimizer is used to perform a large-scale global search and location of the unit's declared price and reactive power input parameters to generate new exploration location data: When the ratio is greater than the preset branch threshold, the predation branch is activated. The position data of the current global best individual and the position data of the current individual are obtained. The second position update formula of the black-necked crane optimizer is used to establish a high-precision fine-tuning of the known high-quality bid range and generate new predation position data: Merge all updated individual position data and output the updated population position data for each branch.
7. The method as described in claim 1, characterized in that, Perform mutation operations and determine if the iteration terminates to output the optimization results, including: Obtain the population data after the branch update and the corresponding fitness values. Sort all individuals from high to low according to the fitness values and filter out the poor individuals in the bottom 20%. Obtain the current decision vector for each inferior individual, and apply a perturbation to the current decision vector using the following Gaussian / Cauchy scale hybrid mutation operator formula to readjust its position within the bidding feasible space, generating new individual position data after mutation: The original inferior individuals are replaced with the new individual location data, all unreplaced individuals are merged with the mutated new individuals, and the next generation outer population data is output. Determine whether the current iteration count has reached the preset maximum iteration count. If not, return to the inner layer to continue iterating. If it has reached the maximum, output the final bid price and reactive power control quantity from the currently recorded global optimal individual data as the optimization result to the control terminal.
8. A marginal cost bidding space device based on secant black-necked crane optimization, characterized in that, include: The boundary generation module is used to obtain historical electricity prices, load data and power grid topology parameters, and generate the bidding space boundary data for each generation node; The population initialization module is used to define the bidding price as the outer decision variable and use the bidding space boundary data as the feasible value range of the bidding price; it combines the reactive power output control quantity and the bidding price to form the outer decision variable combination; based on the Black-necked Crane optimizer, under the constraints of the bidding space boundary data and reactive power equipment capacity, it performs population initialization on the outer decision variable combination to generate initial outer population data; The clearing assessment module takes the current combination of decision variables from the initial outer population data as a fixed constant input to the inner layer, calls the secant optimization algorithm to iteratively solve the active power balance equation with the root-finding objective, and outputs the optimal active power output allocation data corresponding to the current combination of decision variables; performs power flow calculation based on the optimal active power output allocation data, calculates the fitness value of the current combination of decision variables according to the objective function oriented towards maximizing expected bidding profits, and updates the record of the globally optimal individual data based on the fitness value; The iterative optimization module is used to drive the Black-necked Crane optimizer to perform branch updates and mutation operations based on the globally optimal individual data, generating the next generation of outer population data; it determines whether the current iteration count has reached the preset limit. If not, the next generation of outer population data is returned to the inner layer as the new current outer population data to continue iterating; if it has reached the limit, the final bid price and reactive power control quantity in the globally optimal individual data are output as the optimization result.
9. An electronic device, characterized in that, include: processor; The memory stores executable instructions; when the processor executes the instructions, it implements the marginal cost bidding space method based on secant black-necked crane optimization as described in any one of claims 1-7.
10. A computer-readable storage medium, characterized in that, The device stores a computer program, which, when executed by a processor, implements a marginal cost bidding space method based on secant black-necked crane optimization as described in any one of claims 1-7.
