CN115965195A - Multi-person fault positioning optimization method and system based on equivalent inspection time - Google Patents

Multi-person fault positioning optimization method and system based on equivalent inspection time Download PDF

Info

Publication number
CN115965195A
CN115965195A CN202211591014.6A CN202211591014A CN115965195A CN 115965195 A CN115965195 A CN 115965195A CN 202211591014 A CN202211591014 A CN 202211591014A CN 115965195 A CN115965195 A CN 115965195A
Authority
CN
China
Prior art keywords
time
array
unit
person
inspection
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
Application number
CN202211591014.6A
Other languages
Chinese (zh)
Inventor
阮旻智
胡俊波
罗忠
钱超
袁伟
李华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Naval University of Engineering PLA
Original Assignee
Naval University of Engineering PLA
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Naval University of Engineering PLA filed Critical Naval University of Engineering PLA
Priority to CN202211591014.6A priority Critical patent/CN115965195A/en
Publication of CN115965195A publication Critical patent/CN115965195A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

  • Test And Diagnosis Of Digital Computers (AREA)

Abstract

The invention discloses a multi-user fault location optimization method and system based on equivalent inspection time, and belongs to the field of multi-user fault location. The method comprises the following steps: acquiring the state inspection consumption time and the probability of faults occurring in the task time of each unit, and taking the ratio of the state inspection consumption time to the probability of faults occurring in the task time as the equivalent inspection time of the unit; and arranging the units in an ascending order according to the equivalent checking time of each unit to serve as a total checking order after the multi-person fault positioning optimization. The invention can rapidly and effectively make a fault positioning scheme, accurately estimate the probability distribution of time consumed by fault positioning, reduce the average fault positioning time, balance the workload of maintenance personnel and exert the working efficiency of the maintenance personnel to the maximum extent.

Description

