A resource allocation method, system, storage medium and electronic device

Abstract

The present application discloses a resource allocation method, system, storage medium and electronic device. The method includes: obtaining a set of rescue points, a set of disaster-affected points and a set of command centers in a target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers; obtaining the disaster information of all disaster-affected points from the set of disaster-affected points; respectively determining the disaster weight of each disaster-affected point according to the disaster information of each disaster-affected point; generating a resource allocation model for the target disaster area according to the disaster weight of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points and the initial quantity of rescue supplies at the set of command centers; generating a resource allocation result through a bee colony algorithm according to the resource allocation model; achieving the rapid arrival of rescue supplies, achieving the purpose of resource allocation at the lowest cost, consuming less, having higher efficiency and stronger practicability.

Description

Technical Field

[0001] The present application relates to the technical field of railway emergency response and disaster prevention command and dispatching for the transportation of hazardous chemicals, and particularly relates to a resource allocation method, system, storage medium, and electronic device. Background Art

[0002] With the rapid development of railway transportation technology, hazardous chemicals increasingly rely on railways for transportation. Once an accident occurs to a vehicle transporting hazardous chemicals, it usually has characteristics such as a wide range of impact, large derivative accidents, and strong social harm. When conducting rescue operations, in addition to the need to promptly clean up the leaked hazardous chemicals, another key issue is to assemble and mobilize emergency rescue supplies to the disaster area in the shortest possible time, while clearing the line to ensure normal operation of the line, and transporting the derailed trains without hazardous chemical leaks to a safe area in a timely manner to avoid secondary leaks and injuries.

[0003] Compared with the commonly used genetic algorithm at present, the artificial bee colony algorithm is more excellent in local convergence and optimization ability, will not have the "premature" phenomenon of the genetic algorithm, and the complexity of the algorithm is also lower.

[0004] The artificial bee colony algorithm belongs to a kind of swarm intelligence algorithm, which is inspired by the honey-seeking and honey-gathering processes of bees. Compared with common heuristic algorithms, its advantages are that it uses fewer control parameters, has strong robustness, and performs global and local optimal solution searches in each iteration process, so the probability of finding the optimal solution is greatly increased. Summary of the Invention

[0005] In view of the above problems, in order to overcome the problems of uneven distribution of rescue resources and long response time caused by existing railways when transporting hazardous chemicals in the event of sudden accidents, the present application proposes a resource allocation method, system, storage medium, and electronic device. The method takes the shortest rescue response time and the minimum consumption of materials required for transportation and rescue as the dual objective functions, uses the number of trapped people, the degree of hazardous chemical leakage, and the difficulty of transferring non-leaked hazardous chemicals to a safe area as constraints, and obtains the resource allocation plan for each rescue point according to the bee colony algorithm.

[0006] In the first aspect of the present application, a resource allocation method is provided, and the method includes:

[0007] Obtain a set of rescue points, a set of disaster areas, and a set of command centers within the target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers;

[0008] Obtain the disaster information of all disaster areas from the set of disaster areas;

[0009] Determine the disaster weight of each disaster area according to the disaster information of each disaster area respectively;

[0010] Generate a resource allocation model for the target disaster area according to the disaster weights of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial amount of rescue supplies at the set of rescue points, and the initial amount of rescue supplies at the set of command centers;

[0011] Generate a resource allocation result according to the resource allocation model through a bee colony algorithm.

[0012] In some embodiments, the obtaining of the set of rescue points, the set of disaster-affected points, and the set of command centers in the target disaster area, as well as the initial amount of rescue supplies at the set of rescue points and the set of command centers, includes:

[0013] Generate a set of rescue points {J1, J2,..., J m}, a set of command centers {K1, K2,..., K b}, and a set of disaster points where disasters may occur {I1, I2,..., I n} according to the actual locations of the rescue centers;

[0014] The quantity of the c-th (c = 1, 2,..., C) type of rescue emergency supplies stored at the rescue point J m (m = 1, 2,..., m) is number(c cj ), and the quantity of the c-th (c = 1, 2,..., C) type of rescue emergency supplies stored at the command center K b (b = 1, 2,..., b) is number(c ck );

[0015] Where m is the number of rescue points, b is the number of command centers, n is the number of disaster-affected points, and C is the number of types of rescue emergency supplies.

[0016] In some embodiments, the disaster weights include:

[0017] The weight of trapped people, the hazard level, and the section priority.

[0018] In some embodiments, according to the number of trapped people at each disaster-affected point in the disaster information, the weight of trapped people is determined by the following formula:

[0019]

[0020] Where I ink is the number of trapped people at the n-th disaster-affected point, x1 is the number of people rescued by each rescue team, and w ik is the weight of trapped people.

[0021] In some embodiments, according to the hazardous chemical leakage situation of each disaster-affected point in the disaster information and the pre-set hazard level rules, the hazard level is determined.

[0022] In some embodiments, the step of determining the section priority includes:

[0023] According to the number of derailed sections of hazardous chemical vehicles at each disaster-affected point in the disaster information, the proportion of section importance w of each disaster-affected point is determined by the following formula s :

[0024]

[0025] where number(I n ) is the number of derailed sections of the hazardous chemical vehicle at the nth disaster-affected point;

[0026] According to the number of vehicle passages per unit time and the damaged track mileage at each disaster-affected point, the proportion of section damage degree w of each disaster-affected point is determined by the following formula k :

[0027]

[0028] where d inc is the number of vehicle passages per unit time at the ith disaster-affected point, d ing is the damaged track mileage at the ith disaster-affected point, and α, β are price-based parameters;

[0029] According to the section importance and the proportion of section damage degree, the section priority is determined by the following formula:

[0030]

[0031] where w ij is the section importance of the ith disaster-affected point, w ik is the section damage degree of the ith disaster-affected point, χ, δ are balance coefficients between w ij and w ik , η is the pre-allocated value between each disaster-affected point, n is the number of disaster-affected points, and w ijk is the section priority.

[0032] In some embodiments, the resource allocation model includes:

[0033]

[0034]

[0035]

[0036] where m is the number of rescue points, b is the number of command centers, tij is the time from the rescue point to the disaster area, t ik is the time from the command center to the disaster area, number(c cij ) is the quantity of the c-th type of relief supplies dispatched from the rescue point to the disaster area, number(c cik ) is the quantity of the c-th type of relief supplies dispatched from the command center to the disaster area, is the allocated quantity of the disaster area I1 according to w ik is the allocated quantity of the disaster area I1 according to w is is the allocated quantity of the disaster area I1 according to w ijk

[0037] In the second aspect of the present application, a resource allocation system is provided. The system includes:

[0038] A first acquisition module, configured to acquire a set of rescue points, a set of disaster areas, and a set of command centers within a target disaster area, and the initial quantity of relief supplies at the set of rescue points and the set of command centers;

[0039] A second acquisition module, configured to acquire the disaster information of all disaster areas from the set of disaster areas;

[0040] A determination module, configured to determine the disaster weight of each disaster area according to the disaster information of each disaster area respectively;

[0041] A model generation module, configured to generate a resource allocation model of the target disaster area according to the disaster weight of each disaster area, the set of rescue points, the set of disaster areas, the set of command centers, the initial quantity of relief supplies at the set of rescue points, and the initial quantity of relief supplies at the set of command centers;

[0042] A result generation module, configured to generate a resource allocation result through a swarm intelligence algorithm according to the resource allocation model.

[0043] In the third aspect of the present application, a storage medium is provided. The computer program stored in the storage medium can be executed by one or more processors to implement the resource allocation method as described above.

[0044] In the fourth aspect of the present application, an electronic device is provided, including a memory and a processor. A computer program is stored on the memory, and the memory and the processor are communicatively connected to each other. When the computer program is executed by the processor, the resource allocation method as described above is implemented.

[0045] Compared with the prior art, the technical solution of the present application has the following advantages or beneficial effects: ​​​

[0046] When dealing with the problem of resource allocation, the technical solution of this application adopts the bee colony algorithm. By establishing a resource allocation model to allocate the resources required for railway hazardous chemical transportation, it realizes the rapid arrival of rescue supplies and the timeliness of rescue time, thus achieving the goal of allocating resources at the lowest cost. Compared with the traditional genetic algorithm, the technical solution of this application is more suitable for solving the problem of allocating emergency rescue resources, and consumes less, has higher efficiency, and stronger practicability. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only the embodiments of this application. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained according to the provided drawings.

[0048] Figure 1 It is a flowchart of a resource allocation method provided by an embodiment of this application;

[0049] Figure 2 It is a schematic diagram of a resource allocation system provided by an embodiment of this application;

[0050] Figure 3 It is a connection block diagram of an electronic device provided by an embodiment of this application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0051] The following will combine the drawings and embodiments to detail the implementation manners of this application, so as to fully understand how this application uses technical means to solve technical problems and the implementation process of achieving corresponding technical effects and implement accordingly. The embodiments of this application and each feature in the embodiments can be combined with each other on the premise of not conflicting, and the formed technical solutions are all within the protection scope of this application.

[0052] Embodiment 1

[0053] This embodiment provides a resource allocation method. Figure 1 It is a flowchart of a resource allocation method provided by an embodiment of this application. As Figure 1 shown, the method of this embodiment includes:

[0054] S110. Obtain the set of rescue points, the set of disaster-affected points, and the set of command centers in the target disaster area, and the initial quantity of rescue supplies at the set of rescue points and the set of command centers.

[0055] In some embodiments, obtaining the set of rescue points, the set of disaster-affected points, and the set of command centers within the target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers, includes:

