Power dispatching method and system based on ant colony algorithm
By constructing a state transition probability distribution model and updating pheromones using an ant colony algorithm-based power dispatching method, the problem of unreasonable node load allocation in power dispatching is solved, and the global optimal path is found quickly and the dispatching efficiency is improved.
Patent Information
- Application Number
- CN202411020923.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-29
- Publication Date
- 2024-11-29
AI Technical Summary
In existing power dispatching methods, node load allocation is unreasonable, and classical optimization techniques are prone to getting trapped in local optima, making it difficult to handle the discontinuity of cost functions and complex constraints.
An ant colony algorithm-based power dispatching method is adopted. By constructing a power dispatching possibility solution space, calculating the state transition probability distribution model, and updating pheromones, the path selection between nodes is optimized.
It achieves more stable power dispatch, quickly finds the globally optimal path, reduces the false alarm rate of the system, and improves the efficiency and accuracy of dispatch.
Smart Images

Figure CN119047735A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of electric power engineering, and in particular relates to an electric power dispatching method and system based on ant colony algorithm. Background Art
[0002] Power system economic dispatch is at the core of energy production and distribution. As energy demand and fuel costs increase, it becomes increasingly important to find ways to reduce energy production costs. Power system economic dispatch requires finding the optimal load of generators in the power system to meet the entire power demand while incurring the lowest possible generation cost. Therefore, it is necessary to develop and apply mathematical optimization models that can take into account the cost function curve of the generator set characteristics to find the optimal load distribution.
[0003] The cost function of the power system can be simply approximated by a monotonically increasing second-order nonlinear function. However, such a simple cost function does not properly simulate the actual situation of the generator. First, the power system involves constraints such as valve point effects and the use of multiple fuels. If the valve point effect is introduced into the cost function, multiple local minima will be generated. Usually, when performing load allocation for generators, there are some areas where the values are prohibited from operating, and the prohibited operation areas make the cost function discontinuous. In addition, constraints such as ramp rate restrictions and transmission line losses should also be considered in order to approximate the actual behavior of the generator. Nowadays, due to the increasing concern for the environment, toxic gases emitted by burning fuels are also included in the cost function. These restrictions can make the task of economic dispatch of power systems more complicated. Therefore, the optimization problem in the economic dispatch of power systems consists of multiple objectives. Its task is to find the load allocation of generator sets so that the power generation meets the power demand of the entire system while incurring the minimum possible power generation cost. Many classical optimization techniques such as linear programming, homogeneous linear programming, gradient search algorithm, Lambda iteration method, pattern search method, quadratic programming method, Lagrange multiplier method and nonlinear programming method are used to solve the problem of economic dispatch of power systems. The main problem with these classical optimization techniques is that the final solutions they return are highly dependent on the initial values and are often prone to getting stuck in local optima. Discontinuities in the cost function also severely affect the performance of these optimization techniques. Although dynamic programming techniques can handle discontinuous nonlinear cost functions, the dimensionality of the optimization problem is a very important factor for it.
[0004] The ant colony algorithm is an intelligent search algorithm that uses the principle of ants looking for food sources to establish a plan for the total purchase amount to the contracted supplier. When ants are looking for food sources, they release a pheromone on the path they pass through and can sense the pheromones released by other ants. The concentration of the pheromone represents the distance of the path. The higher the pheromone concentration, the shorter the corresponding path distance. Usually, ants will give priority to paths with higher pheromone concentrations with a greater probability and release a certain amount of pheromones to enhance the pheromone concentration on the path, thus forming a positive feedback. In the end, the ants can find the best path from the nest to the food source, that is, the shortest distance. However, the pheromone concentration on the path will gradually decay over time. Summary of the invention
[0005] In view of the above-mentioned prior art, the purpose of the present invention is to provide a more stable power dispatching method and system based on ant colony algorithm, aiming to solve the problem of unreasonable load distribution of power dispatching nodes in the prior art.
[0006] In order to solve the above technical problems, the present application provides a power dispatching method based on ant colony algorithm, including: constructing a possible solution space for power dispatching, encoding the nodes required for power dispatching, setting a node set C = {c1, c2, ..., cn}, and the set of distances between any two nodes in the set is L = {ij|ci, cj∈C};
[0007] The state transition probability distribution model is calculated based on the pheromone concentration on the node and the distance between the node set:
[0008]
[0009] In the formula, τi(k) is the frequency of scheduling of node i during the kth patrol, representing the pheromone concentration accumulated by the ant in the k-1 patrols; Pij represents the state transition probability from node i to node j; allowed is the set of nodes that the "ant" may reach next, indicating the nodes that the "ant" has not reached in this round of patrol; α is the information heuristic factor, indicating the relative importance of τ; ηij is the heuristic function, indicating the influence of distance on the node state transition process; β is the distance heuristic factor, indicating the relative importance of distance;
[0010] Performing parameter verification on the probability distribution model to generate a feasible solution;
[0011] The feasible solution is used to update the pheromone of the probability distribution model, and a power dispatching model is constructed for power dispatching.
[0012] Preferably, the method of updating the pheromone of the probability distribution model by using the feasible solution comprises:
[0013] Create a parameterized pheromone update formula:
[0014] τ ij (t+1)=(1-ρ)τ ij (t)+Δτ ij (t)+Δτ * (t)
[0015]
[0016] In the formula, Δτ ij (t) represents the sum of the pheromone increments on the path (i, j) caused by the ant traversal process; represents the additional pheromone increment released by the key ant on the path (i, j); ρ is the pheromone volatility coefficient; δ is the number of key ants; Q is the pheromone intensity.
[0017] In order to solve the above technical problems, the present application also provides a power dispatching system based on ant colony algorithm, including:
[0018] Construct model module: construct the possible solution space of power dispatch, encode the nodes required for power dispatch, set the node set C = {c1, c2, ..., cn}, and the set of distances between any two nodes in the set is L = {ij|ci, cj∈C};
[0019] The state transition probability distribution model is calculated based on the pheromone concentration on the node and the distance between the node set:
[0020]
[0021] Where τi(k) is the frequency of node i failure during the kth patrol, representing the pheromone concentration accumulated by the ant in the k-1 patrols; Pij represents the state transition probability from node i to node j; allowed is the set of nodes that the "ant" may reach next, indicating the nodes that the "ant" has not yet reached in this round of patrols; α is the information heuristic factor, indicating the relative importance of τ; ηij is the heuristic function, indicating the influence of distance on the node state transition process; β is the distance heuristic factor, indicating the relative importance of distance;
[0022] Model verification module: performs parameter verification on the probability distribution model to generate a feasible solution;
[0023] Parameter updating module: using the feasible solution to update the pheromone of the probability distribution model, constructing a power dispatching model for power dispatching.
[0024] In order to solve the above technical problems, the present application also provides a power dispatching device based on ant colony algorithm, including:
[0025] Memory for storing computer programs;
[0026] A processor is used to point to a computer program to implement the steps of a power dispatch processing method based on an ant colony algorithm.
[0027] In order to solve the above technical problems, the present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, all the steps of the above-mentioned power dispatching method based on ant colony algorithm are implemented.
[0028] The beneficial effects of this application are as follows:
[0029] 1. The power dispatching system of this application centrally manages the dispatching nodes. The monitoring host is based on the ant colony algorithm, and uses an active patrol method combined with a periodic scheduled patrol method to determine the patrol path of the dispatching node, and analyzes the charge status of the dispatching node based on the power data information uploaded by the dispatching node.
[0030] 2. This application adopts the pheromone update method of the ant colony algorithm with a key strategy to update the pheromones secreted during the ant traversal process. This makes the path taken by the historically optimal ants in the traversal process more attractive to subsequent ants. Each time a cycle is completed, the path searched by the key ants is given an additional pheromone increment, which accelerates the increase of pheromones on the optimal path, thereby guiding subsequent ants to quickly find the global optimal path and the global optimal solution. It also solves the problem that the pheromone concentration on the path will gradually decay over time. BRIEF DESCRIPTION OF THE DRAWINGS
[0031] In order to more clearly illustrate the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0032] Figure 1 To represent the data source of each client;
[0033] Figure 2 Flowchart provided for this application;
[0034] Figure 3 Schematic diagram of the power dispatching equipment based on ant colony algorithm provided in this application. DETAILED DESCRIPTION
[0035] As required, detailed embodiments of the present invention are disclosed herein, but it should be understood that the disclosed embodiments are merely exemplary of the present invention, and the present invention may be implemented in different and alternative forms. The accompanying drawings may not be drawn to scale, and certain features may be exaggerated or reduced to show the details of specific components. Therefore, the specific structural and functional details disclosed herein should not be understood as having a limiting meaning, but only as a representative basis to teach those skilled in the art to adopt the present invention differently. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present invention.
[0036] The present application embodiment provides a method for power dispatch processing based on ant colony algorithm, see Figure 1 , Figure 1 The figure shows a flow chart of a power dispatching method in one embodiment of the present invention, which includes steps S1 to S3, which are as follows:
[0037] S1. Construct the possible solution space of power dispatch, encode the nodes required for power dispatch, set the node set C = {c1, c2, ..., cn}, and the set of distances between any two nodes in the set is L = {ij|ci, cj∈C};
[0038] The state transition probability distribution model is calculated based on the pheromone concentration on the node and the distance between the node set:
[0039]
[0040] Wherein, τi(k) is the frequency of scheduling of node i during the kth patrol, representing the pheromone concentration accumulated by the ant in the k-1 patrols; Pij represents the state transition probability from node i to node j; allowed is the set of nodes that the "ant" may reach next, indicating the nodes that the "ant" has not reached in this round of patrol; α is the information heuristic factor, indicating the relative importance of τ; ηij is the heuristic function, indicating the influence of distance on the node state transition process; β is the distance heuristic factor, indicating the relative importance of distance;
[0041] The scheduling nodes are independent of each other, and each node is distributed in the protection area according to certain rules. For the node itself, the monitoring host transmits the node scheduling information to the field controller, and has no direct communication with other nodes. For the entire system, the monitoring host releases "ants" into the network composed of scheduling nodes. The event of detecting scheduling abnormalities is "finding food". The "ants" release pheromones, and the field controller records the abnormal information and reports it to the monitoring host. The accumulation of "pheromones" on the node is a superposition process based on the inspection results. "Pheromones" are used to measure the possibility of abnormal conditions in the node and guide the next round of inspections. This time-based accumulation method can effectively reduce the false alarm rate of the system.
[0042] S2. Perform parameter verification on the probability distribution model to generate a feasible solution;
[0043] S3. Using the feasible solution to update the pheromone of the probability distribution model, construct a power dispatching model for power dispatching.
[0044] The pheromone update method of the ant colony algorithm with a key strategy is used to update the pheromones secreted during the ant traversal process. This makes the path taken by the historically optimal ant during the traversal process more attractive to subsequent ants. Each time a cycle is completed, the path searched by the key ant is given an additional pheromone increment to accelerate the increase of pheromones on the optimal path, thereby guiding subsequent ants to quickly find the global optimal path and the global optimal solution. The parameterized pheromone update formula is established as follows:
[0045] τ ij (t+1)=(1-ρ)τ ij (t)+Δτ ij (t)+Δτ * (t)
[0046]
[0047] In the formula, Δτ ij (t) represents the sum of the pheromone increments on the path (i, j) caused by the ant traversal process; represents the additional pheromone increment released by the key ant on the path (i, j); ρ is the pheromone volatility coefficient; δ is the number of key ants; Q is the pheromone intensity.
[0048] The ant colony algorithm is divided into two stages in the optimization process of the scheduling management system:
[0049] 1) Adaptation stage. In this stage, there is no information to guide the system work. The system uses the traditional sequential query method to collect data and improve the system parameter configuration. It takes a short time.
[0050] 2) Coordination stage: After the adaptation stage, the system accumulates a certain amount of operating data and can complete the inspection task autonomously. Then, it continuously updates the data and dynamically adjusts the inspection method throughout the life cycle.
[0051] The dispatching management system centrally manages the dispatching nodes. The monitoring host is based on the ant colony algorithm and uses an active patrol method combined with a periodic scheduled patrol method to determine the patrol path of the dispatching node, and analyzes the charge status of the dispatching node based on the dispatching data information uploaded by the dispatching node.
[0052] like Figure 2 As shown, this embodiment provides a power dispatching system based on ant colony algorithm, including
[0053] Model building module 20: building a possible solution space for power dispatching, encoding the nodes required for power dispatching, and comprehensively calculating a state transition probability distribution model based on the pheromone concentration on the node and the distance between the node set and the node set;
[0054] Model verification module 22: performing parameter verification on the probability distribution model to generate a feasible solution;
[0055] Parameter updating module 24: using the feasible solution to update the pheromone of the probability distribution model, and constructing a power dispatching model for power dispatching.
[0056] like Figure 3 The schematic diagram of the power dispatching equipment based on the ant colony algorithm provided for this embodiment may include but is not limited to a smart phone, a tablet computer, a laptop computer or a desktop computer.
[0057] Among them, the processor 31 may include one or more processing cores, such as a 4-core processor, an 8-core processor, etc. The processor 31 can be implemented in at least one hardware form of digital signal processing (DSP), field-programmable gate array (FPGA), and programmable logic array (PLA). The processor 31 may also include a main processor and a coprocessor. The main processor is a processor for processing data in the awake state, also known as a central processing unit (CPU); the coprocessor is a low-power processor for processing data in the standby state. In some embodiments, the processor 31 may be integrated with a graphics processing unit (GPU), which is responsible for rendering and drawing the content to be displayed on the display screen. In some embodiments, the processor 31 may also include an artificial intelligence (AI) processor, which is used to process computing operations related to machine learning.
[0058] The memory 30 may include one or more computer-readable storage media, which may be non-transitory. The memory 30 may also include a high-speed random access memory, and a non-volatile memory, such as one or more disk storage devices, flash memory storage devices. In this embodiment, the memory 30 is at least used to store the following computer program, wherein, after the computer program is loaded and executed by the processor 31, it can implement the relevant steps of the power dispatching method based on the ant colony algorithm disclosed in any of the aforementioned embodiments. In addition, the resources stored in the memory 30 may also include an operating system and data, etc., and the storage method may be temporary storage or permanent storage. Among them, the operating system may include Windows, Unix, Linux, etc. The data may include but is not limited to the power dispatching method based on the ant colony algorithm, etc.
[0059] In some embodiments, the power dispatching equipment based on the ant colony algorithm may also include a display screen, an input and output interface, a communication interface, a dispatching and a communication bus.
[0060] Those skilled in the art will understand that Figure 3 The structure shown in the figure does not constitute a limitation on the power dispatching device based on the ant colony algorithm, and may include more or fewer components than those shown in the figure.
[0061] The power dispatching device based on the ant colony algorithm provided in the embodiment of the present application includes a memory 30 and a processor 31. When the processor 31 executes the program stored in the memory 30, it can implement the power dispatching method based on the ant colony algorithm.
[0062] Finally, the present application also provides an embodiment corresponding to a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps recorded in the above method embodiment are implemented.
[0063] It is understandable that if the method in the above embodiment is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory), ROM, random access memory (Random Access Memory, RAM), disk or optical disk and other media that can store program code.
[0064] The above is a detailed introduction to the power dispatching method, device, equipment and medium based on ant colony algorithm provided by the present application. The various embodiments in the specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same and similar parts between the embodiments can refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can refer to the method part description. It should be pointed out that for ordinary technicians in this technical field, without departing from the principles of the present application, several improvements and modifications can be made to the present application, and these improvements and modifications also fall within the scope of protection of the claims of the present application.
[0065] It should also be noted that, in this specification, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the statement "comprises a ..." does not exclude the presence of other identical elements in the process, method, article or device including the element.
Claims
1. A power dispatching method based on ant colony algorithm, characterized in that: The following steps are involved: Construct the possible solution space of power dispatch, encode the nodes required for power dispatch, set the node set C = {c1, c2, ..., cn}, and the set of distances between any two nodes in the set is L = {ij|ci, cj∈C}; The state transition probability distribution model is calculated based on the pheromone concentration on the node and the distance between the node set: ; In the formula, τi(k) is the frequency of scheduling of node i during the kth patrol, representing the pheromone concentration accumulated by the ant in the k-1 patrols; Pij represents the state transition probability from node i to node j; allowed is the set of nodes that the "ant" may reach next, indicating the nodes that the "ant" has not reached in this round of patrol; α is the information heuristic factor, indicating the relative importance of τ; ηij is the heuristic function, indicating the influence of distance on the node state transition process; β is the distance heuristic factor, indicating the relative importance of distance; Performing parameter verification on the probability distribution model to generate a feasible solution; The feasible solution is used to update the pheromone of the probability distribution model, and a power dispatching model is constructed for power dispatching.
2. The power dispatching method based on ant colony algorithm according to claim 1, characterized in that: The method of using the feasible solution to update the pheromone of the probability distribution model includes: Create a parameterized pheromone update formula: ; ; ; ; In the formula, It represents the sum of pheromone increments on the path (i, j) caused by the ant traversal process; represents the additional pheromone increment released by the key ant on the path (i, j); is the pheromone volatility coefficient; is the number of key ants; Q is the pheromone intensity.
3. A power dispatching system based on ant colony algorithm, comprising: Construct model module: construct the possible solution space of power dispatch, encode the nodes required for power dispatch, set the node set C = {c1, c2, ..., cn}, and the set of distances between any two nodes in the set is L = {ij|ci, cj∈C}; The state transition probability distribution model is calculated based on the pheromone concentration on the node and the distance between the node set: ; Where τi(k) is the frequency of node i failure during the kth patrol, representing the pheromone concentration accumulated by the ant in the k-1 patrols; Pij is the probability of state transition from node i to node j; allowed is the set of nodes that the "ant" may reach next, indicating the nodes that the "ant" has not reached in this round of patrol; α is the information heuristic factor, indicating the relative importance of τ; ηij is the heuristic function, indicating the influence of distance on the node state transition process; β is the distance heuristic factor, indicating the relative importance of distance; Model verification module: performs parameter verification on the probability distribution model to generate a feasible solution; Parameter updating module: using the feasible solution to update the pheromone of the probability distribution model, constructing a power dispatching model for power dispatching.
4. A power dispatching device based on ant colony algorithm, characterized in that: include: Memory for storing computer programs; A processor is used to implement the steps of the power dispatching method based on ant colony algorithm as claimed in claim 1 or 2 when executing the computer program.
5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the power dispatching method based on the ant colony algorithm as claimed in claim 1 or 2 are implemented.
