CN113610493A

CN113610493A - Resource information processing method and device

Info

Publication number: CN113610493A
Application number: CN202110843326.0A
Authority: CN
Inventors: 李宗尚; 肖翔; 何刚
Original assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Current assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Priority date: 2021-07-26
Filing date: 2021-07-26
Publication date: 2021-11-05

Abstract

The invention discloses a resource information processing method and device, and relates to the technical field of computers. One embodiment of the method comprises: acquiring resource information containing a plurality of resource groups and time dimension information containing a plurality of time intervals; distributing a plurality of resource groups for a plurality of time intervals according to the resource information and the time dimension information; determining a block section gradient of at least one block section combination based on the result of the allocation, the resource defining condition included in the resource information and the block section defining condition of the time block section included in the time dimension information, wherein the block section combination indicates two time block sections, and the block section gradient indicates an optimization direction of the resource group allocation; optimizing the result of the allocation based on the optimization direction of the resource group allocation indicated by the interval gradient. The implementation mode effectively improves the resource utilization rate.

Description

Resource information processing method and device

Technical Field

The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for processing resource information.

Background

With the rapid development of service industry and manufacturing industry, enterprise resource information is effectively managed through resource management software or a resource management system, so that enterprise resources can be better managed.

There is a trend to process resource information using heuristic algorithms such as genetic algorithms, ant colony algorithms, particle swarm algorithms, etc. to distribute the resource information in the time dimension. Due to the complexity of resource information processing and the heuristic algorithm, a better solution is generally found within a reasonable time range, a global optimal solution is difficult to find or even cannot be found, resource waste is still caused, and the resource utilization rate is low.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for processing resource information, which can effectively improve resource utilization.

In order to achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a resource information processing method including:

acquiring resource information containing a plurality of resource groups and time dimension information containing a plurality of time intervals;

distributing a plurality of resource groups for a plurality of time intervals according to the resource information and the time dimension information;

determining a block section gradient of at least one block section combination based on the result of allocation, the resource defining condition included in the resource information and the block section defining condition of the time block section included in the time dimension information, wherein the block section combination indicates two time block sections, and the block section gradient indicates an optimization direction of resource group allocation;

optimizing the result of the allocation based on the optimization direction of the resource group allocation indicated by the interval gradient.

Optionally, the result of optimizing allocation includes:

circularly executing the following steps N1 to N5, and stopping the circulation when the resource loss reaches the minimum;

n1: searching the section combination with the maximum gradient decrease of the sections;

n2: exchanging time sections for the resource groups in the section combination with the largest gradient decrease of the sections;

n3: calculating resource loss according to the result after the exchange;

n4: judging whether the resource loss reaches a minimum value, if so, executing a step N5; otherwise, determining the section gradient of at least one section combination in the transposed result, and executing the step N1;

n5: and determining that the corresponding relation between the resource groups indicated by the transposed result and the time intervals is an optimized result.

Optionally, the combination of time segments includes a first time segment in which a resource group has been allocated and a second time segment in which a resource group has not been allocated;

the changing time block section for the resource group in the block section combination with the largest gradient decrease of the block sections comprises: and the resource group allocated to the first time interval is exchanged to the second time interval.

Optionally, the computing resource penalty comprises:

calculating a resource allocation value of each time section according to the time section allocated by each resource group and the time section included by each time section included by the transposed result;

calculating the time period loss of each time period according to the predetermined requirement fluctuation range corresponding to each time period, the actual requirement value corresponding to each time period and the resource allocation value of each time period;

accumulating each of the time segment losses, wherein the accumulated result is the resource loss.

Optionally, determining a block gradient of at least one block combination comprises:

constructing a resource fluctuation graph based on the time periods included in each time interval, the predetermined requirement fluctuation range corresponding to each time period and the resource groups allocated to each time interval;

searching a third time interval section in which the provided resource exceeds the upper limit of the requirement fluctuation range corresponding to the time interval in which the provided resource is located and a fourth time interval section which is lower than the lower limit of the requirement fluctuation range corresponding to the time interval in which the provided resource is located from the resource fluctuation map;

calculating a block gradient between the third time block and the fourth time block.

Optionally, for the case that the number of the third time interval is plural,

the calculating a block section gradient between the third time block section and the fourth time block section comprises:

selecting a target third time zone segment from the plurality of third time zone segments that contains the largest number of time zones that exceed the upper limit of the demand fluctuation range;

calculating a block gradient between the target third time block and the fourth time block.

Optionally, for the case that the number of the fourth time interval section is multiple,

selecting a target fourth time zone section containing the largest time zone below the lower limit of the demand fluctuation range from the fourth time zone sections;

calculating a block gradient between the third time block and the target fourth time block.

Optionally, the resource information processing method may further include:

determining a first number of time periods included in the third time interval that exceed an upper limit of the demand fluctuation range and a second number of time periods included in the fourth time interval that are below the upper limit of the demand fluctuation range;

determining the reduction amount of the first number and the reduction amount of the second number aiming at the condition that the resource group allocated by the third time interval is exchanged to the fourth time interval;

performing a step of calculating a block section gradient between the third time block section and the fourth time block section based on the decreased amount of the first number and the decreased amount of the second number.

Optionally, the resource information processing method may further include:

constructing a resource allocation table;

and loading the allocation result and the transposed result obtained by each circulation to the resource allocation table.

Optionally, the calculating the time period loss for each of the time periods comprises:

is performed for each of said time periods and,

judging whether the resource allocation value of the time period is in the corresponding demand fluctuation range of the time period or not,

if so, determining that the time period loss corresponding to the time period is 0;

otherwise, calculating the time period loss of the time period by using the preset actual required value corresponding to the time period and the resource allocation value of the time period.

