Power distribution network fault first-aid repair scheduling method and system, terminal and medium

By using a three-dimensional emergency repair urgency assessment matrix and dynamic priority determination, the problem of unreasonable resource allocation in multi-point fault repair was solved, and multi-dimensional quantitative assessment and adaptive resource scheduling were realized, thereby improving repair efficiency and the ability to handle critical faults in a timely manner.

CN121526162APending Publication Date: 2026-02-13SHANDONG DENENG IOT TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511629801.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-11-08
Publication Date
2026-02-13

AI Technical Summary

Technical Problem

Existing technologies struggle to achieve multi-dimensional and dynamic fault repair scheduling in multi-point fault repair, leading to unreasonable resource allocation, potential delays in critical fault repair, and high reliance on human experience, resulting in low efficiency.

Method used

A three-dimensional emergency repair urgency assessment matrix is ​​adopted, and the weights are dynamically adjusted by combining the actual data of the sub-indicators to generate fault handling priorities. Through dynamic priority determination and adaptive resource scheduling, an emergency repair scheduling plan is generated to resolve resource conflicts and time conflicts.

Benefits of technology

Through multi-dimensional quantitative evaluation and adaptive resource scheduling, the efficiency of emergency repairs has been significantly improved, resource waste has been avoided, and the timely handling of critical faults has been ensured.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121526162A_ABST
    Figure CN121526162A_ABST
Patent Text Reader

Abstract

The invention relates to a power distribution network fault first-aid repair scheduling method and system, a terminal and a medium, and belongs to the technical field of power distribution network fault processing, and the first-aid repair scheduling method comprises the steps: obtaining the number of fault points; judging whether the number of the fault points is not less than 2; if yes, acquiring actual index information of a sub-index corresponding to each fault point; according to a pre-constructed three-dimensional first-aid repair urgency degree evaluation matrix, determining the dimension to which the sub-index corresponding to each fault point belongs; obtaining a corresponding urgency degree total score according to the actual index information corresponding to each fault point and the dimension to which the sub-index belongs; generating a fault processing priority according to the urgency degree total score of each fault point; generating a first-aid repair scheduling plan according to the fault processing priority; the method has the beneficial effects that multi-dimensional and dynamic fault first-aid repair scheduling is realized, so that the first-aid repair efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the technical field of distribution network fault handling, and in particular to a method, system, terminal and medium for dispatching emergency repairs of distribution network faults. Background Technology

[0002] Emergency repair of power distribution network faults is a crucial aspect of power system operation and maintenance, and its efficiency directly impacts power supply reliability and user satisfaction. With rapid urbanization, power distribution network structures are becoming increasingly complex, and simultaneous multi-point faults are occurring more frequently. Particularly in modern cities, the dense distribution of power facilities and the surge in the number of fault points exacerbate the contradiction between limited repair resources and soaring repair demands. To address this challenge, the industry urgently needs efficient fault repair dispatching methods to achieve rapid resource allocation and timely fault handling, thereby reducing power outage time and improving overall service quality.

[0003] In related technologies, the following methods are commonly used to solve the problem of emergency repair of multiple faults: First, assess fault priority based on a single indicator, such as arranging the repair sequence according to the scope of the fault's impact or the difficulty of repair; second, formulate repair plans based on human experience, relying on dispatchers' judgment of the fault situation to allocate resources; third, handle faults using fixed priority rules, such as executing repair tasks in the order of fault reporting time; fourth, combine geographic information system (GIS) to assist in path planning and optimize the driving routes of repair vehicles; and fifth, use simple weighting methods to initially sort different fault points.

[0004] However, the above methods all have significant drawbacks: single-indicator assessments cannot fully reflect the urgency of a fault, potentially leading to delays in critical fault repairs; they rely heavily on human experience, are easily influenced by subjective factors, and are inefficient; fixed priority rules lack flexibility and cannot adapt to dynamically changing fault scenarios; and simple weight allocation methods fail to fully consider the mutual influence between fault points, potentially leading to unreasonable resource allocation. Therefore, in situations where multiple faults occur simultaneously, how to achieve multi-dimensional and dynamic fault repair scheduling has become an urgent technical problem to be solved. Summary of the Invention

[0005] In order to achieve multi-dimensional and dynamic fault repair scheduling and improve repair efficiency, this application provides a method, system, terminal and medium for fault repair scheduling in distribution networks.

