Ship piping system cleaning series washing plan formulation method and device, storage medium and terminal

Abstract

The present invention discloses a method and device, storage medium and terminal for formulating a cleaning and washing scheme for a ship piping system, wherein the method comprises: constructing an undirected graph model based on all piping systems to be washed in a ship system, and obtaining a multi-channel pre-washing circuit; obtaining the number of washing stages based on the multi-channel pre-washing circuit; setting the constraint conditions of each washing stage based on a preset condition group, wherein the preset condition group includes a pipeline cross-connection condition, a cross-cabin condition and a vertex effective washing judgment condition; obtaining a multi-channel washing circuit of each washing stage to obtain a washing circuit set of each washing stage; obtaining a preliminary scheme based on the washing circuit set of all washing stages, calculating the preset performance index of each preliminary scheme, and selecting a preliminary scheme that meets the preset screening conditions as an effective washing scheme. The present invention makes full use of computer technology to assist in manually formulating a cleaning and washing plan for a complex ship piping system, ensuring the scientificity and rationality of the plan while also improving work efficiency.

Description

Technical Field

[0001] The present invention relates to the field of ship testing technology, and in particular to a method and device for formulating a ship piping system cleaning and serial washing plan, a storage medium and a terminal. Background Art

[0002] There are usually a large number of complex piping systems inside the ship to ensure the supply of navigation fuel, lubricating oil, steam, etc. At the same time, the different flowing media in the piping system also have different technical requirements for the piping system itself. In the mooring navigation test before the ship is delivered, the cleaning of various piping systems is an important test content, and usually requires a long test cycle, especially for some special flowing media, which often have very high cleanliness acceptance standards.

[0003] Normally, in a ship mooring navigation test, in order to ensure that all pipe sections and flow-through equipment can be effectively cleaned, if a particular system piping is relatively complex, it is often necessary to conduct multiple series washing tests to ensure that the cleanliness of the entire system meets the requirements. At this time, whether the overall plan of the system piping cleaning test is reasonable or not will greatly affect the overall test cycle and the final cleanliness level. Existing ship piping series washing connections often require manual design, that is, professional employees are required to design loop connections for many pipe systems to be series washed. This type of connection design process is cumbersome, labor-intensive, and prone to design errors. At the same time, this type of design scheme is limited, and the optimal design scheme is often not obtained. Summary of the invention

[0004] The technical problem to be solved by the present invention is that the existing design method of the ship piping system series washing scheme is cumbersome and complicated, with a large workload, and often requires multiple series washing tests to meet the requirements.

[0005] In order to solve the above technical problems, the present invention provides a method for formulating a cleaning and washing plan for a ship piping system, comprising:

[0006] An undirected graph model is constructed based on all pipe systems to be washed in series in the ship system, and based on the undirected graph model, multiple pre-series washing circuits are obtained through a first series washing circuit obtaining method;

[0007] Based on the multiple pre-shuffle loops, the minimum number of pre-shuffle loops that can achieve the maximum number of vertex covers is obtained, and the minimum number of pre-shuffle loops is used as the number of shuffle stages;

[0008] Setting constraints for each series washing stage based on a preset condition group, wherein the preset condition group includes a pipe cross-connection condition, a cross-compartment condition, and a vertex effective series washing determination condition, wherein the pipe cross-connection condition is obtained based on a series washing flow rate restriction condition;

[0009] Through the second serial washing circuit acquisition method, based on the constraint conditions of each serial washing stage and the undirected graph model, multiple serial washing circuits of each serial washing stage are acquired, and all the serial washing circuits of each serial washing stage are aggregated to obtain a serial washing circuit set of each serial washing stage;

[0010] Acquire all the series washing schemes based on the series washing circuit sets of all the series washing stages, and select the series washing scheme with the maximum number of effective cleaning points from all the series washing schemes as a preliminary scheme, wherein each of the series washing schemes includes a series washing circuit in the series washing circuit sets of each series washing stage;

[0011] The preset performance index of each of the preliminary schemes is calculated, and based on the preset performance index, a preliminary scheme that meets the preset screening condition is selected as an effective serial washing scheme.

[0012] Preferably, the first string washing loop acquisition method is a depth-first traversal algorithm.

[0013] Preferably, the condition for determining whether the vertex has been effectively washed is that the liquid flow rate inside the vertex exceeds a preset flow rate, and the vertex can no longer achieve effective washing in the post-washing stage after achieving effective washing in the pre-washing stage.

[0014] Preferably, obtaining a multi-path serial washing circuit of each serial washing stage based on the constraint conditions of each serial washing stage and the undirected graph model through the second serial washing circuit obtaining method includes:

[0015] The constraints of the nth string washing stage are used as the target constraints;

[0016] Based on the target constraint and the undirected graph model, the mth string washing circuit is obtained by the second string washing circuit obtaining method, and it is determined whether m is equal to M. If so, the acquisition of the string washing circuit in the current string washing stage is terminated; otherwise, m is increased by 1, and the mth string washing circuit is obtained again;

[0017] Add 1 to n and determine whether n is greater than the number of the series washing stages. If so, the acquisition of the series washing loop set is terminated. Otherwise, the constraint condition of the nth series washing stage is re-used as the target constraint condition.

[0018] Among them, the initial value of n is 1, and M is the number of serial washing circuits obtained in the nth serial washing stage.

[0019] Preferably, obtaining the serial washing loop by the second serial washing loop obtaining method based on the target constraint condition and the undirected graph model includes:

[0020] Step 1: randomly select a vertex from the undirected graph model as a starting vertex, and use the starting vertex as a current vertex and include it in the searched path;

[0021] Step 2: Determine whether the current vertex has any connected vertices. If so, take all connected vertices of the current vertex as preliminary vertices and group all the preliminary vertices into a preliminary vertex set. Otherwise, execute step 6.

[0022] Step 3: Determine whether the starting vertex is included in the preparation vertex set, if yes, go to step 4, otherwise go to step 5;

[0023] Step 4: Determine whether the number of vertices in the currently searched path is greater than a preset number. If so, connect the starting vertex to the currently searched path to obtain a string-washing loop path and record it, and execute step 7. Otherwise, remove the starting vertex from the prepared vertex set.

[0024] Step 5: Determine whether all the prepared vertices in the prepared vertex set are in the currently searched path. If so, execute step 6. Otherwise, select one of the prepared vertices in the prepared vertex set that are not in the searched path to connect to the searched path, and use the selected prepared vertex as a new current vertex, and execute step 2.

[0025] Step 6: Determine whether the current vertex has a bridging vertex. If so, use all bridging vertices of the current vertex as preliminary vertices, and group all the preliminary vertices into a preliminary vertex set, and then execute step 3; otherwise, execute step 7.

[0026] Step 7: End the connection and use the current serial washing circuit as the final serial washing circuit;

[0027] Among them, in step 6, the method for determining the bridging vertex of the current point vertex is to meet the target constraint condition.

[0028] Preferably, the performance index includes at least one of the number of vertices covered by the cross-connection series washing circuit in each stage, the total number of cross-chamber times, the total length of the cross-connection straight-line distance, and the total volume of clean fuel used in the original pipe system.

[0029] Preferably, the preset screening conditions include at least one of a scheme having a minimum circuit with a maximum number of covered vertices, a scheme having a minimum total number of cross-cabin crossings, a scheme having a shortest total length of a straight-line distance of crossovers, and a scheme having a minimum total volume of clean fuel used in the original pipe system.

[0030] In order to solve the above technical problems, the present invention provides a device for formulating a cleaning and washing scheme for a ship piping system, comprising a pre-washing circuit acquisition module, a washing stage number, a constraint condition setting module, a washing circuit set acquisition module, a preliminary scheme acquisition module and an effective washing scheme acquisition module;

[0031] The pre-series washing circuit acquisition module is used to construct an undirected graph model based on all pipe systems to be washed in the ship system, and acquire multiple pre-series washing circuits through a first series washing circuit acquisition method based on the undirected graph model;

[0032] The number of shuffling stages is used to obtain the minimum number of pre-shuffling loops that can achieve the maximum number of vertex covers based on multiple pre-shuffling loops, and use the minimum number of pre-shuffling loops as the number of shuffling stages;

[0033] The constraint condition setting module is used to set the constraint conditions of each series washing stage based on the preset condition group, wherein the preset condition group includes a pipe cross-connection condition, a cross-chamber condition and a vertex effective series washing judgment condition, and the pipe cross-connection condition is obtained based on the series washing flow rate restriction condition;

[0034] The serial washing circuit set acquisition module is used to acquire all serial washing schemes based on the serial washing circuit sets of all the serial washing stages, and select the serial washing scheme with the maximum number of effective cleaning points from all the serial washing schemes as the preliminary scheme, wherein each of the serial washing schemes includes a serial washing circuit in the serial washing circuit set of each of the serial washing stages;

[0035] The preliminary scheme acquisition module is used to acquire all the series washing schemes based on the series washing circuit sets of all the series washing stages, and select the series washing scheme with the maximum number of effective cleaning fixed points from all the series washing schemes as the preliminary scheme, wherein each of the series washing schemes includes one series washing circuit in the series washing circuit set of each series washing stage;

[0036] The effective serial washing scheme acquisition module is used to calculate the preset performance index of each of the preliminary schemes, and select the preliminary scheme that meets the preset screening conditions as the effective serial washing scheme based on the preset performance index.

[0037] In order to solve the above technical problems, the present invention provides a storage medium on which a computer program is stored, characterized in that when the program is executed by a processor, a method for formulating a cleaning and washing plan for a ship piping system is implemented.

[0038] In order to solve the above technical problem, the present invention provides a terminal, comprising: a processor and a memory, wherein the memory is communicatively connected to the processor;

[0039] The memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that the terminal executes a method for formulating a cleaning and washing plan for a ship piping system.

[0040] Compared with the prior art, one or more embodiments of the above scheme may have the following advantages or beneficial effects:

[0041] The method for formulating a cleaning and washing scheme for a ship piping system provided by an embodiment of the present invention is applied to convert the piping system structure into an undirected graph model, and based on the existing conditions of the undirected graph model, the minimum number of pre-washing loops that can achieve the maximum number of vertex coverage is obtained to determine the number of washing stages, and then the constraints of each washing stage are set based on the restriction conditions, and the washing loops of each washing stage are obtained through computer iteration based on the constraints of each washing stage. When forming the entire cleaning and washing scheme, all washing schemes can be quickly screened by formulating quantitative evaluation indicators to obtain the optimal scheme. Therefore, the present invention makes full use of computer technology to assist in manually formulating a cleaning and washing plan for a complex ship piping system, ensuring the scientificity and rationality of the plan while also improving work efficiency.

[0042] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0044] Figure 1 A schematic diagram of a process for formulating a cleaning and washing plan for a ship piping system according to a first embodiment of the present invention is shown;

[0045] Figure 2 It shows a structural schematic diagram of a device for formulating a cleaning and washing plan for a ship piping system according to a second embodiment of the present invention;

[0046] Figure 3 A schematic diagram of the structure of a terminal according to a fourth embodiment of the present invention is shown. DETAILED DESCRIPTION

[0047] The following will describe the implementation methods of the present invention in detail with reference to the accompanying drawings and embodiments, so that the implementation process of how the present invention applies technical means to solve technical problems and achieve technical effects can be fully understood and implemented accordingly. It should be noted that as long as there is no conflict, the various embodiments of the present invention and the various features in the embodiments can be combined with each other, and the technical solutions formed are all within the protection scope of the present invention.

[0048] There are a large number of complex piping systems inside the ship to ensure the supply of navigation fuel, lubricating oil, steam, etc., and different flowing media in the piping system have different technical requirements for the piping system itself. Usually, in the ship mooring navigation test, in order to ensure that all pipe sections and flow-through equipment can be effectively cleaned, if a specific system piping is more complex, it is often necessary to conduct multiple series washing tests to ensure that the cleanliness of the entire system meets the requirements. At this time, whether the overall plan of the system piping cleaning test is reasonable or not will greatly affect the overall test cycle and the final cleanliness level.

[0049] Embodiment 1

[0050] In order to solve the technical problems existing in the prior art, an embodiment of the present invention provides a method for formulating a cleaning and serial washing plan for a ship piping system.

[0051] Figure 1 FIG. 1 is a flow chart showing a method for formulating a cleaning and washing scheme for a ship piping system according to an embodiment of the present invention; Figure 1 As shown, the method for formulating a cleaning and washing plan for a ship piping system according to an embodiment of the present invention includes the following steps.

[0052] Step S101, constructing an undirected graph model based on all pipe systems to be serially washed in the ship system, and acquiring multiple pre-serial washing circuits through a first serial washing circuit acquisition method based on the undirected graph model.

[0053] Specifically, the pipe system that needs to be washed in series in the ship system is called the pipe system to be washed in series. An undirected graph model is constructed based on all the pipe systems to be washed in series in the ship system. In order to conveniently represent the connected pipe systems and cross-connection conditions between the components in the pipe system, the ports of each pipe section in the pipe system to be washed in series, some flow-through equipment and multi-pipe converging points are used as vertices in the undirected graph model. If there are pipe sections connecting the vertices in the physical pipe system, there will be an undirected edge in the undirected graph accordingly. At this time, the actual distance is temporarily not considered. It should be noted that all the pipe systems to be washed in series in the ship system can be part of the pipe systems in the ship system or all of the pipe systems in the ship system. And the pipe systems of ship systems are usually complex pipe systems.

