Distribution network project group progress management method and system based on dynamic resource optimization

By constructing a single-code network graph for project groups, and based on adjacency matrix and dynamic inverse solution algorithm, the problem of distortion in distribution network project group management was solved, and the accuracy of resource optimization and schedule management was achieved.

CN114239960BActive Publication Date: 2024-11-19JIANGMEN POWER SUPPLY BUREAU OF GUANGDONG POWER GRID CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111544541.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-16
Publication Date
2024-11-19
Estimated Expiration
2041-12-16

AI Technical Summary

Technical Problem

Existing management methods for power distribution network projects lack a holistic perspective, making it difficult to meet the needs of optimizing project schedule management and leading to management distortion.

Method used

Construct a single-code network graph for the project group, perform topological sorting based on the project adjacency matrix, solve the critical path using a dynamic inverse solution algorithm, determine resource conflicts through the resource demand matrix and supply vector, and optimize resource allocation using a resource optimization allocation algorithm to optimize the single-code network graph for the project group.

Benefits of technology

It improved the accuracy of distribution network project group management, ensured optimal resource allocation, and optimized the progress management of project groups.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114239960B_ABST
    Figure CN114239960B_ABST
Patent Text Reader

Abstract

The present invention relates to the technical field of project management, and discloses a distribution network engineering project group progress management method and system based on dynamic resource optimization. The method constructs a project group single-code network diagram of the distribution network engineering project group, and based on a project adjacency matrix, sorts each process of each sub-project in the project group single-code network diagram to construct a project group sequence topology diagram. A dynamic reverse solution algorithm is used to solve the key path of the project group sequence topology diagram, and resource conflict situations are judged through a resource demand matrix and a resource supply vector. When a resource conflict occurs, a resource optimization configuration algorithm is used to perform resource configuration, thereby obtaining an optimal project group single-code network diagram, and improving the accuracy of distribution network engineering project group management.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of project management, and in particular to a distribution network engineering project group progress management method and system based on dynamic resource optimization. Background Art

[0002] In recent years, with the continuous growth of investment in distribution networks in my country, there are more and more distribution network construction projects, and the concept of distribution network project groups has emerged in the construction process. Distribution network project group management is a systematic and complex task. In the implementation process, there will be a variety of management interference factors. If we follow the previous idea of ​​single project progress management, we lack a holistic view and it is difficult to meet the existing project group progress optimization management needs, which will cause the management of distribution network project groups to be distorted. Summary of the invention

[0003] The present invention provides a distribution network project group progress management method and system based on dynamic resource optimization, which solves the technical problem of distribution network project group management distortion.

[0004] In view of this, a first aspect of the present invention provides a distribution network project group progress management method based on dynamic resource optimization, comprising the following steps:

[0005] Constructing a project group single-code network diagram of the distribution network project group according to the single-code network diagram of a single project in the distribution network project group, wherein the project group single-code network diagram includes a project adjacency matrix, and the project adjacency matrix expresses the logical relationship between each project through the adjacent relationship between vertices;

[0006] Based on the project adjacency matrix, sorting the processes of the sub-projects in the project group single-code network diagram according to a preset topological sorting rule, thereby constructing a project group sequence topological diagram;

[0007] Solving the critical path of the project group sequence topology graph based on a dynamic reverse solving algorithm;

[0008] Obtain the resource demand matrix and resource supply vector, and determine whether a resource conflict occurs based on the resource demand matrix and resource supply vector. If a resource conflict occurs, use the resource optimization configuration algorithm to configure resources, thereby obtaining the best project group single code network diagram.

[0009] Preferably, the step of constructing a project group single-code network diagram of a distribution network project group according to the single-code network diagram of a single project in the distribution network project group, wherein the project group single-code network diagram includes a project adjacency matrix, and the project adjacency matrix expresses the logical relationship between each project through the adjacent relationship between vertices, specifically includes:

[0010] The number of processes of each sub-project in the distribution network project group is set to n processes, and the number of sub-projects is set to m. Then the single-code network diagram T of a single project i It can be expressed by formula 1:

[0011] T i =(V i , E) Formula 1

[0012] Among them, V i represents the working time vector, V i =(V i1 ,V i2 ,...,V in ), V ij represents the working hours required for process j of sub-project i; E represents the process adjacency matrix, which has an order of n×n. It expresses the adjacency relationship between processes through the values ​​in the matrix. The expression of the process adjacency matrix E is shown in Formula 2:

[0013]

[0014] Single-code network diagram based on a single project i The expression of the project group single-code network diagram Q for constructing the distribution network project group is:

[0015] Q=(T i ,F ij ) Formula 3

[0016] In the formula, F ij is the project adjacency matrix, with an order of m×m, which is based on the adjacent relationship between vertices.

[0017] Preferably, the preset topological sorting rule is:

[0018] Get the first sub-project in the distribution network project group and its first process, and fill the first process into the project group sequence topology sequence. The project group sequence topology sequence is initially empty.

