Electric bus pre-disaster pre-deployment robust optimization method and system

By employing a robust optimization method for pre-disaster deployment of electric buses, the problems of inflexible and uncertain deployment in the post-disaster recovery of power distribution networks were solved, achieving a balance between rapid emergency power supply and normal operation, and improving the efficiency and flexibility of post-disaster recovery.

CN121480835APending Publication Date: 2026-02-06XI AN JIAOTONG UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511595026.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-11-03
Publication Date
2026-02-06

AI Technical Summary

Technical Problem

The existing power distribution network post-disaster recovery mainly relies on fixed energy storage and diesel generators, which have high investment costs, inflexible deployment, limited energy transfer, and cannot quickly respond to the emergency power supply needs of different regions. In addition, traditional optimization methods are difficult to effectively handle the uncertainties in disaster scenarios, resulting in poor performance of pre-deployment strategies.

Method used

A robust optimization method for pre-disaster deployment of electric buses is adopted. By acquiring data information, a set of fault scenarios is generated, a robust optimization model is established, and the C&CG decomposition algorithm is used to solve the model to output a pre-deployment plan. Considering the constraints of electric bus operation, dispatch, scheduling and power distribution network system, a reinforced confidence set is constructed to describe the uncertainty of the probability distribution of line faults.

Benefits of technology

It significantly improves the efficiency and flexibility of power distribution network post-disaster recovery, achieves a balance between economy and recovery efficiency, enhances the robustness and practicality of pre-deployment strategies, and ensures the safety and stability of electric buses during the post-disaster recovery process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121480835A_ABST
    Figure CN121480835A_ABST
Patent Text Reader

Abstract

The invention discloses an electric bus pre-disaster pre-deployment robust optimization method and system, and belongs to the technical field of disaster prevention and reduction of power systems. The method comprises the following steps: acquiring power grid, bus, load and disaster prediction data; adopting Monte Carlo simulation to generate a fault scene set; establishing a robust optimization model with minimization of system load shedding as a target, considering electric bus operation, dispatching and scheduling constraints and power distribution network system constraints, and describing line fault uncertainty by constructing an enhanced confidence set; camp is adopted; and solving the model by a CG decomposition algorithm to obtain an optimal pre-deployment scheme. According to the method, the problems of inflexible deployment and high cost of traditional fixed energy storage in post-disaster recovery are effectively solved, and the post-disaster recovery speed and the elasticity level of the power distribution network are remarkably improved and the power failure economic loss is reduced while the normal bus service is ensured by utilizing the mobile energy storage characteristic of the electric bus.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of power system disaster prevention, mitigation and emergency recovery technology, specifically involving a robust optimization method and system for pre-disaster deployment of electric buses. Background Technology

[0002] In recent years, extreme disasters such as hurricanes, floods, and earthquakes have occurred frequently around the world, posing a serious threat to the stable operation of power distribution networks. These high-impact, low-probability events not only cause significant economic losses but also seriously threaten the stability of social public service systems. Especially against the backdrop of climate change and accelerated urbanization, the frequency and intensity of extreme events may further increase, making it particularly urgent to improve the resilience of power distribution networks.

[0003] Existing research largely focuses on deployment strategies for stationary energy storage devices and diesel generators. While these devices can improve system resilience, they suffer from inherent drawbacks such as limited energy transfer and high investment costs. Electric buses, widely deployed in urban public transportation systems, can serve as a resource for disaster relief in the power distribution network due to their large-capacity battery packs and centralized dispatch capabilities. Compared to traditional stationary energy storage devices and diesel generators, electric buses offer advantages such as high mobility and flexible deployment, enabling rapid response to power demands in different areas, thereby shortening outage time and improving recovery efficiency. In the event of extreme events, idle electric buses can be quickly converted into mobile energy storage units using B2G technology to provide emergency power support for damaged power distribution networks.

[0004] Therefore, there is an urgent need to invent a robust optimization strategy for the pre-disaster deployment of electric buses for power distribution network recovery, which can pre-deploy idle electric buses in the pre-disaster stage to accelerate the post-disaster recovery of the power distribution network and improve the resilience of the power distribution network. Summary of the Invention

[0005] The technical problem to be solved by this invention is to address the shortcomings of the prior art by providing a robust optimization method and system for pre-disaster deployment of electric buses. This method addresses the issue that the post-disaster recovery of existing power distribution networks mainly relies on fixed energy storage and diesel generators, which suffer from high investment costs, inflexible deployment, limited energy transfer, and inability to quickly respond to emergency power supply needs in different regions. At the same time, traditional optimization methods are unable to effectively handle the uncertainties in disaster scenarios, resulting in poor performance of pre-deployment strategies in actual disasters.

[0006] The present invention adopts the following technical solution: A robust optimization method for pre-disaster deployment of electric buses includes the following steps: S1. Obtain data information, including grid data, electric bus parameters, load data, pre-disaster predicted line fault probability and upper limit, and disaster duration; S2. Based on the data information obtained in step S1, set the scheduling time interval and the number of scenarios N in the fault scenario set. For each fault scenario, use the Monte Carlo simulation method to generate random numbers uniformly distributed between 0 and 1 for each line and compare them with the fault probability of the line. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. S3. Based on the data information obtained in step S1 and the set of fault scenarios obtained in step S2, establish a robust optimization model for the pre-disaster deployment of electric buses. The robust optimization model takes the minimum load shedding of the system during the disaster as the objective function, and also considers the operational constraints, dispatch constraints, scheduling constraints and distribution network system constraints of electric buses. S4. The pre-disaster electric bus pre-deployment model established in step S3 is solved using a C&CG-based decomposition algorithm to obtain the pre-disaster electric bus pre-deployment scheme. S5. Based on the pre-deployment plan output in step S4, complete the pre-deployment of electric buses before the disaster.

[0007] Preferably, in step S3, the objective function of the robust optimization model is:

