Multi-constraint heat pipe arrangement method, medium and electronic equipment based on snake-heron algorithm

Abstract

The present invention relates to the field of satellite and camera thermal control technology, and more particularly to a multi-constraint heat pipe arrangement method, medium, and electronic device based on a Snake Heron algorithm. The method comprises: establishing a first mathematical model of a heat pipe based on heat conduction requirements, setting position parameters of the hot end starting point, hot end ending point, cold end starting point, cold end ending point, and relay point of the first mathematical model; selecting optimized variable parameters based on the position parameters; obtaining a heat transfer capacity function of the heat pipe based on the optimized variable parameters and a fitness function of a Snake Heron algorithm; determining constraints of the heat pipe based on the position parameters; randomly generating a second mathematical model of the heat pipe based on the fitness function and the constraints, iteratively optimizing the second mathematical model using a Snake Heron algorithm, and outputting an optimal arrangement model of the heat pipe. Thus, while satisfying multiple constraints such as space limitations and heat conduction efficiency, an optimal solution for the heat pipe arrangement of a space camera can be obtained, thereby improving the reliability of the space camera and achieving optimal heat conduction effects.

Description

Technical Field

[0001] The present invention belongs to the field of satellite and camera thermal control technology, and in particular relates to a multi-constraint heat pipe arrangement method based on a snake-heron algorithm, a medium and an electronic device. Background Art

[0002] As a crucial tool for long-distance space exploration and Earth observation, space cameras operate in extremely harsh environments, characterized by intense radiation and extreme temperature swings. For a space camera to function properly, it must maintain the correct temperature for sensitive electronic components to avoid performance degradation or even damage due to excessively high or low temperatures. Heat pipes, as highly efficient thermal conductivity tools, are used within space cameras to conduct and dissipate heat, ensuring the camera's cooling and heating needs.

[0003] Currently, the design of heat pipe layouts for space cameras relies primarily on engineers' experience and trial and error, lacking sophisticated calculations and optimization methods. Consequently, optimal heat dissipation and heating cannot be guaranteed under all operating conditions. This leads to uneven heat dissipation, low heat pipe utilization efficiency, and the large size and weight of space cameras, limiting their performance and application range.

[0004] In addition, during on-orbit operation, the space camera may encounter various thermal environment constraints, such as solar radiation from different directions, earth reflected radiation and deep space background radiation. These constraints require the heat pipe layout of the space camera to adapt to the complex thermal environment to ensure that the space camera can work stably for a long time.

[0005] Traditional heat pipe arrangement methods mainly include manual adjustment methods and optimization algorithms such as genetic algorithms and particle swarm algorithms. They have the following limitations, making it difficult to effectively address the above problems.

[0006] (1) Manual adjustment is slow and inefficient, making it difficult to find the optimal solution;

[0007] (2) Genetic algorithms / particle swarm algorithms converge slowly under complex constraints and are prone to falling into local optimality;

[0008] (3) Existing constraint processing strategies are difficult to simultaneously satisfy the hot end / cold end direction, length, and multi-obstacle interference constraints;

[0009] (4) The weights of multi-objective optimization are fixed, and it is impossible to dynamically balance competing indicators such as heat pipe length and number of bends. Summary of the Invention

[0010] In view of this, the present invention aims to provide a multi-constraint heat pipe arrangement method, medium and electronic equipment based on the Snake Heron algorithm, which can obtain the optimal solution for the heat pipe arrangement of the space camera while meeting multiple constraints such as space limitations and heat conduction efficiency, thereby improving the reliability, environmental adaptability and working performance of the space camera and achieving the optimal heat conduction effect.

[0011] To achieve the above object, the technical solution created by the present invention is implemented as follows:

[0012] The multi-constraint heat pipe arrangement method based on the Snake Heron algorithm includes the following steps:

[0013] S102: establishing a first mathematical model of the heat pipe based on heat conduction requirements, and setting position parameters of a hot end starting point, a hot end ending point, a cold end starting point, a cold end ending point, and a relay point of the first mathematical model;

[0014] S104: Selecting optimization variable parameters based on the position parameters;

[0015] S106: Obtaining a heat transfer capability function of the heat pipe based on the optimized variable parameters, and obtaining a fitness function of the snake heron algorithm based on the heat transfer capability function;