In a second aspect, an embodiment of the present invention provides a resource information processing apparatus, including: an acquisition unit, a resource allocation unit, and a resource optimization unit, wherein,

the acquisition unit is used for acquiring resource information containing a plurality of resource groups and time dimension information containing a plurality of time intervals;

the resource allocation unit is used for allocating a plurality of resource groups for a plurality of time intervals according to the resource information and the time dimension information;

the resource optimization unit is used for determining a section gradient of at least one section combination based on the result of allocation, the resource limiting condition included by the resource information and the section limiting condition of the time section included by the time dimension information, wherein the section combination indicates two time sections, and the section gradient indicates the optimization direction of resource group allocation; optimizing the result of the allocation based on the optimization direction of the resource group allocation indicated by the interval gradient.

One embodiment of the above invention has the following advantages or benefits: allocating a plurality of resource groups to a plurality of time intervals according to the resource groups included in the acquired resource information, the resource limitation conditions of the resource groups, the time intervals included in the time interval information and the time interval limitation conditions of each time interval; and based on the result of allocation, the resource limit condition included by the resource information and the interval limit condition included by the time interval information, determining the interval gradient of at least one interval combination, through which the optimization direction of resource group allocation can be indicated, i.e. subsequently, the resource information can be optimized based on the interval gradient, reducing the intervention of manual resource allocation, and simultaneously, integrating the interval gradient, the resource limit condition and the interval limit condition between the time intervals, the factors of resource allocation and the adjustment direction of resource optimization can be considered more comprehensively.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

fig. 1 is a schematic diagram of a main flow of a resource information processing method according to an embodiment of the present invention;

FIG. 2 is a schematic illustration of the relationship between time periods, time intervals, and a duty cycle according to one embodiment of the present invention;

FIG. 3 is a schematic illustration of the relationship between time periods, time intervals and a duty cycle according to another embodiment of the present invention;

FIG. 4 is a schematic illustration of the main flow of optimizing the results of an allocation according to an embodiment of the invention;

FIG. 5 is a schematic diagram of a main flow of computing resource loss according to an embodiment of the invention;

FIG. 6 is a schematic diagram of a main process flow for calculating a segment loss for each time segment according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of a main process flow for determining a block section gradient between at least two time block sections, according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of a resource fluctuation graph according to one embodiment of the present invention;

FIG. 9 is a schematic diagram of a resource fluctuation graph according to another embodiment of the present invention;

fig. 10 is a schematic diagram of main units of a resource information processing apparatus according to an embodiment of the present invention;

FIG. 11 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 12 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 is a resource information processing method according to an embodiment of the present invention, and as shown in fig. 1, the resource information processing method may include the following steps:

step S101: acquiring resource information containing a plurality of resource groups and time dimension information containing a plurality of time intervals;

the resource group information may be used for the purpose that the enterprise provides services for users in order to perform normal production or normal operation, or the like, and the resources of the enterprise are as follows: such as human resources, device resources, etc., and the resource information included in each grouped group is resource group information. For example, for a marine enterprise, each resource group information may include the number of ships to which the resource group is assigned, ship numbers, crew information, ship replenishment information, etc.; for example, for the manual customer service, each resource group information may include information such as the number of workers answering calls allocated to the resource group, the number of the workers, and the work area; for another example, for entity production, each resource group information may include worker information, production equipment required by a worker, and the like; for example, for hospital emergency treatment, each resource group information may include doctors, nurses, medical devices, etc. of each department to which the resource group is assigned.

In a working cycle, a plurality of working time periods are divided, each working time period is a time interval, wherein a minimum working unit or a minimum working unit corresponding to the working cycle or the working time period is a time interval. I.e. one duty cycle or duty cycle (or time interval) comprises a plurality of time intervals. The time period may be 1 hour, 2 hours, 1 day, 2 days, a week, a month, etc. It should be noted that the working cycle or working period may start at any time point, for example, 31 days is taken as a working cycle or working period, and the working cycle or working period may start at any day; for another example, if a 24-hour work cycle or work period is used, the work cycle or work period may be started from 0 am, 9 am, or 5 pm. The relationship between the time period, the time interval and one working cycle is shown in fig. 2 and 3. As shown in fig. 2, one duty cycle includes 12 time segments, and the time segment corresponding to the time segment a1 is 1-5; the time period corresponding to the time interval B1 is 5-9; the time period corresponding to the time interval C1 is 9-12; the time period corresponding to the time interval D1 is 3-9; the time period corresponding to the time interval E1 is 10-12 and 1-3; it should be noted that 1 to 3 of the time periods corresponding to the time interval E1 may be the time periods in the next time period corresponding to the time period of 10 to 12. As shown in FIG. 3, a time cycle includes 30 time segments, wherein the time segment A2 corresponds to 1-7 time segments; the time interval B2 corresponds to a time interval of 8-16; the time interval C2 corresponds to 17-24 time intervals; the time interval D2 corresponds to 23-30 time intervals; the time interval E2 corresponds to a time interval of 22-29; the time interval F2 corresponds to a time interval of 16-22; the time interval G2 corresponds to a time interval of 5-12.

It should be noted that the number of resource groups acquired in this step generally does not exceed the number of time segments, and in an embodiment, the number of resource groups is smaller than the number of time segments, that is, there are multiple time segments that are not allocated to resource groups as candidates, so that the time segments and the resource group configuration are more reasonable, and the resource group efficiency is effectively improved.

Step S102: distributing a plurality of resource groups for a plurality of time intervals according to the resource information and the time dimension information;

the resource limitation condition may be: a resource group can handle business capacity (e.g., for hospital emergency, the capacity of the resource group to handle business can be the number of patients that the resource group can accommodate, the types of diseases that can be handled, etc.), or for a marine enterprise, the capacity of the resource group to handle business can be the amount of goods that the resource group can transport, the airlines that can sail, the distance that can sail, etc.), or for a field of man-made customer service, the capacity of the resource group to handle business can be the types of services/complaints that can be handled, the number of complaints that can be handled, etc.), operating time limit (e.g., for a marine enterprise, the time period that a ship can travel within the resource group or the time period that the ship can travel out can be limited, etc.), equipment operating limit (e.g., equipment maintenance time, etc.).

The time interval limiting condition may be a requirement of the time interval on resource configuration (for example, for the field of human customer service, the time interval limiting condition is to be met by a group member with resources not less than a preset threshold).

It should be noted that the resource limitation condition and the block section limitation condition may be configured according to actual requirements.

In addition, in this step, one specific implementation manner of allocating the time interval for the plurality of resource groups may include: a time interval is randomly allocated to each resource group, a plurality of resource groups can be allocated to the same time interval, meanwhile, one time interval can also be allocated to a plurality of time intervals, but all resource groups need to be allocated to the time interval, and some time intervals can be unallocated. In a preferred embodiment, another specific implementation manner of allocating time interval segments for multiple resource groups may include: the allocated time interval includes a time interval capable of filling up one work cycle, and in addition, the resource group allocation time interval is required to simultaneously satisfy the resource limitation condition of the resource group and the time interval limitation condition. For example, for the multiple time segments shown in FIG. 3, if there are only four resource groups, then in this other particular implementation, A2, B2, C2, and D2 may be assigned to the four resource groups.

Step S103: determining a block section gradient of at least one block section combination based on the result of the allocation, the resource defining condition included in the resource information and the time block section defining condition included in the time block section information, wherein the block section combination indicates two time block sections, and the block section gradient indicates an optimization direction of the resource group allocation;

the optimization direction refers to the direction of allocating more optimal resources or the direction of allocating worse resources after the time interval is exchanged for the resource group, generally speaking, the gradient of the interval is greater than 0, and the optimization direction of the resource allocation points to the direction of allocating more optimal resources; the interval gradient is less than 0 and the optimal direction of resource allocation points to the worse allocation direction.

It should be noted that, a block section combination includes two time block sections, and therefore, a block section gradient refers to, for two time block sections included in one block section combination, swapping resource groups allocated to the two time block sections (it is worth mentioning that the resource groups allocated to the two time block sections may be at least one resource group allocated to one time block section and no resource group allocated to the other time block section; or resource groups allocated to both time block sections), and in the time period covered by the two time block sections, compared to the time period before swapping, the time period capable of satisfying the service requirement after swapping is incremented (the incremented number is a value greater than 0, which indicates that the swapping is optimized in a more optimal direction) or decremented number (the decremented number is a value less than 0, which indicates that the swapping is optimized in a worse direction), it will be appreciated that swapping may be rejected when the segment gradient is optimized in the worse direction. In addition, the interval gradient can also be: after the resource group of the two time sections is exchanged, in the time section covered by the two time sections, the sum of the number of time periods exceeding the traffic demand and the number of time periods below the traffic demand, which is reduced compared to before the exchange (it is worth mentioning that the number of time periods exceeding the traffic demand is negative if the time period exceeding the traffic demand increases after the exchange, and correspondingly the number of time periods below the traffic demand is negative if the time period below the traffic demand increases after the exchange, for example, the number of time periods exceeding the traffic demand before the exchange is 3, and the number of time periods exceeding the traffic demand after the exchange is 4, the number of time periods exceeding the traffic demand is-1), thus, if the block section gradient is a value greater than 0, it indicates that the swap is optimized to a more optimal direction; if the segment gradient is a value less than 0, it indicates that the swap is optimized to the worse direction. It will be appreciated that swapping may be rejected when the segment gradient is optimized in the worse direction.

Step S104: optimizing the result of the allocation based on the optimization direction of the resource group allocation indicated by the interval gradient.

In the embodiment shown in fig. 1, a plurality of resource groups are allocated to a plurality of time slots according to the resource group included in the acquired resource information and the resource limitation condition of the resource group, and the time slot included in the time slot information and the time slot limitation condition of each time slot; and based on the result of allocation, the resource limit condition included by the resource information and the interval limit condition included by the time interval information, determining the interval gradient of at least one interval combination, through which the optimization direction of resource group allocation can be indicated, i.e. subsequently, the resource information can be optimized based on the interval gradient, reducing the intervention of manual resource allocation, and simultaneously, integrating the interval gradient, the resource limit condition and the interval limit condition between the time intervals, the factors of resource allocation and the adjustment direction of resource optimization can be considered more comprehensively.

In an embodiment of the present invention, as shown in fig. 4, a specific implementation manner of the result of optimizing allocation in step S104 may include the following steps:

circularly executing the following steps S401 to S405, and stopping circulation when the resource loss reaches the minimum;

step S401: searching the section combination with the maximum gradient decrease of the sections;

through the step, the resource limiting condition and the time interval limiting condition are comprehensively considered in the interval combination process of searching the maximum gradient decrease of the interval, so that the subsequent exchange process is more reasonable.

It should be noted that the maximum gradient decrease of the block refers to that after the resource groups corresponding to two time blocks (one of the time blocks may not be allocated with a resource group) are exchanged, the block gradient reaches the maximum value. Therefore, the section gradient descending means that the section gradient is larger than 0, and the section gradient ascending means that the section gradient is smaller than 0.

In a preferred embodiment, the block section combination comprises: a first time period of resource groups has been allocated and a second time period of resource groups has not been allocated.

Step S402: exchanging time sections for the resource groups in the section combination with the largest gradient decrease of the sections;