[0056] Generating a set of rescue points {J1, J2,..., J m}, a set of command centers {K1, K2,..., K b}, and a set of disaster points {I1, I2,..., I n} that may be affected by disasters according to the actual location of the rescue center;

[0057] The quantity of the c-th (c = 1, 2,..., C) type of rescue emergency supplies stored at the rescue point J m (m = 1, 2,..., m) is number(c cj ), and the quantity of the c-th (c = 1, 2,..., C) type of rescue emergency supplies stored at the command center K b (b = 1, 2,..., b) is number(c ck );

[0058] Wherein, m is the number of rescue points, b is the number of command centers, n is the number of disaster-affected points, C is the number of types of rescue emergency supplies, and m, b, n, and C are all positive integers.

[0059] Optionally, constructing the set of each rescue point, the set of the disaster area where disasters may occur, and the initial resource quantity according to the quantity of supplies contained in each rescue point includes the following steps:

[0060] Step 1: Construct a set of rescue points {J1, J2,..., J m}, a set of command centers {K1, K2,..., K b}, and a set of disaster points {I1, I2,..., I n} that may be affected by disasters according to the actual location of the rescue center, where m is the number of rescue points, n is the number of disaster-affected points, and b is the number of command centers;

[0061] Step 2: The quantity of the c-th (c = 1, 2,..., C) type of rescue emergency supplies stored at the rescue point J m (m = 1, 2,..., m) is number(c cj ), and the quantity of the c-th (c = 1, 2,..., C) type of rescue emergency supplies stored at the command center K b (b = 1, 2,..., b) is number(c ck ).

[0062] In some embodiments, after obtaining the set of rescue points, the set of disaster-affected points, and the set of command centers in the target disaster area, the method further includes:

[0063] Obtain the number of rescue points and the number of command centers in the target disaster area.

[0064] Optionally, the set of rescue points in the target disaster area includes all the rescue points in the target disaster area, and the set of command centers in the target disaster area includes all the command centers in the target disaster area. According to the set of rescue points and the set of command centers in the target disaster area, obtain the number of rescue points and the number of command centers in the target disaster area.

[0065] S120. Obtain the disaster information of all the disaster-affected points from the set of disaster-affected points.

[0066] Optionally, the disaster information may include: the location information of the disaster-affected point, the number of trapped people at the disaster-affected point, the number of derailed sections of hazardous chemical vehicles at the disaster-affected point, the number of vehicles passing through the disaster-affected point per unit time, and the damaged mileage of the railway track, etc.

[0067] S130. Determine the disaster weight of each disaster-affected point according to the disaster information of each disaster-affected point.

[0068] In some embodiments, the disaster weight includes:

[0069] The weight of trapped people, the hazard level, and the section priority.

[0070] It can be understood that emergency resources should not be randomly allocated. It is necessary to statistically analyze the weight of trapped people, the level of hazardous material leakage, and the section priority according to the initial situation of the disaster-affected points in the disaster area, and comprehensively analyze the proportion of various weights. Finally, allocate the corresponding rescue teams to the disaster-affected points for rescue.

[0071] In some embodiments, according to the number of trapped people at each disaster-affected point in the disaster information, the weight of trapped people is determined by the following formula:

[0072]

[0073] where floor is the ceiling function, I ink is the number of trapped people at the nth disaster-affected point, x1 is the number of people rescued by each rescue team, w ik is the weight of trapped people.

[0074] Optionally, according to the trapped people situation among the disaster-affected points, it is now assumed that 1 rescue team for trapped people needs to be dispatched for every x1 trapped people. According to the number of trapped people among the disaster-affected points when the disaster occurs, determine the number of rescue teams for trapped people to be dispatched between each pair of disaster-affected points. The calculation method is as follows:

[0075]

[0076] Among them, floor is the ceiling function, and I ink is the number of trapped people at the nth disaster-stricken point, and x1 is the number of people rescued by each rescue team.

[0077] In some embodiments, according to the hazardous chemical leakage situation of each disaster-stricken point in the disaster information and a preset hazard level rule, the hazard level is determined.

[0078] Optionally, according to the hazardous chemical leakage situation between disaster-stricken points and a preset hazard level rule, the hazard level is divided into several levels as shown in the following table:

[0079] Dangerous goods leakage situation Level No leakage occurred. 0 Less than 10㎡ and not easily volatile. I 10㎡ - 30㎡ and not easily volatile, or less than 10㎡ and easily volatile. II More than 30㎡ and not easily volatile, or more than 10㎡ and easily volatile. III

[0080] It should be noted that the preset hazard level rule can be set according to the actual needs of users, and no special limitation is made here specifically.

[0081] In some embodiments, the steps of determining the section priority include:

[0082] According to the number of derailed sections of hazardous chemical vehicles at each disaster-stricken point in the disaster information, the proportion w of the section importance of each disaster-stricken point is determined by the following formula s :

[0083]

[0084] Among them, number(I n ) is the number of derailed sections of the hazardous chemical vehicle at the nth disaster-stricken point;