[0008] in, For the revenue generated by one electric bus on route k; The amount that the power grid unit should subsidize for each electric bus participating in reverse charging; For the first k The number of buses dispatched to stop at the B2G station on each route; The set of time periods within the scheduling period; For distribution network nodes; For nodes i The economic loss per unit of electricity lost during a power outage; For the first i The node at the th t Power loss at any given moment.

[0009] Preferably, an enhanced confidence set is constructed by improving the conventional confidence set, which systematically describes the fuzzy characteristics of line fault scenarios and the enhanced confidence set of fault scenario probabilities. for:

[0010] in, It is the probability distribution of failure scenarios; For the first s The probability corresponding to each scenario; It is an auxiliary variable; It is a probabilistic simplex; Let be the reference probability for the s-th scenario;θ Reflects the confidence level between the reference distribution and the true distribution α ; For the line i The fault status; This is the upper bound of the line fault probability.

[0011] Preferably, the operational constraints for electric buses include:

[0012]

[0013]

[0014]

[0015]

[0016] in, To round down; To round up; This is the initial usable battery level; and The upper and lower limits of the battery capacity for electric buses; For the first bus trip k The power consumption of this route is related to the energy consumption of public transportation. This represents the maximum number of consecutive departures for a single vehicle. For a single vehicle to complete a full operation-charging cycle; For the first k The travel time required for each bus route; Power for charging electric buses; For the first k The departure interval of each route; This refers to the number of departures that need to be covered within the period; The minimum number of buses required to cover all departures.

[0017] Preferably, the electric bus dispatch constraints include:

[0018]

[0019]

[0020] in, For the set of routes; A collection of B2G sites; For the assembly of dispatched electric buses; For the first kThe number of buses dispatched to stop at the B2G station on each route; For 0 / 1 variables, Time represents the first i A bus stopped at j A B2G site.

[0021] Preferably, the electric bus dispatching constraints include: Each bus can only be in one of the following states at any given time: charging, discharging, or idle. The charge status of the bus is kept within the upper and lower limits during the dispatching process; The number of buses that can be connected to each B2G site at the same time shall not exceed its maximum capacity; The charging and discharging power of buses shall not exceed their power limit.

[0022] Preferably, the constraints of the power distribution network system include: Linear distflow power control ensures system power balance and voltage stability; The radial topology constraint of the distribution network ensures that the network structure is tree-like; Generator output constraints and line capacity constraints; Load shedding constraints at load nodes.

[0023] Preferably, in step S4, the C&CG-based decomposition algorithm includes the following steps: Set the global optimization relative error threshold for the C&CG algorithm; Solve the main problem to obtain the current pre-deployment plan and lower bound for electric buses; Based on the current pre-deployment scheme, the second-stage problem in each scenario is solved in parallel, and then the sub-problems are solved to obtain the upper bound and the worst probability distribution; Perform a convergence check. If the convergence condition is met, output the optimal pre-deployment scheme; otherwise, update the main problem and return to solve the main problem again.

[0024] Preferably, the main problem O-MP is solved as follows:

[0025]

[0026] in, The cutting plane representing the main problem; K Indicates the current iteration number; For the first During the nth iteration s The probability corresponding to each scenario; It is the first During the nth iteration s Second-stage decision variables in each scenario; After solving the main problem, update the lower bound. At the same time, there is an optimal solution. .

[0027] Secondly, embodiments of the present invention provide a robust optimization system for pre-disaster deployment of electric buses, comprising: The data module acquires data information, including grid data, electric bus parameters, load data, pre-disaster predicted line fault probability and upper limit, and disaster duration. The scenario module sets the scheduling time interval and the number of scenarios N in the fault scenario set based on the data information obtained from the data module. For each fault scenario, the Monte Carlo simulation method is used to generate a random number uniformly distributed between 0 and 1 for each line and compare it with the fault probability of the line. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. The modeling module establishes a robust optimization model for the pre-disaster deployment of electric buses based on the data information obtained by the data module and the set of fault scenarios obtained by the scenario module. The robust optimization model takes the minimum load shedding of the system during the disaster as the objective function, and also considers the operational constraints, dispatch constraints, scheduling constraints and distribution network system constraints of electric buses. The solution module uses a C&CG-based decomposition algorithm to solve the pre-disaster electric bus pre-deployment model established by the modeling module, and obtains the pre-disaster electric bus pre-deployment scheme. The deployment module completes the pre-deployment of electric buses before the disaster, based on the pre-deployment plan output by the solution module.

[0028] Thirdly, a computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the steps of the above-described robust optimization method for pre-disaster deployment of electric buses.

[0029] Fourthly, embodiments of the present invention provide a computer-readable storage medium including a computer program, which, when executed by a processor, implements the steps of the above-described robust optimization method for pre-disaster deployment of electric buses.

[0030] Fifthly, a chip includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the steps of the above-described robust optimization method for pre-disaster deployment of electric buses.

[0031] In a sixth aspect, embodiments of the present invention provide an electronic device including a computer program, which, when executed by the electronic device, implements the steps of the above-described robust optimization method for pre-disaster deployment of electric buses.

[0032] Compared with the prior art, the present invention has at least the following beneficial effects: A robust optimization method for pre-disaster deployment of electric buses systematically solves the core problem of pre-disaster electric bus scheduling through a closed-loop process of "data acquisition - scenario generation - model building - algorithm solution - pre-deployment execution". Its advantages lie in covering the entire process from basic data preparation to actual deployment, with logically coherent and progressive steps ensuring the operability of the technical solution. Simultaneously, it explicitly aims for "minimum load shedding," balancing the needs of electric bus operation and power grid restoration. It leverages the high mobility and flexible deployment advantages of electric buses while robustly optimizing to address the uncertainties of disaster scenarios, significantly improving the efficiency and flexibility of power grid post-disaster recovery compared to traditional fixed energy storage devices.

[0033] Furthermore, the specific components of the objective function were clarified, and the economic losses from public transport operations, power grid subsidies, and load shedding were optimized in a unified manner. A balance between economic efficiency and recovery efficiency was achieved, and the economic feasibility of the scheme was ensured through quantitative indicators, providing a clear cost-benefit analysis basis for practical application.

