A method for coordinating and scheduling multi-area operation and maintenance resources based on genetic algorithm

Abstract

A method for coordinated scheduling of multi-area operation and maintenance resources based on a genetic algorithm, which completes and classifies areas according to the amount of tasks and the amount of resources, analyzes the areas that cannot be completed in combination with the number of areas that can complete, and schedules the areas that cannot be completed according to the difference between the amount of resources and the amount of tasks, thereby avoiding unreasonable coordinated scheduling, and then monitoring the scheduled areas, and analyzing their task progress, judging whether the areas with abnormal task progress can complete the tasks, and then performing secondary scheduling for the areas that cannot complete the tasks; thus, the present invention can overcome the defects of the prior art and effectively ensure the reasonable scheduling and utilization of overall area resources.

Description

Technical Field

[0001] The present invention relates to the technical field of coordinated scheduling of multi-area resources, and in particular to a method for coordinated scheduling of multi-area operation and maintenance resources based on a genetic algorithm. Background Art

[0002] Genetic algorithm is an optimization algorithm based on the biological evolution process. It searches for the optimal solution by simulating processes such as natural selection, crossover and mutation. Genetic algorithm is also applicable to the problem of optimizing multi-area operation and maintenance resource scheduling.

[0003] According to the patent application number CN202310854336.3, the patent includes the creation of a class and conference management system, which includes conference software, a third-party business interaction system, an audio and video cloud service, and a learning platform. The number of resources of different numbers purchased in the conference software is configured in the class and conference management system. In the technical solution of the present invention, the user only needs to select the number of parties required for online meetings, the classes required for offline meetings, and the occupied time when creating a class / conference, and the online conference resources and offline class resources can be occupied, thereby avoiding the resources being occupied after reservation. At the same time, the combination of live broadcast services and recorded video services on different platforms can reduce costs.

[0004] When some existing areas are being coordinated and dispatched, they basically make one-off adjustments by analyzing their data. Although one-off adjustments are convenient, they cannot make timely and reasonable adjustments when abnormalities occur in subsequent areas, which will cause irrational use of resources and further lead to problems in overall coordination.

[0005] To this end, in view of the above-mentioned defects, the designers of the present invention have conducted intensive research and design, and integrated many years of experience and achievements in related industries to research and design a multi-area operation and maintenance resource coordinated scheduling method based on genetic algorithms to overcome the above-mentioned defects. Summary of the invention

[0006] The purpose of the present invention is to provide a method for coordinated scheduling of multi-area operation and maintenance resources based on a genetic algorithm, which solves the problem that a one-time adjustment cannot adjust abnormal situations in a timely manner, resulting in irrational use of resources.

[0007] To achieve the above object, the present invention discloses a method for coordinating and scheduling multi-area operation and maintenance resources based on a genetic algorithm, which is characterized by comprising the following steps:

[0008] Step 1: First, obtain the area information, where the area information includes: the number of areas, the task volume of the areas, and the resource volume of the areas, and analyze the area information. At the same time, classify different areas to obtain the corresponding classification information, where the classification information includes: areas that can be completed and areas that cannot be completed;

[0009] Step 2: Then analyze the classification information and generate quantity information based on its quantity. The quantity information includes: successful matching information and failed matching information. Then, combine the successful matching information in the quantity information to adjust the areas that cannot be completed and generate adjustment information;

[0010] Step 3: Then analyze the failed matching information in the quantity information, sort and analyze the priority of area a that cannot be completed, and generate the corresponding scheduling information according to the priority;

[0011] Step 4: Monitor the generated scheduling information, analyze it by analyzing the task progress of different areas and obtain the analysis result. The analysis result includes: normal and abnormal;

[0012] Step 5: Obtain the normal areas corresponding to the normal results and monitor them. Obtain the abnormal areas corresponding to the abnormal results and classify them according to their task completion situations to obtain abnormal classification information, and perform secondary scheduling processing on the unqualified areas in the abnormal classification information to generate secondary scheduling information.