[0016] S108: Determine the constraint conditions of the heat pipe based on the position parameters;

[0017] S110: randomly generating a second mathematical model of the heat pipe based on the fitness function and the constraint conditions, iteratively optimizing the second mathematical model using the snake-heron algorithm, and outputting an optimal arrangement model of the heat pipe.

[0018] Furthermore, establishing a first mathematical model of the heat pipe based on the heat conduction requirement and setting position parameters of the hot end starting point, the hot end ending point, the cold end starting point, the cold end ending point, and the relay point of the first mathematical model include the following steps:

[0019] S102-2: Determine the hot end starting point coordinate P1, the hot end ending point coordinate P2, the cold end starting point coordinate Q1, and the cold end ending point coordinate Q2 of the heat pipe;

[0020] S102-4: Set the total number of relay points n of the heat pipe;

[0021] S102-6: Set relay point A1 on the extension line of line segment P1P2, obtain the coordinates of relay point A1 and the distance from relay point A1 to the hot end end point P2 l 1;

[0022] S102-8: Set relay point A on the extension line of line segment Q1Q2 n , get relay point A n The coordinates of relay point A n Distance to cold end point Q2l 2;

[0023] S102-10: Set up relay point A i coordinates of (i=2,3,...n-1);

[0024] S102-12: Determine the heat pipe at each relay point A i Bending radius r at (i=1,2,...n) i .

[0025] Furthermore, the optimized variable parameters include:

[0026] The total number of relay points of the heat pipe n;

[0027] Distance from relay point A1 to hot end termination point P2 l 1;

[0028] Relay Point A n Distance to cold end point Q2 l 2;

[0029] Relay Point A i (i=2,3,...n-1) coordinates.

[0030] Furthermore, the heat transfer capacity function η is:

[0031] ;

[0032] The fitness function F is:

[0033] ;

[0034] Among them, L is the total length of the heat pipe, n is the total number of relay points, Q is the heat transfer capacity of the same type of straight heat pipe per unit length, k1 is the weight coefficient of the total length of the heat pipe L, and k2 is the weight coefficient of the total number of relay points n.

[0035] Furthermore, the constraints include:

[0036] 2≦n≦n max ;

[0037] ≦ l 1≦ l 1_max ;

[0038] ≦ l 2≦ l 2_max ;

[0039] x i_min ≦x i ≦x i_max, y i_min ≤y i ≤y i_max , z i_min ≤z i ≤z i_max ;

[0040] Wherein, n max is the maximum value of the total number of relay points, r1 is the bending radius of the heat pipe at the relay point A1, r n is the bending radius of the heat pipe at the relay point A n , θ1 is the central angle corresponding to r1, θ n is the central angle corresponding to r n . l 1_max is the maximum value of the distance from the relay point A1 to the hot end termination point P2, l 2_max is the maximum value of the distance from the relay point A n to the cold end termination point Q2, x i is the x coordinate of the relay point A n , x i_min and x i_max are the maximum and minimum values of the x coordinates of the relay point A n , y i is the y coordinate of the relay point A n , y i_min and y i_max are the maximum and minimum values of the y coordinates of the relay point A n , z i is the z coordinate of the relay point A n , z i_min and z i_max are the maximum and minimum values of the z coordinates of the relay point A n .

[0041] Furthermore, the snake heron algorithm is used to iteratively optimize the second mathematical model, and the steps for outputting the optimal layout model of the heat pipe are as follows:

[0042] S110-2: Initialize the population and set the total number of iterations T;

[0043] S110-4: When the current iteration number t ≤ 1 / 3T, obtain the globally possible historical optimal model based on the differential evolution strategy;

[0044] S110-6: When 1 / 3T < t ≤ 2 / 3T of the current iteration number, enhance the local search based on the historical optimal model and Brownian motion;

[0045] S110-8: When the current iteration number t>2 / 3T, based on the Levy flight strategy, obtain the historical optimal model, combine the nonlinear perturbation factor, and balance the global and local search;

[0046] S110-10: Balancing global and local search results based on nonlinear perturbation factors;

[0047] S110-12: Set the current iteration number t=t+1, repeat the iterative process from S110-4 to S110-10, and when the current iteration number t=T, output the optimal arrangement model of the heat pipe.