in this step, the combining for the block section includes: and in the case that the first time interval of the resource group is already allocated and the second time interval of the resource group is not allocated, the resource group allocated to the first time interval is exchanged for the second time interval. For example, for each time segment shown in fig. 3, the segments found in step S401 are combined into C2 and F2, where C2 has allocated resource group RG1, and F2 has not allocated resource group, this step may be to change RG1 from time segment C2 to time segment F2.

Step S403: calculating resource loss according to the result after the exchange;

the resource loss may indicate a degree of rational utilization of the resource, i.e., the higher the degree of rational utilization of the resource is, the smaller the resource loss is, and the further explanation is that the switching is performed in a more optimal direction. Through the computing resource loss, the resource allocation or exchange condition can be better grasped from the whole situation, so that the rationality of the resource allocation or exchange is further ensured, and the resource utilization rate is effectively improved.

Step S404: judging whether the resource loss reaches the minimum value, if so, executing the step S405; otherwise, go to step S406;

the step of determining may be to compare the resource loss of the current cycle with the resource loss of the previous cycle, and if the resource loss of the current cycle is less than the resource loss of the previous cycle, it indicates that the resource loss of the previous cycle may not reach the minimum value, and if the resource loss of the current cycle is greater than the resource loss of the previous cycle, it indicates that the resource loss of the previous cycle reaches the minimum value. For another example, if the resource loss obtained by the current loop is 0, the resource loss of the current loop can be directly determined to be the minimum value.

Step S405: determining that the corresponding relation between the resource groups indicated by the exchanged result and the time intervals is the optimized result, and ending the current process;

it is worth noting that the post-swap result is a post-swap result that matches the minimum resource loss. For example, if it is determined in step S404 that the resource loss of the current cycle is greater than the resource loss of the previous cycle, the resource loss of the previous cycle reaches the minimum value, and the result after swapping is the result after swapping obtained in the previous cycle. For another example, in step S404, it is determined that the resource loss of the current loop is 0, that is, the resource loss reaches the minimum value, and the result after swapping is the result after swapping obtained by the current loop.

Step S406: the block section gradient of at least one block section combination in the exchanged result is determined, and step S401 is performed.

By optimizing the resource allocation in the manner of calculating the resource loss, the allocation condition of each resource can be considered more comprehensively, so that the resource allocation can be optimized in limited times of exchange. Compared with the existing method for distributing resources in a model mode, the method and the device for distributing the resources in the distributed mode can effectively reduce consumption of computing resources.

In an embodiment of the present invention, as shown in fig. 5, a specific implementation manner of the step S403 may include the following steps:

step S501: calculating a resource allocation value of each time section according to the time section allocated by each resource group and the time section included by each time section included by the transposed result;

this step can obtain the resource allocation value for each time segment by the following calculation formula (1).

β_i＝γ₁×A_i+γ₂×B_i+…+γ_m×M_i(1)

Wherein, beta_iA resource allocation value characterizing an ith time period; gamma ray₁，γ₂，...，γ_mRepresenting the resource quantity corresponding to each resource group from 1 st to m; a. the_i，B_i，...，M_iCharacterizing whether time interval A, B, the. A is a_i，B_i，...，M_iIs 1 or 0, i.e. time interval A_iIncluding the ith time period, then A_i1 is ═ 1; time intervalA_iIf the ith time slot is not included, the A_i＝0。

For example, for each time interval shown in fig. 2, the final optimized result is: resource group RG1 is allocated to time segment a1, resource group RG2 is allocated to time segment E1, resource group RG3 is allocated to time segment B1, resource group RG4 is allocated to time segment D1, and time segment C1 is not allocated any resource group. Determining the sequence of the time interval to be the 1 st time interval A1, and the corresponding time interval is 1-5; the time interval B1 is the 2 nd time interval, and the corresponding time interval is 5-9; the time interval C1 is the 3 rd time interval, and the corresponding time interval is 9-12; the time interval D1 is the 4 th time interval, and the corresponding time interval is 3-9; the time interval E1 is the 5 th time interval, and the corresponding time intervals are 1-3 and 10-12. The resource amount of the resource group RG1 is 3, the resource amount of the resource group RG2 is 5, the resource amount of the resource group RG3 is 6, and the resource amount of the resource group RG4 is 7.

Resource allocation value of the 3 rd time interval:

β₃＝γ₁×A1₃+0×B1₃+γ₂×C1₃+γ₄×D1₃+γ₂×E1₃

＝3×1+0+5×0+6×1+7×1＝16

since the resource group is not allocated to B1, the amount of the resource group corresponding to B1 is 0; and time segment C1 does not include time segment 3, then C1₃0; time periods A1, D1, and E1 all include period 3, then A1₃＝1；D1₃＝1；E1₃＝1。

Step S502: calculating the time period loss of each time period according to the predetermined requirement fluctuation range corresponding to each time period, the actual requirement value corresponding to each time period and the resource allocation value of each time period;

in this step, the fluctuation range of the demand for each time period may be obtained by multiplying the average demand for the time period by a value greater than 1 as the demandThe upper limit of the fluctuation range is determined, and the average demand of the period is multiplied by a value smaller than 1 and larger than 0 as the lower limit of the fluctuation range of the demand, as shown by α, μ α, and,

And alpha ', mu alpha ' and alpha ' shown in FIG. 9,

Wherein α and α' are the average demand for the time period; μ α and μ α' are the upper limits of the demand fluctuation range of the time period, μ > 1;

and

is the lower limit of the range of fluctuation of demand for the time period, the

It is worth to be noted that the demand fluctuation range may be set correspondingly according to actual situations, and the average demands of each time period may be the same or different; μ and of each time segment