[0013] Among them: The specific method for obtaining the classification information in Step 1 is:

[0014] S1: Label the areas and record them as i, and i = 1, 2,..., n. Then obtain the task volume and resource volume of area i and record them as Ri and Zi respectively. Then judge the area according to the task volume and resource volume of the area;

[0015] S2: When the task volume does not match the resource volume, it means that the corresponding area cannot complete the corresponding task volume, and record the area as the area that cannot be completed and record it as a, and a = 1, 2,..., m. On the contrary, record it as the area that can be completed and record it as b, and b = 1, 2,..., o, and m + o = n.

[0016] Among them: The specific method for obtaining the adjustment information in Step 2 is:

[0017] P1: Obtain the quantities of the areas that can be completed b and the areas that cannot be completed a and record them as Sb and Sa respectively. At the same time, compare the two. When Sb ≥ Sa, it means that the two can be scheduled with each other and generate successful matching information. On the contrary, when Sb < Sa, it means that the two cannot be scheduled with each other and generate failed matching information;

[0018] P2: Then analyze the matching success information, obtain the excess quantity that can be completed in area b, record it as Db, and obtain the demand quantity that cannot be completed in area a, record it as Xa, and sort the excess quantity Db and demand quantity Xa from small to large;

[0019] P3: Get the sorted surplus Db and demand Xa, and calculate the difference between the surplus Db and the demand Xa in ascending order. At the same time, get the area b that can be completed and the area a that cannot be completed corresponding to the smallest difference between the surplus Db and the demand Xa, and match the two to generate scheduling information.

[0020] Wherein: the specific method of obtaining the scheduling information in step 3 is:

[0021] A1: Obtain the priority values ​​of all the unfinished slices a as Ya, sort them from large to small, and then analyze them from the largest to the smallest priority value Ya.

[0022] A2: Get the unfinished area a with the largest priority value Ya, and determine whether there is an adjacent area b. If the unfinished area a does not have an adjacent area b, select the adjacent area with the smallest excess difference and the smallest distance between the unfinished area a and the adjacent area b, and generate the corresponding scheduling information.

[0023] A3: If there is a zone b that can be completed but cannot complete zone a, then analyze the number of existing zones. When the number is single, select the single zone to generate scheduling information. If the number is not single, select the zone that can be completed with the smallest excess difference to generate the corresponding scheduling information.

[0024] Wherein: the method for obtaining the analysis result in step 4 is:

[0025] B1: Get all the slices and record them as h, where h=1, 2, ..., n. Then get the task progress of slice h in time period t and record it as Rh. At the same time, get the tasks of slice h in k time periods and perform Rh. k , then calculate the average value and record it as Rh p ;

[0026] B2: Get the current task progress of area h and record it as Rh s and compare it with the corresponding average value Rh p For comparison, when Rh s ≥Rh p When Rh is , the corresponding area is marked as a normal area and recorded as z, and z=1, 2, ..., u, and a normal result is generated. s<Rh p When , the corresponding area is marked as an abnormal area and recorded as y, and y=1, 2, …, g, and an abnormal result is generated at the same time, and u+g=n.

[0027] Wherein: the method of obtaining the secondary scheduling information in step 5 is:

[0028] E1: Get all abnormal areas y and analyze their task completion status. If the abnormal area y can be completed, it will be marked as a qualified area y1, and y1=1, 2, ..., v, and no processing will be performed while monitoring it. Otherwise, it will be marked as an unqualified area y2, and y2=1, 2, ..., j, and v+j=g;

[0029] E2: Then obtain all unqualified areas y2 and qualified areas y1, screen out qualified areas that can be completed ahead of schedule and mark them as areas to be scheduled, and generate corresponding secondary scheduling information in combination with unqualified areas y2.