[0034] Furthermore, a reinforced confidence set was constructed to describe the uncertainty of the line fault probability distribution. This overcomes the dependence of traditional stochastic programming on probability distribution assumptions, enhances the model's adaptability to extreme disaster scenarios, and improves the robustness and practicality of pre-deployment strategies.

[0035] Furthermore, limitations are imposed on key dimensions such as upper and lower limits on battery capacity, frequency of departures, and charging cycles. The advantage lies in ensuring, through precise mathematical constraints, that electric buses can participate in pre-deployment without affecting the basic operation of the route. The constraints consider both the physical characteristics of electric buses (such as battery capacity limitations and energy consumption patterns) and the actual needs of route operation (such as departure frequency coverage), providing scientific data support for the pre-deployment plan. This ensures that the number of buses dispatched for emergency response is reasonable, avoids disruptions to bus operations due to excessive dispatch, and achieves a balance between emergency needs and daily operations.

[0036] Furthermore, the core rules for electric bus dispatch constraints were defined, clarifying the correspondence between the total number of buses on a route, the number of buses dispatched, and stops at B2G stations. By precisely controlling the bus dispatch and stopping logic using 0 / 1 variables, it ensures that each dispatched bus goes to only one B2G station, avoiding resource dispersion. The constraints guarantee both the minimum number of buses required for route operation and maximize the scale of buses available for emergency response, making resource allocation more efficient. Simultaneously, by quantifying the matching relationship between routes and stations, a clear basis is provided for the implementation of pre-deployment plans, improving the operability of the plan.

[0037] Furthermore, scheduling constraints are clearly defined from four dimensions: bus operating status, state of charge, station capacity, and power limit. This comprehensively covers the key aspects of emergency dispatching for electric buses, ensuring the safety and rationality of the dispatching process. By limiting the single state and state of charge range of buses at any given time, damage to the batteries from overcharging and over-discharging is avoided, ensuring equipment safety. Simultaneously, by limiting the number of stations connected and the charging and discharging power, overload of the power distribution network is avoided, ensuring the stability of emergency power supply. The systematic design of these constraints makes the dispatching process orderly and controllable, improving the reliability of emergency power supply.

[0038] Furthermore, starting from the essential needs of distribution network operation, a linear Distflow model is used to ensure power balance and voltage stability, radial topology constraints ensure network structure safety, and output and capacity constraints prevent equipment overload. These various constraints work together to construct a robust system for ensuring the safe operation of the distribution network. This ensures that the emergency power supply for electric buses is highly compatible with the operating rules of the distribution network, preventing secondary faults caused by emergency power supply and ensuring the safety and stability of post-disaster recovery.

[0039] Furthermore, by decomposing the main problem into sub-problems and computing the optimization results for each scenario in parallel, the model's solution efficiency is significantly improved. By setting a global optimization relative error threshold, the solution time is controlled while ensuring solution accuracy, enabling the solution to quickly respond to the time requirements of pre-disaster deployment. The convergence determination mechanism ensures the optimality of the solution results, and compared with traditional algorithms, it has a greater advantage in handling large-scale scenario sets, providing technical support for the rapid generation of pre-deployment solutions.

[0040] Furthermore, through precise mathematical modeling, the main problem solution can efficiently generate the lower bound and optimal solution of the pre-deployment scheme. The iterative optimization introduced by the cutting plane gradually narrows the search range of the solution and improves the solution efficiency. At the same time, by associating scenario probabilities with the second-stage decision variables, the main problem solution results can fully reflect the impact of each scenario, ensuring the globality and optimality of the pre-deployment scheme, and laying a solid foundation for solving subsequent sub-problems.

[0041] It is understood that the beneficial effects of the second to sixth aspects mentioned above can be found in the relevant descriptions in the first aspect mentioned above, and will not be repeated here.

[0042] In summary, this invention, through innovative robust optimization methods and system design, effectively solves the uncertainty problem in the pre-disaster deployment of electric buses, achieving the dual goals of rapid post-disaster recovery of the power distribution network and normal operation of the public transportation system, and has significant theoretical and practical value.

[0043] The technical solution of the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. Attached Figure Description

[0044] Figure 1 This is a flowchart of the C&CG algorithm of the present invention; Figure 2 An improved IEEE 33-node distribution network topology; Figure 3 A diagram showing the pre-deployment results of electric buses; Figure 4 Here is a scene probability distribution diagram, where (a) is the scene probability distribution of random planning, and (b) is the scene probability distribution of the method of the present invention; Figure 5 A schematic diagram of a computer device provided in an embodiment of the present invention; Figure 6 This is a block diagram of a chip provided according to an embodiment of the present invention.

[0045] Among them, 60. Computer equipment; 61. Processor; 62. Memory; 63. Computer program; 600. Electronic device; 610. Processing unit; 620. Storage unit; 6201. Random access memory unit; 6202. Cache memory unit; 6203. Read-only memory unit; 6204. Program / utility; 6205. Program module; 630. Bus; 640. Display unit; 650. Input / output interface; 660. Network adapter; 700. External device. Detailed Implementation

[0046] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. 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.

[0047] In the description of this invention, it should be understood that the terms "comprising" and "including" indicate the presence of the described features, integrals, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components and / or collections thereof.

[0048] It should also be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0049] It should also be further understood that the term "and / or" as used in this specification and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes such combinations. For example, A and / or B can represent three cases: A alone, A and B simultaneously, and B alone. Additionally, the character " / " in this invention generally indicates that the preceding and following objects have an "or" relationship.

[0050] It should be understood that although terms such as first, second, third, etc., may be used in the embodiments of the present invention to describe the preset range, these preset ranges should not be limited to these terms. These terms are only used to distinguish the preset ranges from one another. For example, without departing from the scope of the embodiments of the present invention, the first preset range may also be referred to as the second preset range, and similarly, the second preset range may also be referred to as the first preset range.