Or may be the same or different and are not limited herein. In addition, the requirement of each time period can be a service requirement or a resource requirement, and when the requirement is the service requirement, the resource requirement can be obtained by setting a conversion coefficient between the service requirement and the resource requirement. In order to simply and clearly explain the subsequent steps, the resource requirements are adopted as the requirements of each time period in the subsequent steps.

Step S503: and accumulating the loss of each time segment, wherein the accumulated result is the resource loss.

This step S503 can be calculated by the following calculation formula (2).

Wherein ω represents a resource loss; omega_jCharacterizing a time period loss for a jth time period; n characterizes the total number of time segments comprised by one duty cycle.

In the step S502, as shown in fig. 6, a specific embodiment of calculating the time period loss of each time period may include the following steps:

is performed for each of the time periods,

step S5021: judging whether the resource allocation value of the time period is in the demand fluctuation range corresponding to the time period, if so, executing the step S5022; otherwise, executing step S5023;

step S5022: determining the time period loss corresponding to the time period to be 0;

step S5023: and calculating the time period loss of the time period by using the actual demand value corresponding to the preset time period and the resource allocation value of the time period.

The above steps S5021 to S5023 can be realized by the following calculation formula group (1).

Calculating formula set (1):

wherein, ω is_jCharacterizing a time period loss for a jth time period; beta is a_jA resource allocation value characterizing a jth time period; alpha is alpha_jCharacterizing the actual demand value of the jth time period;

representing the lower limit of a demand fluctuation range corresponding to the jth time period; mu alpha_jAnd characterizing the upper limit of the corresponding demand fluctuation range of the jth time period.

Generally speaking, the resource allocation value of the time period is in the corresponding demand fluctuation range, which indicates that the resource allocation of the time period is reasonable, and for the resource allocation value of the time period exceeding the upper limit of the demand fluctuation range or being lower than the lower limit of the demand fluctuation range, the time period loss of the time period can be embodied more accurately by introducing the actual demand value of the time period, so that the accuracy of resource loss calculation is ensured, and the optimization direction of the resource allocation is guided better.

In an embodiment of the present invention, as shown in fig. 7, the above specific implementation of determining the block section gradient of at least one block section combination may include the following steps:

step S701: constructing a resource fluctuation graph based on the time periods included in each time interval, the predetermined requirement fluctuation range corresponding to each time period and the resource groups allocated to each time interval;

the resource fluctuation graphs constructed by this step can be shown in fig. 8 and 9, in which fig. 8 is the actual demand value α of each time interval and the lower limit of the demand fluctuation range

And the upper limit μ α of the demand fluctuation range is the same value, and FIG. 9 shows the actual demand value α of each time slot, the lower limit of the demand fluctuation range

And the upper limit μ α of the demand fluctuation range are fluctuation values. It is to be noted that the circular shape of the fluctuation shown in fig. 8 and 9 is the resource allocation value calculated for each time slot in the above embodiment. In the resource fluctuation map, the time slots above the fluctuation range are time slots allocated with resource groups, the time slots below the fluctuation range are time slots not allocated with resource groups, as shown in fig. 8 and 9, the time slots a2, B2, C2 and D2 are all allocated with resource groups; while G2, E2, and F2 are not allocated resource groups.

Step S702: searching a third time interval in which the provided resource exceeds the upper limit of the requirement fluctuation range corresponding to the time period in which the provided resource is located and a fourth time interval corresponding to a lower limit interval in which the provided resource is lower than the requirement fluctuation range corresponding to the time period in which the provided resource is located from the resource fluctuation map;

as shown in fig. 8, the period in which the provided resource exceeds the upper limit of the demand fluctuation range corresponding to the period in which the resource is located: a2 nd time period, a3 rd time period, a 13 th time period, a 14 th time period, a 15 th time period, a 16 th time period, a 17 th time period, and a 30 th time period; wherein, the time intervals of the 2 nd time interval and the 3 rd time interval are A2, the 13 th time interval, the 14 th time interval, the 15 th time interval, the 16 th time interval and the 17 th time interval are B2, and the time interval of the 30 th time interval is D2. In addition, the time period shown in fig. 8 in which the provided resource is lower than the lower limit of the demand fluctuation range corresponding to the time period in which the resource is located: the method comprises the following steps of 7 th time segment, 8 th time segment, 20 th time segment, 21 st time segment and 22 nd time segment, wherein the 7 th time segment and the 8 th time segment are located in a time block A2 and a time block G2 in which resource groups are not allocated, the 20 th time segment, the 21 st time segment and the 22 nd time segment are located in a time block C2 and a time block F2 in which the resource groups are not allocated, and the 22 nd time segment is located in a time block E2 in which the resource groups are not allocated. As can be seen from the above, the third time interval in fig. 8 found in step S701 is: a2, B2, and D2, fourth time interval segment in fig. 8 found: a2, G2, C2, F2, and E2.

In addition, as shown in fig. 9, the resource is provided for a period exceeding the upper limit of the demand fluctuation range corresponding to the period in which the resource is present: a2 nd time period, a3 rd time period, a 4 th time period, a 13 th time period, a 14 th time period, a 15 th time period, a 16 th time period, a 17 th time period, a 25 th time period, a 26 th time period, a 29 th time period, and a 30 th time period; the time blocks of the 2 nd, 3 rd and 4 th time periods are all A2, the 13 th, 14 th, 15 th, 16 th and 17 th time periods are all B2, the 17 th time period is also located in the time period C2, and the time blocks of the 25 th, 26 th and 30 th time periods are D2. In addition, the provided resource shown in fig. 9 is lower than the lower limit time period of the demand fluctuation range corresponding to the time period in which the resource is located: the method comprises the following steps of 8 th time period, 9 th time period, 19 th time period, 20 th time period, 21 st time period, 22 nd time period and 23 rd time period, wherein the 8 th time period is located in a time block A2 and a time block G2 to which no resource group is allocated, the 9 th time period is located in a time block B2 and a time block G2 to which no resource group is allocated, the 19 th time period, the 20 th time period, the 21 st time period, the 22 nd time period and the 23 rd time period are all located in a time block C2, the 19 th time period, the 20 th time period and the 21 st time period are also located in a time block F2 to which no resource group is allocated, and the time blocks in which the 21 st time period and the 22 nd time period are also include a time block E2 to which no resource group is allocated. As can be seen from the above, the third time interval in fig. 9 found in step S701 is: a2, B2, C2, and D2, fourth time interval segment in fig. 9 found: a2, G2, C2, F2, and E2.