[0006] Firstly, this application provides a method for dispatching emergency repairs in a power distribution network, employing the following technical solution: A method for dispatching emergency repairs in a distribution network includes: Obtain the number of fault points; Determine whether the number of fault points is not less than 2; If so, obtain the actual indicator information of the sub-indicator corresponding to each fault point; Based on the pre-constructed three-dimensional emergency repair urgency assessment matrix, determine the dimension to which the sub-indicator belongs for each fault point; Based on the actual indicator information corresponding to each fault point and the dimension to which the sub-indicator belongs, the corresponding total urgency score is obtained; Based on the total urgency score for each fault point, a fault handling priority is generated; Based on the fault handling priority, a repair scheduling plan is generated;

[0007] By adopting the above technical solution, a multi-dimensional quantitative assessment of fault points is achieved through a three-dimensional emergency repair urgency evaluation matrix combined with actual data from sub-indicators. Weights are dynamically adjusted based on the dimension to which the sub-indicators belong, avoiding the limitations of traditional single-indicator assessments. Fault points are categorized by their total urgency score, prioritizing critical faults with high total scores to avoid wasting resources on secondary issues. Emergency repair plans can be dynamically adjusted based on real-time data to ensure optimal resource allocation. This method significantly improves emergency repair efficiency through dynamic priority determination, multi-dimensional quantitative assessment, and adaptive resource scheduling.

[0008] Optionally, after generating the emergency repair scheduling plan, the process includes: Obtain the fault requirements for each fault point; Based on the fault start time, determine whether there is a fault demand conflict between adjacent fault points; If so, mark all adjacent fault points as conflicting fault points; Calculate the priority value of the conflicting failure point; Determine whether the ratio of the larger priority value to the smaller priority value among adjacent conflicting fault points is greater than a set value; If so, then the conflicting fault point with a higher priority value is allowed to preempt the same fault handling device of the conflicting fault point with a lower priority value; and a new fault requirement corresponding to the conflicting fault point with a lower priority value is regenerated. Priority value P = α·U impact +β·C critical +γ·T deadline ;U impact Indicates the number of users affected, C critical T represents the weight of critical facilities. deadline This represents the countdown to the latest completion time (in hours), where α, β, and γ are adjustment coefficients.

[0009] By adopting the above technical solutions, after generating the emergency repair scheduling plan, conflicts in fault demand may stem from multiple factors. In terms of resources, the number of repair personnel, equipment, and materials is limited; multiple faults requiring the same resources simultaneously will cause conflicts. For example, in power emergency repairs, multiple lines in a certain area may fail simultaneously, while the number of repair personnel with specialized skills and specialized repair equipment may be insufficient. Regarding time scheduling, different faults have their own urgency levels and estimated repair times; when multiple high-priority faults are concentrated in close time periods, conflicts can also occur. Adjacent fault points refer to two fault points whose fault handling start times are close. When determining that adjacent fault points conflict, the priority values ​​of the two fault points can be calculated. If the ratio of the larger priority value to the smaller priority value is greater than a set value, the fault demand required by the fault point with the larger priority value will be prioritized and preempted, thus generating a new fault demand for the smaller priority value.

[0010] Optionally, the step after regenerating the new fault requirement corresponding to the conflict fault point with the smaller priority value includes: compensating the conflict fault point with the smaller priority value to increase the adjustment coefficient for calculating the conflict fault point; the new adjustment coefficient is (α, β, γ)×k.

[0011] By adopting the above technical solution, since the fault demand of the fault point with the low priority value is preempted and a new fault demand is generated, compensation can be made for the fault point, and the adjustment coefficient when calculating the priority value is increased, thereby increasing the probability of prioritizing the handling of the fault point when it subsequently fails.

[0012] Optionally, the step of determining whether there is a fault demand conflict between adjacent fault points includes: The fault requirements include fault handling equipment, handling time window, and handling path; Determine whether the processing time windows of adjacent fault points overlap; If so, then time-mark the adjacent fault points; Determine whether the minimum distance of the processing path between adjacent fault points is less than a distance threshold; If so, then spatially mark the adjacent fault points; If adjacent fault points have both time and space markers, then it is determined that there is a fault demand conflict between the adjacent fault points.

[0013] By adopting the above technical solution, and through dual screening using time window overlap judgment (time marker) and path distance threshold judgment (spatial marker), misjudgments based on a single dimension are avoided. For example, fault points that only overlap in time but have no intersection in path will not trigger conflicts, reducing false alarms. If adjacent fault points are handled by the same type of equipment (such as both requiring high-voltage power tower maintenance vehicles), combining spatiotemporal markers can provide early warnings of equipment scheduling conflicts, avoiding equipment idleness or duplicate dispatch.