[0030] Among them: The method of generating secondary scheduling information is as follows:

[0031] E21: Get the areas to be adjusted and sort them from largest to smallest according to the advance completion time, then determine whether there is an area to be scheduled in the unqualified area. If there is, select the area to be scheduled that is closest to the adjacent area to be scheduled to generate secondary scheduling information;

[0032] E22: If there is no area to be adjusted, the secondary scheduling information is generated by matching the areas to be adjusted from large to small.

[0033] From the above content, it can be seen that the multi-area operation and maintenance resource coordinated scheduling method based on genetic algorithm of the present invention has the following effects:

[0034] 1. The areas are classified and processed according to the amount of tasks and resources. The unfinished areas are analyzed in combination with the number of areas that can be completed. At the same time, the unfinished areas are scheduled according to the difference between the amount of resources and the amount of tasks, so as to avoid unreasonable overall scheduling.

[0035] 2. Secondly, monitor the scheduled areas and analyze their task progress. Determine whether the areas with abnormal task progress can complete the task. Then, perform secondary scheduling for the areas that cannot complete the task to ensure the rational scheduling and utilization of the overall area resources.

[0036] The details of the present invention can be obtained from the following description and the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1A schematic diagram of the genetic algorithm-based multi-area operation and maintenance resource coordinated scheduling method of the present invention is shown. DETAILED DESCRIPTION

[0038] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0039] See also Figure 1 The present application provides a method for coordinating and scheduling multi-area operation and maintenance resources based on a genetic algorithm, and the method specifically includes the following steps:

[0040] Step 1: First, obtain the area information, which includes: the number of areas, the amount of area tasks and the amount of area resources, and analyze the area information to classify different areas to obtain corresponding classification information, where the classification information includes: areas that can be completed and areas that cannot be completed, and the specific method of obtaining the classification information is as follows:

[0041] S1: Label the area and record it as i, where i=1, 2, ..., n, then obtain the task volume and resource volume of area i and record them as Ri and Zi respectively, then judge the area according to the task volume and resource volume of the area; specifically, it should be noted here that the task volume is quantified and specifically assigned in this application, and the task volume can specifically include: resource demand, priority, workload and other information. Similarly, the resource volume is assigned, and the resource volume can specifically include: human resources, equipment resources, material resources, etc.

[0042] S2: When the task amount does not match the resource amount, it means that the corresponding area cannot complete the corresponding task amount, and the area to which it corresponds is recorded as an uncompleted area and recorded as a, and a=1, 2, ..., m. Otherwise, it is recorded as a complete area and recorded as b, and b=1, 2, ..., o, and m+o=n. Specifically, it should be noted here that the matching of the task amount and the resource amount means that the resource amount of the area can support the completion of its task amount, and the matching standard is to compare the numerical values ​​of the two.

[0043] Step 2: Then analyze the completed area b and the uncompleted area a, and generate quantity information according to the number of the completed area b and the uncompleted area a, wherein the quantity information includes: matching success information and matching failure information, and then adjust the uncompleted area b in combination with the matching success information in the quantity information and generate adjustment information, and the method of generating the adjustment information is as follows:

[0044] P1: Obtain the quantities of the areas that can complete area b and the areas that cannot complete area a, and denote them as Sb and Sa respectively. Then compare the two. When Sb ≥ Sa, it means they can be scheduled with each other and generate a successful matching message. On the contrary, when Sb < Sa, it means they cannot be scheduled with each other and generate a failed matching message.

[0045] P2: Then analyze the successful matching message, obtain the surplus quantity corresponding to the area that can complete area b, denoted as Db, and at the same time obtain the demand quantity of the area that cannot complete area a, denoted as Xa, and sort the surplus quantity Db and the demand quantity Xa from small to large. Specifically, it should be noted here that: the surplus quantity and the demand quantity represent the difference between the resource quantity and the task quantity. If the difference between the resource quantity and the task quantity is positive, it is represented as the surplus quantity, and on the contrary, if it is negative, it is represented as the demand quantity.