Step S703: a segment gradient between the third time segment and the fourth time segment is calculated.

In this step, for the case that the number of the third time interval is multiple, the specific implementation manner of step S703 may include: selecting a target third time interval containing the largest time interval exceeding the upper limit of the demand fluctuation range from the third time interval; a block gradient between the target third time block and the fourth time block is calculated. For example, for the example shown in fig. 8, the third time interval: a2, B2 and D2, where the number of time segments exceeding the upper limit of the demand fluctuation range corresponding to a2 is 2, the number of time segments exceeding the upper limit of the demand fluctuation range corresponding to B2 is 5, and the number of time segments exceeding the upper limit of the demand fluctuation range corresponding to D2 is 1, then the target third time interval is B2 in the example shown in fig. 8, and then the B2 and the fourth time intervals in fig. 8 to be searched can be calculated: segment gradients were calculated for a2, G2, C2, F2, and E2, respectively. It is to be understood that, when the fourth time period includes a time period corresponding to the target third time period, the fourth time period may be directly omitted or skipped.

In addition, for the case that the number of the fourth time interval sections is multiple, the specific implementation of step S703 may include: selecting a target fourth time zone section containing the largest time zone below the lower limit of the demand fluctuation range from the fourth time zone sections; a segment gradient is calculated between the third time segment and the target fourth time segment. For example, the fourth time interval in fig. 8 found: a2, G2, C2, F2, and E2. Wherein, the time periods lower than the lower limit of the demand fluctuation range in a2 are 2, the time periods lower than the lower limit of the demand fluctuation range in G2 are 2, the time periods lower than the lower limit of the demand fluctuation range in C2 are 3, the time periods lower than the lower limit of the demand fluctuation range in F2 are 3, and the time periods lower than the lower limit of the demand fluctuation range in E2 are 1, then the target fourth time zone time segments are F2 and C2. For each of the third time interval segments in FIG. 8 that may be searched for by F2 and C2: a2, B2, and D2 calculate the interval gradient, respectively. It is understood that when the third time period includes a time period identical to the target fourth time period, the third time period may be directly omitted or skipped.

The process of searching the third time interval and the fourth time interval can be effectively simplified and improved through the resource fluctuation graph, so that the calculation resource expense is effectively saved.

In a preferred embodiment of the present invention, the third time period is a time period in which a resource group is already allocated, and the fourth time period is a time period in which a resource group is not allocated.

In an embodiment of the present invention, the resource information processing method may further include: determining a first number of time periods included in a third time interval that exceeds the upper limit of the demand fluctuation range and a second number of time periods included in a fourth time interval that is below the upper limit of the demand fluctuation range, wherein the third time interval has allocated resource groups and the fourth time interval has no allocated resource groups; determining the reduction amount of the first number and the reduction amount of the second number aiming at the condition that the resource group allocated in the third time interval is exchanged to the fourth time interval; the step of calculating a block gradient between the third time block and the fourth time block is performed based on the decrement of the first number and the decrement of the second number.

As shown in fig. 8, the third time slot is time slot B2, and the fourth time slot is time slot F2. The time zone segment B2 includes 5 time segments exceeding the upper limit of the demand fluctuation range, that is, the first number is 5; the number of time periods that are included in the time period F2 and are lower than the lower limit of the demand fluctuation range is 3, that is, the second number is 3; after the resource group RG9 allocated to the time slot B2 is exchanged to the time slot F2, the time slot B2 becomes a time slot to which no resource group is allocated, and the time slot F2 is allocated to the resource group RG9, at this time, in the resource fluctuation map, the resource allocation values of the time slots related to the time slot B2 and the time slot F2 are changed, if the changed result: if the first number of reductions is 5, and the second number of reductions is 3, then the interval gradient between the third time interval and the fourth time interval is 5+ 3-8, i.e. the interval gradient between the third time interval and the fourth time interval is calculated to be substantially the sum of the first number of reductions for intervals exceeding the upper limit of the demand fluctuation range and the second number of reductions for intervals below the upper limit of the demand fluctuation range after the two time intervals are exchanged. It should be noted that if the first number is not decreased but increased, the decreased amount of the first number is a negative value, and correspondingly, if the second number is not decreased but increased, the decreased amount of the second number is a negative value. Therefore, if the interval gradient is positive, it indicates that the resource allocation is better by switching between the third time interval and the fourth time interval, and the switching can be performed. If the interval gradient is negative, it indicates that the swapping between the third time interval and the fourth time interval causes the resource allocation to develop in a worse direction, and the swapping may be prohibited.

In a preferred embodiment, the third time period is a time period in which a resource group is allocated, and the fourth time period is a time period in which a resource group is not allocated.

In an embodiment of the present invention, the resource information processing method may further include: constructing a resource allocation table; and loading the distribution result and the exchanged result obtained by each circulation to a resource distribution table.