[0054] Considering that the actual pipe system is usually more complex, including pipe sections of various specifications and different types of flow equipment, and there may be cross-connection restrictions between different pipe sections, it is often difficult to complete the cleaning of all pipe sections with one cross-connection. In order to minimize the number of cross-connection series washing and thus improve the coverage of the vertices in the undirected graph by the entire cleaning test plan, we will divide the entire cleaning test plan into multiple series washing stages for implementation, and the constraints of each series washing stage may be different and need to be set separately.

[0055] Then, based on the obtained undirected graph model, the first string washing circuit acquisition method is used to repeatedly acquire multiple pre-string washing circuits. The number of pre-string washing circuits can be as many as possible, so that when selecting the minimum number of pre-string washing circuits that can achieve the maximum number of vertex covers, the minimum minimum number of pre-string washing circuits can be selected. The first string washing circuit acquisition method is preferably a depth-first traversal algorithm, and the string washing circuit acquisition method that is the same as the second washing circuit acquisition method can also be selected.

[0056] Step S102, based on the multi-path pre-wash loops, the minimum number of pre-wash loops that can achieve the maximum number of vertex covers is obtained, and the minimum number of pre-wash loops is used as the number of wash stages.

[0057] Specifically, the obtained multiple pre-shuffle loops are arranged and combined to obtain multiple combination schemes, and then the best combination scheme is selected from all the combination schemes, so that the selected best combination scheme has the minimum number of pre-shuffle loops that can achieve the maximum number of vertex covers. Then the shuffle stage is determined based on the minimum number of loops, that is, the minimum number of pre-shuffle loops N obtained is used as the number of shuffle stages N.

[0058] Step S103, setting the constraint conditions of each series washing stage based on the preset condition group, wherein the preset condition group includes the pipe cross-connection condition, the cross-compartment condition and the vertex effective series washing judgment condition, and the pipe cross-connection condition is obtained based on the series washing flow rate limitation condition.

[0059] The preset condition group includes pipe cross-connection conditions, cross-compartment conditions and vertex effective series washing judgment conditions. Specifically, the pipe cross-connection conditions are obtained based on the series washing flow rate restriction conditions. That is, the series washing flow rate restriction conditions usually include maximum flow rate restriction conditions and minimum flow rate restriction conditions, and the pipe cross-connection conditions are determined in combination with the sizes of all pipe systems that need series washing in the ship system. Among them, the pipe cross-connection conditions determined based on the series washing flow rate restriction conditions combined with the sizes of all pipe systems that need series washing in the ship system can be determined by the designer according to the actual situation; the series washing flow rate restriction conditions can also be divided into several gears, each gear corresponds to a pipe cross-connection condition, and then after obtaining the specific series washing flow rate restriction conditions, the corresponding pipe cross-connection conditions are obtained based on the specific conditions. The process of setting the pipe cross-connection conditions based on the series washing flow rate is a routine operation of those skilled in the art, and no specific restrictions are imposed on it here. It should be noted that if the ship pipe system to be formulated for the series washing scheme does not need to set the series washing flow rate restriction conditions, the series washing flow rate restriction conditions can be expressed as none, and the corresponding pipe cross-connection conditions are also none at this time.

[0060] The cross-tank condition is the setting condition for whether cross-tank is allowed when the pipeline is cross-connected. For example, it can be that only the cross-tank between the front pump room 1 and the front pump room 2 is allowed. And it should be noted that if the ship piping system to be formulated does not need to set the cross-tank condition, the cross-tank condition can be expressed as none. The effective cross-tank washing judgment condition of the vertex is that the liquid flow rate inside the vertex exceeds the preset flow rate, and the vertex can no longer achieve effective cross-tank washing in the post-cross-tank washing stage after achieving effective cross-tank washing in the front-cross-tank washing stage. In the process of pipeline cross-tank washing, it does not mean that the vertex has achieved effective cross-tank washing as long as there is liquid flowing through, but it is necessary for the flow rate of the liquid in the pipeline to reach a certain speed before the vertex can be considered to have achieved effective cross-tank washing. Further, in the cross-tank washing loop, we can record the vertex with a flow rate greater than the preset flow rate as the protagonist, and the vertex with a flow rate not greater than the preset flow rate as the supporting role. When the ship piping system cross-tank washing scheme includes multiple cross-tank washing stages, the cleaning circuit formed in each cross-tank washing stage must be different, and for each vertex, only if it has become the protagonist in any cross-tank washing stage, it is considered to be able to perform effective cross-tank washing. If a vertex in the ship piping system wash plan has been used as the main character in the previous wash phase, it cannot be set as the main character in the subsequent wash phase. The setting of the above vertex effective wash determination conditions can make all the pipes to be washed effectively as much as possible. It should be noted that if the ship piping system to be washed does not need to set the vertex effective wash determination conditions, the setting of the vertex effective wash determination conditions can be represented by none.

[0061] After obtaining the pipe cross-connection conditions and the vertex effective series washing judgment conditions, the constraints of each series washing stage are set in combination with the cross-cabin conditions. It should be noted that when setting the constraints of each series washing stage, in addition to the above conditions, the constraints of each series washing stage can also be set in combination with the specific actual situation of the ship piping system for which the series washing scheme is to be formulated, wherein the specific actual situation of the ship piping system for which the series washing scheme is to be formulated is likely to bring other additional conditions, which need to be considered when setting the constraints of each series washing stage. At the same time, the pipe cross-connection conditions, the vertex effective series washing judgment conditions and the cross-cabin conditions must be reflected in the constraints. And the constraints of each series washing stage set based on the pipe cross-connection conditions, the vertex effective series washing judgment conditions and the cross-cabin conditions can be set by the designer according to the actual situation; the pipe cross-connection conditions, the vertex effective series washing judgment conditions and the cross-cabin conditions can also be set to several levels, each level corresponds to a setting method of the constraints of each series washing stage, and then after obtaining the specific pipe cross-connection conditions, the vertex effective series washing judgment conditions and the cross-cabin conditions, the setting method of the constraints of each series washing stage is obtained based on the specific conditions. It should be noted that the process of setting the constraints of each series washing stage based on the pipeline cross-connection conditions, the vertex effective series washing judgment conditions, the cross-cabin conditions and other additional restriction conditions is a routine operation of those skilled in the art and is not particularly limited here.

[0062] Step S104, through the second string washing circuit acquisition method, obtain the multi-path string washing circuit of each string washing stage based on the constraint conditions and undirected graph model of each string washing stage, and respectively collect all the string washing circuits of each string washing stage to obtain the string washing circuit set of each string washing stage.