[0014] 5. Optionally, the step of regenerating the new fault requirement corresponding to the conflicting fault point with the smaller priority value includes: Obtain the credit value of the emergency repair base within the preset retrieval area; The repair base with the highest credit score exceeding the threshold is selected as the equipment dispatch base; Based on the location of the device's call base and traffic data along the route, the call duration is estimated; Based on the estimated call duration, update the processing time window for the conflict fault point and send the device reservation message.

[0015] By adopting the above technical solution, the optimal base is selected based on the credit value (such as historical task completion rate and equipment maintenance quality) of the emergency repair bases within a preset area. Bases with high credit values ​​(such as those with a score ≥ 90) are prioritized for use, ensuring the reliability of equipment deployment. The credit value is linked to the base's fulfillment capabilities (such as equipment inventory and response speed). This selection process avoids secondary conflicts caused by insufficient resources; for example, high-credit bases are typically equipped with redundant equipment, reducing the probability of scheduling failures. Based on the real-time location of the equipment deployment base (such as within 5 kilometers of the conflict point) and traffic data (such as road condition APIs), the deployment time is dynamically calculated, reducing the risk of overlapping time windows. The updated fault start processing time window (such as adjusting from 9:00-10:00 to 10:30-11:30) avoids spatiotemporal overlap between adjacent fault points.

[0016] Optionally, the scheduling method further includes: Based on the fault requirements, determine the selection rules for skilled personnel; Based on the skill personnel screening rules, matching personnel are selected from a pre-built skill personnel database; Calculate the credibility value of the selected matches; Assign the skilled personnel with the highest credibility value; The confidence value T 信 =W1·Official Certification + W2·Peer Evaluation + W3·Historical Call Count; W1, W2, and W3 are the corresponding trust weights.

[0017] By adopting the above technical solutions, screening rules (such as qualification certificates and historical maintenance records) are formulated based on fault requirements (e.g., equipment type, fault complexity) to quickly identify matching personnel from the personnel database, reducing screening time. For example, for high-voltage power tower faults, personnel holding special operation certificates and with no accident records within the past three years are required; the system automatically filters out those who do not meet the standards. High-reliability personnel typically possess superior emergency response capabilities (e.g., holding "Senior Power Repair Technician" certification), which can reduce the risk of secondary faults (e.g., equipment damage due to misoperation). The system automatically excludes personnel with credit scores below a threshold (e.g., <80 points) or those with recent violation records, thereby improving fault handling efficiency.

[0018] Optionally, before sending the device reservation message, the following steps are included: Obtain the call values ​​of all devices of the same type required within the device call base. Where a, b, c, and d represent the weighting coefficients for lifespan, number of uses, efficiency, and cost, respectively; L i As a weight for equipment lifespan, L max Longest design life for similar equipment; U i U is weighted by the number of times it is used. max The maximum number of uses is designed for the equipment; E i E is the efficiency weight. max This represents the highest efficiency value among similar equipment; C i To maintain cost weighting, C max The highest maintenance cost among similar equipment; L i =Design life - U i × Single-transaction loss coefficient; E i = Task completion rate × Output per unit time / Energy consumption; C i = Spare parts cost + labor cost + downtime loss; Filter the maximum call value S i The corresponding device is designated as the device to be invoked; Based on the device information of the device to be invoked, a device reservation message is sent.

[0019] By adopting the above technical solutions, the dynamic filtering mechanism can avoid overloading of a single device, thereby maximizing the utilization of cluster resources.

[0020] Secondly, this application provides a power distribution network fault repair and dispatching system, which adopts the following technical solution: A system for dispatching emergency repairs in a power distribution network includes: The fault confirmation module is used to obtain the number of fault points and determine whether the number of fault points is not less than 2. The information acquisition module is used to acquire the actual indicator information of the sub-indicator corresponding to each fault point when the number of fault points is not less than 2. The fault handling module is used to determine the dimension to which the sub-indicator belongs for each fault point according to the pre-constructed three-dimensional emergency repair urgency assessment matrix; and to obtain the corresponding total urgency score according to the actual indicator information corresponding to each fault point and the dimension to which the sub-indicator belongs. The scheduling module is used to generate a fault handling priority based on the total urgency score of each fault point; and to generate a repair scheduling plan based on the fault handling priority.

[0021] Thirdly, this application provides a terminal that adopts the following technical solution: A terminal, comprising: The memory stores the dispatching program for emergency repairs of power distribution network faults. The processor is used to execute the program stored in the memory to implement the steps of the above-described method for dispatching emergency repairs of power distribution networks.

[0022] Fourthly, this application provides a computer-readable storage medium, which adopts the following technical solution: A computer-readable storage medium storing a computer program that can be loaded by a processor and executed as described above for the method of dispatching emergency repairs for power distribution networks.