The constructed resource allocation table may be as shown in table 1 below. As can be seen from table 1, the resource groups are: RG1, RG2, RG3, RG4, RG5, RG6, RG7, … …; in round 1, time slots are allocated to each resource group through the step S102, that is, the time slot a3 is allocated to the resource group RG1, E3 is allocated to RG2, F3 is allocated to RG3, RE is allocated to RG4, B3 is allocated to RG5, C3 is allocated to RG6, and H3 is allocated to RG7 and … …; exchanging the D3 time segment allocated to the RG1 for time segment D3 at round 2; after the n-1 th round, time section H3 is allocated to resource group RG1, G3 is allocated to RG2, F3 is allocated to RG3, O3 is allocated to RG4, RE is allocated to RG5, C3 is allocated to RG6, H3 is allocated to RG7, … …; the time period C3 to which RG6 was exchanged to K3 and the like in the n-1 th round through the n-th round. Each iteration is managed through the resource allocation table, and rollback of the resource group allocation time interval is facilitated, such as rollback from the result of the nth round to the n-4 th round and the like. Therefore, the management of the resource allocation process is realized, and the resource allocation efficiency is effectively improved.

TABLE 1

Round/resource group

RG1

RG2

RG3

RG4

RG5

RG6

RG7

……

1 st wheel

A3

E3

F3

RE

B3

C3

H3

……

Wheel 2

D3

E3

F3

RE

B3

C3

H3

……

H3

……

The n-1 th wheel

H3

G3

F3

O3

RE

C3

H3

……

The nth wheel

H3

G3

F3

O3

RE

K3

H3

……

As shown in fig. 10, an embodiment of the present invention provides a resource information processing apparatus 1000, where the resource information processing apparatus 1000 may include: an acquisition unit 1001, a resource allocation unit 1002, and a resource optimization unit 1003, wherein,

an obtaining unit 1001 configured to obtain resource information including a plurality of resource groups and time dimension information including a plurality of time segments;

a resource allocation unit 1002, configured to allocate a plurality of resource groups for a plurality of time segments according to the resource information and the time dimension information;

a resource optimization unit 1003, configured to determine a block gradient of at least one block combination based on the result of allocation, the resource defining condition included in the resource information, and the block defining condition of the time block included in the time dimension information, where the block combination indicates two time blocks, and the block gradient indicates an optimization direction of the resource group allocation; optimizing the result of the allocation based on the optimization direction of the resource group allocation indicated by the interval gradient.

In this embodiment of the present invention, the resource optimizing unit 1003 is further configured to perform the following steps N1 to N5 in a loop, and stop the loop when the resource loss reaches the minimum;

n3: calculating resource loss according to the result after the exchange;

n4: judging whether the resource loss reaches the minimum value, if so, executing the step N5; otherwise, determining the section gradient of at least one section combination in the exchanged result, and executing the step N1;

n5: and determining that the corresponding relation between the plurality of resource groups indicated by the exchanged result and the plurality of time intervals is the optimized result.

In the embodiment of the invention, the section combination comprises a first time section which is allocated with resource groups and a second time section which is not allocated with resource groups; accordingly, the resource optimization unit 1003 is further configured to swap the resource group allocated to the first time period to the second time period.

In this embodiment of the present invention, the resource optimizing unit 1003 is further configured to calculate a resource allocation value of each time segment according to the time segment allocated to each resource group and the time segment included in each time segment, which are included in the result after the swapping; calculating the interval loss of each time period according to the predetermined requirement fluctuation range corresponding to each time period, the actual requirement value corresponding to each time period and the resource allocation value of each time period; and accumulating the loss of each section, wherein the accumulated result is the resource loss.

In this embodiment of the present invention, the resource optimization unit 1003 is further configured to construct a resource fluctuation graph based on a time period included in each time interval, a predetermined requirement fluctuation range corresponding to each time period, and a resource group allocated to each time interval; searching a third time interval in which the provided resource exceeds the upper limit of the requirement fluctuation range corresponding to the time interval in which the provided resource is located and a fourth time interval which is lower than the lower limit of the requirement fluctuation range corresponding to the time interval in which the provided resource is located from the resource fluctuation map; a segment gradient between the third time segment and the fourth time segment is calculated.

In this embodiment of the present invention, the resource optimization unit 1003 is further configured to, for a case that the number of the third time segments is multiple, select a target third time segment from the multiple third time segments, where the target third time segment includes the largest time segment exceeding the upper limit of the demand fluctuation range; a block gradient between the target third time block and the fourth time block is calculated.

In this embodiment of the present invention, the resource optimization unit 1003 is further configured to, for a case where the number of the fourth time segments is multiple, select a target fourth time segment from the fourth time segments, where the target fourth time segment includes the largest time segment that is lower than the lower limit of the demand fluctuation range; a segment gradient is calculated between the third time segment and the target fourth time segment.

In this embodiment of the present invention, the resource optimization unit 1003 is further configured to obtain a first number of time periods included in the third time period, which exceed the upper limit of the demand fluctuation range, and a second number of time periods included in the fourth time period, which are lower than the upper limit of the demand fluctuation range; determining the reduction amount of the first number and the reduction amount of the second number aiming at the condition that the resource group allocated in the third time interval is exchanged to the fourth time interval; the step of calculating a block gradient between the third time block and the fourth time block is performed based on the decrement of the first number and the decrement of the second number.

In this embodiment of the present invention, the resource optimizing unit 1003 is further configured to construct a resource allocation table; and loading the allocation result and the transposed result obtained by each circulation to a resource allocation table.

In this embodiment of the present invention, the resource optimizing unit 1003 is further configured to execute for each time segment, determine whether the resource allocation value of the time segment is in the demand fluctuation range corresponding to the time segment, and if yes, determine that the loss of the time segment corresponding to the time segment is 0; otherwise, calculating the time period loss of the time period by using the actual required value corresponding to the preset time period and the resource allocation value of the time period.