[0046] P3: Obtain the sorted surplus quantity Db and demand quantity Xa, and calculate the difference between the surplus quantity Db and the demand quantity Xa in turn in ascending order. At the same time, obtain the area that can complete area b and the area that cannot complete area a corresponding to the smallest difference between the surplus quantity Db and the demand quantity Xa, and match the two to generate scheduling information. Specifically, it should be noted here that: first calculate the difference between the smallest surplus quantity Db in ascending order of the demand quantity Xa, and then calculate the difference between the surplus quantity Db and the demand quantity Xa in turn in ascending order, and select the area corresponding to the smallest difference between the two, and finally generate scheduling information.

[0047] Step 3: Then analyze the failed matching message in the quantity information, sort and analyze the priorities of the areas that cannot complete area a, and generate corresponding scheduling information according to the priorities. The way to generate scheduling information is as follows:

[0048] A1: Obtain all the priority values of the areas that cannot complete area a, denoted as Ya, and sort them from large to small. Then analyze them in turn from the largest to the smallest according to the priority value Ya. Specifically, it should be noted here that: the priority represents the total time required for different areas to complete tasks, and the shorter the total time, the higher the priority. Then calculate the priority value according to the time and the task quantity, and conduct scheduling analysis starting from the area corresponding to the largest priority value.

[0049] A2: Get the unfinished area a corresponding to the largest priority value Ya, and determine whether there is an adjacent area b that can be completed. If the unfinished area a does not exist in the area b that can be completed, select the area that has the smallest excess difference and the smallest distance between the unfinished area a and the area that can be completed b, and generate corresponding scheduling information. Specifically, it should be noted here that when there is no adjacent area that can be completed, the selection condition is to meet the conditions of both the area with the smallest difference and the area with the smallest distance.

[0050] A3: If there is a zone b that can be completed in the zone a that cannot be completed, then the number of existing zones is analyzed. If the number of existing zones is single, the single zone is selected to generate the scheduling information. If the number of existing zones is not single, the zone that can be completed corresponding to the smallest excess difference is selected to generate the corresponding scheduling information. Specifically, it should be noted that if there is only one zone, the two are directly matched to generate the scheduling information. If there are multiple zones, the zone corresponding to the smallest excess difference is selected to match and generate the scheduling information.

[0051] Step 4: Monitor the generated scheduling information, analyze it by analyzing the task progress of different areas and obtain the analysis results, where the analysis results include: normal and abnormal, and the specific method of generating the analysis results is as follows:

[0052] B1: Get all the slices and record them as h, where h=1, 2, ..., n. Then get the task progress of slice h in time period t and record it as Rh. At the same time, get the tasks of slice h in k time periods and perform Rh. k , then calculate the average value and record it as Rh p .

[0053] B2: Get the current task progress of area h and record it as Rh s and compare it with the corresponding average value Rh p For comparison, when Rh s ≥Rh p When Rh is , the corresponding area is marked as a normal area and recorded as z, and z=1, 2, ..., u, and a normal result is generated. s <Rh p When , the corresponding area is marked as an abnormal area and recorded as y, and y=1, 2, …, g, and an abnormal result is generated at the same time, and u+g=n.

[0054] Step 5: Obtain the normal area z corresponding to the normal result and monitor it, obtain the abnormal area y corresponding to the abnormal result and classify it according to its task completion status to obtain abnormal classification information, where the classification information includes: qualified areas and unqualified areas, and perform secondary scheduling processing on the unqualified areas in the abnormal classification information to generate secondary scheduling information, and the method of generating the secondary scheduling information is as follows:

[0055] E1: Get all abnormal areas y and analyze their task completion status. When the abnormal area y can be completed, it is marked as a qualified area y1, and y1=1, 2, ..., v, then no processing is performed and it is monitored at the same time. Otherwise, when the abnormal area y cannot be completed, it is marked as an unqualified area y2, and y2=1, 2, ..., j, and v+j=g; specifically, it should be noted here that the task completion status is calculated for the corresponding area based on the current progress of the abnormal task. If it can be completed, it is recorded as qualified, otherwise it is recorded as unqualified.

[0056] E2: Then, all unqualified areas y2 and qualified areas y1 are obtained, and qualified areas that can be completed in advance are screened out and marked as areas to be scheduled. The corresponding secondary scheduling information is generated in combination with the unqualified area y2, and the secondary scheduling information is generated as follows:

[0057] E21: Get the areas to be adjusted and sort them from largest to smallest according to the advance completion time, then determine whether there is an area to be scheduled in the unqualified area. If there is, select the area to be scheduled that is closest to the adjacent area to be scheduled to generate secondary scheduling information;

[0058] E22: If there is no area to be adjusted, the area to be adjusted is matched from large to small to generate secondary scheduling information. Specifically, it should be noted that the unqualified area y2 is sorted according to the priority value, and in the secondary scheduling, the area to be adjusted is scheduled from large to small according to the largest priority value.

[0059] Therefore, the present invention performs calculation, screening and processing on different areas, and then adjusts the areas through different resources. The adjustment method is similar to the crossover form in the genetic algorithm, and the genetic algorithm is fully utilized to adjust the areas.

[0060] Some of the data in the above formulas are dimensionless and numerically calculated. Meanwhile, the contents not described in detail in this specification belong to the prior art known to those skilled in the art.

[0061] The above embodiments are only used to illustrate the technical method of the present invention and are not intended to limit it. Although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that the technical method of the present invention can be modified or replaced by equivalents without departing from the spirit and scope of the technical method of the present invention. It is obvious that the above description and record are only examples and are not intended to limit the disclosure, application or use of the present invention. Although the embodiments have been described in the embodiments and described in the drawings, the present invention is not limited to the specific examples illustrated in the drawings and described in the embodiments as the best mode currently considered to implement the teachings of the present invention, and the scope of the present invention will include any embodiment falling within the preceding description and the appended claims.

Claims