[0085] According to the number of passing vehicles per unit time and the damaged rail mileage between each disaster-stricken point, the proportion w of the section damage degree between each disaster-stricken point is determined by the following formula k :

[0086]

[0087] Among them, d inc is the number of passing vehicles per unit time at the ith disaster-stricken point, d ing is the damaged rail mileage at the ith disaster-stricken point, and α, β are price-based parameters;

[0088] According to the section importance and the proportion of the section damage degree, the section priority is determined by the following formula:

[0089]

[0090] Among them, w ij is the section importance of the ith disaster-stricken point, w ikis the damage degree of the i-th disaster area, χ, δ are the balance coefficients between w ij and w ik The pre-allocation value between each disaster area is η, the number of disaster areas is n, and w ijk is the section priority.

[0091] Optionally, α and β are importance adjustment parameters based on price. According to the section importance and section density between disaster areas, the section importance of transporting hazardous chemicals is more important than the section density, and the section priority is obtained to avoid the situation where no rescue team is assigned to a disaster area with too low section priority.

[0092] It should be noted that the pre-allocation value can be set according to the actual needs of users, and no specific limitation is made here.

[0093] S140. Generate a resource allocation model for the target disaster area according to the disaster weight of each disaster area, the set of rescue points, the set of disaster areas, the set of command centers, the initial amount of rescue supplies at the set of rescue points, and the initial amount of rescue supplies at the set of command centers.

[0094] In some embodiments, the resource allocation model includes:

[0095]

[0096]

[0097]

[0098] Among them, m is the number of rescue points, b is the number of command centers, t ij is the time from the rescue point to the disaster area, t ik is the time from the command center to the disaster area, number(c cij ) is the quantity of the c-th type of rescue supplies dispatched from the rescue point to the disaster area, number(c cik ) is the quantity of the c-th type of rescue supplies dispatched from the command center to the disaster area, is the allocation quantity of the disaster area I1 according to w ik , is the allocation quantity of the disaster area I1 according to w is , is the allocation quantity of the disaster area I1 according to w ijk .

[0099] S150. Generate a resource allocation result according to the resource allocation model through a bee colony algorithm.

[0100] Optionally, a resource allocation result is generated through a bee colony algorithm according to the resource allocation model, and the resource dispatch of each rescue point is comprehensively analyzed based on the bee colony algorithm to obtain an optimal resource allocation plan.

[0101] Optionally, in the embodiment of the present application, with the goal of the shortest arrival time of rescue supplies and the lowest cost of transporting rescue supplies, the objective functions F1 and F2 are solved under the constraints of weights and resource upper limits. An optional solution method through the bee colony algorithm includes:

[0102] In the first step, the population size is initialized and the number of iterations is determined. The solution in the problem space is 4-dimensional. The number of employed bees and onlooker bees is 100 each, searching for nectar sources in the 4-dimensional space. The position of each nectar source represents a feasible solution, and the nectar degree of the nectar source corresponds to the fitness of the solution. One employed bee corresponds to one nectar source. The employed bee corresponding to the i-th nectar source searches for a new nectar source according to the following formula:

[0103] x id ' = x id + φ id ·(x id - x kd )

[0104] where i = 1, 2,..., S is the number of nectar sources, employed bees, and onlooker bees, and d = 1, 2, 3, 4 is the number of optimization variables, is a random number between [-1, 1], and k ≠ i.

[0105] Those skilled in the art can understand that X id is the number of employed bees in the bee colony algorithm, that is, the form of the solution.