[0023] In summary, this application has at least the following beneficial effects: By employing a three-dimensional emergency repair urgency assessment matrix and combining it with actual data from sub-indicators, a multi-dimensional quantitative assessment of fault points is achieved. Weights are dynamically adjusted based on the dimension to which the sub-indicators belong, avoiding the limitations of traditional single-indicator assessments. Fault points are categorized by their total urgency score, prioritizing critical faults with high total scores to prevent resource waste on secondary issues. Emergency repair plans can be dynamically adjusted based on real-time data to ensure optimal resource allocation. This method significantly improves emergency repair efficiency through dynamic priority determination, multi-dimensional quantitative assessment, and adaptive resource scheduling. Attached Figure Description

[0024] Figure 1 This is a flowchart of an embodiment of the method of this application; Figure 2 This is a schematic diagram of the three-dimensional emergency repair urgency assessment matrix of this application; Figure 3 This is a flowchart illustrating the conflicting fault requirements at adjacent fault points in this application. Figure 4 It is a flowchart of the steps to regenerate new fault requirements corresponding to conflicting fault points with lower priority values; Figure 5 It is a flowchart for fault matching skills personnel; Figure 6 This is a flowchart of an embodiment of the system in this application. Detailed Implementation

[0025] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the appendices in the embodiments of the present invention will be described below. Figure 1 -Appendix Figure 6The technical solutions in the embodiments of the present invention are clearly and completely described herein. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0026] The first embodiment of this application discloses a method for dispatching emergency repairs in a power distribution network. (Refer to...) Figure 1 As one embodiment of the emergency repair scheduling method, the emergency repair scheduling method may include S110-S180: S110, obtain the number of fault points; S120, determine whether the number of fault points is not less than 2; S130, if so, then obtain the actual indicator information of the sub-indicator corresponding to each fault point; S140, based on the pre-constructed three-dimensional emergency repair urgency assessment matrix, determine the dimension to which the sub-indicator belongs for each fault point; S150: Obtain the corresponding urgency score based on the actual indicator information and the dimension to which the sub-indicator belongs for each fault point; S160: Generate the fault handling priority based on the urgency score for each fault point. S170 generates an emergency repair scheduling plan based on the fault handling priority; S180, if not, then generate emergency repair dispatch information based on the fault type of the fault point.

[0027] Specifically, after a fault occurs, it is determined whether there are multiple fault points (i.e., two or more) within the fault area. If so, it indicates a multi-point fault; otherwise, it indicates a single-point fault. If it is a single-point fault, emergency repair dispatch information can be generated directly based on the fault type of the fault point. The emergency repair dispatch information can include information such as fault requirements and skilled personnel. Fault requirements include fault handling equipment, handling time window, and handling path.

[0028] If there are multiple points of failure, the actual indicator information of the sub-indicator corresponding to each failure point can be obtained, and the dimension to which the sub-indicator belongs can be determined according to the three-dimensional emergency repair urgency assessment matrix. Then, based on the actual indicator information corresponding to each failure point and the dimension to which the sub-indicator belongs, the corresponding total urgency score can be obtained. The dynamic correction items include a time decay factor (urgency decreases by 2% per hour) and resource conflict compensation (if resources are preempted by a high-priority fault, the total urgency score is multiplied by 1.1). When both the time decay factor and resource conflict compensation are present, the actual total urgency score is the total urgency score after resource conflict compensation plus the total urgency score after time decay factor.

[0029] An example of a three-dimensional emergency repair urgency assessment matrix can be found by referring to Figure 2 As shown.

[0030] Examples of weight calculations for key sub-indicators across various dimensions are shown below: (1) Social Impact Dimension (Total Weight 50%) Impact on users (40%): Piecewise normalization Critical facility weight (35%): An example of the preset coefficient table is shown in Table 1: facility type Hospital School Transportation hub government agencies Weighting coefficient 2.0 1.5 1.2 1.0 Table 1 Population density (25%): Classified by administrative region (e.g., core urban area × 1.5, suburbs × 1.0).

[0031] (2) Environmental Constraints Dimension (Total Weight 30%) Weather coefficient: Real-time data can be obtained through the meteorological API. Heavy rain (visibility <50 meters) triggers a weighting coefficient of 1.2.

[0032] Geographical complexity: Slope is calculated based on a 3D terrain model (coefficient × 1.3 when slope > 30°).

[0033] (3) Resource efficiency dimension (total weight 20%) Resource distance decay function: D score =e -0.1×距离 The distance unit is km.