Multi-person fault positioning optimization method and system based on equivalent inspection time
Technical Field
The invention belongs to the field of multi-user fault location, and particularly relates to a multi-user fault location optimization method and system based on equivalent inspection time.
Background
After the equipment fails, generally, the fault is located first and then the repair work is carried out. By "fault locating" is meant finding a failed component that is the cause of the fault. As devices/systems become more powerful and more advanced in performance, the devices/systems also become more complex. When a certain fault phenomenon occurs in a complex equipment/system, the possible fault reasons behind the complex equipment/system are numerous, and the workload of searching for a fault unit is huge. Maintenance personnel are an important maintenance resource, and a certain number of maintenance personnel are required to be configured in order to find out a fault piece as soon as possible within a specified time so as to carry out follow-up repair work. In the case of the same number of people, different examination orders are used, and the time consumed is generally different.
When the possible failure causes are more, the number of the detection sequences is staggering. For example, when 10 cells need to be checked, the full arrangement mode exceeds 360 ten thousand, and it is difficult to effectively optimize the checking order in a traversal mode. At present, how to reasonably and effectively determine the inspection sequence usually depends on the personal experience of maintenance personnel, and a scheme which consumes less time and has balanced distribution of the fault positioning workload of the maintenance personnel is urgently needed.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to provide a multi-person fault location optimization method and a multi-person fault location optimization system based on equivalent inspection time, and aims to solve the problems of less time consumption and balanced distribution of fault location workload of maintenance personnel.
In order to achieve the above object, in a first aspect, the present invention provides a method for optimizing multi-person fault location based on equivalent inspection time, where the method includes:
s1, acquiring the state inspection consumption time and the probability of faults occurring in task time of each unit, and taking the ratio of the state inspection consumption time to the probability of faults occurring in the task time as the equivalent inspection time of the unit;
and S2, arranging the units in an ascending order according to the equivalent checking time of the units to serve as a total checking order after the multi-person fault positioning optimization.
Preferably, the method comprises:
and S3, sequentially dividing the units into people according to the total inspection sequence by adopting a principle of balancing the inspection workload of each person to obtain the inspection sequence of each person.
Preferably, step S3 comprises:
s31, initialization checking sequence number i =1+ m, and each element dM (i, 1) = itp in 1 st column of the initialization matrix dM i Recording the initial value of each element in an array mdn of the number of units for which each maintenance worker is responsible is 1, wherein a matrix dM has m rows, the stored number of the units is the number of the units, m represents the number of the maintenance workers, and an array itp represents the optimized total inspection sequence;
s32, initializing a personnel serial number j =1;
s33. Initialize the temporary array ct = dM (j, 1 j ),dM(j,1:mdn j ) Is the first mdn of the jth row vector of the matrix dM j An element;
s34, calculating the workload mt of the temporary array ct j The method comprises the following steps:
s341. Initialize the index id =1, mt of the temporary array ct j =0, and the number of elements in the array ct is recorded as cL;
s342. Initialization Unit number k = ct id Update mt j =mt j +tc k The array tc represents the time consumed for checking the state of each unit;
s343, updating id = id +1, if id is not more than cL, entering S342, and otherwise, entering S35;
s35, updating the serial number j =1+ j, if j is less than or equal to m, entering S33, otherwise, entering S36;
s36, finding the minimum value in the workload array mt, recording the serial number as im, and updating mdn im =mdn im +1,dM(im,mdn im )=itp i
S37, updating i =1+ i, and if i is less than or equal to n, entering S32, wherein n represents the unit number of the complex equipment.
Preferably, the method further comprises:
s4, calculating fault troubleshooting completion time and probability thereof, and average troubleshooting time of each person;
s5, accumulating the average troubleshooting time of each person to obtain the average troubleshooting time of the multi-person fault positioning; and obtaining the probability distribution of the troubleshooting time consumption through ascending order troubleshooting completion time.
Preferably, step S4 comprises:
s41, initializing an inspection serial number i =0, and a person serial number j =1;
s42, mean time tm of fault location of initializer j j =0, from 1 to mdn in the jth row vector of the matrix dM j The element(s) of (c) is placed in a temporary array ct, the matrix dM has m rows, the stored unit number is the unit number, and m represents the number of maintenance personnel;
s43, calculating the mean time tm of fault location of the worker j j And a workload mt j The method comprises the following steps:
s431, initializing tm j =0, subscript id =1 of the temporary array ct;
s432, updating i = i +1, and enabling unit number k = ct id Temporary time array tu id =tc k
Figure BDA0003994345820000031
Fault locating completion time->
Figure BDA0003994345820000032
tm j =tm j +pd i td i
S433, updating id = id +1, and if id is less than or equal to mdn j S432, otherwise, the workload mt of the person j j =td i Then, the process proceeds to S44;
s44, updating the serial number j =1+ j, and if j is less than or equal to m, entering S42, otherwise, entering S5.
Preferably, step S5 includes:
s51, calculating the average of the schemeTime to fault location
Figure BDA0003994345820000033
S52, sequencing the elements in the array td from small to large, storing the sequencing result in tx, and recording the element serial number corresponding to the sequencing result in im;
s53, calculating a probability array px according to im, recording the number of elements in an array td as nd, initializing i =1, and including:
s531, initializing a unit number k = im i ,pt i =pd k Pd represents a conditional probability array, calculating the probability
Figure BDA0003994345820000041
S532, updating i = i +1, if i is less than or equal to nd, entering S531, and otherwise, outputting relevant variables of the optimized scheme.
Preferably, the types of the units are the same or different, the types including: an electronic unit, a mechanical unit, or an electromechanical unit.
In order to achieve the above object, in a second aspect, the present invention provides a multi-person fault location optimization system based on equivalent inspection time, including: a processor and a memory; the memory is used for storing computer execution instructions; the processor is configured to execute the computer-executable instructions to cause the method of the first aspect to be performed.
Generally, compared with the prior art, the above technical solution conceived by the present invention has the following beneficial effects:
the invention discloses a multi-person fault positioning optimization method and a multi-person fault positioning optimization system based on equivalent inspection time, wherein the ratio of the time consumed by state inspection to the probability of faults occurring in task time is used as the equivalent inspection time of a unit, all the units are arranged in an ascending order according to the equivalent inspection time of all the units and used as a total inspection sequence after multi-person fault positioning optimization, a fault positioning scheme can be quickly and effectively formulated, the probability distribution of the time consumed by fault positioning is accurately estimated, the average fault positioning time is reduced, the workload of maintenance personnel is balanced, and the working efficiency of the maintenance personnel is exerted to the maximum.
Drawings
Fig. 1 is a flowchart of a multi-user fault location optimization method based on equivalent inspection time according to the present invention.
Fig. 2 shows tx and px results obtained by the simulation method and the method of the present invention.
Fig. 3 shows the mean time to failure location for 1000 random schemes according to an embodiment of the present invention.
Fig. 4 shows the difference between the human work according to the random schemes provided by the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Fig. 1 is a flowchart of a multi-user fault location optimization method based on equivalent inspection time according to the present invention. As shown in fig. 1, the method includes:
s1, acquiring the state inspection consumption time of each unit and the probability of faults occurring in the task time, and taking the ratio of the state inspection consumption time to the probability of faults occurring in the task time as the equivalent inspection time of the unit.
Preferably, the units are of the same or different types, including: an electronic unit, a mechanical unit, or an electromechanical unit.
And S2, arranging the units in an ascending order according to the equivalent checking time of the units to serve as a total checking order after the multi-person fault positioning optimization.
Preferably, the method comprises: and S3, according to the total inspection sequence, sequentially dividing the units into people by adopting a principle of balancing the inspection workload of each person to obtain the inspection sequence of each person.
Preferably, step S3 comprises:
s31, initializing each element dM (i, 1) = itp in the 1 st column of the matrix dM i Recording initial values of elements in a unit number array mdn which is responsible for each maintenance worker to be 1, and initializing an inspection sequence number i =1+ m, wherein the matrix dM has m rows, the unit numbers are stored, m represents the number of the maintenance workers, and an array itp represents the optimized total inspection sequence;
s32, initializing a personnel serial number j =1;
s33. Initialize the temporary array ct = dM (j, 1 j ),dM(j,1:mdn j ) Is the first mdn of the jth row vector of the matrix dM j An element;
s34, calculating the workload mt of the temporary array ct j The method comprises the following steps:
s341. Initialize id =1, mt j =0, and the number of elements in the array ct is recorded as cL;
s342. Initialization k = ct jd ,mt j =mt j +tc k
S343, updating id = id +1, if id is not more than cL, entering S342, and otherwise, entering S35;
s35, updating the serial number j =1+ j, if j is less than or equal to m, entering S33, otherwise, entering S36;
s36, finding the minimum value in the workload array mt, recording the serial number as im, and updating mdn im =mdn im +1,dM(im,mdn im )=itp i
S37, updating i =1+ i, and if i is less than or equal to n, entering S32, wherein n represents the unit number of the complex equipment.
Preferably, the method further comprises: and S4, calculating the troubleshooting completion time, the troubleshooting completion probability and the average troubleshooting time of each person.
Preferably, step S4 comprises:
s41, initializing an inspection serial number i =0, and a person serial number j =1;
s42, mean time tm of fault location of initializer j j =0, from 1 to mdn in the jth row vector of the matrix dM j The element(s) of (1) is placed in a temporary array ct, the matrix dM has m rows, the stored unit number is the unit number, and m represents the number of maintenance personnel;
s43, calculating the mean time tm of fault location of the worker j j And a workload mt j The method comprises the following steps:
s431, initializing tm j =0,id=1;
S432, updating i = i +1, and enabling unit number k = ct id Temporary time array tu id =tc k Conditional probability of finding a fault in the ith check
Figure BDA0003994345820000061
Fault locating completion time->
Figure BDA0003994345820000062
tm j =tm j +pd i td i
S433, updating id = id +1, and if id is less than or equal to mdn j S432, otherwise, the workload mt of the person j j =td i Then, the process proceeds to S44;
s44, updating the serial number j =1+ j, and if j is less than or equal to m, entering S42, otherwise, entering S5.
S5, accumulating the average troubleshooting time of each person to obtain the average troubleshooting time of the multi-person fault positioning; and obtaining the probability distribution of troubleshooting time consumption by ascending the troubleshooting completion time.
Preferably, step S5 includes:
s51, calculating the mean fault positioning time of the scheme
Figure BDA0003994345820000063
S52, sequencing the elements in the array td from small to large, storing the sequencing result in tx, and recording the element serial number corresponding to the sequencing result in im;
s53, calculating a probability array px according to im, recording the number of elements in an array td as nd, initializing i =1, and including:
s531, initializing k = im i ,pt i =pd k Calculating the probability
Figure BDA0003994345820000071
S532, updating i = i +1, if i is less than or equal to nd, entering S531, and otherwise, outputting relevant variables of the optimized scheme.
The invention provides a multi-person fault positioning optimization system based on equivalent inspection time, which comprises: a processor and a memory; the memory is used for storing computer execution instructions; the processor is used for executing the computer execution instruction so as to execute the method.
Examples
The embodiment appoints: (1) An installation consists of a plurality of electronic units, the life of each unit being described in terms of time for the sake of convenience of description. (2) at most 1 unit fails at any time. When a certain unit breaks down, the normal work of the equipment can be influenced, and the equipment has certain fault phenomena, so that the repair work needs to be carried out. (3) When the fault is confirmed, the order of checking the states of the units is independent and irrelevant, namely: there are no cases where there are specific requirements on the inspection order, such as "unit a must be inspected first and then unit B". (4) The life distribution law of each unit, the time consumed for performing a (normal or not) status check on each unit, the time to be executed. (5) Each service person has the ability to inspect all units, but each person can only inspect one unit at a time. (6) all maintenance personnel start to check at the same time; after the inspection of a certain unit is finished, if the state of the maintenance personnel is normal, the maintenance personnel continues to inspect the next unit according to the inspection sequence within the range in which the maintenance personnel is responsible for inspection; when a person checks the fault unit, the checking is stopped, and the subsequent stage of repairing the fault element is carried out.
The related variable conventions of this embodiment are as follows: the number of maintenance personnel is recorded as m; the number of units is recorded as n; the lifetime of the unit i obeys an exponential distribution Exp (u) i ) (ii) a The time spent for checking the state of the cell i is denoted as tc i (ii) a The task time is denoted as Tw. These variables are known quantities.
It is known that a certain component consists of 20 electronic units, the task time is 100 hours, 3 maintenance personnel exist, and relevant information is shown in table 1. By adopting the method, a fault positioning scheme is optimized and formulated, the fault positioning effect of the scheme is calculated, and the probability of finding a fault piece within 60min is estimated.
TABLE 1
Figure BDA0003994345820000081
1) The equivalent check time array tp is calculated in a traversal mode, and the result is shown in the table 2.
1.1 Let cell number i =1;
1.2 ) calculation of
Figure BDA0003994345820000082
In the formula, pf i Is the probability of a failure of unit i. />
Figure BDA0003994345820000083
When the k = i,
Figure BDA0003994345820000091
when k ≠ i, it>
Figure BDA0003994345820000092
1.3 I = i +1, if i ≦ n, perform 1.2), otherwise perform 3).
2) The sequence number array ipt was determined and the results are shown in Table 2.
And sequencing the elements in the array tp according to a principle from small to large, and storing element serial numbers corresponding to sequencing results into an array itp. Stored in the array itp is the cell number. For example, ip = [ 12.6.3.3.4 ], after sorting from small to large is completed, itp = [ 3.2 ].
TABLE 2
Figure BDA0003994345820000093
3) An inspection unit is assigned to each repair person. The array mdn =8, 6, the cell number and order results of each person's examination are stored in the scheme matrix dM, the dM results are shown in table 3.
3.1 Initialization matrix dM (i, 1) = itp) for each element dM (i, 1) = itp in column 1 of the matrix dM i
And recording the initial value of each element in the unit number array mdn responsible by each maintenance worker as 1.
Order checking sequence number i =1+ m.
3.2 Let sequence number j =1.
3.3 Let the temporary array ct = dM (j, 1: mdn (m) j ),dM(j,1:mdn j ) Is the first mdn of the jth row vector of the matrix dM j And (4) each element.
3.4 Mt) calculating the work amount mt of the temporary array ct j
3.4.1 Let id =1,mt j =0, and the number of elements in the array ct is recorded as cL;
3.4.2 Let k = ct id ,mt j =mt j +tc k
3.4.3 Id = id +1, if id ≦ cL, perform 3.4.2), otherwise perform 3.5).
3.5 Order j =1+ j, if j ≦ m, execute 3.3), otherwise execute 3.6).
3.6 Find the minimum value among several mt, the sequence number is im, let mdn im =mdn im +1,dM(im,mdn im )=itp i . Stored in dM is the cell number.
3.7 I =1+ i, if i ≦ n, execute 3.2), otherwise, execute 4).
TABLE 3
Figure BDA0003994345820000101
4) And calculating the working state of each maintenance worker. The average failure time tm of each person is: 21.9min, 25.6min and 23.0min, wherein the workload mt is respectively as follows: 209min, 230min and 225min. td and pd are shown in Table 4.
4.1 Let sequence i =0 and sequence j =1.
4.2 Let person j's mean time to failure tm j =0, from 1 to mdn in the jth row vector of the matrix dM j Is arranged atIn the temporary array ct.
4.3 Calculate mean time to failure tm for person j j And a workload mt j The method comprises the following steps:
4.3.1 Tm) initialization j =0,id=1;
4.3.2 Let i = i +1, unit number k = ct id Temporary time array tu id =tc k Conditional probability
Figure BDA0003994345820000111
Fault locating completion time->
Figure BDA0003994345820000112
tm j =tm j +pd i td i
4.3.3 Id = id +1, if id ≦ mdn j 4.3.2) is performed, otherwise, the workload mt of person j j =td i And then proceeds to S44.
4.4 Order j =1+ j, if j ≦ m, execute 4.2), otherwise, execute 5).
5) And calculating the fault positioning effect of the scheme. The mean fault location time Tx =70.5min for this scheme. the tx and px are reordered as shown in Table 4.
5.1 Average fault location time for the solution
Figure BDA0003994345820000113
5.2 The elements in the array td are sorted from small to large, the sorting result is stored in tx, and the element sequence number corresponding to the sorting result is recorded in im. For example td = [25 ] 12 ], tx = [12 ] 30, im = [2 ] 3.
5.3 The completion probability array px is calculated according to im. The number of elements in the array td is denoted as nd, and let i =1.
5.3.1 Let k = im i ,pt i =pd k Order probability
Figure BDA0003994345820000114
5.3.2 Let i = i +1, if i ≦ nd, perform 5.3.1), otherwise perform 6).
TABLE 4
Figure BDA0003994345820000115
Figure BDA0003994345820000121
6) And outputting related variables dM, mt, tx, px and Tx of the optimized scheme.
From 1 to mdn in the jth row vector in the matrix dM j The element of (1) is the unit number and the inspection order of the unit number, mt, which the maintainer j is responsible for inspecting j Is the workload of the person. px of i Is at time tx i The probability of finding a fault within, tx is the mean fault location time for the scheme. From tx i 、px i The different angles from Tx describe the time consuming case of this fault location scheme.
The optimized scheme known by dM is as follows: the maintenance personnel 1 are responsible for checking 8 units, and checking the unit 15, the unit 8, the unit 13, the unit 7, the unit 20, the unit 10, the unit 19 and the unit 12 in sequence, wherein the workload is 209min; the maintenance personnel 2 are responsible for checking 6 units, checking the unit 6, the unit 4, the unit 9, the unit 18, the unit 17 and the unit 1 in sequence, and the workload is 230min; the maintenance personnel 3 are responsible for checking 6 units, and checking the unit 11, the unit 3, the unit 14, the unit 16, the unit 2 and the unit 5 in sequence, wherein the workload is 225min. The difference value of the workload of the maintenance personnel is 21min. The mean fault location time of the scheme is 70.5min. The probability of finding a fault in a specified time by the scheme can be known by tx and px. Since the times in tx approaching 60min are 56 and 64, the corresponding probabilities in px are 0.571 and 0.668, the probability of finding a fault within 60min is between 0.571 and 0.668, approximately 0.6.
A simulation model can be established to verify the correctness of the method, and the simulation model is briefly described as follows:
(1) Generating n random numbers simT i ,1≤i≤n,simT i Subject to unit iAnd (5) a service life distribution rule.
(2) At all simT i The minimum number is found in the sequence number, the corresponding sequence number is marked as g, namely: simT (silicon carbide-titanium carbide) g ≤simT i ,1≤i≤n。
(3) If simT m If Tw is satisfied, the simulation is effective, and according to the serial number g and the checking sequence of each person in the scheme, the fault piece is determined to be found by which repair person, so that the fault positioning time of the simulation can be obtained. The maximum working time of each person can be obtained according to the inspection sequence of each maintenance person.
After a large number of simulations, the mean fault location time can be calculated.
Fig. 2 shows tx and px results obtained by the simulation method and the method of the present invention. As shown in fig. 2, the simulation result of mean time between failure locations of the above-mentioned optimization scheme is 72.0min, which is very consistent with the result of the method.
In the above example, a large number of solutions are generated randomly, and it is time consuming to simulate the fault location of these solutions using simulation. Fig. 3 shows the mean time to failure location for 1000 random schemes according to an embodiment of the present invention. As shown in FIG. 3, the minimum time is 84.1min, the maximum time is 353.6min, the mean time is 172.4min, and the root variance is 44.7. Fig. 4 shows the difference between the maximum workload and the minimum workload of the staff in the random schemes provided by the embodiment of the present invention (described by the difference between the maximum workload and the minimum workload), as shown in fig. 4, the average workload difference is 42.1min, which indicates that the method scheme of the present invention is significantly better than the random schemes in terms of the balance when the staff is assigned to check the workload. A large number of simulation results show that: the method has remarkable optimization effect, can rapidly and effectively make a fault positioning scheme, accurately estimate the probability distribution of time consumed by fault positioning, reduce the average fault positioning time, balance the workload of maintenance personnel and exert the working efficiency of the maintenance personnel to the maximum extent. The invention can quickly realize local optimization, and can quickly provide an optimization result in minutes even if the number n of units and the number m of personnel are large.
It will be understood by those skilled in the art that the foregoing is only an exemplary embodiment of the present invention, and is not intended to limit the invention to the particular forms disclosed, since various modifications, substitutions and improvements within the spirit and scope of the invention are possible and within the scope of the appended claims.