Fig. 11 shows an exemplary system architecture 1100 to which the resource information processing method or the resource information processing apparatus of the embodiment of the present invention can be applied.

As shown in fig. 11, the system architecture 1100 may include

terminal devices

1101, 1102, 1103, a network 1104, a server 1105, and a database 1106. The network 1104 is a medium to provide communication links between the

terminal devices

1101, 1102, 1103 and the server 1105. Network 1104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

A user may use

terminal devices

1101, 1102, 1103 to interact with a server 1105 over a network 1104 to receive or send messages or the like. Various messaging client applications, such as a web browser application, a search class application, an instant messaging tool, a mailbox client, social platform software, etc. (by way of example only) may be installed on the

terminal devices

1101, 1102, 1103.

The

terminal devices

1101, 1102 and 1103 can receive resource information of a resource group and time dimension information of a time interval section input by a user, and send the resource information of the resource group and the time dimension information of the time interval section to the server 1105 and the database 1106, the server 1105 allocates the time interval section for the resource group and optimizes the allocated result, and the server 1105 can respectively send the optimized result to the

terminal devices

1101, 1102 and 1103 and the database 1106; the database 1106 may store resource information for the resource group, time dimension information for the time interval, and optimized results.

The

terminal devices

1101, 1102, 1103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 1105 may be a server that provides various services, such as a background management server (for example only) that provides support for users to utilize resource information and time zone section information provided by the

terminal devices

1101, 1102, 1103, and the like. The background management server may analyze and otherwise process the received data such as the resource information and the time interval information, and feed back a processing result (for example, the time interval allocated to the resource group — just an example) to the terminal device, and may store the processing result in the database for subsequent query or modification.

It should be noted that the resource information processing method provided in the embodiment of the present invention is generally executed by the server 1105, and accordingly, the resource information processing apparatus is generally provided in the server 1105.

It should be understood that the number of terminal devices, networks, servers, and databases in fig. 11 are merely illustrative. There may be any number of terminal devices, networks, servers, and databases, as desired for implementation.

Referring now to FIG. 12, shown is a block diagram of a computer system 1200 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device or the server shown in fig. 12 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 12, the computer system 1200 includes a Central Processing Unit (CPU)1201, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)1202 or a program loaded from a storage section 1208 into a Random Access Memory (RAM) 1203. In the RAM 1203, various programs and data necessary for the operation of the system 1200 are also stored. The CPU 1201, ROM 1202, and RAM 1203 are connected to each other by a bus 1204. An input/output (I/O) interface 1205 is also connected to bus 1204.

The following components are connected to the I/O interface 1205: an input portion Y06 including a keyboard, a mouse, and the like; an output portion 1207 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 1208 including a hard disk and the like; and a communication section 1209 including a network interface card such as a LAN card, a modem, or the like. The communication section 1209 performs communication processing via a network such as the internet. A driver 1210 is also connected to the I/O interface 1205 as needed. A removable medium 1211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is mounted on the drive 1210 as necessary, so that a computer program read out therefrom is mounted into the storage section 1208 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 1209, and/or installed from the removable medium 1211. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 1201.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present invention may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit, a resource allocation unit, and a resource optimization unit. The name of the unit does not constitute a limitation to the unit itself in some cases, and for example, the acquisition unit may also be described as a "unit that acquires resource information including a plurality of resource groups and time dimension information including a plurality of time zone sections".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring resource information containing a plurality of resource groups and time dimension information containing a plurality of time intervals; distributing a plurality of resource groups for a plurality of time intervals according to the resource information and the time dimension information; determining a block section gradient of at least one block section combination based on the result of the allocation, the resource defining condition included in the resource information and the block section defining condition of the time block section included in the time dimension information, wherein the block section combination indicates two time block sections, and the block section gradient indicates an optimization direction of the resource group allocation; optimizing the result of the allocation based on the optimization direction of the resource group allocation indicated by the interval gradient.

According to the technical scheme of the embodiment of the invention, a plurality of resource groups are allocated to a plurality of time intervals according to the resource groups included by the acquired resource information, the resource limitation condition of the resource groups, the time intervals included by the time interval information and the time interval limitation condition of each time interval; and based on the result of allocation, the resource limit condition included by the resource information and the interval limit condition included by the time interval information, determining the interval gradient of at least one interval combination, through which the optimization direction of resource group allocation can be indicated, i.e. subsequently, the resource information can be optimized based on the interval gradient, reducing the intervention of manual resource allocation, and simultaneously, integrating the interval gradient, the resource limit condition and the interval limit condition between the time intervals, the factors of resource allocation and the adjustment direction of resource optimization can be considered more comprehensively.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A resource information processing method is characterized by comprising the following steps:

2. The method of claim 1, wherein optimizing the results of the assignment comprises:

n3: calculating resource loss according to the result after the exchange;

3. The method of claim 2,

the block segment combination comprises a first time block segment in which a resource group is already allocated and a second time block segment in which a resource group is not allocated;

4. The method of claim 2 or 3, wherein the computing resource loss comprises:

5. The method of claim 1 or 2, wherein determining a block gradient for at least one block combination comprises:

6. The method of claim 5,

for the case that the number of the third time interval is multiple,

calculating a block gradient between the target third time block and the fourth time block;

and/or the presence of a gas in the gas,

for the case that the number of the fourth time interval section is multiple,

7. The method of claim 5, further comprising:

8. The method of claim 2, further comprising:

constructing a resource allocation table;

9. The method of claim 4, wherein said calculating a time period loss for each of said time periods comprises:

is performed for each of said time periods and,

10. A resource information processing apparatus characterized by comprising: an acquisition unit, a resource allocation unit, and a resource optimization unit, wherein,

11. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-9.

12. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-9.