[0051] Depending on the context, the word "if" as used here can be interpreted as "when," "when," "in response to determination," or "in response to detection." Similarly, depending on the context, the phrase "if determination" or "if detection (of the stated condition or event)" can be interpreted as "when determination," "in response to determination," "when detection (of the stated condition or event)," or "in response to detection (of the stated condition or event)."

[0052] The accompanying drawings illustrate various structural schematic diagrams according to embodiments disclosed in this invention. These drawings are not to scale, and some details have been enlarged for clarity, and some details may have been omitted. The shapes of the various regions and layers shown in the drawings, as well as their relative sizes and positional relationships, are merely exemplary and may deviate from reality due to manufacturing tolerances or technical limitations. Furthermore, those skilled in the art can design regions / layers with different shapes, sizes, and relative positions as needed.

[0053] This invention provides a robust optimization method for pre-deployment of electric buses before disasters. It acquires basic information such as grid data and electric bus parameters; generates a set of fault scenarios using Monte Carlo simulation; constructs a robust optimization model with the objective of minimizing load shedding, incorporating constraints from operation, dispatch, scheduling, and the distribution network system; and characterizes fault uncertainty through an improved confidence set. The model is solved using the C&CG decomposition algorithm, outputting a pre-deployment plan for execution. This invention leverages the mobile energy storage advantages of electric buses, robustly addressing disaster uncertainties through optimization, balancing emergency recovery with daily operational needs, reducing power outage losses and deployment costs, and significantly improving the efficiency and resilience of distribution network disaster recovery, demonstrating significant practical application value.

[0054] Please see Figure 1This invention discloses a robust optimization method for pre-disaster deployment of electric buses, comprising the following steps: S1. Obtain data information, including grid data, electric bus parameters, load data, pre-disaster predicted line failure probability and upper limit, and disaster duration; S2. Based on the data information obtained in step S1, set the scheduling time interval and the number of scenarios N in the fault scenario set. For each fault scenario, use the Monte Carlo simulation method to generate a random number uniformly distributed between 0 and 1 for each line and compare it with the fault probability of the line. If it is greater than the fault probability, the line is faulty; otherwise, it is not faulty. S3. Based on the data obtained in step S1 and the set of fault scenarios obtained in step S2, establish a robust optimization model for pre-disaster deployment of electric buses. The specific steps are as follows: The objective function is to minimize the load shedding of the system during a disaster, and various constraints are considered to achieve the pre-deployment of electric buses before a disaster. Since the precise form of line fault distribution caused by typhoons is usually unknown and ambiguous, it is necessary to construct a set containing all possible distributions (i.e., a confidence set) to describe this uncertainty. To characterize the potential damage risk of typhoons to power distribution lines and describe the uncertainty of line faults caused by hurricanes, a reinforced confidence set is constructed by improving the conventional confidence set. This systematically describes the fuzzy characteristics of line fault scenarios and provides a mathematical basis for robust optimization of pre-assignment strategies.

[0055] in, It is the probability distribution of failure scenarios; It is a reinforced confidence set of the probability of failure scenarios; For the first s The probability corresponding to each scenario; It is an auxiliary variable; It is a probabilistic simplex; Let be the reference probability for the s-th scenario; θ Reflects the confidence level between the reference distribution and the true distribution α , As the number of sampling scenarios increases, θ The number of simulations will decrease, and the reference distribution will be closer to the true distribution. When the number of simulations is infinite, the confidence region degenerates into a deterministic empirical distribution, and the model is equivalent to a traditional two-stage stochastic programming model. For the line i The fault status is 0 for fault and 1 for no fault. This is the upper bound of the line fault probability.

[0056] The following formula is used as the objective function:

[0057] in, The revenue generated by an electric bus on route k is the amount lost due to a bus not operating after it is dispatched. If the loss of one passenger is 2 yuan, and each bus loses 30 passengers for each missed operation, and the bus operates 4 fewer times within the pre-deployment time frame, the total loss is 240 yuan. The amount that the power grid unit should subsidize for each electric bus participating in reverse charging; For the first k The number of buses dispatched to stop at the B2G station on each route; The set of time periods within the scheduling period; For distribution network nodes; For nodes i The economic loss per unit of electricity lost during a power outage; For the first i The node at the th t The power loss at each moment. Considering that the pre-deployment time can be relatively long, there are no restrictions on the location of the pre-deployment stations for each bus.

[0058] For each route, the minimum number of electric buses required to maintain its operation can be calculated, providing data support for pre-deployment. The following formula is used as a constraint:

[0059]

[0060]

[0061]

[0062]

[0063] in, To round down; To round up; This is the initial usable battery level; and The upper and lower limits of the battery capacity for electric buses; For the first bus trip k The power consumption of this route is related to the energy consumption of public transportation. This represents the maximum number of consecutive departures for a single vehicle (integer). For a single vehicle to complete a full operation-charging cycle; For the first k The travel time required for each bus route; Power for charging electric buses; For the first k The departure interval of each route; This refers to the number of departures that need to be covered within the period; The minimum number of buses required to cover all departures.

[0064] According to the first disaster k The total number of electric buses on each route It is necessary to consider the number of electric buses that can be dispatched for reverse charging on each route, that all dispatched reverse charging buses will only go to one B2G station, and that each bus can only be at one station. The following formula is used as constraints:

[0065]

[0066]

[0067] in, For the set of routes; A collection of B2G sites; For the assembly of dispatched electric buses; For the first k The number of buses dispatched to stop at the B2G station on each route; 0 / 1 variable Time represents the first i A bus stopped at j A B2G site.

[0068] Once the pre-deployment strategy and fault scenarios for electric buses are determined, the second phase aims to minimize economic losses from power outages. It also limits the number of buses simultaneously participating in reverse charging within a B2G station. Furthermore, based on the network reconfiguration scheme, the tie-line status and bus charge status are optimized for each scenario. s All of them have the following electric bus dispatching constraints and system constraints: 1) Electric bus dispatching constraints

[0069]

[0070]

[0071]

[0072]

[0073]

[0074]

[0075]