[0034] For example, fault A affects 2000 users, has one critical facility (one hospital), a weather factor of heavy rain (×1.2), and a resource distance of 25km, so its urgency score is 87.6. Fault B affects 1200 users, has two critical facilities (two schools), a weather factor of strong winds (×1.1), and a resource distance of 40km, so its urgency score is 78.9. Therefore, the fault handling priority is level 1 for fault A and level 2 for fault B.

[0035] The calculation process for fault B is the same as that for fault A. Taking the calculation process for fault A as an example: Social impact dimension: (0.5 × (0.5 + 2.0 × 1.0)) = 1.25 (0.5 for users > 1500, hospital weight × 2.0); Environmental constraints dimension: 0.3 × (1.2 × 1.0) = 0.36, (rainstorm weather coefficient × 1.2); Resource efficiency dimension: 0.2×e -0.1×25 =0.2 × 0.082 = 0.016 The total score for urgency is 1.25 + 0.36 + 0.016 = 1.626. Assuming the dynamic correction term is 1 / 0.02, then 1.626 / 0.02 = 81.3.

[0036] The emergency repair dispatch plan includes emergency repair dispatch information for each fault point.

[0037] Reference Figure 3 After generating the emergency repair scheduling plan, steps S210-S260 need to be executed: S210, obtain the fault requirements for each fault point; S220, determine whether there is a fault demand conflict between adjacent fault points according to the fault start time; S230, if so, mark all adjacent fault points as conflicting fault points; S240, calculate the priority value of the conflict failure point; S250, determine whether the ratio of the larger priority value to the smaller priority value among adjacent conflicting fault points is greater than the set value; S260, if so, then allow the conflicting fault point with the higher priority value to preempt the same fault handling device of the conflicting fault point with the lower priority value; and regenerate the new fault requirement corresponding to the conflicting fault point with the lower priority value.

[0038] Specifically, taking two adjacent fault points as an example, adjacent fault points refer to two fault points with similar processing time windows, that is, the absolute value of the start time difference between the two fault points is equal to or less than the time difference threshold.

[0039] For example, the fault start processing time window for fault A is (9:00-12:00), and the fault start processing time window for fault B is (10:30-13:30). Since the time difference between the start time of fault B and the start time of fault A is 1.5 hours, which is equal to the preset time difference threshold, fault A and fault B can be determined to be adjacent fault points. Further, it is determined whether fault A and fault B have a fault requirement conflict; if a fault conflict exists, fault A and fault B are marked as conflicting fault points; then, the priority value of fault A and fault B is calculated, with priority value P = α·U. impact +β·C critical +γ·T deadline ;U impact Indicates the number of users affected, C critical T represents the weight of critical facilities. deadline This represents the countdown to the latest completion time (in hours), where α, β, and γ are adjustment coefficients.

[0040] The steps to determine whether there is a conflict in fault requirements between adjacent fault points can be as follows: First, determine whether the processing time windows of adjacent fault points overlap. For example, the processing time window for fault A is 9:00-12:00, and the processing time window for fault B is 10:00-13:30. Since there is a 1.5-hour overlap, fault A and fault B are time-marked. Simultaneously, determine whether the minimum distance of the processing paths between adjacent fault points is less than a distance threshold. For example, if the distance threshold is set to 5m, the processing path coordinates for fault A are [(10,20)→(15,25)], and the processing path coordinates for fault B are [(12,22)→(18,28)]; the minimum distance between their paths is 3.2m, which is less than 5m, so fault A and fault B are spatially marked. When fault A and fault B have both time and spatial markings, it is determined that there is a conflict in their fault requirements.

[0041] Taking fault A as an example, it affects 1200 users, has one critical facility (hospital), uses an aerial work platform and a dryer as the fault handling equipment, has a handling time window of 9:00-12:00, and a handling path coordinate of [(10,20)→(15,25)]. Fault B affects 800 users, has no critical facilities, uses an aerial work platform as the fault handling equipment, has a fault start handling time window of 10:00-13:30, and a handling path coordinate of [(12,22)→(18,28)]. Calculate the priority values ​​of fault A and fault B.

[0042] If α = 0.6, β = 0.3, γ = 0.1, then the priority value P of fault A is... A =0.6×(1200 / 2000)+0.3×3+0.1×(1 / (12-9))=0.36+0.9+0.11=1.37; Priority value P of fault B B =0.6×(800 / 2000)+0.3×0+0.1×(1 / (13.5-10.5))=0.24+0+0.08=0.32; Because of P A / P B =4.28>1.5 (set value), therefore fault A is allowed to preempt the aerial work platform vehicle of fault B; fault B is suspended and the aerial work platform vehicle is transferred to fault A; fault B regenerates an alternative solution, i.e., a new fault requirement.