[0063] Specifically, after obtaining the constraints of each series washing stage, the multi-way series washing circuit of each series washing stage can be obtained based on the constraints of each series washing stage for the phase-free graph model through the second series washing circuit acquisition method. Assume that all series washing stages are sorted based on the number of series washing stages N, that is, the first series washing stage, the second series washing stage...the Nth series washing stage are obtained. The multi-way series washing circuit of each series washing stage based on the constraints of each series washing stage and the undirected graph model specifically includes the following steps:

[0064] Step S1041: The constraint condition of the nth series washing stage is used as the target constraint condition. It should be noted that the initial value of n is 1.

[0065] Step S1042, the mth string washing circuit is obtained through the second string washing circuit obtaining method based on the target constraint condition and the undirected graph model. The method of obtaining the string washing circuit through the second string washing circuit obtaining method based on the target constraint condition and the undirected graph model will be described in detail later. It should be noted that the initial value of m is also 1.

[0066] Step S1043, determine whether m is equal to M, if so, end the acquisition of the serial washing loop in the current serial washing stage, otherwise m is increased by 1 and go to step S1042.

[0067] Wherein, M is the number of series washing circuits obtained in the nth series washing stage, and its value may be between 50 and 200 according to the complexity of the piping system, and the M value of each series washing stage may be different.

[0068] Step S1043, add 1 to n and determine whether n is greater than the number of serial washing stages. If so, end the acquisition of the serial washing loop set, otherwise go to step S1041.

[0069] Through the above steps, the multi-channel washing circuits of each washing stage can be obtained. Then, the multi-channel washing circuits of each washing stage are respectively assembled to obtain the washing circuit assembly of each washing stage.

[0070] Step S105, obtain all series washing schemes based on the series washing circuit set of all series washing stages, and select the series washing scheme with the maximum number of effective cleaning points from all series washing schemes as the preliminary scheme, wherein each series washing scheme includes a series washing circuit in the series washing circuit set of each series washing stage.

[0071] Specifically, all the serial washing circuits in the serial washing circuit set of all serial washing stages are arranged and combined to obtain all serial washing schemes. It should be noted that each serial washing scheme includes a serial washing circuit in the serial washing circuit set of each serial washing stage, that is, a serial washing circuit is selected from the serial washing circuit set of each serial washing stage and combined to form a serial washing scheme including N stages.

[0072] After obtaining the series washing schemes for all situations, the series washing scheme with the maximum number of effective cleaning points among all the series washing schemes is used as a preliminary scheme, and all the preliminary schemes are screened out from all the series washing schemes.

[0073] Step S106, calculating the preset performance index of each preliminary scheme, and selecting the preliminary scheme that meets the preset screening condition as the effective serial washing scheme based on the preset performance index.

[0074] Specifically, the test cost and energy consumption are mainly considered, and at least one of the number of vertices covered by the cross-connection series washing circuit in each stage, the total number of cross-compartment times, the total length of the cross-connection straight-line distance, and the total volume of clean fuel used in the original pipe system is used as a preset performance indicator. From the perspective of reducing test costs and reducing energy consumption, at least one of the schemes with the maximum number of covered vertices and the minimum number of cross-compartment times, the scheme with the shortest total length of the cross-connection straight-line distance, and the scheme with the smallest total volume of clean fuel used in the original pipe system is used as a preset screening condition. The preset performance indicators of each preliminary scheme are obtained, and then the preliminary scheme that meets the preset screening conditions is selected as an effective series washing scheme based on the preset performance indicators. The effective series washing scheme is a reference scheme for the entire pipe system cleaning test plan, providing technical support for engineering personnel.

[0075] The purpose of the present invention is to generate a series of cleaning schemes for complex pipe systems according to constraints, and then select one or more cleaning schemes with the best comprehensive performance according to the main performance indicators to be considered.

[0076] The method of obtaining the serial washing circuit through the second serial washing circuit obtaining method based on the target constraint condition and the undirected graph model specifically includes:

[0077] Step S421, randomly select a vertex from the undirected graph model as a starting vertex, take the starting vertex as the current vertex and include it in the searched path.

[0078] Specifically, a vertex is randomly selected from the undirected graph model as the starting vertex of the string-shuffling loop, and the starting vertex is recorded in the searched path as the starting vertex of the searched path. At the same time, the starting vertex is used as the basis for determining the subsequent vertices of the searched path, that is, the starting vertex is used as the current vertex. It should be noted that the searched path is mainly used to gradually record the vertices of the searched string-shuffling loop path, and the vertices are connected in sequence in the order in which they are searched.

[0079] Step S422, determine whether the current vertex has any connected vertices, if so, take all connected vertices of the current vertex as preliminary vertices, and group all preliminary vertices into a preliminary vertex set, otherwise go to step S426.

[0080] Specifically, the vertices directly connected to the current vertex through the undirected edge are taken as the connected vertices of the current vertex, and it is determined whether the current vertex has a connected vertex. If so, all the connected vertices of the current vertex are searched, and all the connected vertices of the current vertex are taken as the preliminary vertices of the searched path, and then all the preliminary vertices are collected as a preliminary vertex set. However, if it is found that there is no connected vertex of the current vertex in the undirected model after searching, then go to step S426.

[0081] Step S423, determine whether the starting vertex is included in the preparation vertex set, if yes, go to step S424, otherwise go to step S425.

[0082] Specifically, this step is to judge the preliminary vertex set obtained in step S422 or step S426, that is, to judge whether there is a starting vertex set in step S421 in the preliminary vertex set. If so, go to step S424 to further judge the currently searched path. If there is no starting vertex in the preliminary vertex set, go to step S425 to search for the vertex for the next connection in the preliminary vertices.

[0083] Step S424, determine whether the number of vertices in the currently searched path is greater than the preset number. If so, connect the starting vertex to the currently searched path to obtain the string-washing loop path and record it, and go to step S427, otherwise remove the starting vertex from the prepared vertex set.

[0084] Specifically, the number of vertices in the currently searched path is queried, and then it is determined whether the number of vertices in the currently searched path is greater than the preset number, that is, whether the number of vertices in the currently searched path can form a loop, or whether the number of vertices in the currently searched path can form a loop that meets the loop vertex number requirement. If the number of vertices in the currently searched path is greater than the preset number, it means that the number of vertices in the currently searched path can already form a loop or can already form a loop that reaches a certain number of vertices. At this time, the starting vertex is connected to the currently searched path to form a string-washing loop path, and the obtained string-washing loop path is recorded. Then directly go to step S427 to end the connection work of the string-washing loop path. If the number of vertices in the currently searched path is not greater than the preset number, it means that the number of vertices in the currently searched path cannot form a loop or cannot form a loop with a certain number of vertices. At this time, the starting vertex is removed from the preparatory vertex set, and then the next step is set for the remaining preparatory vertices in the preparatory vertex set. Preferably, in order to avoid the situation where the searched path cannot form a loop, the number of vertices can be set to 2.