[0076]

[0077]

[0078] in, A collection of electric buses for dispatch; A collection of B2G sites in the distribution network; This is a 0 / 1 status variable indicating whether the access site participates in reverse charging; a value of 1 indicates participation in reverse charging. This is a 0 / 1 state variable indicating whether to connect to a charging station and participate in charging; charging occurs when the value is 1. For the first j The maximum number of buses allowed to access a station; For the first i The bus in the j The reverse charging power of each station; The upper limit for reverse charging power of buses; For the first i The bus in the j Charging power at each station; Maximum charging power for buses; For the first j The site is t Reverse charging power at any given time; For the first j The site is t The charging power at any given time; For the first i A bus in t The state of charge at any given moment; and These are the upper and lower limits of the electric charge for buses.

[0079] 2) Linear Distflow model

[0080]

[0081]

[0082]

[0083]

[0084]

[0085]

[0086]

[0087]

[0088]

[0089]

[0090]

[0091] in, A collection of distribution network lines; Represented by nodes j The set of lines for child nodes; Represented by nodes j The set of lines for the parent node; and Representing the scene respectively s Down t Timetable l The active and reactive power flowing through; and Representing nodes respectively j The active and reactive loads; for t Time Node j Voltage; and Indicates the line l Resistance and reactance; Standard voltage; M It is a very large constant; and For nodes j The upper and lower limits of the voltage; and This represents the upper limit of the generator's active and reactive power. This is the upper limit for reactive power at B2G sites; For the line l The capacity; The power factor.

[0092] 3) Radial topology constraints of distribution networks

[0093]

[0094]

[0095] in, This is a set of potential root nodes, which includes B2G sites and nodes at both ends of the damaged line; This refers to the number of nodes in the distribution network. It is a 0 / 1 variable; if it is 1, it represents a potential root node. j exist tIt must become the root node at any time, and vice versa; For the line l The virtual power flowing through; M is a large number.

[0096] For ease of description, the above pre-disaster electric bus deployment model is represented in the following form:

[0097]

[0098]

[0099] in, This is the matrix form of the above model; For the first s One scenario; These are the first-stage decision variables. feasible domain, These are the decision variables for the first stage, including , ; It is the first s Second-stage decision variables in each scenario, including , , , , , , , , , , , , , , , , ; yes The feasible domain; It is the first s Line fault scenarios in various situations, including ; It is the probability distribution of fault scenarios.

[0100] S4. Based on the pre-disaster electric bus deployment model established in step S3, the proposed C&CG-based decomposition algorithm is used to solve the problem. The algorithm flowchart is shown below. Figure 1 As shown, the specific steps are as follows: S401. Set the global optimization relative error of the C&CG algorithm. ; S402, Global optimization relative error based on step S401 Solve the main problem O-MP; The main problem is solved in O-MP as follows:

[0101]

[0102] in, The cutting plane representing the main problem; K Indicates the current iteration number; For the first During the nth iteration s The probability corresponding to each scenario; It is the first During the nth iteration s Second-stage decision variables in each scenario.

[0103] After solving the main problem, update the lower bound. At the same time, there is an optimal solution. .

[0104] S403, Pre-disaster deployment plan for electric buses based on step S402 Solve the subproblems; Specifically as follows: First, compute each scene in parallel. s The corresponding optimization problems are as follows:

[0105]

[0106] Find the optimal value The subproblem is then represented as:

[0107] Solve the above problem and update the upper bound as follows: The worst distribution is .

[0108] S404, Based on step S402, and the result obtained in step S403 Perform a convergence check; if Then jump to step S5 and output. ;otherwise, , to determine the uncertain probability distribution Add to the main question and jump to step S402.

[0109] S5. Based on the results output in step S4, complete the pre-deployment of electric buses before the disaster.

[0110] In another embodiment of the present invention, a robust optimization system for pre-disaster deployment of electric buses is provided. This system can be used to implement the above-mentioned robust optimization method for pre-disaster deployment of electric buses. Specifically, the robust optimization system for pre-disaster deployment of electric buses includes a data module, a scenario module, a modeling module, a solution module, and a deployment module.

[0111] The data module acquires data information, including grid data, electric bus parameters, load data, pre-disaster predicted line fault probability and upper limit, and disaster duration. The scenario module sets the scheduling time interval and the number of scenarios N in the fault scenario set based on the data information obtained from the data module. For each fault scenario, the Monte Carlo simulation method is used to generate a random number uniformly distributed between 0 and 1 for each line and compare it with the fault probability of the line. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. The modeling module establishes a robust optimization model for the pre-disaster deployment of electric buses based on the data information obtained by the data module and the set of fault scenarios obtained by the scenario module. The robust optimization model takes the minimum load shedding of the system during the disaster as the objective function, and also considers the operational constraints, dispatch constraints, scheduling constraints and distribution network system constraints of electric buses. The solution module uses a C&CG-based decomposition algorithm to solve the pre-disaster electric bus pre-deployment model established by the modeling module, and obtains the pre-disaster electric bus pre-deployment scheme. The deployment module completes the pre-deployment of electric buses before the disaster, based on the pre-deployment plan output by the solution module.

[0112] This invention provides a terminal device comprising a processor and a memory. The memory stores a computer program, which includes program instructions. The processor executes the program instructions stored in the computer storage medium. The processor may be a Central Processing Unit (CPU), or other general-purpose processors, graphics processing units (GPUs), tensor processing units (TPUs), digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. It is the computing and control core of the terminal, suitable for implementing one or more instructions, specifically suitable for loading and executing one or more instructions to achieve corresponding method flows or corresponding functions. The processor described in this embodiment can be used for the operation of a robust optimization method for pre-disaster deployment of electric buses, including: Acquire data including network structure data, electric bus parameters, load data, pre-disaster predicted line fault probabilities and upper bounds, and disaster duration. Based on the acquired data, set the scheduling time interval and the number of scenarios N in the fault scenario set. For each fault scenario, use the Monte Carlo simulation method to generate a uniformly distributed random number between 0 and 1 for each line and compare it with the line's fault probability. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. Based on the acquired data and the obtained fault scenario set, establish a robust optimization model for pre-disaster deployment of electric buses. The robust optimization model takes the minimum load shedding during the disaster as the objective function and considers electric bus operation constraints, dispatch constraints, scheduling constraints, and distribution network system constraints. Solve the established pre-disaster electric bus pre-deployment model using a C&CG-based decomposition algorithm to obtain a pre-disaster electric bus pre-deployment scheme. Based on the output pre-deployment scheme, complete the pre-disaster deployment of electric buses.