Claims (8)

1. A multi-person fault location optimization method based on equivalent inspection time is characterized by comprising the following steps:
s1, acquiring the state inspection consumption time and the probability of faults occurring in task time of each unit, and taking the ratio of the state inspection consumption time to the probability of faults occurring in the task time as the equivalent inspection time of the unit;
and S2, arranging the units in an ascending order according to the equivalent checking time of the units to serve as a total checking order after the multi-person fault positioning optimization.
2. The method of claim 1, wherein the method comprises:
and S3, according to the total inspection sequence, sequentially dividing the units into people by adopting a principle of balancing the inspection workload of each person to obtain the inspection sequence of each person.
3. The method of claim 2, wherein step S3 comprises:
s31, initialization checking sequence number i =1+ m, and each element dM (i, 1) = itp in 1 st column of the initialization matrix dM i Recording the initial value of each element in an array mdn of the number of units for which each maintenance worker is responsible is 1, wherein a matrix dM has m rows, the stored number of the units is the number of the units, m represents the number of the maintenance workers, and an array itp represents the optimized total inspection sequence;
s32, initializing a personnel serial number j =1;
s33. Initialize the temporary array ct = dM (j, 1 j ),dM(j,1:mdn j ) Is the first mdn of the jth row vector of the matrix dM j An element;
s34, calculating the workload mt of the temporary array ct j The method comprises the following steps:
s341. Initialize the index id =1, mt of the temporary array ct j =0, and the number of elements in the array ct is recorded as cL;
s342. Initialization Unit number k = ct id Update mt j =mt j +tc k The array tc represents the time consumed by checking the state of each unit;
s343, updating id = id +1, if id is not more than cL, entering S342, and otherwise, entering S35;
s35, updating the serial number j =1+ j, and if j is less than or equal to m, entering S33, otherwise, entering S36;
s36, finding the minimum value in the workload array mt, recording the serial number as im, and updating mdn im =mdn im +1,dM(im,mdn im )=itp i
S37, updating i =1+ i, and if i is less than or equal to n, entering S32, wherein n represents the unit number of the complex equipment.
4. The method of claim 2, further comprising:
s4, calculating troubleshooting completion time, probability of the troubleshooting completion time and average troubleshooting time of each person;
s5, accumulating the average troubleshooting time of each person to obtain the average troubleshooting time of the multi-person fault positioning; and obtaining the probability distribution of the troubleshooting time consumption through ascending order troubleshooting completion time.
5. The method of claim 4, wherein step S4 comprises:
s41, initializing an inspection serial number i =0, and a person serial number j =1;
s42, mean time tm of fault location of initializer j j =0, from 1 to mdn in the jth row vector of the matrix dM j The element(s) of (c) is placed in a temporary array ct, the matrix dM has m rows, the stored unit number is the unit number, and m represents the number of maintenance personnel;
s43, calculating the mean time tm of fault location of the worker j j And a workload mt j The method comprises the following steps:
s431, initializing tm j =0, the index id of the temporary array ct =1;
s432, updating i = i +1, and enabling unit number k = ct id Temporary time array tu id =tc k Conditional probability
Figure FDA0003994345810000021
Fault locating completion time->
Figure FDA0003994345810000022
tm j =tm j +pd i td i
S433, updating id = id +1, if id is less than or equal to mdnj, entering S432, and otherwise, judging that the workload mtj of the person j = td i Then, the process proceeds to S44;
s44, updating the serial number j =1+ j, and if j is less than or equal to m, entering S42, otherwise, entering S5.
6. The method of claim 5, wherein step S5 comprises:
s51, calculating the mean fault positioning time of the scheme
Figure FDA0003994345810000023
S52, sequencing the elements in the array td from small to large, storing the sequencing result in tx, and recording the element serial number corresponding to the sequencing result in im;
s53, calculating a probability array px according to im, recording the number of elements in an array td as nd, initializing i =1, and including:
s531, initializing a unit number k = im i ,pt i =pd k Pd represents a conditional probability array, calculating the probability
Figure FDA0003994345810000031
S532, updating i = i +1, if i is less than or equal to nd, entering S531, and otherwise, outputting relevant variables of the optimized scheme.
7. The method of claim 1, wherein the units are of the same or different types, the types comprising: an electronic unit, a mechanical unit, or an electromechanical unit.
8. A multi-person fault location optimization system based on equivalent inspection time, comprising: a processor and a memory;
the memory is used for storing computer execution instructions;
the processor, configured to execute the computer-executable instructions to cause the method of any one of claims 1 to 7 to be performed.
CN202211591014.6A 2022-12-12 2022-12-12 Multi-person fault positioning optimization method and system based on equivalent inspection time Pending CN115965195A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211591014.6A CN115965195A (en) 2022-12-12 2022-12-12 Multi-person fault positioning optimization method and system based on equivalent inspection time

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211591014.6A CN115965195A (en) 2022-12-12 2022-12-12 Multi-person fault positioning optimization method and system based on equivalent inspection time