[0019] Searching for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix, and filling the next process found into the project group sequence topology sequence;

[0020] Delete the previous process of the next process found, and search for the next process of the next process found in the project group single code network diagram;

[0021] Repeat the steps of searching for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix to the step of deleting the previous process of the next process found, until the next process is empty, thereby obtaining a filled project group sequence topology sequence to obtain a project group sequence topology diagram.

[0022] Preferably, the step of solving the critical path of the project group sequence topology graph based on a dynamic inverse solution algorithm specifically includes:

[0023] The earliest start time C(i,j) is calculated by the dynamic programming recursive formula, and the formula is:

[0024] C(i,j)=max{C(k,l)+V(k,l)} Formula 5

[0025] In the formula, C(i,j) is the earliest start time of the jth process of sub-project i, where the start time of the first process of sub-project i is 0, V(k,l) is the previous process of V(i,j), V(i,j) takes values ​​in sequence according to the process adjacency matrix, and C(k,l) represents the earliest start time of the lth process of sub-project k;

[0026] Get the maximum value of the earliest start time C(i,j) to determine the last process of the last sub-project in the critical path;

[0027] Suppose the last process of the last sub-project is numbered V(i,j), and the immediate predecessor process V(k,l) of the last process V(i,j) of the last sub-project is calculated through the process adjacency matrix E and the project adjacency matrix F. If the immediate predecessor process V(k,l) satisfies the condition C(k,l)+V(k,l)=C(i,j), then the process corresponding to V(k,l) is the immediate predecessor process of the last process V(i,j) of the last sub-project on the critical path. Repeat this step until the first process is found, thereby obtaining all the processes on the critical path of the project group sequence topology graph.

[0028] Preferably, the steps of obtaining a resource demand matrix and a resource supply vector, determining whether a resource conflict occurs based on the resource demand matrix and the resource supply vector, and if a resource conflict occurs, performing resource allocation using a resource optimization allocation algorithm to obtain an optimal project group single-code network diagram specifically include:

[0029] Obtain the resource requirements of each sub-project of the distribution network project group and construct a resource requirement matrix, which is defined as S. The element S in the resource requirement matrix S is jorepresents the number of o-th resource required for the j-th process, randomly selects j, finds the non-zero item in the j-th column of S, and obtains the process and resource supply vector used by o resources. The resource supply vector is defined as P o , used to represent the existing quantity of the oth resource, repeat this step until the resource demand matrix of all sub-projects is traversed to obtain the total resource demand of the distribution network project group;

[0030] According to the resource supply vector P o The start time and duration of the same resource process are found for each sub-project based on the total resource demand. If there is time overlap and the corresponding resource demand at the overlapping time is greater than the total resource demand, it is determined that a resource conflict has occurred.

[0031] If it is determined that a resource conflict occurs, a resource optimization configuration algorithm is used to perform resource configuration and obtain several resource configuration schemes;

[0032] Calculate the total construction period of each resource allocation scheme, compare the total construction periods corresponding to each resource allocation scheme, determine the minimum total construction period, and use the project group single-code network diagram corresponding to the minimum total construction period as the optimal project group single-code network diagram.

[0033] In a second aspect, the present invention further provides a distribution network project group progress management system based on dynamic resource optimization, comprising the following steps:

[0034] A network diagram construction module, used to construct a project group single-code network diagram of a distribution network project group according to a single-code network diagram of a single project in the distribution network project group, wherein the project group single-code network diagram includes a project adjacency matrix, and the project adjacency matrix expresses the logical relationship between each project through the adjacent relationship between vertices;

[0035] A topology map construction module is used to sort the processes of each sub-project in the project group single-code network diagram according to a preset topology sorting rule based on the project adjacency matrix, so as to construct a project group sequence topology map;

[0036] A path solving module, used for solving the key path of the project group sequence topology diagram based on a dynamic reverse solving algorithm;

[0037] The adjustment module is used to obtain the resource demand matrix and resource supply vector, and determine whether a resource conflict occurs based on the resource demand matrix and resource supply vector. If a resource conflict occurs, the resource optimization configuration algorithm is used to configure resources, so as to obtain the best project group single code network diagram.

[0038] Preferably, the network diagram construction module specifically includes:

[0039] The sub-project network diagram construction module is used to set the number of processes of each sub-project in the distribution network project group to n processes and the number of sub-projects to m. Then the single-code network diagram T of a single project i It can be expressed by formula 1:

[0040] T i =(V i , E) Formula 1

[0041] Among them, V i represents the working time vector, V i =(V i1 ,V i2 ,...,V in ), V ij represents the working hours required for process j of sub-project i; E represents the process adjacency matrix, which has an order of n×n. It expresses the adjacency relationship between processes through the values ​​in the matrix. The expression of the process adjacency matrix E is shown in Formula 2:

[0042]