[0113] Please see Figure 5The terminal device is a computer device. In this embodiment, the computer device 60 includes a processor 61, a memory 62, and a computer program 63 stored in the memory 62 and executable on the processor 61. When executed by the processor 61, the computer program 63 implements the robust optimization method for pre-disaster deployment of electric buses in this embodiment. To avoid repetition, these details are not elaborated here. Alternatively, when executed by the processor 61, the computer program 63 implements the functions of each model / unit in the robust optimization system for pre-disaster deployment of electric buses in this embodiment. To avoid repetition, these details are not elaborated here.

[0114] Computer device 60 can be a desktop computer, laptop, handheld computer, cloud server, or other computing device. Computer device 60 may include, but is not limited to, a processor 61 and a memory 62. Those skilled in the art will understand that... Figure 5 This is merely an example of computer device 60 and does not constitute a limitation on computer device 60. It may include more or fewer components than shown, or combine certain components, or different components. For example, computer device may also include input / output devices, network access devices, buses, etc.

[0115] The processor 61 may be a Central Processing Unit (CPU), or other general-purpose processors, graphics processing units (GPUs), tensor processing units (TPUs), digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor.

[0116] The memory 62 can be an internal storage unit of the computer device 60, such as a hard disk or RAM of the computer device 60. The memory 62 can also be an external storage device of the computer device 60, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., provided on the computer device 60.

[0117] Furthermore, the memory 62 may include both internal storage units of the computer device 60 and external storage devices. The memory 62 is used to store computer programs and other programs and data required by the computer device. The memory 62 can also be used to temporarily store data that has been output or will be output.

[0118] Please see Figure 6 The terminal device is an electronic device 600, which is manifested in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: at least one processing unit 610, at least one storage unit 620, a bus 630 connecting different platform components (including storage unit 620 and processing unit 610), a display unit 640, etc.

[0119] The storage unit stores program code, which can be executed by the processing unit 610 to perform the steps described in the method section of this specification according to various exemplary embodiments of the present invention. For example, the processing unit 610 can perform actions such as... Figure 1 The steps are shown in the figure.

[0120] Storage unit 620 may include a readable medium in the form of a volatile storage unit, such as random access memory (RAM) 6201 and / or cache memory 6202, and may further include a read-only memory (ROM) 6203.

[0121] Storage unit 620 may also include a program / utility 6204 having a set (at least one) program module 6205, such program module 6205 including but not limited to: operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0122] Bus 630 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the multiple bus structures.

[0123] Electronic device 600 can also communicate with one or more external devices 700 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 600, and / or with any device that enables electronic device 600 to communicate with one or more other computing devices (e.g., router, modem). This communication can be performed via input / output interface 650. Furthermore, electronic device 600 can also communicate with one or more networks (e.g., local area network, wide area network, and / or public network, such as the Internet) via network adapter 660. Network adapter 660 can communicate with other modules of electronic device 600 via bus 630. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage platforms.

[0124] Example 4 This invention also provides a storage medium, specifically a computer-readable storage medium, which is a memory device in a terminal device for storing programs and data. It is understood that the computer-readable storage medium here can include both built-in storage media in the terminal device and extended storage media supported by the terminal device; it can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. The computer-readable storage medium provides storage space that stores the terminal's operating system. Furthermore, the storage space also stores one or more instructions suitable for loading and execution by a processor, which can be one or more computer programs (including program code). More specific examples of the computer-readable storage medium include: an electrical connection with one or more wires, a portable disk, a hard disk, random access memory, read-only memory, erasable programmable read-only memory, optical fiber, portable compact disk read-only memory, optical storage device, magnetic storage device, or any suitable combination thereof.

[0125] Computer-readable storage media also include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable storage medium can also be any readable medium other than a readable storage medium that can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the readable storage medium can be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, radio frequency, etc., or any suitable combination thereof.

[0126] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0127] One or more instructions stored in a computer-readable storage medium can be loaded and executed by a processor to implement the corresponding steps of the robust optimization method for pre-disaster deployment of electric buses in the above embodiments; one or more instructions in the computer-readable storage medium are loaded and executed by the processor to perform the following steps: Acquire data including network structure data, electric bus parameters, load data, pre-disaster predicted line fault probabilities and upper bounds, and disaster duration. Based on the acquired data, set the scheduling time interval and the number of scenarios N in the fault scenario set. For each fault scenario, use the Monte Carlo simulation method to generate a uniformly distributed random number between 0 and 1 for each line and compare it with the line's fault probability. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. Based on the acquired data and the obtained fault scenario set, establish a robust optimization model for pre-disaster deployment of electric buses. The robust optimization model takes the minimum load shedding during the disaster as the objective function and considers electric bus operation constraints, dispatch constraints, scheduling constraints, and distribution network system constraints. Solve the established pre-disaster electric bus pre-deployment model using a C&CG-based decomposition algorithm to obtain a pre-disaster electric bus pre-deployment scheme. Based on the output pre-deployment scheme, complete the pre-disaster deployment of electric buses.

[0128] The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0129] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0130] The proposed robust optimization strategy for pre-disaster deployment of electric buses was validated on an improved IEEE 33-node system. The program was implemented in MATLAB R2022a, and the robust optimization model was solved using Gurobi 11.0.0 via Yalmip, with a convergence gap of 0.1%. The computer used was equipped with an R7-8845H processor, 32GB of RAM, and a 6-bit Windows 10 operating system.