[0048] The present invention provides a computer-readable storage medium on which computer program instructions are stored. When the computer program instructions are executed by a processor, a multi-constraint heat pipe arrangement method based on the Serpentis algorithm is implemented.

[0049] The present invention provides an electronic device comprising a memory and a processor, wherein the memory is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement a multi-constraint heat pipe arrangement method based on a Snake Heron algorithm.

[0050] Compared with the prior art, the present invention can achieve the following beneficial effects:

[0051] (1) The multi-constraint heat pipe arrangement method based on the Snake-Heron algorithm provided by the present invention, by establishing a mathematical model of heat pipe arrangement under multi-constraint conditions and combining the global search and local optimization capabilities of the Snake-Heron algorithm, can obtain the optimal solution for the heat pipe arrangement of the space camera while satisfying multiple constraints such as space limitations and heat conduction efficiency, thereby improving the reliability, environmental adaptability and working performance of the space camera and achieving the optimal heat conduction effect.

[0052] (2) The multi-constraint heat pipe arrangement method based on the Snake Heron algorithm provided by the present invention performs iterative optimization based on the Snake Heron algorithm, and dynamically balances the global and local search structures based on nonlinear perturbation factors through differential evolution strategy, Brownian motion and Levy flight strategy, thereby ensuring that the global optimal solution of the heat pipe path arrangement scheme can be obtained and output in the complex solution space. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] The accompanying drawings, which constitute part of the present invention, are intended to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are intended to explain the present invention and do not constitute an undue limitation of the present invention. In the accompanying drawings:

[0054] Figure 1 A flow chart of a multi-constraint heat pipe arrangement method based on the Snake Heron algorithm according to an embodiment of the present invention;

[0055] Figure 2 A schematic diagram of a process for establishing a first mathematical model of the heat pipe based on heat conduction requirements and setting position parameters of the hot end starting point, hot end ending point, cold end starting point, cold end ending point, and relay point of the first mathematical model according to an embodiment of the present invention;

[0056] Figure 3 A schematic diagram of the position parameters of the hot end starting point, hot end ending point, cold end starting point, cold end ending point and relay point of the first mathematical model according to an embodiment of the present invention;

[0057] Figure 4 A schematic diagram of a process for iteratively optimizing the second mathematical model using the snake heron algorithm and outputting the optimal arrangement model of the heat pipe according to an embodiment of the present invention;

[0058] Figure 5 Schematic diagram of an electronic device for the multi-constraint heat pipe arrangement method based on the Snake Heron algorithm described in an embodiment of the present invention.

[0059] The reference numerals are as follows: 1 electronic device, 11 memory, 12 processor. DETAILED DESCRIPTION

[0060] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and do not constitute a limitation to the present invention. Similar elements in different embodiments use associated similar element numbers. In the following embodiments, many detailed descriptions are intended to enable the present invention to be better understood. However, those skilled in the art can easily recognize that some of the features can be omitted in different situations, or can be replaced by other elements, materials, or methods. In some cases, some operations related to the present invention are not shown or described in the specification. This is to avoid the core part of the present invention being overwhelmed by too much description. For those skilled in the art, it is not necessary to describe these related operations in detail. They can fully understand the related operations based on the description in the specification and the general technical knowledge in the art.

[0061] It should be noted that, in the absence of conflict, the embodiments and features of the embodiments of the present invention can be combined with each other to form various implementation methods. At the same time, the steps or actions in the method description can also be interchanged or adjusted in a manner that is obvious to those skilled in the art. Therefore, the various orders in the description and the drawings are only for the purpose of clearly describing a certain embodiment and are not intended to be a required order, unless otherwise specified that a certain order must be followed.

[0062] In the description of the present invention, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", "clockwise", "counterclockwise" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present invention. In addition, the terms "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, features defined as "first", "second", etc. may explicitly or implicitly include one or more of the features. In the description of the present invention, unless otherwise specified, "multiple" means two or more.

[0063] In the description of the present invention, it should be noted that, unless otherwise expressly specified or limited, the terms "installed," "connected," and "connected" should be understood in a broad sense. For example, they can refer to fixed connections, detachable connections, or integral connections; they can refer to mechanical connections or electrical connections; they can refer to direct connections or indirect connections through an intermediate medium; and they can refer to internal connections between two components. Those skilled in the art can understand the specific meanings of the above terms in the present invention based on specific circumstances.