[0043] In order to compensate for fault B, the adjustment coefficient of fault B is increased when the priority value of fault B needs to be calculated in the future; the new adjustment coefficients corresponding to fault B are kα, kβ and kγ, where k can be 1.2.

[0044] When the fault requirements of adjacent fault points do not conflict, or when the ratio of the larger priority value to the smaller priority value among adjacent conflicting fault points is less than or equal to 1.5, they can be processed according to priority order, i.e., fault A is processed first, and fault B waits. In other implementations, if fault B suddenly worsens, the priority value can be recalculated.

[0045] Reference Figure 4 The steps for regenerating new fault requirements corresponding to conflict fault points with lower priority values ​​include S310-S340: S310, obtain the credit value of the emergency repair base in the preset retrieval area; S320: Select the repair base with the highest credit score that exceeds the threshold as the equipment dispatch base; S330 estimates the call duration based on the location of the equipment's call base and traffic data along the route; S340 updates the processing time window for the conflict fault point and sends a device reservation message based on the estimated call duration.

[0046] Specifically, the retrieval area can be set according to the actual situation. For example, if both fault A and fault B occur in location A, then the credit scores of all emergency repair bases within location B can be obtained. Alternatively, filtering can be based on distance; for example, the retrieval area could be within a 40-kilometer radius of fault B. After obtaining the credit scores of the emergency repair bases, a preliminary screening is performed to select those with credit scores above a threshold. Then, the repair base with the highest credit score is selected as the equipment retrieval base. The location of this equipment retrieval base and the traffic data along its route are then obtained to estimate the retrieval duration. This allows for updating the processing time window for fault B and sending equipment reservation messages to the equipment retrieval base. For example, if the estimated retrieval duration is 45 minutes, then the processing time window for fault B is updated to 11:15-14:15. The system can interface with electronic maps. After setting fault B as the starting point and the device call base as the destination, the electronic map will automatically generate a route based on the location of the starting point and the destination, and automatically generate the travel time based on the traffic data along the way. When there are multiple routes, no matter which route is selected, the maximum travel time will be used as the estimated call time.

[0047] In addition, after determining the device call base, the call values ​​of all devices of the same type required within the device call base can be obtained. Where a, b, c, and d represent the weighting coefficients for lifespan, number of uses, efficiency, and cost, respectively; L i As a weight for equipment lifespan, L max Longest design life for similar equipment; U i U is weighted by the number of times it is used. max The maximum number of uses is designed for the equipment; E i E is the efficiency weight. maxThis represents the highest efficiency value among similar equipment; C i To maintain cost weighting, C max The highest maintenance cost among similar equipment; L i =Design life - U i × Single-transaction loss coefficient; E i = Task completion rate × Output per unit time / Energy consumption; C i = Spare parts cost + labor cost + downtime loss. Then filter for the maximum call value S. i The corresponding device is designated as the device to be invoked; based on the device information of the device to be invoked, a device reservation message is sent.

[0048] For example, the parameters of a certain emergency repair equipment are as follows: Remaining lifespan L i =2 years, L max =5 years; Number of uses U i =200, U max =500; Efficiency E i =90%, E max =95%; Maintenance cost C i =800 yuan, C max = 1000 yuan.

[0049] Given weights a = 0.4, b = 0.2, c = 0.3, d = 0.1, then: Then, it is compared with other devices for evaluation, thereby deciding whether to use it.

[0050] Reference Figure 5 In addition, when associating fault requirements with skilled personnel, S410-S440 can be executed: S410, determine the selection rules for skilled personnel based on fault requirements; S420, based on the skilled personnel screening rules, selects matching personnel from a pre-built skilled personnel database; S430, calculate the confidence value of the selected matches; S440 assigns the most trustworthy skilled personnel.

[0051] Specifically, the screening rules can include hard condition filtering and fault type matching; hard condition filtering can be qualification certificate matching; that is, an initial screening can be conducted to select skilled personnel suitable for handling the fault type based on the fault type; then a second screening can be conducted to select personnel with qualification certificates from the skilled personnel in the initial screening. Then, the credibility value of the skilled personnel after the second screening is calculated, and the skilled personnel with the highest credibility value are assigned.

[0052] Credibility value T 信 =W1·Official Certification + W2·Peer Evaluation + W3·Historical Call Count; W1, W2, and W3 are the corresponding trust weights.

[0053] Suppose a power distribution network in a certain area experiences a fault, requiring the rapid dispatch of suitable skilled personnel to handle it. A pre-built skilled personnel database contains information on numerous skilled personnel, including their qualification certificates, types of faults they have handled, and peer reviews.