[0131] The improved IEEE 33-node distribution network topology is as follows: Figure 2 As shown, the system has a rated voltage of 12.66kV and a total load of 3.715MW. The system has only one main power source, located at node 1, with a maximum output of 10.0MW. It is assumed that only 5 tie lines are equipped with remote control switches for remote operation. The total post-disaster dispatch time is 5 hours, with a dispatch interval of 30 minutes. The B2G sites are nodes 2, 8, and 25.

[0132] The load importance classification and load shedding losses of the power distribution network are shown in Table 1; the parameters of the electric buses participating in the dispatch are shown in Table 2, and the battery load range of the electric buses is 10-90%. Three electric bus routes participated in the pre-disaster deployment, and the relevant parameters of the routes are shown in Table 3, including the number of buses that can be dispatched on each route, the minimum number of buses required for the operation of the route, the daily revenue of one bus, and the subsidy for each bus to be pre-deployed to the B2G station.

[0133] Twenty-four hours before a typhoon, the meteorological bureau or relevant research institutions will provide sufficiently accurate weather forecast data. The power grid company can use this data to determine the pre-deployment strategy for electric buses on different routes, deploying the electric buses participating in the pre-deployment to the corresponding B2G stations 24 hours in advance, while reserving some electric buses to ensure the basic operation of the electric bus routes within 24 hours before the typhoon. The confidence level is set at α=0.95, the number of scenarios is 100, and the output of the main power supply is reduced to 20% of the rated capacity after the disaster.

[0134] Based on the above parameters and simulation results, the pre-allocation strategy for electric buses is obtained. The Electric Bus Adapter (EB) extracts data from three routes and pre-deploys it to different B2G charging stations, enabling rapid recharging of the proxy protocol after a disaster. The pre-allocation and scheduling strategies are as follows: Figure 3 As shown, 6 electric buses (EBs) were dispatched to the Node 2 charging station, 8 EBs to the Node 8 charging station, and 6 EBs to the Node 28 battery swapping station. To meet the demand for public transportation services after the typhoon, 6, 6, and 4 electric buses were respectively deployed to the three routes to handle public transportation on the day before the disaster. Under this strategy, the total pre-allocated cost was 5840 yuan. The routes damaged in the typical scenario were 6-7, 8-9, 14-15, 2-19, and 28-29. Table 4 shows the comparison of whether electric buses were used for post-disaster recovery in this scenario.

[0135] Table 1 Load Classification and Node Number

[0136] Table 2 Electric Bus Parameters

[0137] Table 3. Line-related parameters

[0138] The probability distribution of the scenario will significantly influence the pre-deployment strategy of electric buses. To demonstrate the difference in strategies, we compare the worst-case probability distribution obtained from the proposed enhanced confidence set with the probability distribution from stochastic programming. The comparison results of the different probability distributions are as follows: Figure 4 As shown.

[0139] Table 4. Recovery results with and without electric buses in typical scenarios.

[0140] Figure 4 The results show that traditional stochastic programming yields the same probability for each scenario. In this model, the scenario probability distribution obtained by relying on the enhanced confidence set considers the disturbance of physical line faults, which is closer to the actual damage situation. The bus pre-deployment situation of the method in this chapter and the pre-deployment situation obtained by stochastic programming are shown in Table 5. The load recovery results of the two methods under typical fault scenarios are compared in Table 6.

[0141] Table 5 Results of pre-deployment of electric buses under different strategies

[0142] Table 6 Load recovery results of different strategies

[0143] The results show that using the reinforced confidence set proposed in this invention to solve the electric bus pre-deployment strategy has a better recovery effect. For the strategy solved by traditional stochastic programming, the robustness of the strategy is insufficient because it does not consider the uncertainty of the damage scenario. In some fault scenarios, the number of pre-deployed electric buses may be too high or too low, and the electric buses cannot be fully utilized.

[0144] In summary, this invention presents a robust optimization method and system for pre-disaster deployment of electric buses. By constructing a robust optimization model for pre-disaster deployment of electric buses, employing reinforced confidence sets to describe the uncertainty of line faults, and establishing a two-stage stochastic programming framework, the optimal pre-deployment is achieved under the premise of ensuring normal bus operation through efficient solution using the C&CG algorithm. Simulation results show that, compared with traditional stochastic programming, the method of this invention reduces the power loss from 4318 kWh to 3775 kWh and the economic loss from 20176 yuan to 17475 yuan, significantly improving the post-disaster recovery capability of the distribution network. Simultaneously, by leveraging the mobile energy storage characteristics of electric buses, the limitations of fixed energy storage are overcome, providing an innovative solution for disaster prevention and mitigation in urban distribution networks. This method has advantages such as flexible deployment, controllable cost, and good recovery effect, and has good prospects for widespread application.

[0145] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the above-described division of functional units and modules is merely an example. In practical applications, the above functions can be assigned to different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiments can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit. Furthermore, the specific names of the functional units and modules are only for easy differentiation and are not intended to limit the scope of protection of this application. The specific working process of the units and modules in the above system can be referred to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0146] In the above embodiments, the descriptions of each embodiment have different focuses. For parts that are not described in detail or recorded in a certain embodiment, please refer to the relevant descriptions of other embodiments.

[0147] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed in this invention can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0148] In the embodiments provided by this invention, it should be understood that the disclosed devices / terminals and methods can be implemented in other ways. For example, the device / terminal embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0149] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0150] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0151] If the integrated module / unit is implemented as 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, all or part of the processes in the methods of the above embodiments can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random-access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium can be appropriately added or removed according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electrical carrier signals and telecommunication signals.

[0152] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus, and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0153] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0154] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0155] The above content is only for illustrating the technical concept of the present invention and should not be construed as limiting the scope of protection of the present invention. Any modifications made to the technical solution based on the technical concept proposed in this invention shall fall within the scope of protection of the claims of this invention.

Claims