[0064] The present invention will be described in detail below with reference to the accompanying drawings and in combination with embodiments.

[0065] like Figure 1 As shown, an embodiment of the present invention provides a multi-constraint heat pipe arrangement method based on the snake heron algorithm, comprising the following steps:

[0066] S102: According to the structural characteristics of the space camera and based on the heat conduction requirements, a first mathematical model of the heat pipe is established, a coordinate system is established in the heat pipe arrangement area, and the position parameters of the hot end starting point, hot end ending point, cold end starting point, cold end ending point and relay point of the first mathematical model are set.

[0067] Among them, the hot end starting point is the starting point of the overlap section between the heat pipe and the heating device, the hot end ending point is the ending point of the overlap section between the heat pipe and the heating device, the cold end starting point is the starting point of the overlap section between the heat pipe and the heat sink, and the cold end ending point is the ending point of the overlap section between the heat pipe and the heat sink; the relay point represents the bend in the heat pipe path, that is, the connection point where the heat pipe is constructed to avoid obstacles.

[0068] S104: Selecting optimized variable parameters based on the position parameters. Specifically, the position parameters include constants and variables, and some variables are selected as optimized variable parameters to be applied in the subsequent iteration process of the snake heron algorithm.

[0069] S106: Obtaining a heat transfer capability function of the heat pipe based on the optimized variable parameters, and obtaining a fitness function of the snake heron algorithm based on the heat transfer capability function.

[0070] S108: Determine the constraint conditions of the heat pipe based on the position parameters.

[0071] S110: randomly generating a second mathematical model of the heat pipe based on the fitness function and the constraint conditions, iteratively optimizing the second mathematical model using the snake-heron algorithm, and outputting an optimal arrangement model of the heat pipe, that is, an optimal solution of the heat pipe path arrangement scheme.

[0072] Therefore, by establishing a heat pipe layout model under constraints and combining the global search and local optimization capabilities of the Snake-Heron algorithm, it is possible to obtain the optimal solution for the heat pipe layout of the space camera while meeting multiple constraints such as space limitations and heat conduction efficiency, thereby improving the reliability, environmental adaptability and working performance of the space camera and achieving the optimal heat conduction effect.

[0073] like Figure 2 and Figure 3 As shown, establishing a first mathematical model of the heat pipe based on the heat conduction requirement and setting the position parameters of the hot end starting point, hot end ending point, cold end starting point, cold end ending point and relay point of the first mathematical model include the following steps:

[0074] S102-2: Determine the hot end starting point coordinates P1 (x p1 ,y p1 ,z p1 )、hot end end point coordinates P2 (x p2 ,y p2 ,z p2 )、Coordinates of the cold end starting point Q1 (x q1 ,y q1 ,z q1 ) and the cold end point coordinates Q2 (x q2 ,y q2 ,z q2 ).

[0075] Among them, the coordinates of P1, P2, Q1 and Q2 are constants.

[0076] S102-4: Set the total number n of relay points of the heat pipe.

[0077] The total number of relay points n represents the total number of bends of the heat pipe, and n is a variable.

[0078] S102-6: Set relay point A1 on the extension line of line segment P1P2, obtain the coordinates of relay point A1 and the distance from relay point A1 to the hot end end point P2 l 1.

[0079] Specifically, A1(x a1 ,y a1 ,z a1 ) is expressed as:

[0080] ;

[0081] in, l 1 is a variable.

[0082] S102-8: Set relay point A on the extension line of line segment Q1Q2 n , get relay point A n The coordinates of relay point A n Distance to cold end point Q2 l 2.

[0083] Specifically, A n (x an ,y an ,z an ) is expressed as:

[0084] ;

[0085] in, l 2 is a variable.

[0086] S102-10: Set up relay point A i Coordinate A of (i=2,3,...n-1) i (x ai ,y ai ,z ai ).

[0087] S102-12: Determine the heat pipe at each relay point A i Bending radius r at (i=1,2,...n) i .

[0088] Specifically, in practical applications, since the radius change of the heat pipe bend has little effect on the heat transfer capacity of the heat pipe, r i Set to a constant; where r i ≧50mm.