[0085] Step S425, determine whether all the preliminary vertices in the preliminary vertex set are in the currently searched path. If so, go to step S426, otherwise select one from all the preliminary vertices in the preliminary vertex set that are not in the searched path to connect to the searched path, and use the selected preliminary vertex as the new current vertex, and go to step S422.

[0086] Specifically, the set of prepared vertices in this step is the set of prepared vertices after the starting vertex set is eliminated, and since the searched path is also continuously updated with the searched connected vertices, the searched path used in this step is also the current searched path. That is, it is determined whether all the prepared vertices in the current set of prepared vertices are already in the current searched path. If so, it is transferred to step S426 to further determine the current vertex. If not all the prepared vertices in the current set of prepared vertices are in the current searched path, and some of the prepared vertices have not yet been connected to the current searched path, then one is randomly selected from all the prepared vertices in the current set of prepared vertices that are not in the searched path to be connected to the searched path, and the selected prepared vertex is used as the new current vertex, and then it is jumped to step S422 to re-query the next searched path connection vertex.

[0087] Step S426: Determine whether there is a bridging vertex for the current vertex. If so, take all bridging vertices of the current vertex as preliminary vertices, and group all preliminary vertices into a preliminary vertex set, then go to step S423; otherwise, go to step S427.

[0088] Specifically, determine whether there is a cross-connectable vertex at the current vertex. Furthermore, the cross-connectable vertex of the current vertex is determined in accordance with the target constraint. When searching for the cross-connection scheme of the string washing circuit, the constraint considered is mainly the cross-connection principle between pipe segments, that is, only vertices that meet certain cross-connection conditions can be cross-connected with the current vertex, and the cross-connection condition is the target constraint. When it is determined that there is a cross-connectable vertex at the current vertex, all the cross-connectable vertices of the current vertex are determined in turn according to the set cross-connection conditions, and all the cross-connectable vertices of the current vertex are used as preparatory vertices, and then all the current preparatory vertices are grouped into a preparatory vertex set, and jump to step S423, and further query the next connected vertex of the searched path based on the operation of the preparatory vertex set in step S423. However, when it is determined that there is no cross-connectable vertex at the current vertex, jump directly to step S427.

[0089] Step S427: End the connection and use the current serial washing circuit as the final serial washing circuit.

[0090] In order to better represent the searched series washing circuit path and make the searched series washing circuit path look clearer, the ship piping series washing circuit connection method of the embodiment of the present invention may also include step S428. The specific content of step S428 is as follows.

[0091] Step S428, representing the serial shuffling loop path in the form of an adjacency matrix.

[0092] Specifically, the entire undirected graph can be represented by an adjacency matrix after completing the bridging to form a certain string-washing loop, in which the existing pipe segments are known adjacency information, which is recorded in the form of matrix_known_fl. The bridging part is based on the grouping of vertices, and the corresponding elements on the main diagonal of the adjacency matrix are found to form an adjacency submatrix to represent the variable part of the bridging problem.

[0093] In order to better illustrate the method for formulating a cleaning and washing scheme for a ship piping system according to an embodiment of the present invention, the design of a cleaning and washing circuit path for some piping systems of a certain ship is taken as an example for illustration.

[0094] Assume that the pipeline system to be cleaned in series on a certain ship includes supply pipelines, oil transfer pipelines, refueling pipelines, oil discharge pipelines and oil return pipelines. All pipe sections in the pipeline system to be cleaned in series are abstracted into an undirected graph. All 42 vertices are named and grouped according to the cabins they are in. The specific groups are as follows:

[0095] (1) Pump room 1: V081, V083 to V088;

[0096] (2) Pump room 2 – V089 to V102;

[0097] (3) Daily cabin: V108 to V115;

[0098] (4) No. 1 fuel tank: V116 to V119;

[0099] (5) No. 2 fuel tank—V120, V121;

[0100] (6) No. 3 fuel tank—V122, V123;

[0101] (7) No. 4 fuel tank—V124, V125;

[0102] (8) No. 5 fuel tank: V126 to V128.

[0103] After the entire undirected graph is completed and a certain series of loops are formed, it can be represented by the adjacency matrix A, and the existing pipe segments are the known adjacency information, which is recorded by the matrix A_known_fl. The cross-linkable part finds the corresponding elements around the diagonal of the adjacency matrix A according to the grouping of vertices, forming 8 adjacent sub-matrices A(1)~A(8) to represent the variable part of the cross-link problem.

[0104] The inner diameters of the pipe sections corresponding to all vertices are shown in Table 1.

[0105] Table 1

[0106] Pipe section inner diameter / mm 80 100 125 150 Number of vertices 2 8 20 12

[0107] Based on the experience of previous series washing operations, in order to ensure the cleaning effect and also to ensure the safety of the operation, the series washing flow rate restriction conditions are set as follows: the minimum series washing flow rate is usually not less than 4.5m / s, and the maximum series washing flow rate cannot exceed 7m / s. This imposes restrictions on the cross-connection of pipe sections with different pipe diameters. Assuming that the maximum series washing flow rate in the loop is 7m / s, the corresponding minimum flow rate under different maximum and minimum pipe diameter combinations is shown in Table 2.

[0108] Table 2

[0109]

[0110] From the data in Table 2, it can be seen that if the minimum flow rate of the washing is to reach 4.5m / s, when the pipe sections of different diameters are bridged, the two bridged pipe sections must only contain two adjacent pipe sections of specifications in Table 1 (the specifications of the pipe sections connected by the connected vertices usually do not change). Therefore, it can be seen that the pipe bridge condition is that the entire washing circuit can only contain two adjacent pipe sections of specifications in Table 1 at most. The known cross-cabin condition is: if cross-cabin bridge is required, only the cross-cabin between the front pump cabins 1 and 2 is allowed.

[0111] Based on the above background information, the steps for solving the method for formulating a cleaning and washing plan for a ship piping system in this embodiment are as follows:

[0112] Step S1, construct an undirected graph model according to the actual structure of the pipe system to be washed in series and the distribution of the cabins in the background information. It can be seen that there are a total of 42 vertices distributed in 8 cabins, and a multi-path pre-washing circuit is obtained using a depth-first traversal algorithm.

[0113] Step S2, by performing permutation and combination analysis on multiple pre-washing circuits, it is obtained that the maximum vertex coverage number is 38 and the minimum number of circuits required is N=3, that is, three stages of washing circuits are required to complete the cleaning test.

[0114] Step S3, based on the pipeline jump condition, cross-cabin condition and vertex effective series washing judgment condition, the constraints of the three series washing stages can be set as follows: the constraints of the first series washing stage are: the main and supporting roles of the vertex need to be determined according to the actual connection form. In this stage, there is no limit on the pipe diameter during jump-over, but cross-cabin is not allowed; the constraints of the second series washing stage are: the same as the constraints of the first series washing stage; the constraints of the third series washing stage are: only the two largest diameters, namely vertices with diameters of 125mm and 150mm, are allowed to jump, and pump cabins 1 and 2 can jump across cabins. At this time, all vertices are protagonists and can be effectively washed.

[0115] Step S4, n is the nth stage of the series washing to be performed, and the initial value n is set to 1; the number of times of searching the cross-connection circuit for each series washing stage is set to M, and in this embodiment, M is taken as 100;

[0116] Step S5: Determine whether n>3 at present, if yes, proceed to step S24, otherwise proceed to step S6;

[0117] Step S6: Record that the current series washing stage is about to search the mth series washing circuit, and set the initial value m=1;

[0118] Step S7: Determine whether m>100, if yes, set n=n+1 and go to step S5, otherwise go to step S8;

[0119] Step S8: Select a vertex as the starting vertex, set it as the current vertex, and include it in the searched path;

[0120] Step S9: Determine whether the current vertex has any connected vertices. If so, take all connected vertices of the current vertex as preliminary vertices, and group all preliminary vertices into a preliminary vertex set, and proceed to step S10; otherwise, proceed to step S16;

[0121] Step S10: Determine whether the starting vertex is included in the preparation vertex set, if yes, proceed to step S11, otherwise proceed to step S14;

[0122] Step S11: Determine whether the number of vertices in the currently searched path is greater than 2, if so, proceed to step S12, otherwise proceed to step S13;

[0123] Step S12: Connect the starting vertex to the searched path to obtain a loop and record it, and then go to step S23;

[0124] Step S13: remove the starting vertex from the set of preliminary vertices;

[0125] Step S14: Determine whether all the preliminary vertices in the preliminary vertex set are in the currently searched path, if so, proceed to step S16, otherwise proceed to step S15;

[0126] Step S15: randomly selecting a prepared vertex from all the prepared vertices in the prepared vertex set that are not in the searched path and connected to the searched path, and using the selected prepared vertex as a new current vertex, and then proceeding to step S22;

[0127] Step S16: Determine whether the current vertex has a vertex that can be crossed. If so, all the vertices that can be crossed by the current vertex are used as preliminary vertices, and all the preliminary vertices are grouped into a preliminary vertex set, and then go to step S17; otherwise, go to step S23;

[0128] Step S17: Determine whether the starting vertex is included in the preliminary vertex set, if yes, proceed to step S18, otherwise proceed to step S19;

[0129] Step S18: Connect the starting vertex to the searched path to obtain a loop and record it;

[0130] Step S19: remove the starting vertex from the set of preliminary vertices;

[0131] Step S20: Determine whether all vertices that the current vertex can cross are in the searched path, if yes, go to step S23, otherwise go to step S21;

[0132] Step S21: randomly selecting a prepared vertex from all the prepared vertices in the prepared vertex set that are not in the searched path and connected to the searched path, and using the selected prepared vertex as a new current vertex;

[0133] Step S22: Update the current search path and the information of the found loop, and go to step 8;

[0134] Step S23: stop searching, record the information of all cross-connected series washing circuits obtained in this search, set m=m+1 and go to step S7;

[0135] Step S24: In the cleaning series washing of the three series washing stages, Num1=95, Num2=95, and Num3=75 series washing loops are obtained respectively. One series washing loop is selected from each series washing stage and combined to form a series washing scheme including three stages. A preliminary selection is performed from all the series washing schemes to obtain 1840 preliminary schemes with a maximum number of effective cleaning vertices of 38;

[0136] Step S25: Calculate various performance indicators of each preliminary scheme, mainly considering the test cost and energy consumption, including the number of vertices covered by the cross-connection series washing circuit in each stage, the total number of cross-tank times, the total length of the cross-connection straight line distance, and the total volume of clean fuel used in the original pipe system;

[0137] Step S26: From the perspective of reducing the test cost and reducing energy consumption, according to the performance index calculated in step S25, a scheme that meets at least one condition is selected from all 1840 schemes, namely (1) the scheme with the shortest total length of the straight-line bridge among all schemes - scheme No. 577, (2) the scheme with the shortest total length of the straight-line bridge among the longest loop and the shortest series washing scheme - scheme No. 1700, (3) the scheme with the shortest total length of the straight-line bridge among the series washing schemes with the shortest average loop length - scheme No. 1700, (4) the scheme with the shortest total length of the straight-line bridge when the number of cross-tank crossings is 1, 3, and 5 respectively - schemes No. 555, 1335, and 576, and (5) the scheme with the smallest sum of the oil volume used in the original pipe system - scheme No. 1700, thereby forming the five schemes in Table 3. As shown in Table 3.

[0138] Table 3

[0139]

[0140] It can be seen from the above practical examples that the method for formulating a cleaning and washing plan for a ship piping system proposed in the present invention can be used to efficiently and quickly obtain alternative cleaning and washing plans for a complex piping system that meet the constraints and the desired goals, thereby providing beneficial technical support for improving the ship mooring navigation test and thus shortening the ship delivery cycle.

[0141] The method for formulating a cleaning and washing scheme for a ship piping system provided by an embodiment of the present invention converts the piping system structure into an undirected graph model, and obtains the minimum number of pre-washing loops that can achieve the maximum vertex coverage number based on the existing conditions of the undirected graph model to determine the number of washing stages, and then sets the constraints of each washing stage based on the restriction conditions, and obtains the washing loops of each washing stage through computer iteration based on the constraints of each washing stage. When forming the entire cleaning and washing scheme, all washing schemes can be quickly screened by formulating quantitative evaluation indicators to obtain the optimal scheme. Therefore, the present invention makes full use of computer technology to assist in manually formulating a cleaning and washing plan for a complex ship piping system, ensuring the scientificity and rationality of the plan while also improving work efficiency.

[0142] Embodiment 2

[0143] In order to solve the technical problems existing in the prior art, an embodiment of the present invention provides a device for formulating a cleaning and washing plan for a ship piping system.

[0144] Figure 2 The schematic diagram of the structure of the device for formulating the cleaning and washing scheme of the ship piping system according to the second embodiment of the present invention is shown; Figure 2 As shown, the device for formulating a cleaning and washing plan for a ship piping system according to an embodiment of the present invention includes a pre-washing circuit acquisition module, a washing stage number, a constraint condition setting module, a washing circuit set acquisition module, a preliminary plan acquisition module and an effective washing plan acquisition module.