[0043] A project network diagram building module for single-code network diagrams based on a single project. i The expression of the project group single-code network diagram Q for constructing the distribution network project group is:

[0044] Q=(T i ,F ij ) Formula 3

[0045] In the formula, F ij is the project adjacency matrix, with an order of m×m. It expresses the logical relationship between projects through the adjacent relationship between vertices. The expression of the project adjacency matrix is ​​shown in Formula 4:

[0046]

[0047] Preferably, the system further comprises:

[0048] The process acquisition module is used to obtain the first sub-project in the distribution network project group and its first process, and fill the first process into the project group sequence topology sequence. The project group sequence topology sequence is initially empty.

[0049] A process search module is used to search for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix, and fill the next process found into the project group sequence topology sequence;

[0050] The process deletion module is used to delete the previous process of the next process found, and search for the next process of the next process found in the project group single-code network diagram until the next process is empty, thereby obtaining the filled project group sequence topology sequence to obtain the project group sequence topology diagram.

[0051] Preferably, the path solving module specifically includes:

[0052] The calculation module is used to calculate the earliest start time C(i,j) through the dynamic programming recursive formula, and the formula is:

[0053] C(i,j)=max{C(k,l)+V(k,l)} Formula 5

[0054] In the formula, C(i,j) is the earliest start time of the jth process of sub-project i, where the start time of the first process of sub-project i is 0, V(k,l) is the previous process of V(i,j), and V(i,j) takes values ​​in sequence according to the process adjacency matrix. The project group sequence topology diagram represents the jth process of sub-project i in the project group sequence topology diagram, and C(k,l) represents the earliest start time of the lth process of sub-project k;

[0055] The process determination module is used to obtain the maximum value of the earliest start time C(i,j) to determine the last process of the last sub-project in the critical path;

[0056] The predecessor process acquisition module is used to set the last process number of the last sub-project as V(i,j), and calculate the predecessor process V(k,l) of the last process V(i,j) of the last sub-project through the process adjacency matrix E and the project adjacency matrix F. If the predecessor process V(k,l) satisfies the condition C(k,l)+V(k,l)=C(i,j), then the process corresponding to V(k,l) is the predecessor process of the last process V(i,j) of the last sub-project on the critical path.

[0057] Preferably, the adjustment module specifically includes:

[0058] The resource demand acquisition module is used to obtain the resource demand of each sub-project of the distribution network project group and construct a resource demand matrix, which is defined as S. The element S in the resource demand matrix S is jo represents the number of o-th resource required for the j-th process, randomly selects j, finds the non-zero item in the j-th column of S, and obtains the process and resource supply vector used by o resources. The resource supply vector is defined as P o , used to represent the existing quantity of the oth resource, repeat this step until the resource demand matrix of all sub-projects is traversed to obtain the total resource demand of the distribution network project group;

[0059] The resource conflict judgment module is used to determine the resource conflict according to the resource supply vector P o The start time and duration of the same resource process are found for each sub-project based on the total resource demand. If there is time overlap and the corresponding resource demand at the overlapping time is greater than the total resource demand, it is determined that a resource conflict has occurred.

[0060] A resource configuration module is used to use a resource optimization configuration algorithm to perform resource configuration when it is determined that a resource conflict occurs, and obtain several resource configuration plans;

[0061] The comparison module is used to calculate the total construction period of each resource allocation scheme, compare the total construction period corresponding to each resource allocation scheme, determine the minimum total construction period, and thus use the project group single code network diagram corresponding to the minimum total construction period as the best project group single code network diagram.

[0062] It can be seen from the above technical solutions that the present invention has the following advantages:

[0063] The present invention constructs a project group single-code network diagram of the distribution network project group, sorts the processes of each sub-project in the project group single-code network diagram based on the project adjacency matrix, constructs a project group sequence topology diagram, and uses a dynamic inverse solution algorithm to solve the key path of the project group sequence topology diagram. The resource conflict is judged through the resource demand matrix and the resource supply vector, and when the resource conflict occurs, the resource optimization configuration algorithm is used to configure the resources, so as to obtain the best project group single-code network diagram, thereby improving the accuracy of the distribution network project group management. BRIEF DESCRIPTION OF THE DRAWINGS

[0064] Figure 1 A flow chart of a distribution network project group progress management method based on dynamic resource optimization provided by an embodiment of the present invention;

[0065] Figure 2 A schematic structural diagram of a distribution network project group progress management system based on dynamic resource optimization provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0066] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings 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.

[0067] For easier understanding, see Figure 1The present invention provides a distribution network project group progress management method based on dynamic resource optimization, comprising the following steps:

[0068] 100. A single-code network diagram of the distribution network project group is constructed based on the single-code network diagram of a single project in the distribution network project group. The single-code network diagram of the project group includes a project adjacency matrix. The project adjacency matrix expresses the logical relationship between projects through the adjacent relationship between vertices.