[0089] Thus, the first mathematical model of the heat pipe can be described by the position parameters of the hot end starting point, the hot end ending point, the cold end starting point, the cold end ending point and the relay point.

[0090] In some embodiments, the optimization variable parameters selected based on the location parameters include:

[0091] The total number of relay points of the heat pipe n;

[0092] Distance from relay point A1 to hot end termination point P2 l 1;

[0093] Relay Point A n Distance to cold end point Q2 l 2;

[0094] Relay Point A i (i=2,3,...n-1) coordinates.

[0095] That is to say, the total number of relay points n of the heat pipe and the distance from the relay point A1 to the hot end termination point P2 are iteratively optimized by the snake heron algorithm. l 1. Relay Point A n Distance to cold end point Q2 l 2 and relay point A i The coordinates of (i=2,3,...n-1) can obtain the optimal solution for the heat pipe arrangement scheme.

[0096] When the heat pipe model is determined, the heat transfer capacity of the heat pipe is generally inversely proportional to the total length L of the heat pipe and the total number of relay points n. Therefore, in some embodiments, based on the total length L of the heat pipe and the total number of relay points n, the heat transfer capacity function η of the heat pipe is determined as:

[0097] , unit is W;

[0098] The fitness function F is obtained based on the heat transfer capacity function η:

[0099] ;

[0100] Where L is the total length of the heat pipe, that is, the length between the hot end starting point and the cold end starting point of the heat pipe, n is the total number of relay points, Q is the heat transfer capacity of the same type of straight heat pipe per unit length, k1 is the weight coefficient of the total length of the heat pipe L, and k2 is the weight coefficient of the total number of relay points n; k1 and k2 are calibrated through experiments.

[0101] Among them, since the fitness function F is set as the inverse of the heat transfer capacity function η, the optimization goal of the snake-heron algorithm is set to the minimum value of the fitness function F, that is, when the optimal solution of the heat pipe arrangement is obtained, the heat transfer capacity of the heat pipe is the strongest.

[0102] Specifically, the total length L of the heat pipe is expressed as:

[0103] ;

[0104] Among them, θi For r i The corresponding central angle of the circle; specifically, taking θ1 as an example, the expression of θ1 is:

[0105] ;

[0106] It is understandable that θ i The expressions for (i=2,3,...n) are similar.

[0107] In some embodiments, constraints of the heat pipe are determined based on the position parameters, and the constraints include:

[0108] 2≦n≦n max ;

[0109] ≦ l 1≦ l 1_max ;

[0110] ≦ l 2≦ l 2_max ;

[0111] x i_min ≦x i ≦x i_max ,y i_min ≦y i ≦y i_max , z i_min ≦z i ≦z i_max ;

[0112] Among them, n max is the maximum value of the total number of relay points, r1 is the bending radius of the heat pipe at the relay point A1, r n The heat pipe is at relay point A n The bending radius at r1, θ1 is the central angle of the circle corresponding to r1, θ n For r n The corresponding central angle, l 1_max is the maximum distance from the relay point A1 to the hot end termination point P2, l 2_max Relay point A n The maximum distance to the cold end point Q2, x i Relay point A n The x-coordinate, x i_min and x i_max Relay point A n The maximum and minimum values ​​of the x-coordinate, y i Relay point A n The y coordinate of i_minand y i_max is the relay point A n The maximum and minimum values of the y coordinate of, z i is the relay point A n The z coordinate of, z i_min and z i_max is the relay point A n The maximum and minimum values of the z coordinate of.

[0113] As Figure 4 shown, the snake egret algorithm is used to iteratively optimize the second mathematical model. The steps for outputting the optimal layout model of the heat pipe include the following:

[0114] S110 - 2: Initialize the population and set the total number of iterations T.

[0115] S110 - 4: When the current iteration number t ≤ 1 / 3T, based on the differential evolution strategy, obtain the historical optimal model that may exist within the global range.

[0116] S110 - 6: When 1 / 3T < t ≤ 2 / 3T of the current iteration number, enhance local search based on the historical optimal model and Brownian motion.

[0117] S110 - 8: When t > 2 / 3T of the current iteration number, obtain the historical optimal model based on the Levy flight strategy, and combine with the non - linear perturbation factor to balance global and local search.

