CN111860898A - Method and device for updating decision of equipment and electronic equipment - Google Patents
Method and device for updating decision of equipment and electronic equipment Download PDFInfo
- Publication number
- CN111860898A CN111860898A CN202010783224.XA CN202010783224A CN111860898A CN 111860898 A CN111860898 A CN 111860898A CN 202010783224 A CN202010783224 A CN 202010783224A CN 111860898 A CN111860898 A CN 111860898A
- Authority
- CN
- China
- Prior art keywords
- weight
- time point
- acyclic graph
- update
- directed acyclic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 239000011159 matrix material Substances 0.000 claims abstract description 54
- 238000013486 operation strategy Methods 0.000 claims abstract description 28
- 230000003247 decreasing effect Effects 0.000 claims abstract description 16
- 238000012423 maintenance Methods 0.000 claims description 65
- 238000003860 storage Methods 0.000 claims description 31
- 238000004590 computer program Methods 0.000 claims description 24
- 230000006870 function Effects 0.000 claims description 21
- 125000002015 acyclic group Chemical group 0.000 claims description 9
- 230000000875 corresponding effect Effects 0.000 description 33
- 238000010586 diagram Methods 0.000 description 10
- 230000008901 benefit Effects 0.000 description 9
- 230000008569 process Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 5
- 230000001360 synchronised effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000002093 peripheral effect Effects 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 230000008439 repair process Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012886 linear function Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/20—Administration of product repair or maintenance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Abstract
The invention provides a method and a device for updating a decision of equipment and electronic equipment, wherein the method comprises the following steps: establishing a directed acyclic graph G ═ (V, E, W); adjusting the adjacent matrix W to generate a new adjacent matrix W ', and elements W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function; and determining the shortest path of the new directed acyclic graph G '═ V, E and W', and determining an operation strategy at each key time point according to the key time points in the shortest path. By the method and the device for updating the decision of the equipment and the electronic equipment, the problem of determining the optimal operation strategy is converted into the problem of determining the shortest path of the directed acyclic graph. An optimal operation policy is determined based on the shortest path, so that an operation policy at each critical time point can be conveniently determined, and the method canThe net income of all time periods can be considered, and the net income maximization can be effectively guaranteed.
Description
Technical Field
The invention relates to the technical field of equipment updating, in particular to a method and a device for equipment updating decision, electronic equipment and a computer-readable storage medium.
Background
When a factory uses one device, the factory decides at time nodes such as the beginning of each year (or the end of the year), and if the old device is continuously used, a large maintenance fee is paid; if a new device is purchased, an update fee is paid. At this time, how to arrange the strategy of updating the equipment, i.e. making the decision of updating the equipment or continuing to use the old equipment in the beginning of each year, so as to minimize the total expenditure or maximize the total profit, is a technical problem to be solved urgently by the factory.
At present, a factory only arranges an updating strategy based on experience and cannot realize quantitative decision; alternatively, whether or not to replace the equipment is determined simply by considering the difference between the annual maintenance cost and the update cost, and it is difficult to consider the entire situation of the equipment, which is likely to cause a policy error.
Disclosure of Invention
In order to solve the existing technical problem, embodiments of the present invention provide a method and an apparatus for device update decision, an electronic device, and a computer-readable storage medium.
In a first aspect, an embodiment of the present invention provides a method for updating a decision by a device, where the method includes:
establishing a directed acyclic graph G ═ V, E, W, the vertex V of the directed acyclic graph is a key time point arranged in time sequence, the directed edge E of the directed acyclic graph is an edge pointing to the key time point from the previous key time point, and the element W in the adjacency matrix W of the directed acyclic graphijA net profit weight for not performing an updating device operation from an ith said critical time point to a jth said critical time point and performing an updating device operation at a jth said critical time; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
adjusting the adjacent matrix W to generate a new adjacent matrix W ', and elements W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
determining a shortest path of a new directed acyclic graph G '═ V, E, W', and determining an operation strategy at each key time point according to the key time points in the shortest path.
In a second aspect, an embodiment of the present invention further provides an apparatus for updating a decision by a device, where the apparatus includes:
an establishing module, configured to establish a directed acyclic graph G ═ V, E, W, where a vertex V of the directed acyclic graph is a key time point arranged in a time sequence, a directed edge E of the directed acyclic graph is an edge pointing from a previous key time point to a subsequent key time point, and an element W in an adjacency matrix W of the directed acyclic graphijA net profit weight for not performing an updating device operation from an ith said critical time point to a jth said critical time point and performing an updating device operation at a jth said critical time; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
an adjusting module, configured to perform adjustment processing on the adjacent matrix W to generate a new adjacent matrix W ', and an element W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
and the processing module is used for determining the shortest path of the new directed acyclic graph G '(V, E, W'), and determining the operation strategy at each key time point according to the key time points in the shortest path.
In a third aspect, an embodiment of the present invention provides an electronic device, including a bus, a transceiver, a memory, a processor, and a computer program stored on the memory and executable on the processor, where the transceiver, the memory, and the processor are connected via the bus, and when the computer program is executed by the processor, the method for updating a decision of a device according to any one of the foregoing embodiments is implemented.
In a fourth aspect, the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps in the method for device update decision described in any one of the above.
According to the method, the device, the electronic device and the computer-readable storage medium for the device update decision, the key time points are used as vertexes, the sequence between the key time points is used as directed edges to construct a directed acyclic graph, and the net benefit of device maintenance operation and device update operation is not executed in the middle corresponding to the directed edges; and simultaneously, adjusting the adjacency matrix of the directed acyclic graph through a decreasing function, thereby converting the problem of determining the optimal operation strategy into the problem of determining the shortest path of the directed acyclic graph. The optimal operation strategy is determined based on the shortest path, so that the operation strategy at each key time point can be conveniently determined, the method can give consideration to the net benefits of all time periods, and the net benefits can be effectively maximized.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments or the background art of the present invention, the drawings required to be used in the embodiments or the background art of the present invention will be described below.
FIG. 1 is a flow chart illustrating a method for updating a decision by a device according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram illustrating a directed acyclic graph in the method for updating a decision by a device according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of an apparatus for updating a decision by a device according to an embodiment of the present invention;
fig. 4 shows a schematic structural diagram of an electronic device for performing a method for device update decision according to an embodiment of the present invention.
Detailed Description
In the description of the embodiments of the present invention, it should be apparent to those skilled in the art that the embodiments of the present invention can be embodied as methods, apparatuses, electronic devices, and computer-readable storage media. Thus, embodiments of the invention may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), a combination of hardware and software. Furthermore, in some embodiments, embodiments of the invention may also be embodied in the form of a computer program product in one or more computer-readable storage media having computer program code embodied in the medium.
The computer-readable storage media described above may take any combination of one or more computer-readable storage media. The computer-readable storage medium includes: an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of the computer-readable storage medium include: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only Memory (ROM), an erasable programmable read-only Memory (EPROM), a Flash Memory, an optical fiber, a compact disc read-only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any combination thereof. In embodiments of the 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, device, or apparatus.
The computer program code embodied on the computer readable storage medium may be transmitted using any appropriate medium, including: wireless, wire, fiber optic cable, Radio Frequency (RF), or any suitable combination thereof.
Computer program code for carrying out operations for embodiments of the present invention may be written in assembly instructions, Instruction Set Architecture (ISA) instructions, machine related instructions, microcode, firmware instructions, state setting data, integrated circuit configuration data, or in one or more programming languages, including an object oriented programming language, such as: java, Smalltalk, C + +, and also include conventional procedural programming languages, such as: c or a similar programming language. The computer program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be over any of a variety of networks, including: a Local Area Network (LAN) or a Wide Area Network (WAN), which may be connected to the user's computer, may be connected to an external computer.
The method, the device and the electronic equipment are described through the flow chart and/or the block diagram.
It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions. These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing apparatus to function in a particular manner. Thus, the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The embodiments of the present invention will be described below with reference to the drawings.
Fig. 1 shows a flowchart of a method for updating a decision by a device according to an embodiment of the present invention. As shown in fig. 1, the method includes:
step 101: establishing a directed acyclic graph G ═ V, E and W, wherein the vertex V of the directed acyclic graph is a key time point arranged in time sequence, the directed edge E of the directed acyclic graph is an edge pointing to a subsequent key time point from a previous key time point, and the element W in the adjacency matrix W of the directed acyclic graphijTo perform no more from the ith key time point to the jth key time pointNew device operation and performing a net revenue weight of the updated device operation at the jth critical time; wherein the key time point is the time point of executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i.
In the embodiment of the invention, the net income weight in the process of using the equipment is represented by a directed acyclic graph, and the corresponding path when the net income weight is maximum is the corresponding optimal decision. In this embodiment, a time point at which a device maintenance operation needs to be performed or a device update operation needs to be performed is taken as a fixed point of the directed acyclic graph, that is, the fixed point V is a key time point arranged in a time sequence; generally, a factory determines whether to repair or replace equipment (i.e., update equipment) at the end of the year or early year, and the corresponding time point may be set as a critical time point at the beginning or end of the year. For example, the end of year 1, the end of year 2, etc. are taken as key time points; meanwhile, the device needs to be purchased for the first time at the initial time point, which is also equivalent to performing one device updating operation, so the initial time point can also be used as a key point. For example, if the first year is the first time, the first year may be the 1 st key time, and the second and third key times may be the 2 nd and 3 rd key times in the order of the first year, the second year, and the like.
Meanwhile, since the key time points have chronological order, the embodiment determines the corresponding directed edge based on the chronological order. In this embodiment, the directed edge E is an edge pointing from a previous key time point to a subsequent key time point, that is, the directed edge is an edge pointing from an ith key time point to a jth key time point, and j > i. As shown in FIG. 2, the vertex of the directed acyclic graph contains 5 key time points v1To v5I.e. vertex V ═ V1,v2,v3,v4,v5The directed edge of the directed acyclic graph contains v1→v2，v3→v5And the like, as shown in fig. 2.
In addition, in the embodiment of the present invention, the element W in the adjacency matrix WijTo perform no update device operation from the ith critical time point to the jth critical time point and perform the update at the jth critical timeNet profit weight for new device operation; wherein j > i. That is, in the directed acyclic graph, v is a vertexiTo vjCorresponding directed edge vi→vjThe weight of (a) is specifically: performing no updating device operation from the ith key time point to the jth key time point, and simultaneously performing the net profit weight when the updating device operation is performed at the jth key time; the net gain weight is used to represent the net gain from the ith key time point to the jth key time point. Specifically, the element w is a time element that is required to perform a maintenance operation or an update operation, since there may be other critical time points from the ith critical time point to the jth critical time pointijOther critical time points between the corresponding ith to jth critical time points require maintenance equipment operations to be performed (i.e., no update equipment operations to be performed). For example, when the 5 key time points are, in order, beginning of year 1, 2, 3, 4, and 5, w is14It means that the refresh device operation is not performed for three years from the beginning of the 1 st year to the beginning of the 4 th year, while the refresh device operation is performed at the beginning of the 4 th year. I.e. w14The corresponding decision is the equipment maintained in the beginning of the 2 nd year, the equipment maintained in the beginning of the 3 rd year and the equipment updated in the beginning of the 4 th year.
Step 102: adjusting the adjacent matrix W to generate a new adjacent matrix W ', and elements W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Where f () is a decreasing function.
In the embodiment of the invention, the optimal operation strategy corresponds to the maximum net gain, namely the larger the net gain, the better the corresponding operation strategy. Therefore, based on the directed acyclic graph, the problem of finding the optimal operation strategy can be converted into the problem of determining the longest path of the directed acyclic graph. Meanwhile, since it is determined that the shortest path of the directed acyclic graph is a mature technique, in this embodiment, the elements in the adjacent matrix W are adjusted based on the decreasing function f (), and the adjusted elements W'ij＝f(wij) I.e. the original element wijThe larger the element w 'after adjustment'ijThe smaller the size, the more will beThe problem of determining the longest path of an acyclic graph G ═ V, E, W translates to: the problem of determining the shortest path of the new directed acyclic graph G ═ V, E, W'.
At the same time, due to the presence of invalid elements in the adjacency matrix of the directed acyclic graph, e.g. w21、w11For example, when the adjustment processing is performed on the adjacency matrix W, the invalid elements may not be adjusted.
Optionally, since element wijRepresenting net revenue, and adjusted element w 'when determining shortest path'ijSummation is required; to avoid decrementing the function f () adjusted element w'ijThe correspondence between the change and the net gain when summing, the decreasing function f () in this embodiment is a linear function, i.e., f (w)ij)＝-awij+ b; wherein a and b are both adjustment coefficients, and a is greater than 0. Optionally, adjusted element w'ijCan be directly-wijI.e. w'ij＝-wij。
Step 103: and determining the shortest path of the new directed acyclic graph G '═ V, E and W', and determining an operation strategy at each key time point according to the key time points in the shortest path.
In the embodiment of the present invention, after determining the new directed acyclic graph G '═ V, E, W', the shortest path of the directed acyclic graph may be determined based on the existing shortest path algorithm, for example, the shortest path may be obtained based on Dijkstra algorithm (Dijkstra), and then the operation policy at each critical time point may be determined based on the shortest path.
Specifically, the step of determining the operation policy at each critical time point according to the critical time points in the shortest path includes: performing an update device operation at a critical point in time contained in the shortest path; the service equipment operation is performed at a critical point in time not included in the shortest path. In the embodiment of the invention, the element w in the adjacency matrixijNo equipment updating operation is performed between the i critical time points and the j critical time point, so that in the shortest path determined in this embodiment, if a certain critical time point is skipped over by the shortest path, i.e., the shortest path does not include the critical time point, the shortest path is determinedThe equipment updating operation is not executed at the key time point, and the equipment maintenance operation is correspondingly executed; at the same time, the element wijThe updating device operation is executed at the jth critical time, so the updating device operation needs to be executed at the critical time point included in the shortest path. For example, there is a vertex V ═ { V) of the directed acyclic graph1,v2,v3,v4,v5At this time, the value of v needs to be determined1To v5Is the shortest path of (v)1,v5Respectively representing initial key time points and final key time points; if the determined shortest path is v1→v2→v5Then the 2 nd critical time point is located in the shortest path, and the 3 rd and 4 th critical time points are not located in the shortest path, so the finally determined operation policy is: update equipment operations are performed at the 2 nd critical time point and repair equipment operations are performed at the 3 rd and 4 th critical time points.
The method for updating the decision of the equipment, provided by the embodiment of the invention, is characterized in that the key time points are used as vertexes, the sequence among the key time points is used as directed edges to construct a directed acyclic graph, and the middle corresponding to the directed edges does not execute equipment maintenance operation and finally executes net income of equipment updating operation; and simultaneously, adjusting the adjacency matrix of the directed acyclic graph through a decreasing function, thereby converting the problem of determining the optimal operation strategy into the problem of determining the shortest path of the directed acyclic graph. The optimal operation strategy is determined based on the shortest path, so that the operation strategy at each key time point can be conveniently determined, the method can give consideration to the net benefits of all time periods, and the net benefits can be effectively maximized.
On the basis of the foregoing embodiment, in the step 101 "establishing a directed acyclic graph G ═ V, E, W", the process of determining the adjacency matrix specifically includes:
step A1: determining an update weight when the update device operation is performed at each key time point, and determining a profit weight after each lapse of a target period and a maintenance weight when the maintenance device operation is performed when the update device operation is not performed; the target period is a time period between two adjacent key time points.
In the embodiment of the present invention, the update weight when the update device operation is performed represents the update cost or the update cost when the update device is updated, and the larger the update weight is, the larger the corresponding update cost is. Similarly, the profit weight represents the profit generated in the kth target period after k-1 target periods without performing the equipment updating operation, and correspondingly, the maintenance weight represents the maintenance weight corresponding to the kth target period after k-1 target periods without performing the equipment updating operation; wherein the target period represents a time period between two adjacent key time points, and the maintenance weight can be generally: and when the ending time point of the kth target period is taken as a key time point, the maintenance cost when the maintenance equipment is operated is executed, and the larger the maintenance weight is, the higher the corresponding maintenance cost is.
In addition, since the key time points are periodic, that is, the time period between adjacent key time points is fixed, that is, a target period is spaced between adjacent key time points; and the revenue that can be realized later for a new piece of equipment, and the corresponding maintenance costs, is generally not correlated to the point in time, e.g., the revenue that can be generated by newly purchased equipment in the beginning of year 1 within one year (i.e., within year 1) should be the same as the revenue that can be generated by newly purchased equipment in the beginning of year 3 within one year (i.e., within year 3). The corresponding revenue weight and maintenance weight is determined in this embodiment based on the length of the target period experienced by the equipment.
In this embodiment, when determining the operation strategy, the plant may make a work plan of a specific duration, such as a five-year plan, a ten-year plan, and the like, and further, the operation strategy of the end of year or the beginning of year needs to be determined. For example, in the present embodiment, a five-year plan is created, i.e., the time span of the plan is five years, and the corresponding operation strategy needs to be determined at the end of each year. Then a total of six key time points are involved in this embodiment: the update weight (or update cost) when performing the update device operation at each key time point in the early 1 st year, late 2 nd year, …, and late 5 th year can be specifically shown in table 1 below:
TABLE 1
| Critical point in time vj | 1 | 2 | 3 | 4 | 5 | 6 |
| Update the weight cj | 0 | 1.5 | 2.2 | 2.5 | 3 | 0 |
Wherein the update weight cjIndicating the cost of the update when the operation of the updating device is performed at the j-th critical point in time, e.g. c32.5 means that the cost of replacing a new device at the end of year 2 is 2.5. Meanwhile, since the 1 st key time point and the 6 th key time point are respectively the starting time point and the ending time point, the corresponding updating cost can be set to be zero, that is, the operation strategy can not be considered at this time. Of course, the corresponding update weights for the start and end time points may also be determined, such as determining the cost required to update the device at the end of the 5 th year.
Meanwhile, the interval duration between the key time points is 1 year, that is, the target period is 1 year, and the income weight and the maintenance weight (or the maintenance cost) of the equipment in the current year after every 1 year is specifically shown in the following table 2:
TABLE 2
| Period k | 1 | 2 | 3 | 4 | 5 |
| Profit weight rk | 5 | 1.5 | 4 | 3.75 | 3 |
| Maintenance weight uk | 0.5 | 1 | 1.5 | 2 | 2.5 |
Wherein the profit weight rkIndicating that the kth target is not performing the update device operationPeriodic revenue weight; accordingly, the maintenance weight ukThe maintenance weight corresponding to the kth target period is indicated when the equipment updating operation is not executed, and is generally the maintenance weight for executing the equipment maintenance operation when the kth target period is ended. For example, r in Table 23Representing the profit weight in the third year from the time of updating the device; u. of3It represents the cost of maintaining the equipment at the end of the third year, since the time after updating the equipment. Specifically, if the time is at the end of year 1 (i.e., the 2 nd key time point v)2) The update device operation is performed, then r3Represents the profit weight in the third year (i.e., in year 4) from the end of year 1; accordingly, u3It means the cost for maintaining the equipment at the end of the third year (i.e., the aforementioned 5 th key time point: the end of 4 th year) from the end of the 1 st year.
Step A2: determining elements W in the adjacency matrix W according to the corresponding update weights, revenue weights and maintenance weightsijAnd is and
wherein r iskAnd ukRespectively representing the profit weight and the maintenance weight corresponding to the k-th target period after k-1 target periods of non-execution of the updating device operation.
In the embodiment of the invention, after the corresponding update weight, the income weight and the maintenance weight are determined, the method can be based on the formula
Determining each element wij. At this time, the element wijAnd (3) representing that all maintenance weights and updating weights when equipment is updated at the jth key time point are subtracted from the ith key time point to the jth key time point, and finally, the net profit weight from the ith key time point to the jth key time point is obtained through calculation.
For example, as shown in tables 1 and 2 above, w14Indicates that v is from the beginning of the 1 st year1By the end of year 3 v4Net gain of (2); at this time, the service life of the equipment is 1, 2 and 3 years, and based on table 2, the income weight of three years is 5+4.5+4 ═ 13.5, and the corresponding maintenance weight of three years is 0.5+1+1.5 ═ 3; meanwhile, as can be seen from table 1, the weight for replacing the equipment at the end of the 3 rd year is 2.5, so w14＝13.5-3-2.5＝8。
In the same way, w36Indicates that v is from the end of 3 years4By the end of year 5 v6Net gain of (2); at this time, the service life of the equipment is still 1, 2 and 3 years, so the income weight and the maintenance weight of three years are still 13.5 and 3 respectively; meanwhile, as can be seen from table 1, the weight for replacing the device at the end of the 5 th year is 0, so w3610.5. All elements w can be determined in the same wayijThe final determined adjacency matrix is:
wherein, the element w corresponding to i ≧ j in the adjacency matrixijIs an invalid element. After the adjacency matrix is determined, an optimal operation policy may be determined based on the above steps 102 and 103. For example, the present embodiment takes the negation function as a decreasing function, i.e., w'ij＝-wijIf the new directed acyclic graph is G' ═ V, E, -W; based on Dijstra algorithm, the shortest path is obtained as v1→v2→v3→v4→v6The path length is-17, i.e. the operation policy of the device is:
1)v1→v2the new equipment is updated in 1 year from the beginning to the end of the 1 st year in 1 year and at the end of the 1 st year, and the corresponding benefit-maintenance cost-updating cost is 5-0.5-1.5-3;
2)v2→v3the plant is upgraded at the end of year 1, with a new plant upgraded at the end of year 1, at the end of year 2 (early 3), with a benefit-maintenance cost-upgrade cost of 5-0.5-1.5-3;
3)v3→v4the new equipment is updated at the end of 2 years, the equipment is updated at the end of 1 year and 3 years (early 4 years), and the benefit-maintenance cost-update cost is 5-0.5-1.5＝3；
4)v4→v6The new equipment is updated at the end of 3 years, and the equipment is not updated until the end of 5 years after the new equipment is used for 2 years, so that the benefit-maintenance cost-update cost is (5+4.5) - (0.5+1) -0-8. The total yield is: 3+3+3+8 ═ 17.
The method for updating the decision of the equipment, provided by the embodiment of the invention, is characterized in that the key time points are used as vertexes, the sequence among the key time points is used as directed edges to construct a directed acyclic graph, and the middle corresponding to the directed edges does not execute equipment maintenance operation and finally executes net income of equipment updating operation; and simultaneously, adjusting the adjacency matrix of the directed acyclic graph through a decreasing function, thereby converting the problem of determining the optimal operation strategy into the problem of determining the shortest path of the directed acyclic graph. The optimal operation strategy is determined based on the shortest path, so that the operation strategy at each key time point can be conveniently determined, the method can give consideration to the net benefits of all time periods, and the net benefits can be effectively maximized.
The method for updating a decision by a device according to an embodiment of the present invention is described in detail above with reference to fig. 1 to fig. 2, and the method may also be implemented by a corresponding apparatus.
Fig. 3 is a schematic structural diagram illustrating an apparatus for updating a decision by a device according to an embodiment of the present invention. As shown in fig. 3, the apparatus for updating a decision includes:
an establishing module 31, configured to establish a directed acyclic graph G ═ V, E, W, where a vertex V of the directed acyclic graph is a key time point arranged in a time sequence, a directed edge E of the directed acyclic graph is an edge pointing from a previous key time point to a subsequent key time point, and an element W in an adjacency matrix W of the directed acyclic graphijA net profit weight for not performing an updating device operation from an ith said critical time point to a jth said critical time point and performing an updating device operation at a jth said critical time; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
an adjusting module 32, configured to perform adjustment processing on the adjacent matrix W to generate a new adjacent matrix W ', and an element W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
a processing module 33, configured to determine a shortest path of the new directed acyclic graph G '═ V, E, W', and determine an operation policy at each of the critical time points according to the critical time points in the shortest path.
On the basis of the foregoing embodiment, the establishing module 31, establishing a directed acyclic graph G ═ V, E, W, includes:
determining an update weight when the update device operation is performed at each of the key time points, and determining a profit weight after each lapse of a target period and a maintenance weight when the maintenance device operation is performed when the update device operation is not performed; the target period is a time period between two adjacent key time points;
determining an element W in the adjacency matrix W according to the corresponding update weight, the income weight, and the maintenance weightijAnd is and
wherein, cjRepresenting the update weight when the update device operation is performed at jth of said key time points, rkAnd ukRespectively representing the profit weight and the maintenance weight corresponding to the k-th target period after k-1 target periods of non-execution of the updating device operation.
On the basis of the above-described embodiment, f (w)ij)＝-awij+ b; wherein a and b are both adjustment coefficients, and a is greater than 0.
On the basis of the above embodiment, the processing module 33 determines the operation policy at each critical time point according to the critical time points in the shortest path, including:
performing an update device operation at a critical point in time contained in the shortest path; performing a service equipment operation at a critical point in time not included in the shortest path.
The device for updating the decision of the equipment provided by the embodiment of the invention constructs the directed acyclic graph by taking the key time points as vertexes and the sequence between the key time points as directed edges, does not execute the operation of maintaining the equipment in the middle corresponding to the directed edges, and finally executes the net gain of updating the equipment operation; and simultaneously, adjusting the adjacency matrix of the directed acyclic graph through a decreasing function, thereby converting the problem of determining the optimal operation strategy into the problem of determining the shortest path of the directed acyclic graph. The optimal operation strategy is determined based on the shortest path, so that the operation strategy at each key time point can be conveniently determined, the device can give consideration to the net benefits of all time periods, and the net benefits can be effectively maximized.
In addition, an embodiment of the present invention further provides an electronic device, including a bus, a transceiver, a memory, a processor, and a computer program stored in the memory and executable on the processor, where the transceiver, the memory, and the processor are connected via the bus, and when the computer program is executed by the processor, each process of the method for device update decision is implemented, and the same technical effect can be achieved, and details are not described here to avoid repetition.
Specifically, referring to fig. 4, an embodiment of the present invention further provides an electronic device, which includes a bus 1110, a processor 1120, a transceiver 1130, a bus interface 1140, a memory 1150, and a user interface 1160.
In an embodiment of the present invention, the electronic device further includes: a computer program stored on the memory 1150 and executable on the processor 1120, the computer program when executed by the processor 1120 performing the steps of:
establishing a directed acyclic graph G ═ V, E, W, the vertex V of the directed acyclic graph is a key time point arranged in time sequence, the directed edge E of the directed acyclic graph is an edge pointing to the key time point from the previous key time point, and the element W in the adjacency matrix W of the directed acyclic graphijNo updating device operation is performed from the ith key time point to the jth key time point, and at the jth key time pointPerforming a net profit weight for the updated device operation; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
adjusting the adjacent matrix W to generate a new adjacent matrix W ', and elements W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
determining a shortest path of a new directed acyclic graph G '═ V, E, W', and determining an operation strategy at each key time point according to the key time points in the shortest path.
Optionally, when the computer program is executed by the processor 1120 in the step of "establishing a directed acyclic graph G ═ V, E, W", the processor is caused to implement the following steps:
determining an update weight when the update device operation is performed at each of the key time points, and determining a profit weight after each lapse of a target period and a maintenance weight when the maintenance device operation is performed when the update device operation is not performed; the target period is a time period between two adjacent key time points;
determining an element W in the adjacency matrix W according to the corresponding update weight, the income weight, and the maintenance weightijAnd is and
wherein, cjRepresenting the update weight when the update device operation is performed at jth of said key time points, rkAnd ukRespectively representing the profit weight and the maintenance weight corresponding to the k-th target period after k-1 target periods of non-execution of the updating device operation.
Optionally, f (w)ij)＝-awij+ b; wherein a and b are both adjustment coefficients, and a is greater than 0.
Optionally, the computer program, when executed by the processor 1120 to perform the step of determining an operation policy at each of the critical time points according to the critical time points in the shortest path, causes the processor to implement the steps of:
performing an update device operation at a critical point in time contained in the shortest path; performing a service equipment operation at a critical point in time not included in the shortest path.
A transceiver 1130 for receiving and transmitting data under the control of the processor 1120.
In embodiments of the invention in which a bus architecture (represented by bus 1110) is used, bus 1110 may include any number of interconnected buses and bridges, with bus 1110 connecting various circuits including one or more processors, represented by processor 1120, and memory, represented by memory 1150.
Bus 1110 represents one or more of any of several types of bus structures, including a memory bus, and memory controller, a peripheral bus, an Accelerated Graphics Port (AGP), a processor, or a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include: an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA), a Peripheral Component Interconnect (PCI) bus.
The bus 1110 may also connect various other circuits such as peripherals, voltage regulators, or power management circuits to provide an interface between the bus 1110 and the transceiver 1130, as is well known in the art. Therefore, the embodiments of the present invention will not be further described.
The transceiver 1130 may be one element or may be multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. For example: the transceiver 1130 receives external data from other devices, and the transceiver 1130 transmits data processed by the processor 1120 to other devices. Depending on the nature of the computer system, a user interface 1160 may also be provided, such as: touch screen, physical keyboard, display, mouse, speaker, microphone, trackball, joystick, stylus.
It is to be appreciated that in embodiments of the invention, the memory 1150 may further include memory located remotely with respect to the processor 1120, which may be coupled to a server via a network. One or more portions of the above-described networks may be an ad hoc network (ad hoc network), an intranet (intranet), an extranet (extranet), a Virtual Private Network (VPN), a Local Area Network (LAN), a Wireless Local Area Network (WLAN), a Wide Area Network (WAN), a Wireless Wide Area Network (WWAN), a Metropolitan Area Network (MAN), the Internet (Internet), a Public Switched Telephone Network (PSTN), a plain old telephone service network (POTS), a cellular telephone network, a wireless fidelity (Wi-Fi) network, and combinations of two or more of the above. For example, the cellular telephone network and the wireless network may be a global system for Mobile Communications (GSM) system, a Code Division Multiple Access (CDMA) system, a Worldwide Interoperability for Microwave Access (WiMAX) system, a General Packet Radio Service (GPRS) system, a Wideband Code Division Multiple Access (WCDMA) system, a Long Term Evolution (LTE) system, an LTE Frequency Division Duplex (FDD) system, an LTE Time Division Duplex (TDD) system, a long term evolution-advanced (LTE-a) system, a Universal Mobile Telecommunications (UMTS) system, an enhanced Mobile Broadband (eMBB) system, a mass Machine Type Communication (mtc) system, an ultra reliable low latency Communication (urrllc) system, or the like.
It is to be understood that the memory 1150 in embodiments of the present invention can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. Wherein the nonvolatile memory includes: Read-Only Memory (ROM), Programmable ROM (PROM), Erasable PROM (EPROM), Electrically Erasable PROM (EEPROM), or Flash Memory.
The volatile memory includes: random Access Memory (RAM), which acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as: static random access memory (Static RAM, SRAM), Dynamic random access memory (Dynamic RAM, DRAM), Synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), Double Data rate Synchronous Dynamic random access memory (Double Data RateSDRAM, DDRSDRAM), Enhanced Synchronous DRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), and direct memory bus RAM (DRRAM). The memory 1150 of the electronic device described in the embodiments of the invention includes, but is not limited to, the above and any other suitable types of memory.
In an embodiment of the present invention, memory 1150 stores the following elements of operating system 1151 and application programs 1152: an executable module, a data structure, or a subset thereof, or an expanded set thereof.
Specifically, the operating system 1151 includes various system programs such as: a framework layer, a core library layer, a driver layer, etc. for implementing various basic services and processing hardware-based tasks. Applications 1152 include various applications such as: media Player (Media Player), Browser (Browser), for implementing various application services. A program implementing a method of an embodiment of the invention may be included in application program 1152. The application programs 1152 include: applets, objects, components, logic, data structures, and other computer system executable instructions that perform particular tasks or implement particular abstract data types.
In addition, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements each process of the method for device update decision, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here.
In particular, the computer program may, when executed by a processor, implement the steps of:
establishing a directed acyclic graph G ═ V, E, W, the vertex V of the directed acyclic graph is a key time point arranged in time sequence, the directed edge E of the directed acyclic graph is an edge pointing to the key time point from the previous key time point, and the element W in the adjacency matrix W of the directed acyclic graphijNet right of return for not performing update device operations from the ith to the jth critical time points and performing update device operations at the jth critical timeWeighing; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
adjusting the adjacent matrix W to generate a new adjacent matrix W ', and elements W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
determining a shortest path of a new directed acyclic graph G '═ V, E, W', and determining an operation strategy at each key time point according to the key time points in the shortest path.
Optionally, when the computer program is executed by the processor to perform the step of "establishing a directed acyclic graph G ═ V, E, W", the processor is caused to implement the following steps:
determining an update weight when the update device operation is performed at each of the key time points, and determining a profit weight after each lapse of a target period and a maintenance weight when the maintenance device operation is performed when the update device operation is not performed; the target period is a time period between two adjacent key time points;
determining an element W in the adjacency matrix W according to the corresponding update weight, the income weight, and the maintenance weightijAnd is and
wherein, cjRepresenting the update weight when the update device operation is performed at jth of said key time points, rkAnd ukRespectively representing the profit weight and the maintenance weight corresponding to the k-th target period after k-1 target periods of non-execution of the updating device operation.
Optionally, f (w)ij)＝-awij+ b; wherein a and b are both adjustment coefficients, and a is greater than 0.
Optionally, the computer program, when executed by the processor, causes the processor to perform the step of determining an operation policy at each of the critical time points from the critical time points in the shortest path, the step of:
performing an update device operation at a critical point in time contained in the shortest path; performing a service equipment operation at a critical point in time not included in the shortest path.
The computer-readable storage medium includes: permanent and non-permanent, removable and non-removable media may be tangible devices that retain and store instructions for use by an instruction execution apparatus. The computer-readable storage medium includes: electronic memory devices, magnetic memory devices, optical memory devices, electromagnetic memory devices, semiconductor memory devices, and any suitable combination of the foregoing. The computer-readable storage medium includes: phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), non-volatile random access memory (NVRAM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic tape cartridge storage, magnetic tape disk storage or other magnetic storage devices, memory sticks, mechanically encoded devices (e.g., punched cards or raised structures in a groove having instructions recorded thereon), or any other non-transmission medium useful for storing information that may be accessed by a computing device. As defined in embodiments of the present invention, the computer-readable storage medium does not include transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses traveling through a fiber optic cable), or electrical signals transmitted through a wire.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus, electronic device and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electrical, mechanical or other form of connection.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to solve the problem to be solved by the embodiment of the invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present invention may be substantially or partially contributed by the prior art, or all or part of the technical solutions may be embodied in a software product stored in a storage medium and including instructions for causing a computer device (including a personal computer, a server, a data center, or other network devices) to execute all or part of the steps of the methods of the embodiments of the present invention. And the storage medium includes various media that can store the program code as listed in the foregoing.
The above description is only a specific implementation of the embodiments of the present invention, but the scope of the embodiments of the present invention is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the embodiments of the present invention, and all such changes or substitutions should be covered by the scope of the embodiments of the present invention. Therefore, the protection scope of the embodiments of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for updating a decision by a device, comprising:
establishing a directed acyclic graph G ═ V, E, W, the vertex V of the directed acyclic graph is a key time point arranged in time sequence, the directed edge E of the directed acyclic graph is an edge pointing to the key time point from the previous key time point, and the element W in the adjacency matrix W of the directed acyclic graphijA net profit weight for not performing an updating device operation from an ith said critical time point to a jth said critical time point and performing an updating device operation at a jth said critical time; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
adjusting the adjacent matrix W to generate a new adjacent matrix W ', and elements W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
determining a shortest path of a new directed acyclic graph G '═ V, E, W', and determining an operation strategy at each key time point according to the key time points in the shortest path.
2. The method of claim 1, wherein the establishing a directed acyclic graph G ═ (V, E, W) comprises:
determining an update weight when the update device operation is performed at each of the key time points, and determining a profit weight after each lapse of a target period and a maintenance weight when the maintenance device operation is performed when the update device operation is not performed; the target period is a time period between two adjacent key time points;
determining an element W in the adjacency matrix W according to the corresponding update weight, the income weight, and the maintenance weightijAnd is and
wherein, cjAt j < th > said keyUpdate weight, r, at the time point when the operation of the updating apparatus is performedkAnd ukRespectively representing the profit weight and the maintenance weight corresponding to the k-th target period after k-1 target periods of non-execution of the updating device operation.
3. The method of claim 1, wherein f (w)ij)＝-awij+ b; wherein a and b are both adjustment coefficients, and a is greater than 0.
4. The method according to any of claims 1-3, wherein said determining an operation policy at each of said critical time points according to said critical time points in said shortest path comprises:
performing an update device operation at a critical point in time contained in the shortest path; performing a service equipment operation at a critical point in time not included in the shortest path.
5. An apparatus for updating a decision by a device, comprising:
an establishing module, configured to establish a directed acyclic graph G ═ V, E, W, where a vertex V of the directed acyclic graph is a key time point arranged in a time sequence, a directed edge E of the directed acyclic graph is an edge pointing from a previous key time point to a subsequent key time point, and an element W in an adjacency matrix W of the directed acyclic graphijA net profit weight for not performing an updating device operation from an ith said critical time point to a jth said critical time point and performing an updating device operation at a jth said critical time; wherein the key time point is the time point for executing the operation of the maintenance equipment or the operation of the updating equipment, and j is more than i;
an adjusting module, configured to perform adjustment processing on the adjacent matrix W to generate a new adjacent matrix W ', and an element W ' in the new adjacent matrix W 'ijIs f (w)ij) (ii) a Wherein f () is a decreasing function;
and the processing module is used for determining the shortest path of the new directed acyclic graph G '(V, E, W'), and determining the operation strategy at each key time point according to the key time points in the shortest path.
6. The apparatus of claim 5, wherein the means for establishing establishes a directed acyclic graph G ═ V, E, W comprises:
determining an update weight when the update device operation is performed at each of the key time points, and determining a profit weight after each lapse of a target period and a maintenance weight when the maintenance device operation is performed when the update device operation is not performed; the target period is a time period between two adjacent key time points;
determining an element W in the adjacency matrix W according to the corresponding update weight, the income weight, and the maintenance weightijAnd is and
wherein, cjRepresenting the update weight when the update device operation is performed at jth of said key time points, rkAnd ukRespectively representing the profit weight and the maintenance weight corresponding to the k-th target period after k-1 target periods of non-execution of the updating device operation.
7. The device of claim 5, wherein f (w)ij)＝-awij+ b; wherein a and b are both adjustment coefficients, and a is greater than 0.
8. The apparatus of any of claims 5-7, wherein the processing module determines the operating policy at each of the critical time points based on the critical time points in the shortest path, comprising:
performing an update device operation at a critical point in time contained in the shortest path; performing a service equipment operation at a critical point in time not included in the shortest path.
9. An electronic device comprising a bus, a transceiver, a memory, a processor and a computer program stored on the memory and executable on the processor, the transceiver, the memory and the processor being connected via the bus, characterized in that the computer program, when executed by the processor, implements the steps in the method of device update decision according to any of claims 1 to 4.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method for device update decision according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010783224.XA CN111860898A (en) | 2020-08-06 | 2020-08-06 | Method and device for updating decision of equipment and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010783224.XA CN111860898A (en) | 2020-08-06 | 2020-08-06 | Method and device for updating decision of equipment and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111860898A true CN111860898A (en) | 2020-10-30 |
Family
ID=72971496
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010783224.XA Pending CN111860898A (en) | 2020-08-06 | 2020-08-06 | Method and device for updating decision of equipment and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111860898A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113238770A (en) * | 2021-04-13 | 2021-08-10 | 中车工业研究院有限公司 | Product platform updating method and device, electronic equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070086358A1 (en) * | 2005-10-18 | 2007-04-19 | Pascal Thubert | Directed acyclic graph computation by orienting shortest path links and alternate path links obtained from shortest path computation |
| US20090094076A1 (en) * | 2007-10-05 | 2009-04-09 | Reddy Sudhakar Y | Method and system using linear programming for estimating test costs for bayesian diagnostic models |
| US20110098982A1 (en) * | 2009-10-22 | 2011-04-28 | Dassault Systemes | Method and system for updating a modeled object in a product lifecycle management system |
| US20140156329A1 (en) * | 2012-11-30 | 2014-06-05 | Dassault Systemes DELMIA Corp. | Canonical Availability Representations For Bills Of Materials |
| US20150186798A1 (en) * | 2013-12-31 | 2015-07-02 | Cisco Technology, Inc. | Learning data processor for distributing learning machines across large-scale network infrastructures |
| US20170353292A1 (en) * | 2016-06-02 | 2017-12-07 | Cisco Technology, Inc. | Directed acyclic graph optimization based on timing information for generating optimized network clock |
| CN107667505A (en) * | 2015-06-05 | 2018-02-06 | 思科技术公司 | System for monitoring and managing data center |
| CN108062615A (en) * | 2016-11-07 | 2018-05-22 | 富士通株式会社 | Production plan apparatus and method and non-transitory computer-readable storage media |
| CN108337239A (en) * | 2017-01-10 | 2018-07-27 | 信特尼有限公司 | The event of electronic equipment proves |
| CN108595255A (en) * | 2018-04-13 | 2018-09-28 | 武汉理工大学 | Workflow task dispatching method based on shortest path first in geographically distributed cloud |
-
2020
- 2020-08-06 CN CN202010783224.XA patent/CN111860898A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070086358A1 (en) * | 2005-10-18 | 2007-04-19 | Pascal Thubert | Directed acyclic graph computation by orienting shortest path links and alternate path links obtained from shortest path computation |
| US20090094076A1 (en) * | 2007-10-05 | 2009-04-09 | Reddy Sudhakar Y | Method and system using linear programming for estimating test costs for bayesian diagnostic models |
| US20110098982A1 (en) * | 2009-10-22 | 2011-04-28 | Dassault Systemes | Method and system for updating a modeled object in a product lifecycle management system |
| US20140156329A1 (en) * | 2012-11-30 | 2014-06-05 | Dassault Systemes DELMIA Corp. | Canonical Availability Representations For Bills Of Materials |
| US20150186798A1 (en) * | 2013-12-31 | 2015-07-02 | Cisco Technology, Inc. | Learning data processor for distributing learning machines across large-scale network infrastructures |
| CN107667505A (en) * | 2015-06-05 | 2018-02-06 | 思科技术公司 | System for monitoring and managing data center |
| US20170353292A1 (en) * | 2016-06-02 | 2017-12-07 | Cisco Technology, Inc. | Directed acyclic graph optimization based on timing information for generating optimized network clock |
| CN108062615A (en) * | 2016-11-07 | 2018-05-22 | 富士通株式会社 | Production plan apparatus and method and non-transitory computer-readable storage media |
| CN108337239A (en) * | 2017-01-10 | 2018-07-27 | 信特尼有限公司 | The event of electronic equipment proves |
| CN108595255A (en) * | 2018-04-13 | 2018-09-28 | 武汉理工大学 | Workflow task dispatching method based on shortest path first in geographically distributed cloud |
Non-Patent Citations (1)
| Title |
|---|
| 刘伍颖;卢宇彤;沈志宇;: "面向异构多域环境的全局资源调度研究与实现", 计算机工程与应用, no. 18, 21 June 2006 (2006-06-21), pages 61 - 64 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113238770A (en) * | 2021-04-13 | 2021-08-10 | 中车工业研究院有限公司 | Product platform updating method and device, electronic equipment and storage medium |
| CN113238770B (en) * | 2021-04-13 | 2023-09-15 | 中车工业研究院有限公司 | Product platform updating method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10026050B2 (en) | Association-based product design | |
| CN113726823B (en) | Defense method, defense device, electronic equipment and storage medium | |
| US11055618B2 (en) | Weight adjusted composite model for forecasting in anomalous environments | |
| CN111581627A (en) | Data processing method and device and electronic equipment | |
| WO2023016159A1 (en) | Method and system for predicting network traffic of smart city | |
| CN112348123A (en) | User clustering method and device and electronic equipment | |
| CN111860898A (en) | Method and device for updating decision of equipment and electronic equipment | |
| CN110674397B (en) | Method, device, equipment and readable medium for training age point prediction model | |
| CN115453754A (en) | Super-surface phase coefficient optimization method and device and electronic equipment | |
| CN115496285B (en) | Power load prediction method and device and electronic equipment | |
| CN111429458B (en) | Image restoration method and device and electronic equipment | |
| US9690750B2 (en) | Arithmetic device, arithmetic method, and wireless communication device | |
| CN112532334A (en) | Time synchronization method and device and electronic equipment | |
| US11693916B2 (en) | Solving quadratic integer programming (QIP) problems on optimization solver machines | |
| CN114937058A (en) | System and method for 3D multi-object tracking in LiDAR point clouds | |
| CN111582456B (en) | Method, apparatus, device and medium for generating network model information | |
| CN113875228A (en) | Video frame insertion method and device and computer readable storage medium | |
| CN114584476A (en) | Traffic prediction method, network training device and electronic equipment | |
| US20190108455A1 (en) | Bit prediction method and system using a statistical model | |
| US20210081783A1 (en) | Information processing apparatus, method of processing information, and non-transitory computer-readable storage medium for storing information processing program | |
| WO2024032695A1 (en) | Csi prediction processing method and apparatus, communication device, and readable storage medium | |
| CN110070175B (en) | Image processing method, model training method and device and electronic equipment | |
| CN111767980B (en) | Model optimization method, device and equipment | |
| CN112651775A (en) | Method and device for determining geographical radiation range and electronic equipment | |
| CN111753102A (en) | Public opinion analysis method and device based on affair map and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |