Optimal valve element design method fusing mixed integer programming modeling and heuristic algorithm
By using mixed integer programming modeling and heuristic algorithms to optimize valve core design, the problems of time-consuming and ineffective manual design are solved, and efficient and accurate valve core optimization design is achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-12-23
- Publication Date
- 2026-03-31
AI Technical Summary
Existing valve core designs rely on manual experience, resulting in lengthy design time, poor performance, and a high risk of errors, making optimization difficult.
A hybrid integer programming model and heuristic algorithm are used to generate candidate valve core layout schemes. The design parameters are optimized by a solver, and the exact solution is obtained by combining a recursive algorithm and the commercial solver Gurobi.
The ability to obtain an optimized valve core design that meets the requirements in a short time overcomes the drawbacks of manual design and improves design efficiency and accuracy.
Smart Images
Figure CN121765952A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the fields of industrial design and operations research, and in particular to an optimal valve core design method that integrates mixed integer programming modeling and heuristic algorithms. Background Technology
[0002] The logic design of current valve cores is becoming increasingly complex. Due to numerous constraints, it is difficult to establish a general mathematical model for optimization. Currently, it mainly relies on designers to perform manual calculations based on experience, which is not only time-consuming and labor-intensive, but also suffers from drawbacks such as limited processing complexity, low solution efficiency, susceptibility to errors, and difficulty in breaking through local optima. Modeling industrial design problems as mixed-integer programming problems (MIP) in operations research and solving them can effectively avoid the drawbacks of relying on designers' experience. At the same time, incorporating heuristic algorithms can effectively reduce computation time.
[0003] Therefore, those skilled in the art are dedicated to developing a valve core design method based on mixed integer programming to address the aforementioned deficiencies in the prior art. Summary of the Invention
[0004] In view of the above-mentioned defects of the prior art, the technical problem to be solved by the present invention is how to overcome the problems of long time and poor effect of manual design in the past, so as to obtain a valve core design solution that meets the requirements in a shorter time.
[0005] To achieve the above objectives, this invention provides an optimal valve core design method that integrates mixed integer programming modeling and heuristic algorithms, characterized in that the method includes the following steps: Step 1: Generate candidate valve core layout schemes using a heuristic algorithm. The valve core includes a central valve core and several edge valve cores, wherein the central control angle connects the central valve core and the edge valve cores, and the edge control angle connects adjacent edge valve cores. Step 2: Based on the candidate valve core layout schemes, model the valve core design parameters as a mixed integer programming model. These parameters include the starting and ending angles of the center control angle, the starting and ending angles of the edge control angle, and the valve core angle. and interval angle The rotation angles under different modes are determined; the mixed-integer programming model is solved using a solver to obtain an initial solution for optimizing the design parameters. This initial solution maximizes the valve core angle. To minimize the valve core radius; Step 3: Using the initial solution and heuristic algorithm obtained in Step 2, continue to adjust the mixed integer programming model, add constraints to make the model meet all the pre-set conditions, and use the solver again to solve the model to obtain the final design scheme.
[0006] Furthermore, in step 1, a recursive algorithm is used to generate the candidate arrangements of the valve core. The recursive algorithm is based on the valve core connectivity to enumerate possible arrangements, including initializing an empty arrangement list and gradually adding connected arrangements until all connections are covered.
[0007] Furthermore, the recursive algorithm includes the following sub-steps: Step 1.1: Initialize an empty arrangement list to store all arrangements generated in the algorithm; Step 1.2: Input the current connectivity list and the current arrangement, wherein the current connectivity list consists of all connections that do not include the central valve core; Step 1.3: Select a solution from the current connected list and add it to the current layout. If the number of connected elements in the current layout is 0, add the current layout to all layout lists and return. Otherwise, first check if the current layout is empty. If it is, select a connection and add it to the current layout. Then check which connection the two ends of the current layout are in and remove that connection from the current connected list. Then expand the current layout. Step 1.4: Call the algorithm itself again until all connections are added to the arrangement, add the current arrangement to the list of all arrangements, and finally return all possible arrangements.
[0008] Furthermore, in step 2, the objective of the mixed-integer programming model is to maximize the valve core angle. Its objective function is: The sum of the angles occupied by all valve cores and the interval angles between all valve cores in the mixed integer programming model is 360°, therefore the following constraints apply: in, Number of edge valve cores; The first stage of calculation is performed using the mixed-integer programming model, including calculating the angle of the central control angle. The angle of the edge control angle The angle of rotation for each mode Auxiliary variables of the central control angle Auxiliary variables of edge control angle ,in, The number of the central control angles, The number of edge control angles, This represents the number of valve core modes.
[0009] Furthermore, the first case calculated by the mixed-integer programming model is: if in the... In the first mode, there is proportionally controlled connectivity, with the first... Taking the edge control corner as an example, if you want to cover the edge control corner from the first edge control corner... One to the first For each valve core, the starting angle of the edge control angle is required to be in the th... and the Between the valve cores, the termination corner is at the... and the The specific constraints between the valve cores are as follows: in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
[0010] Furthermore, the second case calculated by the mixed-integer programming model is: if in the... In any given mode, if there is a proportionally controlled connection and that angle covers the proportional connection, then it must cover three valve cores, with the first one being the most important. Taking the edge control angle as an example, assuming it covers the first edge control angle... , No. and the For each valve core, the starting angle must be in the [number]th [position]. The middle of the valve core, the termination corner is at the... The specific constraints in the middle of each valve core are as follows: in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
[0011] Furthermore, the third case calculated by the mixed-integer programming model is: if in the... In this mode, there exists proportionally controlled connectivity, but the angle does not cover the proportionally connected area. This differs slightly from the first case, and the constraint is expressed as follows: in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
[0012] Furthermore, after completing the first stage of calculation, the mixed integer programming model enters the second stage to address the issue that some control angles should be disconnected in certain modes. Regarding the central control angle, assuming that at the 1st... In the first mode Each central control angle should be disconnected, and the first phase should be calculated. Angle of the midpoint of each central control angle Ac and the midpoint angle vector of the interval between each valve core. Bc ,Will Bc Subtract each component Ac And take the absolute value, to get Cc ,exist Cc Take the index of the smallest value in the middle to determine the position that should be covered. Ic : in, For the first An angle of the central control angle. For the first Another angle of the central control angle.
[0013] Furthermore, regarding the edge control angle, assuming that in the first... In the first mode The edge control angle should be disconnected, and the first phase should be calculated. Angle of the midpoint of each edge control angle Ae And the midpoint angle vector of each valve core. Be ,Will Be Subtract each component Ae And take the absolute value, to get Ce ,exist Ce Take the index of the smallest value in the middle to determine the position that should be covered. Ie : in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle; After completing the above steps, depending on the actual situation, add constraints to the mixed integer programming model using either the first or third option in the first stage, and then use the solver to obtain the final result.
[0014] Furthermore, all the pre-set conditions in step 3 refer to abstracting the valve core design into a general mathematical problem, including the number of patterns. The connectivity and number of connections in each mode are user-defined. The number of valve cores in a connection is 2 or 3. Let M be the number of user-defined valve core numbers; then each valve core number is... , ... .
[0015] The optimal valve core design method that integrates hybrid integer programming modeling and heuristic algorithms provided by this invention has at least the following technical effects: 1. The technical solution provided by this invention integrates computer technology into valve core design, overcoming the drawbacks of time-consuming and poor-quality manual design by designers in the past, and can obtain a feasible solution that meets the requirements in a short time. 2. The technical solution provided by this invention transforms the industrial problem of valve core design into a mathematical optimization problem, laying a theoretical foundation for subsequent research.
[0016] The following will further explain the concept, specific structure, and technical effects of the present invention in conjunction with the accompanying drawings, so as to fully understand the purpose, features, and effects of the present invention. Attached Figure Description
[0017] Figure 1 This is a schematic diagram of a valve core according to a preferred embodiment of the present invention; Figure 2 This is a schematic diagram of a valve core with proportional control according to a preferred embodiment of the present invention; Figure 3 This is a schematic diagram of valve rotation according to a preferred embodiment of the present invention; Figure 4 This is a schematic diagram of the control angle of a preferred embodiment of the present invention; Figure 5 This is a preferred embodiment of the valve core design example 1 of the present invention; Figure 6 This is a preferred embodiment of the valve core design example 2 of the present invention; Figure 7 This is a preferred embodiment of the valve core design example 3 of the present invention. Detailed Implementation
[0018] The following description, with reference to the accompanying drawings, illustrates several preferred embodiments of the present invention to make its technical content clearer and easier to understand. The present invention can be embodied in many different forms, and the scope of protection of the present invention is not limited to the embodiments mentioned herein.
[0019] Heuristic algorithms are problem-solving strategies designed based on experience, intuition, or knowledge of the problem domain. Their goal is to find a satisfactory solution (not necessarily the global optimum) within an acceptable time, such as the greedy algorithm in the TSP problem and the assignment heuristic algorithm in job shop scheduling.
[0020] Mathematical programming is a branch of operations research that studies how to find the optimal solution in planning and management work under given conditions (constraints) according to a certain metric (objective function). Mixed integer programming (MIP) is one form of it.
[0021] Current valve core design suffers from drawbacks such as limited processing complexity, low solution efficiency, susceptibility to errors, and difficulty in breaking through local optima. Thanks to the continuous improvement of commercial solvers, they now possess the capability to handle large-scale problems, processing large-scale MIP optimization problems at extremely high speeds. This invention utilizes heuristic algorithms to reduce the search range, modeling the industrial problem of valve core design as an optimization problem in operations research, and then leverages the powerful capabilities of commercial solvers for accurate solutions. The commercial solver used in this invention includes Gurobi, a solver with exceptional capabilities in handling mixed integer programming problems.
[0022] The valve designed in this embodiment of the invention includes multiple valve cores, one of which is located in the center and is called the central valve core. The remaining valve cores are distributed around it and are called edge valve cores. The central control angle connects the central valve core and the edge valve cores to form a combination, while the edge control angle connects adjacent valve cores in the edge to form a combination. Figure 1 As shown, the center control angle connects 1 and 2, and the edge control angle connects 3 and 4. Furthermore, in this embodiment of the invention, the angle occupied by an edge valve core is defined as... The angle between the two edge valve cores is In the valve core optimization design, it is required that Larger is better, meaning the valve has the smallest possible radius, which allows it to generate greater value in industrial production.
[0023] Besides the basic cases mentioned above, sometimes valve core designs require proportional control of certain center control angles or edge control angles, such as... Figure 2 As shown, the edge control angles are proportionally controlled, connecting points 4, 3, and 5 together. This proportional control requires 100% coverage of the central valve core, while the two outer ports combined must also achieve 100% coverage. In the design schematic, the edge control angle is positioned at the center of the two edge ports. Because the proportional control requires 100% coverage of the two outer ports, other non-proportional center or edge control angles must maintain a certain distance from adjacent ports. The distance.
[0024] Valves achieve different functions by covering different ports with rotation center control angle and edge control angle. For example... Figure 3 As shown, valve mode 1 covers (1,2) and (3,5), and after rotation, it covers (1,2) and (3,4) in mode 2. Similarly, mode 3 covers (1,2) and (3,4,5), mode 4 covers (2,3) and (1,5), mode 5 covers (1,4) and (2,3), and mode 6 covers (2,3) and (1,4,5).
[0025] As shown in Table 1, valve core design is abstracted into a general mathematical problem, where the number of patterns N, the connectivity within each pattern, and the number of connections are user-defined, and the number of valve cores in a connection is 2 or 3. Let M be the number of user-defined valve core numbers, then each valve core is numbered as follows: , ... .
[0026] Table 1 Mathematical description of the valve core problem Example 1 This invention provides an optimal valve core design method that integrates hybrid integer programming modeling and heuristic algorithms, comprising the following steps: Step 1: Generate candidate valve core layout schemes. The valve core includes a central valve core and several edge valve cores. The central control angle connects the central valve core and the edge valve cores, and the edge control angle connects the adjacent edge valve cores. Step 2: Based on the candidate valve core layout schemes, model the valve core design parameters as a mixed integer programming model. The parameters include the starting and ending angles of the center control angle, the starting and ending angles of the edge control angle, and the valve core angle. and interval angle The rotation angles under different modes; a solver is used to solve the mixed-integer programming model to obtain an initial solution for optimizing the design parameters. The initial solution is obtained by maximizing the valve core angle. To minimize the valve core radius; Step 3: Using the initial solution obtained in Step 2, continue to adjust the mixed integer programming model, add constraints to make the model meet all the pre-set conditions, and use the solver again to obtain the final design scheme.
[0027] Specifically, all the pre-set conditions in step 3 refer to a mathematical description of the valve core problem in Table 1, which is an objective valve core design requirement proposed by the user.
[0028] Example 2 Before modeling the valve core design scheme into a mixed-integer programming model, this embodiment of the invention needs to find candidate valve core arrangements. Using an enumeration method would be extremely time-consuming, so finding these valve core arrangements efficiently and accurately is a key issue. Based on Embodiment 1, in step 1, this embodiment of the invention uses an algorithm utilizing recursion to solve this problem. For the center control angle, the center valve core can be connected to the edge valve cores by rotation; therefore, in this embodiment of the invention, it is considered that the center valve core and any edge valve core can be connected. For the edge control angle, it is necessary that the connected valve cores are adjacent, which is a necessary condition for a feasible valve core arrangement.
[0029] This invention suggests that the fewer valve cores included in the designed valve core scheme, the better the final result. It is very likely that the number of valve cores will be even greater. This is a heuristic algorithm, and its design idea is similar to the greedy strategy of sorting by value density in the knapsack problem. Therefore, by making good use of the relationships between various connectivity schemes, the scheme with the fewest valve cores can be designed. Table 2 shows the pseudocode of the valve core arrangement generation algorithm used in the embodiment of the present invention. In the program, an empty list is first initialized to store all arrangements generated by the algorithm. The algorithm first takes a list of all connections that do not contain the central valve core and an empty arrangement as input, selects a connection to add to the arrangement, then checks which connection the two ends of the current arrangement are in, removes the connection from the current connection list, adds the connection to the current arrangement, calls the algorithm itself again, until all connections are added to the arrangement, adds the current arrangement to the list of all arrangements, and finally returns.
[0030] Table 2. Pseudocode for Valve Core Layout Generation Algorithm Step 1 uses a recursive algorithm to generate candidate valve core arrangement schemes. The recursive algorithm enumerates possible arrangements based on valve core connectivity, including initializing an empty arrangement list and progressively adding connected schemes until all connectivity is covered. Specifically, the recursive algorithm includes the following sub-steps: Step 1.1: Initialize an empty arrangement list to store all arrangements generated in the algorithm; Step 1.2: Input the current connectivity list and the current layout. The current connectivity list consists of all connections that do not include the central valve core. Step 1.3: Select a solution from the current connected list and add it to the current layout. If the number of connected elements in the current layout is 0, add the current layout to all layout lists and return. Otherwise, first check if the current layout is empty. If it is, select a connection and add it to the current layout. Then check which connection the two ends of the current layout are in and remove that connection from the current connected list. Then expand the current layout. Step 1.4: Call the algorithm itself again until all connections are added to the arrangement, add the current arrangement to the list of all arrangements, and finally return all possible arrangements.
[0031] Taking the case in Table 3 as an example, after removing duplicate connections, there are seven valve core connection methods in this case: (1,4), (3,5), (1,3), (2,4), (2,5), (1,2), and (3,4). If 4 is used as the central valve core, and connections containing 4 are removed, then four connection schemes remain: (3,5), (1,3), (2,5), and (1,2). Initialize the edge arrangement as an empty queue. If the search starts from (1,2), then (1,2) is added to the queue, becoming [1,2]. At this point, it is found that 1 is in (1,3), so (1,3) is added to the queue, becoming [3,1,2]. Then it is found that 3 is in (3,5), so (3,5) is added to the queue, becoming [5,3,1,2]. Thus, one possible arrangement has been found.
[0032] Table 3 Valve Core Design Cases Example 3 Based on Example 1 or 2, the two-stage algorithm solution is then implemented. After obtaining the candidate valve core sorting, the starting and ending angles of the center control angle, the starting and ending angles of the edge control angle, the angle occupied by one edge valve core, the angle between two edge valve cores, and the rotation angle of each mode need to be calculated using a mixed integer programming model.
[0033] Taking the mixed integer programming model in Table 3 as an example, if the edge arrangement is [5,3,1,2] and the center port is 4, then one edge control angle and one center control angle are needed. In mode 1, the edge control angle needs to cover the first and second valve cores, and the center control angle needs to cover the third valve core, such as... Figure 4 As shown, the starting angle of the edge control angle should be greater than [value missing]. and smaller than The termination angle should be greater than Less than The starting angle of the center control angle should be greater than Less than The termination angle should be greater than Less than By applying this principle to all patterns, a mathematical model is obtained, which is then computed using a commercial solver.
[0034] In this embodiment of the invention, the constants in Table 4 are used in the mixed-integer programming model: Table 4 Model Constants and Descriptions In this embodiment of the invention, the decision variables in Table 5 are used in the mixed-integer programming model: Table 5 Model Decision Variables and Descriptions Specifically, in step 2, the goal of the mixed-integer programming model is to maximize the valve spool angle. Its objective function is: In the mixed-integer programming model, the sum of the angles occupied by all valve cores and the interval angles between all valve cores is 360°, hence the constraint: in, Number of edge valve cores; The first stage of calculation is performed using a mixed-integer programming model, including calculating the angle of the central control angle. , edge control angle The angle of rotation for each mode Auxiliary variables of the central control angle Auxiliary variables of edge control angle ,in, The number of central control angles, The number of edge control angles, This represents the number of valve core modes.
[0035] The first case calculated by the mixed-integer programming model is: if in the... In the first mode, there is proportionally controlled connectivity, with the first... Taking the edge control corner as an example, if you want to cover the edge control corner from the first edge control corner... One to the first For each valve core, the starting angle of the edge control angle must be in the th... and the Between the valve cores, the termination corner is at the... and the The specific constraints between the valve cores are as follows: in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
[0036] The second case calculated by the mixed-integer programming model is: if in the... In any given mode, if there is a proportionally controlled connection and that angle covers the proportional connection, then it must cover three valve cores, with the first one being the most important. Taking the edge control angle as an example, assuming it covers the first edge control angle... , No. and the For each valve core, the starting angle must be in the [number]th [position]. The middle of the valve core, the termination corner is at the... The specific constraints in the middle of each valve core are as follows: in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
[0037] The third case calculated by the mixed-integer programming model is: if in the... In this mode, there exists proportionally controlled connectivity, but the angle does not cover the proportionally connected area. This differs slightly from the first case, and the constraint is expressed as follows: in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
[0038] Example 4 Based on Example 3, after the mixed-integer programming model completes the first stage of calculation, it enters the second stage to solve the problem that some control angles should be disconnected in certain modes. This problem was not considered in the first stage of calculation, and the second stage solves it based on the calculation of the first stage. As shown in Table 2, in Mode 3, the center control angle should be disconnected. There are many ways to place these control angles, and exhaustively searching for them would be very time-consuming. Here, this invention uses a heuristic algorithm, which moves the center control angle and the edge control angle to the nearest position, which is likely to be the best. If the center control angle is disconnected, the control angle needs to be placed between two valve cores, while the edge control angle only needs to cover one port.
[0039] For the central control angle, assuming it is at the... In the first mode Each central control angle should be disconnected, and the first phase should be calculated. Angle of the midpoint of each central control angle Ac and the midpoint angle vector of the interval between each valve core. Bc ,Will Bc Subtract each component Ac And take the absolute value, to get Cc ,exist Cc Take the index of the smallest value in the middle to determine the position that should be covered. Ic : in, For the first An angle of the central control angle. For the first Another angle of the central control angle.
[0040] For the edge control angle, assuming it is at the 1st... In the first mode The edge control angle should be disconnected, and the first phase should be calculated. Angle of the midpoint of each edge control angle Ae And the midpoint angle vector of each valve core. Be ,Will Be Subtract each component Ae And take the absolute value, to get Ce ,exist Ce Take the index of the smallest value in the middle to determine the position that should be covered. Ie : in, For the first An angle of the edge control angle. For the first Another angle of the edge control angle; After completing the above steps, depending on the actual situation, add the constraints to the mixed integer programming model using either the first or third option in the first stage, and then use the solver to obtain the final result.
[0041] The following are several valve core solutions designed using the embodiments of the present invention, which can obtain a better solution within a few minutes to tens of minutes, fully demonstrating the effectiveness of the solutions provided by the embodiments of the present invention.
[0042] The mathematical description of the valve core problem corresponding to Valve Core Design Case 1 is shown in the table below: The corresponding valve core design scheme is as follows: Figure 5 As shown.
[0043] The mathematical description of the valve core problem corresponding to Valve Core Design Case 2 is shown in the table below: The corresponding valve core design scheme is as follows: Figure 6 As shown.
[0044] The mathematical description of the valve core problem corresponding to valve core design case 3 is shown in the table below: The corresponding valve core design scheme is as follows: Figure 7 As shown.
[0045] The preferred embodiments of the present invention have been described in detail above. It should be understood that those skilled in the art can make numerous modifications and variations based on the concept of the present invention without creative effort. Therefore, all technical solutions that can be obtained by those skilled in the art based on the concept of the present invention through logical analysis, reasoning, or limited experimentation on the basis of existing technology should be within the scope of protection defined by the claims.
Claims
1. An optimal spool design method that fuses mixed integer programming modeling and heuristic algorithms, characterized in that, The method comprises the following steps: Step 1, generating a valve core arrangement candidate scheme using a heuristic algorithm, the valve core comprising a center valve core and a plurality of edge valve cores, wherein a center control angle connects the center valve core and the edge valve cores, and an edge control angle connects adjacent edge valve cores; Step 2, model parameters of the valve core design as a mixed integer programming model according to the valve core arrangement candidate scheme, the parameters including the start angle and end angle of the center control angle, the start angle and end angle of the edge control angle, the valve core angle and the interval angle , the angle of rotation in different modes; use a solver to solve the mixed integer programming model to obtain an initial solution of the optimized design parameters, the initial solution is obtained by maximizing the valve core angle to achieve the minimum valve core radius; Step 3, continuing to adjust the mixed integer programming model using the initial solution obtained in step 2 and a heuristic algorithm, adding constraints to make the model meet all pre-set conditions, and solving again using the solver to obtain a final design scheme.
2. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 1, wherein, In step 1, a recursive algorithm is used to generate the valve core arrangement candidate scheme, wherein the recursive algorithm is based on valve core connectivity to enumerate possible arrangements, including initializing an empty arrangement list, gradually adding connected schemes until all connections are covered.
3. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 2, wherein, The recursive algorithm comprises the following sub-steps: Step 1.1, initializing an empty arrangement list for saving all arrangements generated in the algorithm; Step 1.2, inputting the current connectivity list and the current arrangement, wherein the current connectivity list is composed of all connections not containing the center valve core; Step 1.3, selecting a scheme from the current connectivity list to add to the current arrangement, if the number of connections of the current arrangement is 0, then the current arrangement is added to the all arrangement list and returned, otherwise, first check if the current arrangement is empty, if yes, select a connection to add to the current arrangement, then check the two end elements of the current arrangement in which connection, remove the connection from the current connectivity list, and expand the current arrangement; Step 1.4, re-call the algorithm itself until all connections are added to the arrangement, add the current arrangement to the all arrangement list, and finally return all possible arrangements.
4. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 1, wherein, In the step 2, the objective of the mixed integer programming model is to maximize the spool angle with the objective function: All valve cores in the mixed integer programming model occupy an angle and the interval angle between all valve cores sums up to 360°, so there is a constraint: wherein, is the number of edge spools; calculating, by the mixed integer programming model, a first stage, including calculating an angle of the center control angle , an angle of the edge control angle , an angle of rotation of each mode , an auxiliary variable of the center control angle , an auxiliary variable of the edge control angle , wherein, is the number of the center control angle, is the number of the edge control angle, is the number of the valve core mode.
5. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 4, wherein, The first case of the mixed integer programming model calculation is: if there is proportional control connection in the first mode, taking the first edge control angle as an example, if the first to the first valve core is to be covered, the starting angle of the edge control angle is required to be between the first and the first valve core, and the ending angle is between the first and the first valve core, and the specific constraint is: in, For the first An angle of edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
6. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 5, wherein, The second case of the mixed integer programming model calculation is: if there is proportional control in the first mode and the angle covers the proportional connection, then three valve cores are necessarily covered, taking the first edge control angle as an example, assuming that the first , the first , and the first valve cores are covered, then the starting angle is required to fall in the middle of the first valve core, and the ending angle is required to fall in the middle of the first valve core, and the specific constraint is: in, For the first An angle of edge control angle. For the first Another angle of the edge control angle For the first The angle of rotation for each mode For the first The first mode An auxiliary variable for each edge control angle.
7. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 6, wherein, The third case of the mixed integer programming model calculation is: if in the first mode, there is a proportional control connection, but the angle does not cover the proportional connection, at this time, the situation is slightly different from that in the first case, and the constraint is expressed as: wherein, is a first edge control angle, is a second edge control angle, is a third edge control angle, is a fourth edge control angle, is a fifth edge control angle, is a sixth edge control angle, is a seventh edge control angle, is an eighth edge control angle, is a ninth edge control angle.
8. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 7, wherein, After the mixed integer programming model completes the first stage of calculation, it enters the second stage to solve the problem that some control angles should be disconnected in some modes; For the center control angle, assuming that the first mode should be disconnected in the first center control angle, calculate the angle of the midpoint of the first center control angle in the first stage Ac , and the midpoint angle vector of the interval between each valve core Bc , subtract Bc each component in Ac , and take the absolute value to get Cc , and take the index of the minimum value in Cc to get the position that should be covered Ic : wherein is a first center control angle, is a second center control angle, is a third center control angle, and is a fourth center control angle.
9. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 8, wherein, For the edge control angle, assuming that the first edge control angle should be disconnected in the first mode, the angle of the midpoint of the first edge control angle in the first stage is calculated Ae , and the midpoint angle vector of each valve core Be is calculated Be , each component is subtracted from Ae and the absolute value is obtained Ce , and the index of the minimum value in Ce is obtained, and the position that should be covered is obtained Ie : wherein is a first edge control angle, is a second edge control angle, is a third edge control angle, is a fourth edge control angle. After the above steps, according to the actual situation, the first or third case in the first stage is taken to add constraints to the mixed integer programming model, and then the solver is used to solve to obtain the final result.
10. The optimal spool design method of fusing mixed integer programming modeling and heuristic algorithm of claim 1, wherein, All the conditions preset in the step 3 refer to the spool design abstraction as a general mathematical problem, including the number of modes , the communication in each mode and the number of communications are user-defined, the number of spools in the communication is 2 or 3, and the number of user-defined spool numbers is M, then each spool number is , … .