[0069] It should be noted that the network diagram is the basis of modern engineering construction progress management methods, and its essence is a directed, loop-free diagram. The network diagram in engineering progress management can be divided into a single-code network diagram and a double-code network diagram. The single-code network diagram uses nodes to represent work, and arrows to represent the logical relationship between work. For a certain arrow, its starting node is the previous process of the ending node; the double-code network diagram uses arrows to represent work, and nodes represent the intersection of the previous and next work. The two can be converted to each other. In comparison, the arrow relationship of the single-code network diagram is simple, the logical relationship is clear, and it is convenient for computer expression optimization and adjustment. Therefore, this embodiment selects a single-code network diagram to numerically implement the progress management method.

[0070] In the project group schedule, the project group single-code network diagram contains the working hours of each internal process of each sub-project and the logical relationship between each process, as well as the logical relationship between each sub-project.

[0071] 200. Based on the project adjacency matrix, the processes of each sub-project in the project group single-code network diagram are sorted according to the preset topological sorting rules, so as to construct a project group sequence topological diagram.

[0072] Among them, the preset topological sorting rules are:

[0073] 201. Obtain the first sub-project in the distribution network project group and the first process carried out by it, and fill the first process into the project group sequence topology sequence. The project group sequence topology sequence is initially empty;

[0074] 202. Find the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix, and fill the next process found into the project group sequence topology sequence;

[0075] 203. Delete the previous process of the next process found, and search for the next process of the next process found in the project group single code network diagram;

[0076] 204. Repeat step 202 to step 203 until the next process is empty, thereby obtaining a filled project group sequence topology sequence to obtain a project group sequence topology graph.

[0077] 300. Solve the critical path of the project group sequence topology diagram based on the dynamic inverse solution algorithm.

[0078] Among them, the previous process of any project in the project group sequence topology diagram is ranked before this process. Since there are multiple parallel processes in the project group, there are multiple paths from the starting point to the end point of the sequence topology diagram. Therefore, it is necessary to query the critical path among the multiple paths.

[0079] 400. Obtain a resource demand matrix and a resource supply vector, and determine whether a resource conflict occurs based on the resource demand matrix and the resource supply vector. If a resource conflict occurs, use a resource optimization configuration algorithm to perform resource configuration, thereby obtaining an optimal project group single-code network diagram.

[0080] The present embodiment provides a method for progress management of a distribution network project group based on dynamic resource optimization. The method constructs a project group single-code network diagram of the distribution network project group, sorts the processes of each sub-project in the project group single-code network diagram based on the project adjacency matrix, constructs a project group sequence topology diagram, and uses a dynamic inverse solution algorithm to solve the critical path of the project group sequence topology diagram. The resource demand matrix and the resource supply vector are used to determine the occurrence of resource conflicts. When resource conflicts occur, a resource optimization configuration algorithm is used to perform resource configuration, thereby obtaining the best project group single-code network diagram and improving the accuracy of distribution network project group management.

[0081] In a specific embodiment, step 100 specifically includes:

[0082] 101. Set the number of processes of each sub-project in the distribution network project group to n processes and the number of sub-projects to m. Then the single-code network diagram T of a single project i It can be expressed by formula 1:

[0083] T i =(V i , E) Formula 1

[0084] Among them, V i represents the working time vector, V i =(V i1 ,V i2 ,...,V in ), V ij represents the working hours required for process j of sub-project i; E represents the process adjacency matrix, which has an order of n×n. It expresses the adjacency relationship between processes through the values ​​in the matrix. The expression of the process adjacency matrix E is shown in Formula 2:

[0085]

[0086] Among them, if there is no process V in the actual project iij , then V ij =0.

[0087] 102. Single-code network diagram based on a single project T i The expression of the project group single-code network diagram Q for constructing the distribution network project group is:

[0088] Q=(T i ,F ij ) Formula 3

[0089] In the formula, F ij is the project adjacency matrix, with an order of m×m. It expresses the logical relationship between projects through the adjacent relationship between vertices. The expression of the project adjacency matrix is ​​shown in Formula 4:

[0090]

[0091] In a specific embodiment, step 300 specifically includes:

[0092] 301. Calculate the earliest start time C(i,j) through the dynamic programming recursive formula, the formula is:

[0093] C(i,j)=max{C(k,l)+V(k,l)} Formula 5

[0094] In the formula, C(i,j) is the earliest start time of the jth process of sub-project i, where the start time of the first process of sub-project i is 0, V(k,l) is the previous process of V(i,j), V(i,j) takes values ​​in sequence according to the process adjacency matrix, and C(k,l) represents the earliest start time of the lth process of sub-project k;

[0095] Among them, V(i,j) takes values ​​in sequence according to the process adjacency matrix, which can ensure that c(k,l) is known when solving c(i,j).

[0096] 302. Obtain the maximum value of the earliest start time C(i,j) to determine the last process of the last sub-project in the critical path;