1. A robust optimization method for pre-disaster deployment of electric buses, characterized in that, Includes the following steps: S1. Obtain data information, including grid data, electric bus parameters, load data, pre-disaster predicted line fault probability and upper limit, and disaster duration; S2. Based on the data information obtained in step S1, set the scheduling time interval and the number of scenarios N in the fault scenario set. For each fault scenario, use the Monte Carlo simulation method to generate random numbers uniformly distributed between 0 and 1 for each line and compare them with the fault probability of the line. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. S3. Based on the data information obtained in step S1 and the set of fault scenarios obtained in step S2, establish a robust optimization model for the pre-disaster deployment of electric buses. The robust optimization model takes the minimum load shedding of the system during the disaster as the objective function, and also considers the operational constraints, dispatch constraints, scheduling constraints and distribution network system constraints of electric buses. S4. The pre-disaster electric bus pre-deployment model established in step S3 is solved using a C&CG-based decomposition algorithm to obtain the pre-disaster electric bus pre-deployment scheme. S5. Based on the pre-deployment plan output in step S4, complete the pre-deployment of electric buses before the disaster.

2. The robust optimization method for pre-disaster deployment of electric buses according to claim 1, characterized in that, In step S3, the objective function of the robust optimization model is: in, For the revenue generated by one electric bus on route k; The amount that the power grid unit should subsidize for each electric bus participating in reverse charging; For the first k The number of buses dispatched to stop at the B2G station on each route; The set of time periods within the scheduling period; For distribution network nodes; For nodes i The economic loss per unit of electricity lost during a power outage; For the first i The node at the th t Power loss at any given moment.

3. The robust optimization method for pre-disaster deployment of electric buses according to claim 2, characterized in that, By improving the conventional confidence set to construct a reinforced confidence set, the fuzzy characteristics of line fault scenarios are systematically described, resulting in a reinforced confidence set for the probability of fault scenarios. for: in, It is the probability distribution of failure scenarios; For the first s The probability corresponding to each scenario; It is an auxiliary variable; It is a probabilistic simplex; Let be the reference probability for the s-th scenario; θ Reflects the confidence level between the reference distribution and the true distribution α ; For the line i The fault status; This is the upper bound of the line fault probability.

4. The robust optimization method for pre-disaster deployment of electric buses according to claim 2, characterized in that, The operational constraints for electric buses include: in, To round down; To round up; This is the initial usable battery level; and The upper and lower limits of the battery capacity for electric buses; For the first bus trip k The power consumption of this route is related to the energy consumption of public transportation. This represents the maximum number of consecutive departures for a single vehicle. For a single vehicle to complete a full operation-charging cycle; For the first k The travel time required for each bus route; Power for charging electric buses; For the first k The departure interval of each route; This refers to the number of departures that need to be covered within the period; The minimum number of buses required to cover all departures.

5. The robust optimization method for pre-disaster deployment of electric buses according to claim 2, characterized in that, The electric bus dispatch constraints include: in, For the set of routes; A collection of B2G sites; For the assembly of dispatched electric buses; For the first k The number of buses dispatched to stop at the B2G station on each route; 0 / 1 variable Time represents the first i A bus stopped at j A B2G site.

6. The robust optimization method for pre-disaster deployment of electric buses according to claim 2, characterized in that, The electric bus dispatch constraints include: Each bus can only be in one of the following states at any given time: charging, discharging, or idle. The charge status of the bus is kept within the upper and lower limits during the dispatching process; The number of buses that can be connected to each B2G site at the same time shall not exceed its maximum capacity; The charging and discharging power of buses shall not exceed their power limit.

7. The robust optimization method for pre-disaster deployment of electric buses according to claim 2, characterized in that, The constraints of the power distribution network system include: Linear distflow power control ensures system power balance and voltage stability; The radial topology constraint of the distribution network ensures that the network structure is tree-like; Generator output constraints and line capacity constraints; Load shedding constraints at load nodes.

8. The robust optimization method for pre-disaster deployment of electric buses according to claim 1, characterized in that, In step S4, the C&CG-based decomposition algorithm includes the following steps: Set the global optimization relative error threshold for the C&CG algorithm; Solve the main problem to obtain the current pre-deployment plan and lower bound for electric buses; Based on the current pre-deployment scheme, the second-stage problem in each scenario is solved in parallel, and then the sub-problems are solved to obtain the upper bound and the worst probability distribution; Perform a convergence check. If the convergence condition is met, output the optimal pre-deployment scheme; otherwise, update the main problem and return to solve the main problem again.

9. The robust optimization method for pre-disaster deployment of electric buses according to claim 8, characterized in that, The main problem is solved in O-MP as follows: in, The cutting plane representing the main problem; K Indicates the current iteration number; For the first During the nth iteration s The probability corresponding to each scenario; It is the first During the nth iteration s Second-stage decision variables in each scenario; After solving the main problem, update the lower bound. At the same time, there is an optimal solution. .

10. A robust optimization system for pre-disaster deployment of electric buses, characterized in that, include: The data module acquires data information, including grid data, electric bus parameters, load data, pre-disaster predicted line fault probability and upper limit, and disaster duration. The scenario module sets the scheduling time interval and the number of scenarios N in the fault scenario set based on the data information obtained from the data module. For each fault scenario, the Monte Carlo simulation method is used to generate a random number uniformly distributed between 0 and 1 for each line and compare it with the fault probability of the line. If the random number is greater than the fault probability, the line is faulty; otherwise, the line is not faulty, thus obtaining the fault scenario set. The modeling module establishes a robust optimization model for the pre-disaster deployment of electric buses based on the data information obtained by the data module and the set of fault scenarios obtained by the scenario module. The robust optimization model takes the minimum load shedding of the system during the disaster as the objective function, and also considers the operational constraints, dispatch constraints, scheduling constraints and distribution network system constraints of electric buses. The solution module uses a C&CG-based decomposition algorithm to solve the pre-disaster electric bus pre-deployment model established by the modeling module, and obtains the pre-disaster electric bus pre-deployment scheme. The deployment module completes the pre-deployment of electric buses before the disaster, based on the pre-deployment plan output by the solution module.