[0106] In the second step, the newly generated possible solutions {X i1 ', X i2 ',..., X iD '} are compared with the original solutions {X i1 , X i2 ,..., X iD}, and better solutions are selected through a greedy selection strategy.

[0107] In the third step, a probability is calculated for each employed bee according to the following formula for each employed bee. The onlooker bees accept the employed bees with the probability calculated above, update using the update formula of the employed bees, and then perform greedy selection.

[0108]

[0109] Step 4, when all the foraging bees and scout bees have searched the entire search space, if the fitness value of a nectar source has not been improved within a given number of steps (defined as the control parameter "limit"), discard the nectar source, and the foraging bee corresponding to this nectar source becomes a scout bee. The scout bee can search for a new possible solution through the following formula:

[0110]

[0111] where r is a random number in [0, 1], x min and x max are the lower and upper bounds of the d-th variable space.

[0112] Optionally, when the position of the nectar source has not been updated for several generations or reaches the maximum number of iterations, output the position of the nectar source, and select the nectar source with the highest fitness among the generated nectar sources as the output solution, that is, the rescue resource allocation plan formed according to the bee colony algorithm.

[0113] It should be noted that in the embodiments of the present application, steps S110 to S140 are to determine the resource allocation model (the objective function of the bee colony algorithm), and step S150 is to solve the resource allocation model (the objective function of the bee colony algorithm) through the bee colony algorithm.

[0114] Furthermore, it should be noted that step S150 is a method for solving the objective function through the bee colony algorithm disclosed in the embodiments of the present application. Those skilled in the art can also solve the resource allocation model in an approximate manner to obtain a resource allocation plan, which is not specifically limited here.

[0115] The method of this embodiment includes: obtaining the set of rescue points, the set of disaster-stricken points, and the set of command centers in the target disaster area, as well as the initial quantities of rescue supplies at the set of rescue points and the set of command centers; obtaining the disaster information of all disaster-stricken points from the set of disaster-stricken points; respectively determining the disaster weights of each disaster-stricken point according to the disaster information of each disaster-stricken point; generating the resource allocation model of the target disaster area according to the disaster weights of each disaster-stricken point, the set of rescue points, the set of disaster-stricken points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points, and the initial quantity of rescue supplies at the set of command centers; generating a resource allocation result through the bee colony algorithm according to the resource allocation model. When dealing with the problem of resource allocation, the technical solution of the present application adopts the bee colony algorithm, and allocates the resources required for railway hazardous chemical transportation by establishing a resource allocation model, realizing the rapid arrival of rescue supplies and the timeliness of rescue time, so as to achieve the purpose of resource allocation with the minimum cost; compared with the traditional genetic algorithm, the technical solution of the present application is more suitable for solving the problem of emergency rescue resource allocation, and consumes less, has higher efficiency, and stronger practicability.

[0116] Embodiment 2

[0117] This embodiment provides a resource allocation system. This system embodiment can be used to execute the method embodiment of this application. For details not disclosed in this system embodiment, please refer to the method embodiment of this application. Figure 2 It is a schematic diagram of a resource allocation system provided by an embodiment of this application, as Figure 2 shown. The resource allocation system 200 of this embodiment includes:

[0118] A first acquisition module 201, configured to acquire a set of rescue points, a set of disaster-affected points, and a set of command centers in a target disaster area, and the initial quantity of rescue supplies at the set of rescue points and the set of command centers;

[0119] A second acquisition module 202, configured to acquire the disaster information of all disaster-affected points from the set of disaster-affected points;

[0120] A determination module 203, configured to determine the disaster weight of each disaster-affected point respectively according to the disaster information of each disaster-affected point;

[0121] A model generation module 204, configured to generate a resource allocation model for the target disaster area according to the disaster weight of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points, and the initial quantity of rescue supplies at the set of command centers;

[0122] A result generation module 205, configured to generate a resource allocation result through a bee colony algorithm according to the resource allocation model.

[0123] In some embodiments, the acquiring the set of rescue points, the set of disaster-affected points, and the set of command centers in the target disaster area, and the initial quantity of rescue supplies at the set of rescue points and the set of command centers includes:

[0124] Generating a set of rescue points {J1, J2,..., J m}, a set of command centers {K1, K2,..., K b}, and a set of disaster points {I1, I2,..., I n} where disasters may occur according to the actual positions of the rescue centers;

[0125] The quantity of the c-th (c = 1, 2,..., C) kind of rescue emergency supplies stored at the rescue point J m (m = 1, 2,..., m) is number(c cj ), and at the command center K b(The quantity of the c-th (c = 1, 2,..., C) kind of rescue emergency supplies stored at (b = 1, 2,..., b) is number(c ck );

[0126] Among them, m is the number of rescue points, b is the number of command centers, n is the number of disaster-stricken points, and C is the number of rescue emergency supply categories.

[0127] In some embodiments, the disaster weight includes:

[0128] The trapped personnel weight, the hazard level, and the section priority.

[0129] In some embodiments, according to the number of trapped people at each disaster-stricken point in the disaster information, the trapped personnel weight is determined by the following formula:

[0130]

[0131] Among them, I ink is the number of trapped people at the n-th disaster-stricken point, x1 is the number of people rescued by each rescue team, and w ik is the trapped personnel weight.

[0132] In some embodiments, according to the hazardous chemical leakage situation at each disaster-stricken point in the disaster information and the pre-set hazard level rules, the hazard level is determined.

[0133] In some embodiments, the steps of determining the section priority include:

[0134] According to the number of derailed sections of the hazardous chemical vehicles at each disaster-stricken point in the disaster information, the proportion of the section importance of each disaster-stricken point w s is determined by the following formula:

[0135]

[0136] Among them, number(I n ) is the number of derailed sections of the hazardous chemical transport vehicle at the n-th disaster-stricken point;

[0137] According to the number of vehicle passages per unit time and the damaged mileage of the railway tracks at each disaster-stricken point, the proportion of the section damage degree of each disaster-stricken point w k is determined by the following formula:

[0138]

[0139] Among them, d inc is the number of vehicle passages per unit time at the i-th disaster-stricken point, d ing is the damaged mileage of the railway tracks at the i-th disaster-stricken point, and α, β are price-based parameters;

[0140] According to the section importance and the proportion of the section damage degree, the section priority is determined by the following formula:

[0141]

[0142] where w ij is the section importance of the i-th disaster-affected point, w ik is the section damage degree of the i-th disaster-affected point, χ, δ are the balance coefficients between w ij and w ik , η is the pre-allocation value between each disaster-affected point, n is the number of disaster-affected points, and w ijk is the section priority.

[0143] In some embodiments, the resource allocation model includes:

[0144]

[0145]

[0146]

[0147] where m is the number of rescue points, b is the number of command centers, t ij is the time from the rescue point to the disaster-affected point, t ik is the time from the command center to the disaster-affected point, number(c cij ) is the quantity of the c-th type of rescue supplies dispatched from the rescue point to the disaster-affected point, number(c cik ) is the quantity of the c-th type of rescue supplies dispatched from the command center to the disaster-affected point, is the allocation quantity of the disaster-affected point I1 according to w ik , is the allocation quantity of the disaster-affected point I1 according to w is , is the allocation quantity of the disaster-affected point I1 according to w ijk .

[0148] It should be noted that the above-mentioned various modules / units can be functional modules or program modules, and can be implemented either by software or by hardware. For the modules implemented by hardware, the above-mentioned various modules can be located in the same processor; or the above-mentioned various modules can also be located in different processors in any combined form.

[0149] The resource allocation system disclosed in this embodiment includes: a first acquisition module 201, configured to acquire a set of rescue points, a set of disaster-affected points, and a set of command centers within a target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers; a second acquisition module 202, configured to acquire the disaster information of all disaster-affected points from the set of disaster-affected points; a determination module 203, configured to determine the disaster weight of each disaster-affected point respectively according to the disaster information of each disaster-affected point; a model generation module 204, configured to generate a resource allocation model for the target disaster area according to the disaster weight of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points, and the initial quantity of rescue supplies at the set of command centers; a result generation module 205, configured to generate a resource allocation result through a bee colony algorithm according to the resource allocation model. When dealing with the problem of resource allocation, the technical solution of this application adopts a bee colony algorithm, and allocates the resources required for railway hazardous chemical transportation by establishing a resource allocation model, achieving the rapid arrival of rescue supplies and the timeliness of rescue time, thereby achieving the purpose of allocating resources at the lowest cost; compared with the traditional genetic algorithm, the technical solution of this application is more suitable for solving the problem of allocating emergency rescue resources, and consumes less, has higher efficiency, and stronger practicability.

[0150] Embodiment III

[0151] This embodiment also provides a storage medium, in which a computer program is stored. When the computer program is executed by a processor, the method steps in Embodiment I can be implemented, and this embodiment will not be repeated here.

[0152] Among them, the storage medium may also separately include a computer program, a data file, a data structure, etc., or include a combination thereof. The storage medium or computer program can be specifically designed and understood by those skilled in the computer software field, or the storage medium may be well-known and available to those skilled in the computer software field. Examples of storage media include: magnetic media, such as hard disks, floppy disks, and magnetic tapes; optical media, such as CD-ROM discs and DVDs; magneto-optical media, such as optical discs; and hardware devices specifically configured to store and execute computer programs, such as read-only memory (ROM), random access memory (RAM), flash memory; or servers, app application marketplaces, etc. Examples of computer programs include machine code (e.g., code generated by a compiler) and files containing high-level code that can be executed by a computer by using an interpreter. The described hardware devices can be configured to act as one or more software modules to perform the operations and methods described above, and vice versa. In addition, the storage medium can be distributed in a networked computer system and can store and execute program code or computer programs in a decentralized manner.

[0153] Embodiment 4

[0154] Figure 3 The following is a connection block diagram of an electronic device provided by an embodiment of this application. As Figure 3 shown, the electronic device 300 may include: a processor 301, a memory 302, a multimedia component 303, an input / output (I / O) interface 304, and a communication component 305.

[0155] Among them, the processor 301 is used to execute all or part of the steps in the resource allocation method in Embodiment 1. The memory 302 is used to store various types of data, which may include, for example, instructions of any application or method in the electronic device, and application-related data.

[0156] The processor 301 may be implemented by an application specific integrated circuit (ASIC), a digital signal processor (DSP), a digital signal processing device (DSPD), a programmable logic device (PLD), a field programmable gate array (FPGA), a controller, a microcontroller, a microprocessor, or other electronic components, and is used to execute the resource allocation method in Embodiment 1 above.

[0157] The memory 302 may be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as a static random access memory (SRAM), an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a programmable read-only memory (PROM), a read-only memory (ROM), a magnetic memory, a flash memory, a magnetic disk, or an optical disk.

[0158] The multimedia component 303 may include a screen and an audio component. The screen may be a touch screen, and the audio component is used for outputting and / or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signals may be further stored in the memory or sent through the communication component. The audio component also includes at least one speaker for outputting audio signals.

[0159] The I / O interface 304 provides an interface between the processor 301 and other interface modules, and the other interface modules may be a keyboard, a mouse, buttons, etc. These buttons may be virtual buttons or physical buttons.

[0160] The communication component 305 is used for wired or wireless communication between the electronic device 300 and other devices. Wired communication includes communication through a network port, a serial port, etc.; wireless communication includes Wi-Fi, Bluetooth, Near Field Communication (NFC), 2G, 3G, 4G, 5G, or a combination of one or more of them. Accordingly, the communication component 305 may include a Wi-Fi module, a Bluetooth module, and an NFC module.

[0161] In summary, a resource allocation method, system, storage medium, and electronic device provided in this application. The method includes: obtaining a set of rescue points, a set of disaster-affected points, and a set of command centers in a target disaster area, and the initial quantity of rescue supplies at the set of rescue points and the set of command centers; obtaining the disaster information of all disaster-affected points from the set of disaster-affected points; respectively determining the disaster weight of each disaster-affected point according to the disaster information of each disaster-affected point; generating a resource allocation model for the target disaster area according to the disaster weight of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points, and the initial quantity of rescue supplies at the set of command centers; generating a resource allocation result through a bee colony algorithm according to the resource allocation model. When dealing with the problem of resource allocation, the technical solution of this application adopts a bee colony algorithm, allocates the resources required for railway hazardous chemical transportation by establishing a resource allocation model, realizes the rapid arrival of rescue supplies and the timeliness of rescue time, and thus achieves the purpose of resource allocation at the lowest cost; compared with the traditional genetic algorithm, it is more suitable for the problem of emergency rescue resource allocation, consumes less, has higher efficiency, and stronger practicability.

[0162] It should also be understood that the methods or systems disclosed in the embodiments provided in this application can also be implemented in other ways. The method or system embodiments described above are merely illustrative. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architectures, functions, and operations of the methods and devices according to multiple embodiments of this application. In this regard, each block in the flowchart or block diagram can represent a module, a computer program segment, or a part of a computer program. A module, a computer program segment, or a part of a computer program contains one or more computer programs for implementing the specified logical functions. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than that marked in the accompanying drawings. In fact, they can be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, as well as the combination of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system for performing the specified functions or actions, or can be implemented by a combination of dedicated hardware and a computer program.

[0163] In this application, the term "comprising", "including", or any other variant thereof is intended to cover non-exclusive inclusion, such that a process, method, article, or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements that are inherent to such process, method, article, or device. Without further limitation, an element defined by the statement "comprising a..." does not exclude the presence of additional identical elements in the process, method, apparatus, or device comprising the element; if there is a description of "first", "second", etc., it is only for descriptive purposes and cannot be construed as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features or implicitly specifying the sequence of the indicated technical features; in the description of this application, unless otherwise stated, the meaning of the terms "multiple", "many" is at least two; if there is a description of a server, it should be noted that the server can be an independent physical server or terminal, or a server cluster composed of multiple physical servers, and can be a cloud server capable of providing basic cloud computing services such as cloud servers, cloud databases, cloud storage, and CDN; if there is a description of a smart terminal or mobile device, it should be noted that the smart terminal or mobile device can be a smart phone, a tablet computer, a smart watch, a smart TV, a smart speaker, a laptop computer, a desktop computer, etc., but is not limited thereto.

[0164] Finally, it should be noted that in the description of this specification, the descriptions with reference to the terms "one embodiment", "some embodiments", "example", "one example" or "some examples", etc. mean that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of this application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

[0165] Although the embodiments of this application have been shown and described above, it can be understood that the above embodiments are all exemplary. The content described is only an implementation manner adopted for the convenience of understanding this application, and is not used to limit this application. Any person skilled in the art within the technical field to which this application pertains can make any modifications and changes in the form of implementation and details without departing from the spirit and scope disclosed by this application. However, the protection scope of this application shall still be subject to the scope defined by the appended claims.

Claims

1. A resource allocation method, characterized in that, The method includes: Obtaining a set of rescue points, a set of disaster-affected points, and a set of command centers within the target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers; Obtaining the disaster information of all disaster-affected points from the set of disaster-affected points; Respectively determining the disaster weight of each disaster-affected point according to the disaster information of each disaster-affected point; wherein, the disaster weight includes: the trapped personnel weight, the hazard level, and the section priority; Generating a resource allocation model for the target disaster area according to the disaster weight of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points, and the initial quantity of rescue supplies at the set of command centers; Generating a resource allocation result through a bee colony algorithm according to the resource allocation model; wherein: Determining the trapped personnel weight according to the number of trapped people at each disaster-affected point in the disaster information through the following formula: Among them, is the number of trapped people at the nth disaster-stricken point, is the number of people rescued by each rescue team, is the weight of people being trapped; Determining the hazard level according to the hazardous chemical leakage situation at each disaster-affected point in the disaster information and the pre-set hazard level rules; The steps for determining the section priority include: According to the number of derailed sections of hazardous chemical vehicles at each disaster-affected point in the disaster information, the proportion of the section importance of each disaster-affected point is determined by the following formula : Among them, is the number of derailed carriages of the hazardous chemical transportation vehicle at the nth disaster-affected point; Determine the proportion of the damage degree of each affected section according to the number of vehicles passing through each affected point per unit time and the damaged mileage of the railway tracks using the following formula : Among them, is the number of vehicles passing through the i-th disaster-stricken point per unit time, is the damaged mileage of the railway track at the i-th disaster-stricken point, is a parameter based on price; Determining the section priority through the following formula according to the section importance and the proportion of the section damage degree: Among them, is the section importance of the i-th disaster-affected point, is the section damage degree of the i-th disaster-affected point, is the balance coefficient between and is the pre-allocation value between each disaster-affected point, n is the number of disaster-affected points, is the section priority.

2. The method according to claim 1, wherein The obtaining of the set of rescue points, the set of disaster-affected points, and the set of command centers within the target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers, includes: Generate a set of rescue points based on the actual location of the rescue center , the command center set and a set of disaster points where disasters may occur ; At the rescue point The number of the th type of rescue emergency supplies stored is , and the number of the th type of rescue emergency supplies stored at the command center is ; Among them, is the number of rescue points, is the number of command centers, is the number of disaster-stricken points, is the number of categories of rescue emergency supplies.

3. The method according to claim 1, wherein The resource allocation model includes: Among them, is the number of rescue points, is the number of command centers, is the time from the rescue point to the disaster area, is the time from the command center to the disaster area, is the quantity of the c-th type of relief supplies dispatched from the rescue point to the disaster area, is the quantity of the c-th type of relief supplies dispatched from the command center to the disaster area, is the allocation quantity of the disaster area I1 according to w ik ; is the allocation quantity of the disaster area I1 according to w is ; is the allocation quantity of the disaster area I1 according to w ijk . It should be noted that there seems to be a small error in the original Chinese text where the semicolons (;) are missing after the explanations related to ik and is . I have added them in the translation for better semantic integrity. If this is not allowed according to the strict rules, please let me know and I will adjust accordingly.

4. A resource allocation system, characterized in that, Including: A first obtaining module, configured to obtain a set of rescue points, a set of disaster-affected points, and a set of command centers within the target disaster area, as well as the initial quantity of rescue supplies at the set of rescue points and the set of command centers; A second obtaining module, configured to obtain the disaster information of all disaster-affected points from the set of disaster-affected points; A determining module, configured to respectively determine the disaster weight of each disaster-affected point according to the disaster information of each disaster-affected point; wherein, the disaster weight includes: the trapped personnel weight, the hazard level, and the section priority; A model generating module, configured to generate a resource allocation model for the target disaster area according to the disaster weight of each disaster-affected point, the set of rescue points, the set of disaster-affected points, the set of command centers, the initial quantity of rescue supplies at the set of rescue points, and the initial quantity of rescue supplies at the set of command centers; A result generating module, configured to generate a resource allocation result through a bee colony algorithm according to the resource allocation model; Wherein: Determining the trapped personnel weight according to the number of trapped people at each disaster-affected point in the disaster information through the following formula: Among them, is the number of trapped people at the nth disaster-stricken point, is the number of people rescued by each rescue team, is the weight of people being trapped; Determining the hazard level according to the hazardous chemical leakage situation at each disaster-affected point in the disaster information and the pre-set hazard level rules; The steps for determining the section priority include: According to the number of derailed hazardous chemical vehicles at each disaster-affected point in the disaster information, determine the proportion of the section importance of each disaster-affected point through the following formula : Among them, is the number of derailed carriages of the vehicle transporting hazardous chemicals at the nth disaster-stricken point; Determine the proportion of the damage degree of each affected section according to the number of vehicles passing through each affected point per unit time and the damaged mileage of the railway tracks by the following formula :[[]]END]] Among them, is the number of vehicles passing through the i-th disaster-stricken point per unit time, is the damaged mileage of the railway track at the i-th disaster-stricken point, is a parameter based on price; Determining the section priority through the following formula according to the section importance and the proportion of the section damage degree: Among them, is the section importance of the i-th disaster-affected point, is the section damage degree of the i-th disaster-affected point, is the balance coefficient between and is the pre-allocation value between each disaster-affected point, n is the number of disaster-affected points, is the section priority.

5. A storage medium, characterized in that, The computer program stored in the storage medium, when executed by one or more processors, executes the resource allocation method according to any one of claims 1 to 3.

6. An electronic device, characterized in that, It includes a memory and a processor. A computer program is stored on the memory, and the memory and the processor are communicatively connected to each other. When the computer program is executed by the processor, the resource allocation method according to any one of claims 1 to 3 is executed.

Images