[0097] 303. Assume that the last process of the last sub-project is numbered V(i,j). Calculate the immediate predecessor process V(k,l) of the last process V(i,j) of the last sub-project through the process adjacency matrix E and the project adjacency matrix F. If the immediate predecessor process V(k,l) satisfies the condition C(k,l)+V(k,l)=C(i,j), then the process corresponding to V(k,l) is the immediate predecessor process of the last process V(i,j) of the last sub-project on the critical path. Repeat this step until the first process is found, thereby obtaining all the processes on the critical path of the project group sequence topology diagram.

[0098] It should be noted that without considering resource constraints, the process adjacency matrix E, sub-project adjacency matrix F and duration vector V ij After that, the critical path of the project can be quickly obtained by dynamic programming method.

[0099] In a specific embodiment, step 400 specifically includes:

[0100] 401. Obtain the resource demand of each sub-project of the distribution network project group, and construct a resource demand matrix, defined as S. The element S in the resource demand matrix S is jo represents the number of o-th resource required for the j-th process, randomly selects j, finds the non-zero item in the j-th column of S, and obtains the process and resource supply vector used by o resources. The resource supply vector is defined as P o , which is used to represent the existing quantity of the oth resource. Repeat this step until the resource requirement matrix of all sub-projects is traversed to obtain the total resource requirement of the distribution network project group.

[0101] Among them, the resource requirements of each sub-project are determined based on the construction drawing design and budget.

[0102] It should be noted that during the construction process, the network diagram may change due to changes in the construction period, the availability of materials, and the allocation of human resources, which in turn causes changes in the logical relationship between processes, and the matrix E and matrix F change accordingly. Therefore, the project critical path can be dynamically adjusted according to the changes.

[0103] When the construction time of a process changes, the V vector can be updated by simply changing V(i,j). Subsequently, the critical path of the project can be adjusted by recalculating it.

[0104] When the availability of resources and human resource allocation changes, it is necessary to determine the conflict. If the priority of the sub-project changes, the project adjacency matrix F can be adjusted. If the internal process of the sub-project needs to be adjusted, the item process adjacency matrix E can be adjusted.

[0105] In order to describe the resource constraints, the resource demand matrix and resource supply vector are proposed.

[0106] 402. According to the resource supply vector P o The start time and duration of the same resource process are found for each sub-project based on the total resource demand. If there is time overlap and the corresponding resource demand at the overlapping time is greater than the total resource demand, it is determined that a resource conflict has occurred.

[0107] 403. If it is determined that a resource conflict occurs, a resource optimization configuration algorithm is used to perform resource configuration to obtain several resource configuration schemes;

[0108] Among them, the resource optimization configuration algorithm adopts the existing resource configuration algorithm, such as genetic algorithm.

[0109] 404. Calculate the total construction period of each resource allocation scheme, compare the total construction periods corresponding to each resource allocation scheme, determine the minimum total construction period, and use the project group single-code network diagram corresponding to the minimum total construction period as the optimal project group single-code network diagram.

[0110] In a specific embodiment, by providing evidence of total resources, evidence of resource requirements, earliest start time of a process, and duration of a process, it can be determined whether a process of a sub-project has resource conflicts with processes of other sub-projects.

[0111] Through the resource optimization algorithm, a variety of allocable plans can be proposed, and the construction period of each plan can be calculated. The allocation plan corresponding to the minimum total construction period obtained by comparing the construction periods is the best allocation plan, and the project group single code network diagram corresponding to the best allocation plan is the best project group single code network diagram.

[0112] The above is a detailed description of an embodiment of a distribution network project group progress management method based on dynamic resource optimization provided by the present invention. The following is a detailed description of an embodiment of a distribution network project group progress management system based on dynamic resource optimization provided by the present invention.

[0113] For easier understanding, see Figure 2 The present invention provides a distribution network project group progress management system based on dynamic resource optimization, comprising the following steps:

[0114] A network diagram construction module 10 is used to construct a project group single-code network diagram of a distribution network project group according to a single-code network diagram of a single project in the distribution network project group. The project group single-code network diagram includes a project adjacency matrix, and the project adjacency matrix expresses the logical relationship between each project through the adjacent relationship between vertices.

[0115] The topology diagram construction module 20 is used to sort the processes of each sub-project in the project group single-code network diagram according to a preset topology sorting rule based on the project adjacency matrix, so as to construct a project group sequence topology diagram;

[0116] A path solving module 30, used for solving the key path of the project group sequence topology graph based on a dynamic reverse solving algorithm;

[0117] The adjustment module 40 is used to obtain the resource demand matrix and the resource supply vector, and determine whether a resource conflict occurs based on the resource demand matrix and the resource supply vector. If a resource conflict occurs, the resource optimization configuration algorithm is used to configure resources, so as to obtain the best project group single code network diagram.

[0118] In a specific embodiment, the network diagram construction module specifically includes:

[0119] The sub-project network diagram construction module is used to set the number of processes of each sub-project in the distribution network project group to n processes and the number of sub-projects to m. Then the single-code network diagram T of a single project i It can be expressed by formula 1:

[0120] T i =(V i , E) Formula 1

[0121] Among them, V i represents the working time vector, V i =(V i1 ,V i2 ,...,V in ), V ij represents the working hours required for process j of sub-project i; E represents the process adjacency matrix, which has an order of n×n. It expresses the adjacency relationship between processes through the values ​​in the matrix. The expression of the process adjacency matrix E is shown in Formula 2:

[0122]

[0123] A project network diagram building module for single-code network diagrams based on a single project. i The expression of the project group single-code network diagram Q for constructing the distribution network project group is:

[0124] Q=(T i ,F ij ) Formula 3

[0125] In the formula, F ij is the project adjacency matrix, with an order of m×m. It expresses the logical relationship between projects through the adjacent relationship between vertices. The expression of the project adjacency matrix is ​​shown in Formula 4:

[0126]

[0127] In a specific embodiment, the system further includes:

[0128] The process acquisition module is used to obtain the first sub-project in the distribution network project group and its first process, and fill the first process into the project group sequence topology sequence. The project group sequence topology sequence is initially empty.

[0129] The process search module is used to search for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix, and fill the next process found into the project group sequence topology sequence;

[0130] The process deletion module is used to delete the previous process of the next process found, and search for the next process of the next process found in the project group single-code network diagram until the next process is empty, thereby obtaining the filled project group sequence topology sequence to obtain the project group sequence topology diagram.

[0131] In a specific embodiment, the path solving module specifically includes:

[0132] The calculation module is used to calculate the earliest start time C(i,j) through the dynamic programming recursive formula, and the formula is:

[0133] C(i,j)=max{C(k,l)+V(k,l)} Formula 5

[0134] In the formula, C(i,j) is the earliest start time of the jth process of sub-project i, where the start time of the first process of sub-project i is 0, V(k,l) is the previous process of V(i,j), and V(i,j) takes values ​​in sequence according to the process adjacency matrix. The project group sequence topology diagram represents the jth process of sub-project i in the project group sequence topology diagram, and C(k,l) represents the earliest start time of the lth process of sub-project k;

[0135] The process determination module is used to obtain the maximum value of the earliest start time C(i,j) to determine the last process of the last sub-project in the critical path;

[0136] The predecessor process acquisition module is used to set the last process number of the last sub-project as V(i,j), and calculate the predecessor process V(k,l) of the last process V(i,j) of the last sub-project through the process adjacency matrix E and the project adjacency matrix F. If the predecessor process V(k,l) satisfies the condition C(k,l)+V(k,l)=C(i,j), then the process corresponding to V(k,l) is the predecessor process of the last process V(i,j) of the last sub-project on the critical path.

[0137] In a specific embodiment, the adjustment module specifically includes:

[0138] The resource demand acquisition module is used to obtain the resource demand of each sub-project of the distribution network project group and construct a resource demand matrix, which is defined as S. The element S in the resource demand matrix S is jo represents the number of o-th resource required for the j-th process, randomly selects j, finds the non-zero item in the j-th column of S, and obtains the process and resource supply vector used by o resources. The resource supply vector is defined as P o , used to represent the existing quantity of the oth resource, repeat this step until the resource demand matrix of all sub-projects is traversed to obtain the total resource demand of the distribution network project group;

[0139] The resource conflict judgment module is used to determine the resource conflict according to the resource supply vector P o The start time and duration of the same resource process are found for each sub-project based on the total resource demand. If there is time overlap and the corresponding resource demand at the overlapping time is greater than the total resource demand, it is determined that a resource conflict has occurred.

[0140] A resource configuration module is used to use a resource optimization configuration algorithm to perform resource configuration when it is determined that a resource conflict occurs, and obtain several resource configuration plans;

[0141] The comparison module is used to calculate the total construction period of each resource allocation scheme, compare the total construction period corresponding to each resource allocation scheme, determine the minimum total construction period, and thus use the project group single code network diagram corresponding to the minimum total construction period as the best project group single code network diagram.

[0142] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes and limited contents of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0143] The present embodiment provides a distribution network engineering project group progress management system based on dynamic resource optimization. By constructing a project group single-code network diagram of the distribution network engineering project group, the various processes of each sub-project in the project group single-code network diagram are sorted based on the project adjacency matrix to construct a project group sequence topology diagram. The dynamic inverse solution algorithm is also used to solve the critical path of the project group sequence topology diagram. The resource demand matrix and the resource supply vector are used to determine the occurrence of resource conflicts. When resource conflicts occur, the resource optimization configuration algorithm is used to perform resource configuration, thereby obtaining the optimal project group single-code network diagram, thereby improving the accuracy of distribution network engineering project group management.

[0144] In the several embodiments provided by the present invention, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