[0118] S110 - 10: Based on the non - linear perturbation factor, balance the global and local search results, thereby achieving a dynamic balance between global and local search, and ensuring that the global optimal solution of the heat pipe path layout scheme can be obtained and output in the complex solution space.

[0119] S110 - 12: Set the current iteration number t = t + 1, repeat the iterative process of S110 - 4 to S110 - 10. When the current iteration number t = T, output the optimal layout model of the heat pipe. Among them, the optimal layout model is the heat pipe path layout scheme with the strongest heat transfer capacity.

[0120] Thus, based on the position parameters of the hot - end starting point, hot - end ending point, cold - end starting point, cold - end ending point and relay point, the fitness function of the snake egret algorithm, the constraint conditions, and the total number of iterations T of the population, the snake egret algorithm is used to iteratively optimize the heat pipe path layout scheme, thereby obtaining the optimal solution of the heat pipe path layout scheme.

[0121] Example 1:

[0122] Example 1 of the present invention exemplifies a multi - constraint heat pipe layout method based on the snake egret algorithm, which is implemented through the following steps:

[0123] S102: According to the structural characteristics of the space camera and based on the heat conduction requirements, a first mathematical model of the heat pipe is established, a coordinate system is established in the heat pipe arrangement area, and the position parameters of the hot end starting point, hot end ending point, cold end starting point, cold end ending point and relay point of the first mathematical model are set.

[0124] Specifically, S102 includes the following steps:

[0125] S102-2: Determine the hot end starting point coordinates P1 (-632.9, -647.9, -0.2), the hot end ending point coordinates P2 (-932.9, -647.9, -0.2), the cold end starting point coordinates Q1 (-1797.5, -505.7, 1704.7), and the cold end ending point coordinates Q2 (-1785.1, -499.1, 1204.9) of the heat pipe.

[0126] S102-4: Set the total number of relay points n of the heat pipe, where n is a variable.

[0127] S102-6: Set relay point A1 on the extension line of line segment P1P2, calculate and obtain the coordinates of relay point A1 (-932.9+ l 1,0,0), and the distance from the relay point A1 to the hot end end point P2 l 1, l 1 is a variable.

[0128] S102-8: Set relay point A on the extension line of line segment Q1Q2 n , calculate and obtain relay point A n Coordinate A n (-1785.1+0.024 l 2,-499.1+0.0132 l 2,1204.9+0.9996 l 2), and relay point A n Distance to cold end point Q2 l 2, l 2 is a variable.

[0129] S102-10: Set up relay point A i Coordinate A of (i=2,3,...n-1) i (x ai ,y ai ,z ai ).

[0130] S102-12: Determine the heat pipe at each relay point A i Bending radius r at (i=1,2,...n) i , value r i =80mm.

[0131] S104: Selecting optimization variable parameters based on the position parameters.

[0132] Specifically, the total number of relay points n of the selected heat pipe, the distance from the relay point A1 to the hot end termination point P2 l 1. Relay Point A n Distance to cold end point Q2 l 2 and relay point A i Coordinate A of (i=2,3,...n-1) i (x ai ,y ai ,z ai ) as optimization variable parameters.

[0133] S106: Obtaining a heat transfer capability function of the heat pipe based on the optimized variable parameters, and obtaining a fitness function of the snake heron algorithm based on the heat transfer capability function.

[0134] Specifically, a 15mm Ø heat pipe was selected, and the heat transfer capacity per unit length of the same type of straight heat pipe was obtained as Q = 450 W∙m. The total length of the heat pipe, L, was set to the length between the hot end starting point and the cold end starting point of the heat pipe. Through experimental calibration, the weight coefficient k1 of the total length of the heat pipe, L, and the weight coefficient k2 of the total number of relay points, n, were determined to be 0.7. The heat transfer capacity function η of the heat pipe was calculated as follows:

[0135] , unit is W;

[0136] Obtain the fitness function F based on the heat transfer capacity function η:

[0137] .

[0138] The optimization goal of the snake heron algorithm is set to the minimum value of the fitness function F, that is, when the optimal solution of the heat pipe arrangement is obtained, the heat transfer capacity of the heat pipe is the strongest.

[0139] Specifically, the total length L of the heat pipe is expressed as:

[0140] ;

[0141] Among them, θ i For r i The corresponding central angle of the circle; specifically, taking θ1 as an example, the expression of θ1 is:

[0142] ;

[0143] It is understandable that θ i The expressions for (i=2,3,...n) are similar.

[0144] S108: Determine the constraint conditions of the heat pipe based on the position parameters, including:

[0145] ;

[0146] ;

[0147] ;

[0148] .

[0149] S110: Use the snake heron algorithm to iteratively optimize the second mathematical model and output the optimal layout model of the heat pipe.

[0150] Specifically, S110 includes the following steps:

[0151] S110-2: Initialize the population and set the total number of iterations T = 100.

[0152] S110-4: When the current iteration number t ≤ 33, based on the differential evolution strategy, obtain the possible historical optimal model within the global range.

[0153] S110-6: When the current iteration number 33 < t ≤ 66, based on the historical optimal model and Brownian motion, enhance the local search.

[0154] S110-8: When the current iteration number t > 66, based on the Levy flight strategy, obtain the historical optimal model, and combine with the non-linear perturbation factor to balance the global and local searches.

[0155] S110-10: Based on the non-linear perturbation factor, balance the global and local search results.

[0156] S110-12: Set the current iteration number t = t + 1, repeat the iterative process of S110-4 to S110-10. When the current iteration number t = T, output the optimal layout model of the heat pipe.

[0157] After the iterative process of step S110 ends, it is solved that when n = 4, l 1 = 143.82mm, l 2 = 21.70mm, x2 = -1502.91mm, y2 = -500.00mm, z2 = 900mm, the optimal solution F of the fitness function F is F = 5.95×10 -3 / W, making the heat transfer capacity of the heat pipe the strongest.

[0158] In Example 1, through iterative optimization using the Snake-Heron algorithm, a heat pipe routing solution that satisfies the constraints is obtained in a relatively short time, improving routing efficiency by over 90%. Furthermore, compared to traditional methods, this method addresses issues such as low heat pipe routing efficiency and non-global optimality, thereby obtaining a heat pipe routing solution with greater heat transfer capability and shorter paths. This significantly improves heat pipe routing efficiency and ensures the heat transfer performance of the heat pipes.

[0159] An embodiment of the present invention further provides a computer-readable storage medium storing computer program instructions. When the computer program instructions are executed by a processor, the multi-constraint heat pipe arrangement method based on the Serpentis algorithm provided by the present invention is implemented.

[0160] An embodiment of the present invention also provides an electronic device 1, including a memory 11 and a processor 12, wherein the memory 11 is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor 12 to implement the multi-constraint heat pipe arrangement method based on the snake egret algorithm provided by the present invention.

[0161] The storage medium / memory 11 includes, but is not limited to, RAM, ROM, magnetic disks, magnetic tapes, optical disks, flash memory, USB flash drives, mobile hard disks, memory cards, memory sticks, network server storage, network cloud storage, etc. The processor 12 includes, but is not limited to, a CPU (central processing unit 12), a GPU (graphics processing unit 12), an MCU (microprocessor 12), etc.

[0162] Finally, it should be noted that although the above embodiments have been described in the specification and drawings of the present invention, this does not limit the scope of patent protection of the present invention. All technical solutions generated by replacing or modifying equivalent structures or equivalent processes based on the essential concepts of the present invention using the contents recorded in the specification and drawings of the present invention, as well as directly or indirectly implementing the technical solutions of the above embodiments in other related technical fields, are included in the scope of patent protection of the present invention.

Claims