1. A method for coordinating and scheduling multi-area operation and maintenance resources based on genetic algorithm, characterized in that It includes the following steps: Step 1: First, obtain the area information, where the area information includes: the number of areas, the task volume of the areas, and the resource volume of the areas, and analyze the area information. At the same time, classify different areas to obtain the corresponding classification information, where the classification information includes: areas that can be completed and areas that cannot be completed; Step 2: Then analyze the classification information and generate quantity information based on its quantity. The quantity information includes: information on successful matching and information on failed matching. Then, combine the information on successful matching in the quantity information to adjust the areas that cannot be completed and generate adjustment information; Step 3: Then analyze the information on failed matching in the quantity information. Analyze and sort the priorities of the areas that cannot complete area a, and generate the corresponding scheduling information according to the priorities. The specific way to obtain the scheduling information is as follows: A1: Obtain all the priority values of the areas that cannot complete area a and denote them as Ya. At the same time, sort them from largest to smallest, and then analyze them in turn according to the priority value Ya from largest to smallest; A2: Obtain the area that cannot complete area a corresponding to the largest priority value Ya. At the same time, judge whether there is an area b that can be completed in its adjacent areas. If there is no area b that can be completed in the area that cannot complete area a, then select the one with the smallest difference in excess quantity and the area that can be completed with the smallest distance between the area that cannot complete area a and the area that can complete b, and generate the corresponding scheduling information; A3: If there is an area b that can be completed in the area that cannot complete area a, then analyze its existing quantity. When the existing quantity is single, select a single area to generate scheduling information. If the existing quantity is not single, then select the area that can be completed with the smallest difference in excess quantity to generate the corresponding scheduling information; Step 4: Monitor the generated scheduling information. Analyze it by analyzing the task progress of different areas to obtain the analysis result. The analysis result includes: normal and abnormal. The way to obtain the analysis result is as follows: B1: Obtain all the areas and denote them as h, and h = 1, 2,..., n. Then obtain the task progress of area h within the time period t and denote it as Rh. At the same time, obtain the task progress Rhk of area h within k time periods, and then calculate its average value and denote it as Rhp; B2: Obtain the current task progress of area h and denote it as Rhs, and compare it with the corresponding average value Rhp. When Rhs ≥ Rhp, mark the corresponding area as a normal area and denote it as z, and z = 1, 2,..., u. At the same time, generate a normal result. On the contrary, when Rhs < Rhp, mark the corresponding area as an abnormal area and denote it as y, and y = 1, 2,..., g. At the same time, generate an abnormal result, and u + g = n; Step 5: Obtain the normal areas corresponding to the normal results and monitor them. Obtain the abnormal areas corresponding to the abnormal results and classify them according to their task completion situations to obtain abnormal classification information. Then, perform secondary scheduling processing on the unqualified areas in the abnormal classification information to generate secondary scheduling information. The way to obtain the secondary scheduling information is as follows: E1: Obtain all abnormal areas y and analyze their task completion status. When an abnormal area y can be completed, it is marked as a qualified area y1, and y1 = 1, 2, …, v. Then, no further processing is performed and it is monitored. Otherwise, it is marked as an unqualified area y2, and y2 = 1, 2, …, j, and v + j = g; E2: Then, obtain all unqualified areas y2 and qualified areas y1, and screen out the qualified areas that can be completed ahead of schedule and mark them as areas to be scheduled. Combine with the unqualified areas y2 to generate corresponding secondary scheduling information; And the method for generating secondary scheduling information is as follows: E21: Obtain the areas to be adjusted and sort them in descending order according to the early completion time. Then, determine whether there are areas to be scheduled in the unqualified areas. If so, select the ones with the closest distance between adjacent areas to be scheduled to generate secondary scheduling information; E22: If there are no areas to be adjusted, generate secondary scheduling information by matching in descending order according to the areas to be adjusted; The specific method for obtaining the adjustment information in step 2 is as follows: P1: Obtain the quantities of areas b that can be completed and areas a that cannot be completed, and record them as Sb and Sa respectively. Then, compare the two. When Sb ≥ Sa, it means that they can be scheduled with each other and generate a successful matching message. Otherwise, when Sb < Sa, it means that they cannot be scheduled with each other and generate a failed matching message; P2: Then, analyze the successful matching message, obtain the surplus quantity corresponding to the area b that can be completed and record it as Db, and obtain the demand quantity of the area a that cannot be completed and record it as Xa. Sort the surplus quantity Db and the demand quantity Xa in ascending order; P3: Obtain the sorted surplus quantity Db and demand quantity Xa, and calculate the difference between the surplus quantity Db and the demand quantity Xa in ascending order one by one. At the same time, obtain the area b that can be completed and the area a that cannot be completed corresponding to the smallest difference between the surplus quantity Db and the demand quantity Xa, and match the two to generate scheduling information.

2. The method for coordinating and scheduling multi-area operation and maintenance resources based on genetic algorithm according to claim 1 is characterized in that: The specific method for obtaining the classification information in step 1 is as follows: S1: Number the areas and record them as i, and i = 1, 2, …, n. Then, obtain the task quantity and resource quantity of area i and record them as Ri and Zi respectively. Then, judge the area according to the task quantity and resource quantity of the area; S2: When the task quantity and the resource quantity do not match, it means that the corresponding area cannot complete the corresponding task quantity, and mark the area as an area that cannot be completed and record it as a, and a = 1, 2, …, m. Otherwise, mark it as an area that can be completed and record it as b, and b = 1, 2, …, o, and m + o = n.

Images