[0146] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0147] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A distribution network project group progress management method based on dynamic resource optimization, characterized in that: The following steps are involved: A project group single-code network diagram of a distribution network project group is constructed according to a single-code network diagram of a single project in the distribution network project group. The project group single-code network diagram includes a project adjacency matrix. The project adjacency matrix expresses the logical relationship between each project through the adjacent relationship between vertices, specifically including: The number of processes of each sub-project in the distribution network project group is set to n processes, and the number of sub-projects is set to m. Then the single-code network diagram T of a single project i It can be expressed by formula 1: T i =(V i , E) Formula 1 Among them, V i represents the working time vector, V i =(V i1 ,V i2 ,...,V ij ,...,V in ), Vij represents the working hours required for process j of sub-project i; E represents the process adjacency matrix, which has an order of n×n. It expresses the adjacency relationship between processes through the values ​​in the matrix. The expression of the process adjacency matrix E is shown in Formula 2: Single-code network diagram based on a single project i The expression of the project group single-code network diagram Q for constructing the distribution network project group is: Q=(T i ,F ij ) Formula 3 In the formula, F ij is the project adjacency matrix, with an order of m×m. It expresses the logical relationship between projects through the adjacent relationship between vertices. The expression of the project adjacency matrix is ​​shown in Formula 4: Based on the project adjacency matrix, sorting the processes of the sub-projects in the project group single-code network diagram according to a preset topological sorting rule, thereby constructing a project group sequence topological diagram; The preset topological sorting rule is: Get the first sub-project in the distribution network project group and its first process, and fill the first process into the project group sequence topology sequence. The project group sequence topology sequence is initially empty. Searching for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix, and filling the next process found into the project group sequence topology sequence; Delete the previous process of the next process found, and search for the next process found in the project group single code network diagram; Repeat the steps of searching for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix to the step of deleting the previous process of the next process found, until the next process is empty, thereby obtaining a filled project group sequence topology sequence, and obtaining a project group sequence topology diagram; Solving the key path of the project group sequence topology graph based on a dynamic reverse solving algorithm specifically includes: The earliest start time C(i,j) is calculated by the dynamic programming recursive formula, and the formula is: C(i,j)=max{C(k,l)+V(k,l)} Formula 5 In the formula, C(i,j) is the earliest start time of the jth process of sub-project i, where the start time of the first process of sub-project i is 0, V(k,l) is the previous process of V(i,j), V(i,j) takes values ​​in sequence according to the process adjacency matrix, and C(k,l) represents the earliest start time of the lth process of sub-project k; Get the maximum value of the earliest start time C(i,j) to determine the last process of the last sub-project in the critical path; Assume that the last process of the last sub-project is numbered V(i,j), and the immediate predecessor process V(k,l) of the last process V(i,j) of the last sub-project is calculated through the process adjacency matrix E and the project adjacency matrix F. If the immediate predecessor process V(k,l) satisfies the condition C(k,l)+V(k,l)=C(i,j), then the process corresponding to V(k,l) is the immediate predecessor process of the last process V(i,j) of the last sub-project on the critical path. Repeat this step until the first process is found, thereby obtaining all processes on the critical path of the project group sequence topology graph; Obtain the resource demand matrix and resource supply vector, and determine whether a resource conflict occurs based on the resource demand matrix and resource supply vector. If a resource conflict occurs, use the resource optimization configuration algorithm to configure resources, thereby obtaining the best project group single code network diagram.

2. The method for managing the progress of distribution network project groups based on dynamic resource optimization according to claim 1 is characterized in that: The steps of obtaining a resource demand matrix and a resource supply vector, determining whether a resource conflict occurs based on the resource demand matrix and the resource supply vector, and if a resource conflict occurs, performing resource allocation using a resource optimization allocation algorithm to obtain an optimal project group single code network diagram specifically include: Obtain the resource requirements of each sub-project of the distribution network project group and construct a resource requirement matrix, which is defined as S. The element S in the resource requirement matrix S is jo represents the number of o-th resource required for the j-th process, randomly selects j, finds the non-zero item in the j-th column of S, and obtains the process and resource supply vector used by o resources. The resource supply vector is defined as P o , used to represent the existing quantity of the oth resource, repeat this step until the resource demand matrix of all sub-projects is traversed to obtain the total resource demand of the distribution network project group; According to the resource supply vector P o The start time and duration of the same resource process are found for each sub-project based on the total resource demand. If there is time overlap and the corresponding resource demand at the overlapping time is greater than the total resource demand, it is determined that a resource conflict has occurred. If it is determined that a resource conflict occurs, a resource optimization configuration algorithm is used to perform resource configuration and obtain several resource configuration schemes; Calculate the total construction period of each resource allocation plan, compare the total construction periods corresponding to each resource allocation plan, determine the minimum total construction period, and use the project group single-code network diagram corresponding to the minimum total construction period as the optimal project group single-code network diagram.