[0145] The pre-series washing circuit acquisition module is used to construct an undirected graph model based on all the pipe systems to be washed in the ship system, and obtain multiple pre-series washing circuits through the first series washing circuit acquisition method based on the undirected graph model and the cross-cabin condition;

[0146] The number of shuffling stages is used to obtain the minimum number of pre-shuffling loops that can achieve the maximum number of vertex covers based on multiple pre-shuffling loops, and use the minimum number of pre-shuffling loops as the number of shuffling stages;

[0147] A constraint condition setting module, used to set the constraint conditions of each series washing stage based on a preset condition group, wherein the preset condition group includes a pipe cross-connection condition, a cross-chamber condition and a vertex effective series washing judgment condition, and the pipe cross-connection condition is obtained based on the series washing flow rate restriction condition;

[0148] A series washing circuit set acquisition module is used to acquire all series washing schemes based on the series washing circuit sets of all series washing stages, and select a series washing scheme with the maximum number of effective cleaning points from all series washing schemes as a preliminary scheme, wherein each series washing scheme includes a series washing circuit in the series washing circuit set of each series washing stage;

[0149] A preliminary scheme acquisition module is used to acquire all series washing schemes based on the series washing circuit sets of all series washing stages, and select a series washing scheme with the maximum number of effective cleaning fixed points from all series washing schemes as a preliminary scheme, wherein each series washing scheme includes one series washing circuit in the series washing circuit set of each series washing stage;

[0150] The effective serial washing scheme acquisition module is used to calculate the preset performance index of each preliminary scheme, and select the preliminary scheme that meets the preset screening conditions as the effective serial washing scheme based on the preset performance index.

[0151] The device for formulating a cleaning and washing scheme for a ship piping system provided by an embodiment of the present invention converts the piping system structure into an undirected graph model, and obtains the minimum number of pre-washing loops that can achieve the maximum number of vertex coverage based on the existing conditions of the undirected graph model to determine the number of washing stages, and then sets the constraints of each washing stage based on the restriction conditions, and obtains the washing loops of each washing stage through computer iteration based on the constraints of each washing stage. When forming the entire cleaning and washing scheme, all washing schemes can be quickly screened by formulating quantitative evaluation indicators to obtain the optimal scheme. Therefore, the present invention makes full use of computer technology to assist in manually formulating a cleaning and washing plan for a complex ship piping system, ensuring the scientificity and rationality of the plan while also improving work efficiency.

[0152] Embodiment 3

[0153] In order to solve the above-mentioned technical problems existing in the prior art, an embodiment of the present invention further provides a storage medium storing a computer program, which, when executed by a processor, can implement all the steps in the method for formulating a cleaning and washing plan for a ship piping system in Embodiment 1.

[0154] The specific steps of the method for formulating a cleaning and washing plan for a ship piping system and the beneficial effects obtained by applying the readable storage medium provided in the embodiment of the present invention are the same as those in the first embodiment and will not be described in detail here.

[0155] It should be noted that the storage medium includes various media that can store program codes, such as ROM, RAM, magnetic disk or optical disk.

[0156] Embodiment 4

[0157] In order to solve the above technical problems existing in the prior art, an embodiment of the present invention further provides a terminal.

[0158] Figure 3 The schematic diagram of the terminal structure of the fourth embodiment of the present invention is shown. Figure 3The terminal of this embodiment includes a processor and a memory connected to each other; the memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that when the terminal executes, all steps in the method for formulating a cleaning and washing plan for a ship piping system in embodiment 1 can be implemented.

[0159] The specific steps of the method for formulating a cleaning scheme for a ship piping system and the beneficial effects obtained by applying the terminal provided by the embodiment of the present invention are the same as those in the first embodiment, and will not be described in detail here.

[0160] It should be noted that the memory may include random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage. Similarly, the processor may also be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

[0161] Although the embodiments disclosed in the present invention are as above, the contents described are only embodiments adopted for facilitating the understanding of the present invention and are not intended to limit the present invention. Any technician in the technical field to which the present invention belongs can make any modifications and changes in the form and details of the implementation without departing from the spirit and scope disclosed in the present invention, but the protection scope of the present invention shall still be subject to the scope defined in the attached claims.

Claims

1. A method for formulating a cleaning and washing plan for a ship piping system, comprising: An undirected graph model is constructed based on all pipe systems to be serially washed in the ship system, and multiple pre-serial washing circuits are obtained through a first serial washing circuit obtaining method based on the undirected graph model; Based on the multiple pre-shuffle loops, the minimum number of pre-shuffle loops that can achieve the maximum number of vertex covers is obtained, and the minimum number of pre-shuffle loops is used as the number of shuffle stages; Setting constraints for each series washing stage based on a preset condition group, wherein the preset condition group includes a pipe cross-connection condition, a cross-compartment condition, and a vertex effective series washing determination condition, wherein the pipe cross-connection condition is obtained based on a series washing flow rate restriction condition; Through the second serial washing circuit acquisition method, based on the constraint conditions of each serial washing stage and the undirected graph model, multiple serial washing circuits of each serial washing stage are acquired, and all the serial washing circuits of each serial washing stage are aggregated to obtain a serial washing circuit set of each serial washing stage; Acquire all the series washing schemes based on the series washing circuit sets of all the series washing stages, and select the series washing scheme with the maximum number of effective cleaning points from all the series washing schemes as a preliminary scheme, wherein each of the series washing schemes includes a series washing circuit in the series washing circuit sets of each series washing stage; Calculating the preset performance index of each of the preliminary schemes, and selecting the preliminary scheme that meets the preset screening conditions as the effective series washing scheme based on the preset performance index; Wherein, obtaining the multi-path serial washing circuit of each serial washing stage based on the constraint conditions of each serial washing stage and the undirected graph model through the second serial washing circuit obtaining method includes: The constraints of the nth string washing stage are used as the target constraints; Based on the target constraint and the undirected graph model, the mth string washing circuit is obtained by the second string washing circuit obtaining method, and it is determined whether m is equal to M. If so, the acquisition of the string washing circuit in the current string washing stage is terminated; otherwise, m is increased by 1, and the mth string washing circuit is obtained again; Add 1 to n and determine whether n is greater than the number of the series washing stages. If so, the acquisition of the series washing loop set is terminated. Otherwise, the constraint condition of the nth series washing stage is re-used as the target constraint condition. Among them, the initial value of n is 1, and M is the number of serial washing circuits obtained in the nth serial washing stage; Acquiring a series washing circuit by a second series washing circuit acquisition method based on the target constraint condition and the undirected graph model includes: Step 1: randomly select a vertex from the undirected graph model as a starting vertex, and use the starting vertex as a current vertex and include it in the searched path; Step 2: Determine whether the current vertex has any connected vertices. If so, take all connected vertices of the current vertex as preliminary vertices and group all the preliminary vertices into a preliminary vertex set. Otherwise, execute step 6. Step 3: Determine whether the starting vertex is included in the preparation vertex set, if yes, go to step 4, otherwise go to step 5; Step 4: Determine whether the number of vertices in the currently searched path is greater than a preset number. If so, connect the starting vertex to the currently searched path to obtain a string-washing loop path and record it, and execute step 7. Otherwise, remove the starting vertex from the prepared vertex set. Step 5: Determine whether all the prepared vertices in the prepared vertex set are in the currently searched path. If so, execute step 6. Otherwise, select one of the prepared vertices in the prepared vertex set that are not in the searched path to connect to the searched path, and use the selected prepared vertex as a new current vertex, and execute step 2. Step 6: Determine whether the current vertex has a bridging vertex. If so, use all bridging vertices of the current vertex as preliminary vertices, and group all the preliminary vertices into a preliminary vertex set, and then execute step 3; otherwise, execute step 7. Step 7: End the connection and use the current serial washing circuit as the final serial washing circuit; Among them, in step 6, the method of determining the bridging vertex of the current vertex is to meet the target constraint condition.