Publications (1)

Publication Number Publication Date
CN115965195A true CN115965195A (en) 2023-04-14

Family

ID=87353567

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211591014.6A Pending CN115965195A (en) 2022-12-12 2022-12-12 Multi-person fault positioning optimization method and system based on equivalent inspection time

Country Status (1)

Country Link
CN (1) CN115965195A (en)

Similar Documents

Publication Publication Date Title
CN115310048B (en) Method and system for calculating repair probability of equipment in expected time
US20140324520A1 (en) Method for deterministic safety analysis in non-stationary high risk system, control method and control system using thereof
CN111782532B (en) Software fault positioning method and system based on network abnormal node analysis
Cao et al. Reliability improvement allocation method considering common cause failures
CN115759479B (en) Complex equipment fault positioning optimization method and system based on comprehensive value
Nafreen et al. Connecting software reliability growth models to software defect tracking
CN115879719A (en) Traversal partition-based parallel fault positioning optimization method and system
CN115270078B (en) Method and system for calculating average repair time of electromechanical equipment
CN115965195A (en) Multi-person fault positioning optimization method and system based on equivalent inspection time
CN115879720A (en) Inspection sequence optimization method and system adopting universal inspection tool for inspection
CN115688025A (en) Method and system for estimating probability distribution of equipment fault repair time
Volochiy et al. Automation of quantitative requirements determination to software reliability of safety critical NPP I&C systems
CN110688152B (en) Software reliability quantitative evaluation method combining software development quality information
CN115796838A (en) Troubleshooting time estimation method and system for cooperation of multiple persons
CN116029692A (en) Average maintenance time estimation method and system for complex equipment
CN112906237A (en) Engine component fault analysis method and system
CN115293296B (en) Mechanical equipment fault positioning optimization method and system
CN116502845B (en) Method and system for estimating average consumption number of electromechanical equipment spare parts considering maintenance time consumption
CN115600045B (en) Average detection time calculation method and system adopting universal detection tool for detection
JP2024007091A (en) Maintenance management system for power generation plant equipment and maintenance management method for power generation plant equipment
Ryzhov et al. Model of conjoint fault detection at metrological service of electronics
CN105303315A (en) Power equipment reliability evaluation method taking into consideration influence of maintenance randomness
Knezevic 3 MIRCE Science: a mathematical scheme for predicting impacts of reliability engineering on the time evolution of physical systems
CN114936472A (en) Multi-stage task reliability simulation evaluation method for space launch field
CN117057638A (en) Method and system for estimating utilization availability of mechanical parts considering maintenance time consumption

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