1. A multi-constraint heat pipe arrangement method based on the snake heron algorithm, characterized in that: Including: S102: Establish the first mathematical model of the heat pipe based on the heat conduction requirement, and set the position parameters of the starting point, ending point of the hot end, starting point, ending point of the cold end, and relay point of the first mathematical model; Establishing the first mathematical model of the heat pipe based on the heat conduction requirement and setting the position parameters of the starting point, ending point of the hot end, starting point, ending point of the cold end, and relay point of the first mathematical model includes: S102-2: Determine the coordinates P1 of the starting point of the hot end, coordinates P2 of the ending point of the hot end, coordinates Q1 of the starting point of the cold end, and coordinates Q2 of the ending point of the cold end of the heat pipe; S102-4: Set the total number n of relay points of the heat pipe; S102-6: Set relay point A1 on the extension line of line segment P1P2, obtain the coordinates of relay point A1 and the distance from relay point A1 to the hot end end point P2 l 1; S102-8: Set relay point A on the extension line of line segment Q1Q2 n , get relay point A n The coordinates of relay point A n Distance to cold end point Q2 l 2; S102-10: Set up relay point A i coordinates of (i=2,3,...n-1); S102-12: Determine the heat pipe at each relay point A i Bending radius r at (i=1,2,...n) i ; S104: Select the optimization variable parameters based on the position parameters; S106: Obtain the heat transfer capacity function of the heat pipe based on the optimization variable parameters, and obtain the fitness function of the snake heron algorithm based on the heat transfer capacity function; S108: Determine the constraint conditions of the heat pipe based on the position parameters; S110: Randomly generate the second mathematical model of the heat pipe based on the fitness function and the constraint conditions, and use the snake heron algorithm to perform iterative optimization on the second mathematical model, and output the optimal layout model of the heat pipe.

2. The multi-constraint heat pipe arrangement method based on the snake heron algorithm according to claim 1 is characterized in that: The optimization variable parameters include: The total number n of relay points of the heat pipe; Distance from relay point A1 to hot end termination point P2 l 1; Relay Point A n Distance to cold end point Q2 l 2; Relay Point A i (i=2,3,...n-1) coordinates.

3. The multi-constraint heat pipe layout method based on the snake heron algorithm according to claim 2, wherein: The heat transfer capacity function η is: ； The fitness function F is: ； Where, L is the total length of the heat pipe, n is the total number of relay points, Q is the heat transfer capacity of the same type of straight heat pipe per unit length, k1 is the weight coefficient of the total length L of the heat pipe, and k2 is the weight coefficient of the total number n of relay points.

4. The multi-constraint heat pipe layout method based on the snake heron algorithm according to claim 3, wherein: The constraint conditions include: 2≦n≦n max ; ≦ l 1≦ l 1_max ； ≦ l 2≦ l 2_max ； x i_min ≦x i ≦x i_max ,y i_min ≦y i ≦y i_max ,z i_min ≦z i ≦z i_max ; Among them, n max is the maximum value of the total number of relay points, r1 is the bending radius of the heat pipe at the relay point A1, r n The heat pipe is at relay point A n The bending radius at r1, θ1 is the central angle of the circle corresponding to r1, θ n For r n The corresponding central angle, l 1_max is the maximum distance from the relay point A1 to the hot end termination point P2, l 2_max Relay point A n The maximum distance to the cold end point Q2, x i Relay point A n The x-coordinate, x i_min and x i_max Relay point A n The maximum and minimum values ​​of the x-coordinate, y i Relay point A n The y coordinate of i_min and y i_max Relay point A n The maximum and minimum values ​​of the y coordinate, z i Relay point A n The z coordinate, z i_min and z i_max Relay point A n The maximum and minimum z-coordinates.

5. The multi-constraint heat pipe arrangement method based on the snake heron algorithm according to claim 4 is characterized in that: Using the snake heron algorithm to perform iterative optimization on the second mathematical model and outputting the optimal layout model of the heat pipe includes: S110-2: Initialize the population and set the total number of iterations T; S110-4: When the current iteration number t ≤ 1 / 3T, based on the differential evolution strategy, obtain the possible historical optimal model within the global range; S110-6: When the current iteration number 1 / 3T < t ≤ 2 / 3T, based on the historical optimal model and Brownian motion, enhance the local search; S110-8: When the current iteration number t > 2 / 3T, based on the Levy flight strategy, obtain the historical optimal model, and combine the non-linear perturbation factor to balance the global and local searches; S110-10: Based on the non-linear perturbation factor, balance the global and local search results; S110-12: Set the current iteration number t = t + 1, repeat the iterative process of S110-4 to S110-10, and when the current iteration number t = T, output the optimal layout model of the heat pipe.

6. A computer-readable storage medium storing computer program instructions, characterized in that: The computer program instructions implement the multi-constraint heat pipe layout method based on the snake heron algorithm according to any one of claims 1 to 5 when executed by a processor.

7. An electronic device comprising a memory and a processor, characterized in that: The memory is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the multi-constraint heat pipe arrangement method based on the Snake Heron algorithm according to any one of claims 1 to 5.

Images