[0054] Hard criteria filtering: Handling power distribution network faults requires specific qualification certificates, such as electrician's licenses and high-voltage electrician's operation certificates. Only personnel holding relevant certificates can participate in the subsequent screening.

[0055] Fault type matching: Distribution network faults are diverse, such as short-circuit faults, ground faults, and overvoltage faults. Based on the specific type of the current fault, skilled personnel with experience in handling that type of fault are selected.

[0056] Initial screening: Screening is based on the type of fault. Assuming the current fault is a short circuit, skilled personnel with prior experience handling short circuit faults are identified from the skills pool. For example, if the skills pool contains 100 people, and 30 of them have experience handling short circuit faults, these 30 people are included in the initial screening list.

[0057] Secondary screening: The 30 people on the initial screening list are matched with their qualification certificates. This involves checking whether they hold an electrician's license and a high-voltage electrician's operating license. Assuming that after screening, 20 people possess both certificates, these 20 people become the final matched candidates.

[0058] Points are awarded based on the level and number of certificates held by skilled personnel. For example, holding an electrician's certificate earns 30 points, holding a high-voltage electrician's operating certificate earns 50 points, and holding both earns 80 points.

[0059] Peer evaluation score: A score of 0-100 is obtained through peer evaluation.

[0060] Historical call count score: The more historical calls, the higher the score, with a value between 0 and 10.

[0061] Trustworthiness Weights: Assume the authentication trustworthiness weight is 0.5, the peer evaluation trustworthiness weight is 0.3, and the historical call count weight is 0.2. Taking one skilled worker as an example, who holds an electrician's license and a high-voltage electrician's operating license, with an authentication score of 80, a peer evaluation score of 90, and a historical call count score of 5, their trustworthiness score would be 0.5 × 80 + 0.3 × 90 + 0.2 × 5 = 68. The trustworthiness scores of the other 19 matched workers are calculated using the same method. The worker with the highest trustworthiness score is the assigned worker.

[0062] Based on the above method embodiments, the second embodiment of this application discloses a dispatching system for emergency repair of power distribution network faults. (Refer to...) Figure 6As one implementation of the emergency repair dispatch system, the emergency repair dispatch system may include: The fault confirmation module is used to obtain the number of fault points and determine whether the number of fault points is not less than 2. The information acquisition module is used to acquire the actual indicator information of the sub-indicator corresponding to each fault point when the number of fault points is not less than 2. The fault processing module is used to determine the dimension to which the sub-indicator corresponding to each fault point belongs based on the pre-constructed three-dimensional emergency repair urgency assessment matrix. And based on the actual indicator information corresponding to each fault point and the dimension to which the sub-indicator belongs, the corresponding urgency score is obtained. The scheduling module is used to generate fault handling priorities based on the total urgency score of each fault point, and to generate emergency repair scheduling plans based on the fault handling priorities.

[0063] The modules for the distribution network fault repair and dispatching system correspond one-to-one with the methods for distribution network fault repair and dispatching, which will not be elaborated on here.

[0064] A third embodiment of this application provides a terminal. As one implementation of this terminal, the terminal may include: a memory and a processor; wherein... The memory is used to store the dispatch program for emergency repair of power distribution network faults; The processor is used to execute the program stored in the memory to implement the steps of the above-described method for dispatching emergency repairs of power distribution networks.

[0065] The memory can communicate with the processor via a communication bus, which can be an address bus, a data bus, a control bus, etc.

[0066] Additionally, the memory may include random access memory (RAM) or non-volatile memory (NVM), such as at least one disk storage device.

[0067] Furthermore, the processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.

[0068] The fourth embodiment of this application provides a computer-readable storage medium storing a computer program that can be loaded by a processor and executed by the above-described method for dispatching emergency repairs of power distribution networks.

[0069] Computer-readable storage media can be any usable medium that a computer can access, or a data storage device such as a server or data center that integrates one or more usable media. Usable media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state drives).

[0070] The above are all preferred embodiments of this application and are not intended to limit the scope of protection of this application. Any feature disclosed in this specification (including the abstract and drawings) may be replaced by other equivalent or similar features unless specifically stated otherwise. That is, unless specifically stated otherwise, each feature is only one example of a series of equivalent or similar features.

Claims

1. A method for power distribution network fault repair scheduling, characterized in that, The method comprises the following steps: acquiring the number of fault points; determining whether the number of fault points is not less than 2; if yes, acquiring actual index information of each fault point corresponding sub-index; determining the dimension of each fault point corresponding sub-index according to a pre-constructed three-dimensional repair urgency evaluation matrix; obtaining the corresponding urgency total score according to the actual index information of each fault point and the dimension of the sub-index; generating a fault handling priority according to the urgency total score of each fault point; generating a repair scheduling plan according to the fault handling priority; 2. The method for power distribution network fault repair scheduling according to claim 1, characterized in that, after the generation of the repair scheduling plan, the method comprises the following steps: acquiring the fault demand of each fault point; determining whether there is a fault demand conflict between adjacent fault points according to the fault starting processing time; if yes, marking the adjacent fault points as conflict fault points; calculating the priority value of the conflict fault points; determining whether the ratio of the larger priority value to the smaller priority value of the adjacent conflict fault points is greater than a set value; if yes, allowing the conflict fault point with the larger priority value to preempt the same fault handling device of the conflict fault point with the smaller priority value; and regenerating the new fault demand of the conflict fault point with the smaller priority value; Priority value P = a · U impact + b · C critical + g · T deadline ; U impact represents the number of users, C critical represents the weight of the critical facility, T deadline represents the countdown of the latest completion time (hours), a, b, g are adjustment factors.

3. The method for power distribution network fault repair scheduling according to claim 2, characterized in that, after the regeneration of the new fault demand of the conflict fault point with the smaller priority value, the method comprises the following steps: compensating the conflict fault point with the smaller priority value and increasing the adjustment coefficient of the conflict fault point; the new adjustment coefficient is (α, β, γ) × k.

4. The method for power distribution network fault repair scheduling according to claim 2, characterized in that, The step of determining whether there is a fault demand conflict between adjacent fault points comprises: The fault demand comprises a fault handling device, a processing time window and a processing path; determining whether the processing time windows of adjacent fault points overlap; if yes, marking the adjacent fault points in time; determining whether the minimum distance of the processing paths of adjacent fault points is less than a distance threshold value; if yes, marking the adjacent fault points in space; if the adjacent fault points are marked in time and in space, it is determined that the adjacent fault points have a fault demand conflict.

5. The method for power distribution network fault repair scheduling according to claim 2, characterized in that, The step of regenerating the new fault demand of the conflict fault point with the smaller priority value comprises: acquiring the credit value of a repair base in a preset calling area; selecting the repair base with the largest credit value as a device calling base, the credit value of which exceeds a threshold value; estimating the calling time length according to the location of the device calling base and the traffic data along the way; updating the processing time window and sending a device reservation message of the conflict fault point according to the estimated calling time length.

6. The method for power distribution network fault repair scheduling according to claim 5, characterized in that, Before the sending of the device reservation message, the method comprises the following steps: Acquiring the device call base required type of all devices call value Wherein, a, b, c, d respectively represent the weight coefficient of life, use frequency, efficiency and cost; L i The device life weight, L max The longest design life of the same type of equipment; U i The use frequency weight, U max The maximum use frequency of equipment design; E i The efficiency weight, E max The highest efficiency value of the same type of equipment; C i The maintenance cost weight, C max The highest maintenance cost of the same type of equipment; L i = design life - U i × single loss coefficient; E i = task completion rate × unit time output / energy consumption; C i = spare parts cost + labor cost + downtime loss; Screening maximum call value S i Corresponding device as a call device; sending a device reservation message according to the device information of the device to be called.

7. The method for power distribution network fault repair scheduling according to claim 2, characterized in that, The method further comprises the following steps: determining a skill personnel screening rule according to the fault demand; screening a matched person from a pre-constructed skill personnel database according to the skill personnel screening rule; calculating the credit value of the screened matched person; assigning the skill personnel with the largest credit value. The trusted value T 信 = W1 official certification + W2 colleague evaluation + W3 historical call times; W1, W2, and W3 are corresponding trusted weights.

8. A power distribution network fault repair dispatching system, characterized by, The device comprises: a fault confirmation module, configured to acquire the number of fault points and determine whether the number of fault points is not less than 2; an information acquisition module, configured to acquire actual index information of each fault point corresponding sub-index when the number of fault points is not less than 2. The fault processing module is configured to determine the dimension of each fault point corresponding sub-index according to a pre-constructed three-dimensional repair urgency evaluation matrix; And obtain the corresponding total score of urgency according to the actual index information corresponding to each fault point and the dimension of the sub-index; The scheduling module is configured to generate a fault handling priority according to the urgency total score of each fault point, and generate a rush repair scheduling plan according to the fault handling priority.

9. A terminal, characterized by comprising: The method comprises the following steps: A memory storing a power distribution network fault repair scheduling program; A processor configured to execute the program stored in the memory to implement the steps of the power distribution network fault repair scheduling method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, A computer program stored in the memory, which can be loaded and executed by the processor to implement the power distribution network fault repair scheduling method according to any one of claims 1-7.