2. The method according to claim 1, characterized in that The first string washing circuit acquisition method is a depth-first traversal algorithm.

3. The method according to claim 1, characterized in that The conditions for determining whether the vertex is effectively washed are that the liquid flow rate inside the vertex exceeds a preset flow rate, and that the vertex can no longer achieve effective washing in the post-washing stage after achieving effective washing in the pre-washing stage.

4. The method according to claim 1, characterized in that: The performance index includes at least one of the number of vertices covered by the cross-connection series washing circuit in each stage, the total number of cross-compartment times, the total length of the cross-connection straight-line distance, and the total volume of clean fuel used in the original pipe system.

5. The method according to claim 1, characterized in that The preset screening conditions include at least one of a scheme with a maximum number of covered vertices and a minimum loop value, a scheme with a minimum total number of cross-cabin crossings, a scheme with a shortest total length of a cross-connection straight line distance, and a scheme with a minimum total volume of clean fuel used in the original pipe system.

6. A device for formulating a cleaning plan for a ship piping system, characterized in that: It includes a pre-series washing circuit acquisition module, a series washing stage number, a constraint condition setting module, a series washing circuit set acquisition module, a preliminary plan acquisition module and an effective series washing plan acquisition module; The pre-series washing circuit acquisition module is used to construct an undirected graph model based on all pipe systems to be washed in the ship system, and acquire multiple pre-series washing circuits through a first series washing circuit acquisition method based on the undirected graph model; The number of shuffling stages is used to obtain the minimum number of pre-shuffling loops that can achieve the maximum number of vertex covers based on multiple pre-shuffling loops, and use the minimum number of pre-shuffling loops as the number of shuffling stages; The constraint condition setting module is used to set the constraint conditions of each series washing stage based on the preset condition group, wherein the preset condition group includes a pipe cross-connection condition, a cross-chamber condition and a vertex effective series washing judgment condition, and the pipe cross-connection condition is obtained based on the series washing flow rate restriction condition; The serial washing circuit set acquisition module is used to acquire all serial washing schemes based on the serial washing circuit sets of all the serial washing stages, and select the serial washing scheme with the maximum number of effective cleaning points from all the serial washing schemes as the preliminary scheme, wherein each of the serial washing schemes includes a serial washing circuit in the serial washing circuit set of each of the serial washing stages; The preliminary scheme acquisition module is used to acquire all the series washing schemes based on the series washing circuit sets of all the series washing stages, and select the series washing scheme with the maximum number of effective cleaning fixed points from all the series washing schemes as the preliminary scheme, wherein each of the series washing schemes includes one series washing circuit in the series washing circuit set of each series washing stage; The effective series washing scheme acquisition module is used to calculate the preset performance index of each of the preliminary schemes, and select the preliminary scheme that meets the preset screening conditions as the effective series washing scheme based on the preset performance index; Wherein, obtaining the multi-path serial washing circuit of each serial washing stage based on the constraint conditions of each serial washing stage and the undirected graph model through the second serial washing circuit obtaining method includes: The constraints of the nth string washing stage are used as the target constraints; Based on the target constraint and the undirected graph model, the mth string washing circuit is obtained by the second string washing circuit obtaining method, and it is determined whether m is equal to M. If so, the acquisition of the string washing circuit in the current string washing stage is terminated; otherwise, m is increased by 1, and the mth string washing circuit is obtained again; Add 1 to n and determine whether n is greater than the number of the series washing stages. If so, the acquisition of the series washing loop set is terminated. Otherwise, the constraint condition of the nth series washing stage is re-used as the target constraint condition. Among them, the initial value of n is 1, and M is the number of serial washing circuits obtained in the nth serial washing stage; Acquiring a series washing circuit by a second series washing circuit acquisition method based on the target constraint condition and the undirected graph model includes: Step 1: randomly select a vertex from the undirected graph model as a starting vertex, and use the starting vertex as a current vertex and include it in the searched path; Step 2: Determine whether the current vertex has any connected vertices. If so, take all connected vertices of the current vertex as preliminary vertices and group all the preliminary vertices into a preliminary vertex set. Otherwise, execute step 6. Step 3: Determine whether the starting vertex is included in the preparation vertex set, if yes, go to step 4, otherwise go to step 5; Step 4: Determine whether the number of vertices in the currently searched path is greater than a preset number. If so, connect the starting vertex to the currently searched path to obtain a string-washing loop path and record it, and execute step 7. Otherwise, remove the starting vertex from the prepared vertex set. Step 5: Determine whether all the prepared vertices in the prepared vertex set are in the currently searched path. If so, execute step 6. Otherwise, select one of the prepared vertices in the prepared vertex set that are not in the searched path to connect to the searched path, and use the selected prepared vertex as a new current vertex, and execute step 2. Step 6: Determine whether the current vertex has a bridging vertex. If so, use all bridging vertices of the current vertex as preliminary vertices, and group all the preliminary vertices into a preliminary vertex set, and then execute step 3; otherwise, execute step 7. Step 7: End the connection and use the current serial washing circuit as the final serial washing circuit; Among them, in step 6, the method of determining the bridging vertex of the current vertex is to meet the target constraint condition.

7. A storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method for formulating a cleaning and washing plan for a ship piping system according to any one of claims 1 to 5 is implemented.

8. A terminal, characterized in that: include: A processor and a memory, wherein the memory is communicatively connected to the processor; The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the terminal executes the method for formulating a cleaning and washing plan for a ship piping system according to any one of claims 1 to 5.

Images