3. A distribution network project group progress management system based on dynamic resource optimization, characterized in that: include: A network diagram construction module, used to construct a project group single-code network diagram of a distribution network project group according to a single-code network diagram of a single project in the distribution network project group, wherein the project group single-code network diagram includes a project adjacency matrix, and the project adjacency matrix expresses the logical relationship between each project through the adjacent relationship between vertices; The network diagram construction module specifically includes: The sub-project network diagram construction module is used to set the number of processes of each sub-project in the distribution network project group to n processes and the number of sub-projects to m. Then the single-code network diagram T of a single project i It can be expressed by formula 1: T i =(V i , E) Formula 1 Among them, V i represents the working time vector, V i =(V i1 ,V i2 ,...,V ij ,...,V in ), Vij represents the working hours required for process j of sub-project i; E represents the process adjacency matrix, which has an order of n×n. It expresses the adjacency relationship between processes through the values ​​in the matrix. The expression of the process adjacency matrix E is shown in Formula 2: A project network diagram building module for single-code network diagrams based on a single project. i The expression of the project group single-code network diagram Q for constructing the distribution network project group is: Q=(T i ,F ij ) Formula 3 In the formula, F ij is the project adjacency matrix, with an order of m×m. It expresses the logical relationship between projects through the adjacent relationship between vertices. The expression of the project adjacency matrix is ​​shown in Formula 4: A topology map construction module is used to sort the processes of each sub-project in the project group single-code network diagram according to a preset topology sorting rule based on the project adjacency matrix, so as to construct a project group sequence topology map; A path solving module, used for solving the key path of the project group sequence topology diagram based on a dynamic reverse solving algorithm; The path solving module specifically includes: The calculation module is used to calculate the earliest start time C(i,j) through the dynamic programming recursive formula, and the formula is: C(i,j)=max{C(k,l)+V(k,l)} Formula 5 In the formula, C(i,j) is the earliest start time of the jth process of sub-project i, where the start time of the first process of sub-project i is 0, V(k,l) is the previous process of V(i,j), and V(i,j) takes values ​​in sequence according to the process adjacency matrix. The project group sequence topology diagram represents the jth process of sub-project i in the project group sequence topology diagram, and C(k,l) represents the earliest start time of the lth process of sub-project k; The process determination module is used to obtain the maximum value of the earliest start time C(i,j) to determine the last process of the last sub-project in the critical path; The immediate predecessor process acquisition module is used to set the last process number of the last sub-project as V(i,j), and calculate the immediate predecessor process V(k,l) of the last process V(i,j) of the last sub-project through the process adjacency matrix E and the project adjacency matrix F. If the immediate predecessor process V(k,l) satisfies the condition of C(k,l)+V(k,l)=C(i,j), then the process corresponding to V(k,l) is the immediate predecessor process of the last process V(i,j) of the last sub-project on the critical path; The adjustment module is used to obtain the resource demand matrix and the resource supply vector, and determine whether a resource conflict occurs based on the resource demand matrix and the resource supply vector. If a resource conflict occurs, the resource optimization configuration algorithm is used to configure resources, thereby obtaining the best project group single code network diagram; The process acquisition module is used to obtain the first sub-project in the distribution network project group and its first process, and fill the first process into the project group sequence topology sequence. The project group sequence topology sequence is initially empty. A process search module is used to search for the next process of the distribution network project group in the project group single-code network diagram through the project adjacency matrix and the process adjacency matrix, and fill the next process found into the project group sequence topology sequence; The process deletion module is used to delete the previous process of the next process found, and search for the next process found in the project group single-code network diagram until the next process is empty, thereby obtaining the filled project group sequence topology sequence to obtain the project group sequence topology diagram.

4. The distribution network project group progress management system based on dynamic resource optimization according to claim 3 is characterized in that: The adjustment module specifically includes: The resource demand acquisition module is used to obtain the resource demand of each sub-project of the distribution network project group and construct a resource demand matrix, which is defined as S. The element S in the resource demand matrix S is jo represents the number of o-th resource required for the j-th process, randomly selects j, finds the non-zero item in the j-th column of S, and obtains the process and resource supply vector used by o resources. The resource supply vector is defined as P o , used to represent the existing quantity of the oth resource, repeat this step until the resource demand matrix of all sub-projects is traversed to obtain the total resource demand of the distribution network project group; The resource conflict judgment module is used to determine the resource conflict according to the resource supply vector P o The start time and duration of the same resource process are found for each sub-project based on the total resource demand. If there is time overlap and the corresponding resource demand at the overlapping time is greater than the total resource demand, it is determined that a resource conflict has occurred. A resource configuration module is used to use a resource optimization configuration algorithm to perform resource configuration when it is determined that a resource conflict occurs, and obtain several resource configuration plans; The comparison module is used to calculate the total construction period of each resource allocation scheme, compare the total construction period corresponding to each resource allocation scheme, determine the minimum total construction period, and thus use the project group single code network diagram corresponding to the minimum total construction period as the best project group single code network diagram.