Next Article in Journal
Quantitative Analysis of Soil Cd Content Based on the Fusion of Vis-NIR and XRF Spectral Data in the Impacted Area of a Metallurgical Slag Site in Gejiu, Yunnan
Previous Article in Journal
The Kinetic Mechanism of the Thermal Decomposition Reaction of Small Particles of Limestone at Steelmaking Temperatures
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Tabu-Matching Heuristic Algorithm Based on Temperature Feasibility for Efficient Synthesis of Heat Exchanger Networks

Shanghai Key Laboratory of Multiphase Flow and Heat Transfer in Power Engineering, School of Energy and Power Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China
*
Author to whom correspondence should be addressed.
Processes 2023, 11(9), 2713; https://doi.org/10.3390/pr11092713
Submission received: 9 August 2023 / Revised: 5 September 2023 / Accepted: 8 September 2023 / Published: 11 September 2023
(This article belongs to the Topic Advanced Heat and Mass Transfer Technologies)

Abstract

:
The non-structural model of heat exchanger networks (HENs) offers a wide solution space for optimization due to the random matching of hot and cold streams. However, this stochastic matching can sometimes result in infeasible structures, leading to inefficient optimization. To address this issue, a tabu matching based on a heuristic algorithm for HENs is proposed. The proposed tabu-matching method involves three main steps: First, the critical temperature levels—high, medium, and low-temperature intervals—are determined based on the inlet and outlet temperatures of streams. Second, the number of nodes is set according to the temperature intervals. Third, the nodes of streams are flexibly matched within the tabu rules: the low-temperature interval of hot streams with the high-temperature interval of cold streams; the streams crossing cannot be matched. The results revealed that by incorporating the tabu rules and adjusting the number of nodes, the ratio of the feasible zone in the whole solution domain increases, and the calculation efficiency is enhanced. To evaluate the effectiveness of the method, three benchmark problems were studied. The obtained total annual costs (TACs) of these case studies exhibited a decrease of USD 4290/yr (case 1), USD 1435/yr (case 2), and USD 11,232/yr (case 3) compared to the best published results. The results demonstrate that the proposed tabu-matching heuristic algorithm is effective and robust.

1. Introduction

With the continuous depletion of fossil energy resources and growing concerns about global warming, the energy crisis has emerged as one of the most pressing concerns in today’s global economy. Heat exchangers are significant elements within a thermal system [1], where some heat exchangers are organized to operate as heat exchanger networks (HENs) to recover waste heat and lower overall energy consumption. Solving the HEN synthesis problem involves dealing with both integer variables (e.g., stream matches) and continuous variables (e.g., heat exchanger load and stream split fractions). Accordingly, this problem can be categorized as a mixed-integer nonlinear programming problem. Moreover, the research on HEN synthesis can be extended to tackle optimization problems in domains closely related to system integration. These domains include the synthesis of mass exchange networks [2], hydrogen distribution networks [3], water networks [4], and transmission and distribution networks [5,6,7]. Hence, the global optimization of the HEN synthesis problem is considered a challenging and hot research topic in the field of process system integration.
In this context, pinch point techniques [8,9], deterministic methods [10,11], and heuristic methods [12,13,14,15] have been successively applied to HEN synthesis. Recently, Fu et al. [16] used pinch analysis in the shifted temperature driving force plot to improve energy recovery and economic benefits in the transformation of HENs. Orosz et al. [17] proposed a heuristic framework for selecting the best structural parameters via an extension of the P-HEN synthesis solver. Lakner et al. [18] modified the P-graph-based HEN synthesis method and proposed a procedure for HEN synthesis that determines the best, n-best, or all feasible HENs for all periods, considering variable approach temperatures. It is worth noting that the aforementioned methods achieved reasonable optimization results.
The models of HEN synthesis serve as the foundation for synthesis and are designed to streamline algorithm implementation and result representation. The stage-wise superstructure (SWS) model [19] is one of the most widely used models. The SWS model contains most structures and can achieve reasonable solutions in various case studies and scenarios. However, some heat exchange patterns in SWS are not feasible [19]. Numerous models [20,21,22,23] have been proposed to bolster the model’s adaptability and broaden its solution scope to enhance its practical problem-solving capacity. Xiao [24] proposed a non-structural model (NSM) without frame constraints, different from the constraints of the SWS model. The proposed model uses nodes on the streams as connection points for the heat exchanger units. During optimization, the hot and cold nodes can be freely matched, enabling a more accessible and flexible matching design and ensuring a sufficient solution space.
From the thermodynamic standpoint, the random nature of mode matching in the NSM model may yield infeasible structures, such as heat exchanger units with temperature crossover or heat transfer from a low-temperature stream to a high-temperature stream. Researchers [25,26,27] introduced penalty functions to avoid impractical structures. These functions are added to the objective function when constraints are violated. This approach does not prevent the generation of infeasible solutions but directs the network population to the feasible domain with high probability, thereby effectively preventing infeasible solutions. However, only a few studies have approached the issue from the perspective of narrowing down the infeasible domains.
This paper introduces a temperature interval tabu matching of the Random Walk algorithm with Compulsive Evolution (RWCE-TB) to eliminate infeasible matching structures while preserving valuable iterations and discarding ineffective ones, thereby improving the optimization quality. The method is based on the concept of locating the temperature interval for each process stream, namely high, medium, or low-temperature intervals. Then, the number of nodes is set according to the temperature intervals. Since calculating each HEN involves traversing all predefined nodes in the NSM model, the configuration of nodes affects the efficiency of optimization. The NSM typically assigns an equal number of nodes to both hot and cold streams. However, streams with larger temperature spans can lead to more diverse matching relationship situations. Hence, it is essential to adjust the allocation of nodes accordingly. This adjustment ensures an adequate number of nodes for streams with larger temperature spans, preventing the issue of insufficient nodes, which may hinder the flexible insertion of new stream matches. Conversely, for streams with smaller temperature spans, the number of nodes should be reduced appropriately to avoid the unnecessary waste of nodes and reduce computation time caused by an excessive number of nodes. Finally, a tabu matching is proposed based on temperature intervals. Specific matches are considered “forbidden” or “restricted” to eliminate infeasible matching structures in tabu matching. The nodes of streams are flexibly matched, but the following nodes are in the tabu rules, which cannot be matched:the nodes on the low-temperature interval of hot streams with that on the high-temperature interval of cold streams, and the nodes onthe streams that are temperature crossings.
The remainder of this article is organized as follows: The HEN synthesis problem, the NSM, the objective function, and constraints are introduced in Section 2. In Section 3, the RWCE is utilized to solve the problem, the infeasible matching structures in the NSM with RWCE and their adverse effects on the optimization are discussed, and then the heuristic optimization method for tabu matching the temperature intervals of HEN synthesis is introduced. In Section 4, the established method is employed in three test cases to verify its effectiveness. Finally, the main achievements are summarized in Section 5.

2. Model Formulation

2.1. Problem Statements

In a chemical process, NH hot streams require cooling, and NC cold streams need to be heated. To this end, multiple heat exchangers are designed to facilitate heat recovery from the hot streams and utilize the absorbed heat in the cold streams. The design involves various parameters, including the inlet and outlet temperatures of the streams, heat capacity flow rate, and convective heat transfer coefficient. This arrangement forms a HEN. In cases where heat recovery alone cannot reach the desired target temperature, additional hot and cold utilities are necessary, consuming extra hot and cold sources. Typically, saturated steam and cooling water are commonly chosen as the hot and cold utilities, respectively, due to their known inlet and outlet temperatures and heat transfer coefficients. These utilities are used to either heat the cold process streams or cool the hot process streams to the target temperature. The primary goal of HEN synthesis is to enhance system energy efficiency or reduce investment costs.

2.2. Non-Structural Model

Xiao et al. [24] introduced a widely used NSM for the HEN synthesis problem. This model offers significant freedom and randomness, which contributes to expanding the solution domain and obtaining global optimal solutions. The NSM constructs heat exchanger units through node connections, resulting in a highly flexible matching of heat exchanger units and ensuring optimization continuity. This characteristic allows for the generation of diverse potential network structures.
Figure 1 illustrates a schematic diagram of an example, labeled as H2C2. “H” and “C” signify hot and cold streams, respectively; the subsequent numerical values indicate the number of hot and cold streams. Specifically, H2C2 consists of NH = 2 hot streams and NC = 2 cold streams. In Figure 1, each horizontal line with arrows represents a stream, whereas the red and blue lines represent hot and cold streams. The arrows indicate the flow direction of the streams. Along each stream, hollow dots represent nodes where heat exchanger units can be located. At the end of the streams, a C in a blue hollow dot and an H in a red one indicate cold and hot utility, respectively. A set of solid nodes connected by a black straight line represents the presence of a heat exchanger unit at that specific location of a hot and cold node. In this example, the number of hot stream nodes per stream is set to NdH = 3, and the number of cold stream nodes per stream is set to NdC = 3. There are four heat exchanger units indicated by these solid nodes.

2.3. Objective Function

The optimization objective of the HEN in this work is to minimize the TAC, which can be expressed as follows:
min T A C = n bH = 1 N bH ( F Fix + C A A n bH ε ) X n bH + i = 1 N H ( F Fix + C A A CU , i ε ) X CU , i + j = 1 N C ( F Fix + C A A HU , j ε ) X HU , j + i = 1 N H ( C CU Q CU , i ) X CU , i + j = 1 N C ( C HU Q HU , j ) X HU , j
where NH and NC are the number of hot and cold streams, respectively. Variable X is a binary variable that can take the value 0 or 1. When X equals 1, it indicates the presence of a heat exchanger or cold and hot utility at the corresponding nodes. On the other hand, when X is 0, the nodes are empty without any units. Ffix is the fixed investment cost, CA is the area cost coefficient, and n bH is the serial number on the hot stream nodes. ε is the area cost index, and CCU and CHU are the coefficients of the operating cost of cold and hot utilities, respectively. A n bH , A CU , i , and A HU , j are the areas of heat exchanger unit, cold utility, and hot utility, respectively. Meanwhile, QCU,i and QHU,j are the consumption heat loads of cold and hot utilities, respectively. The first three items in the equation represent the fixed investment and area costs associated with the heat exchanger units and the cold and hot utility equipment. On the other hand, the last two items represent the energy consumption costs incurred by the cold and hot utilities. The TAC is also related to the area of heat exchangers, which can be expressed as follows:
A n bH = Q n bH U i , j L M T D n bH , i N H , j N C , n bH N bH
U i , j = h i h j h i + h j , i N H , j N C
L M T D n bH = { ( T n bH in T M C ( n bH ) out ) ( T n bH out T M C ( n bH ) in ) L n ( T n bH in T M C ( n bH ) out T n bH out T M C ( n bH ) in ) , T n bH in T M C ( n bH ) out T n bH out T M C ( n bH ) in ( T n bH in T M C ( n bH ) out ) + ( T n bH out T M C ( n bH ) in ) 2 , T n bH in T M C ( n bH ) out = T n bH out T M C ( n bH ) in
where U i , j is the total heat transfer coefficient, h is the convective heat transfer coefficient of the stream, and LMTD is the logarithmic mean temperature difference. When the heat transfer temperature difference between the left and right ends of the heat exchanger unit is less than 10−5 °C, the arithmetic mean temperature difference is used instead of the logarithmic mean temperature difference. The superscripts “in” and “out” indicate the inlet and outlet, respectively. The subscripts i and j represent the ith hot stream and jth cold stream, respectively. M C ( n bH ) is the serial number of the cold node connected with the hot stream node nbH.

2.4. Constraints

For each HEN structure, the following constraints should be satisfied:
(i)
Overall heat balance in each stream
( T H , i in T H , i target ) F C P , i = n dH = 1 N dH Q H , i , n dH + Q CU , i   ,   i N H
( T C , j target T C , j in ) F C P , j = n dC = 1 N dC Q C , j , n dC + Q HU , j   ,   j N C
where NdH and NdC are the number of nodes on each hot and cold stream, respectively.
(ii)
Temperature constraints
The temperature should satisfy the following constraints to prevent the temperature crossing and infinite exchanger area:
T n bH in T M C ( n bH ) out Δ T min
T n bH out T M C ( n bH ) in Δ T min
T N dH , i out T CU , i out Δ T min
T H , i traget T CU , i in Δ T min
T HU , j in T C , j target Δ T min
T HU , j out T 1 , j in Δ T min
where Δ T min is the minimum approach temperature.

3. Solution Approach

This section focuses on the RWCE approach in solving the HEN synthesis problem using the NSM model, addressing infeasible matching structures and their optimization-related consequences. Subsequently, the implementation of RWCE with tabu matching (RWCE-TB) is discussed.

3.1. Random Walk Algorithm with Compulsive Evolution

Figure 2 depicts the detailed flowchart of the RWCE, a simultaneous heuristic approach used for the global optimization of HEN issues [15]. This method leverages the principles of the random walk algorithm, which allows for the simultaneous optimization of integer and continuous variables. The optimization process involves randomly adjusting the heat loads of the heat exchangers. The critical optimization steps within RWCE include initialization, evolution, generation, selection, and mutation. Importantly, RWCE incorporates a probability mechanism that allows for accepting imperfect solutions, which helps prevent the algorithm from getting trapped in local optima and improves the chances of finding global optima.
(1)
Initialization of individual structure
In the RWCE optimization approach, the HEN is represented by a population of N individuals (n = 1, 2, …, N). Each individual in the population is a potential HEN structure. During the initialization phase, the HEN’s design is set to be empty, with nodes left unconnected. Consequently, the streams within the HEN initially rely on energy from the utilities to reach their desired target temperatures.
(2)
Random walking operation
A random evolutionary process of the heat loads is performed in a HEN structure, specifically for the existing heat exchanger units. This process is governed by an evolution probability denoted as ϕ . This can be mathematically expressed in the form below:
( Q n bH ) i t + 1 = { ( Q n bH ) i t + ( 1 2 ρ ) Δ L β ω 1   ,   if   r 1 < ϕ ( Q n bH ) i t   ,   otherwise
where Qit and Qit+1 are the heat load of the heat exchanger unit at iteration ‘it’ and the heat load of the same heat exchanger unit after undergoing a random walk. The parameters ρ, β, and ω1 are random numbers within the range of (0, 1). Moreover, ΔL determines the maximum step size during evolution, while ( 1 2 ρ ) determines the direction of movement in each dimension in each individual evolution.
(3)
Heat exchanger elimination
When the heat load of a heat exchanger unit falls below the threshold value Qmin after the random walking process, this indicates that the heat exchanger is not operating efficiently. In such cases, the heat exchanger will be forcibly eliminated from the network, and its original node connection relationship will be removed.
Q n bH = { Q n bH ,   if   Q n bH > Q min 0 ,   otherwise  
(4)
New heat exchanger unit generation
Generating a new heat exchanger unit involves randomly selecting nodes from the hot and cold streams. In cases where no matching relationship exists between the selected nodes, a certain probability θ is used to generate one new heat exchanger unit. The new unit is then assigned a random heat load. The implementation method is as follows:
Q H , new = { Q max × ω 2 ,   if   ( r 2 < θ ) 0 ,   otherwise
M H , new = { N bH × ω 3 ,   if   ( r 2 < θ ) 0 ,   otherwise
M C , new = { N bC × ω 4   ,   if   ( r 2 < θ ) 0 ,   otherwise
where Qmax denotes the maximum heat load of the newly generated heat exchanger unit, and ω2, ω3, ω4, and r2 are random numbers between (0, 1).
(5)
Selection and mutation operations
If the TAC of the evolved structure decreases compared to the previous iteration, it is accepted as the initial structure for the next iteration without any condition. However, if the TAC increases after evolution, the network with a higher cost is still considered with a certain probability, denoted as δ. To decide whether to accept the imperfect solution with increased cost, a randomly generated number denoted as r3 is compared to δ. If r3 is smaller than δ, the imperfect solution with the increased TAC is accepted as the initial structure for the next evolution iteration. Otherwise, the original structure from the previous iteration is retained. ( f n ) i t represents the TAC of the HEN for the iteration numbered it, and ( f n ) i t + 1 represents the TAC of the HEN for the (it + 1) iteration. The implementation method can be expressed as follows:
( f n ) i t + 1 = { ( f n ) i t + 1 , if   ( f n ) i t + 1 ( f n ) i t ( f n ) i t + 1 , else   if   ( r 3 < δ )   ( f n ) i t , otherwise
(6)
Iteration termination
The calculation terminates when the iteration number reaches the maximum iteration ITmax.

3.2. Infeasible Matching Caused by RWCE

Two common instances of impossible matching can arise when using heat loads of heat exchanger units as optimization variables in the NSM. One such instance is when a heat exchanger unit exhibits temperature crossover, and the other is when heat is transmitted from hot streams with lower temperatures to cold streams with higher temperatures. These infeasible matching structures can be handled through inner utilities or penalty methods, but they often come with an associated cost increase or penalty. The penalty or inner utilities substituting method in the NSM can lead to high penalty costs for these infeasible structures. As a result, most of these structures are typically not accepted during the optimization process, which can lead to wasted time at that particular iteration. Furthermore, the RWCE algorithm adopts a mechanism of accepting imperfect solutions. It accepts a small portion of these infeasible structures by allowing imperfect solutions. This approach may waste iteration steps and alter the optimization path.

3.2.1. Temperature Crossover

Counter-current heat transfer is a widely employed method to enhance the heat transfer efficiency between cold and hot streams. However, a temperature crossover arises when the hot stream exhibits lower inlet and outlet temperatures than the cold stream, contradicting thermodynamic principles. This temperature crossover phenomenon can occur at the following heat exchanger location, as illustrated in Figure 3. The RWCE algorithm, commonly utilized for optimizing HENs, may accept imperfect structures with temperature crossovers due to its acceptance of imperfect solutions. Infeasible configurations are usually managed using the inner utilities substituting method or penalty functions to ensure the optimization process can continue. Unfortunately, the penalty method approach incurs additional costs, adversely affecting the optimization process and reducing overall efficiency.

3.2.2. Extreme Match

The fundamental law of thermodynamics dictates that heat naturally flows from high-temperature objects to low-temperature objects, but not in the reverse direction. When the random pairing of nodes results in a hot node having a lower temperature than a cold node, heat transfer cannot occur, rendering the node pairing invalid. In the H7C3 case study [28], as shown in Figure 4, it is evident that the temperature level of the H1, H2, H3, and H4 streams is lower than that of the C1 stream. As a result, the heat exchanger pairings with their respective nodes are ineffective matches, leading to increased costs and rendering the configuration impractical.

3.2.3. Adverse Effects of Infeasible Structures

The typical approach of substituting with internal utilities or applying high-cost penalty functions is often used to address the infeasible structures generated during the HEN optimization. However, this approach can impact the optimization path and reduce the overall efficiency of the optimization process.
(1)
Impact on optimization paths
The penalty function method is commonly employed to handle inequality constraints in optimization problems. It involves assigning a specific penalty value to infeasible solutions that violate the established rules. This penalty value increases the TAC associated with the infeasible solution, making it less favorable and, thus, less likely to be selected by the optimization algorithm during the selection mechanism. On the other hand, the selection mechanism of the RWCE algorithm incorporates the acceptance of imperfect solutions. It allows for accepting results with larger TAC values with a certain probability. The selection of imperfect solutions is determined randomly based on this probability, and as a result, some infeasible solutions can be included in the selection process under the RWCE algorithm. To illustrate this difference in approach, the H4C5 case [29] can be used as an example.
Accepting the infeasible solution at step 12,581,610 is a representative case illustrating its effect on the optimization path. In Figure 5, which demonstrates the change in cost during the optimization process of the nine-stream case, the point denoted as P represents the infeasible solution containing the penalty value accepted at step 12,581,610. As evident in Figure 5, the infeasible solution’s acceptance significantly impacts the TAC. Due to the penalty value associated with the infeasible solution, its TAC increases abruptly after being accepted. However, introducing this infeasible solution also obstructs the optimization process of the original feasible solutions. The subsequent optimization paths evolve with this infeasible solution as the starting point, influencing the direction of the optimization. Consequently, some feasible solutions with evolutionary potential lose the opportunity to continue their evolution and may miss out on discovering better solutions. This effect leads to a decline in the optimization path and a stagnation in TAC, negatively impacting the overall optimization process.
(2)
Impact on optimization efficiency
Optimizing infeasible structures can lead to the rejection of most structures due to their high cost, resulting in wasted iteration time. While a small portion of infeasible structures is accepted by the imperfect acceptance mechanism of the RWCE algorithm, using such structures as initial configurations for the next iteration can waste additional iteration steps.
For example, in the H7C3 case depicted in Figure 6, assuming five nodes per stream and generating only one heat exchanger at a time, there are a total of 7 × 3 × 5 = 525 stream matching methods for node selection. Among these, when H1, H2, H3, and H4 are matched with the C1 stream, the resulting structure is invalid due to the mismatch of the hot stream’s low-temperature portion with the cold stream’s the high-temperature portion. A total of 4 × 5 × 5 = 100 combinations are produced with this invalid structure, accounting for 19% of the total matching methods. The listed invalid nodes, in this case, include only the nodes where the hot stream’s lower temperature interval and the cold stream’s higher temperature interval coincide, excluding any invalid node matches caused by temperature crossovers. The proportion of invalid matching structures in the randomly selected node matching is one fifth of the total ratio, leading to a further increase in cost and wasting computational resources and efficiency.

3.3. RWCE-TB Method

Based on the observed phenomenon of infeasible structures and their impact on optimization efficiency, accepting infeasible structures may lead to more iterations required to return to the feasible domain, making it challenging to find better structures and reducing optimization efficiency. Additionally, accepting infeasible structures, such as those with temperature crossovers or heat transfer from low-temperature to high-temperature sites, can replace the original, more feasible structures, further hindering the optimization process and affecting the optimization path. To address these issues, a new approach called the temperature interval tabu matching of RWCE (RWCE-TB) is proposed based on the rule of random matching of hot and cold nodes in the NSM.

3.3.1. The RWCE-TB Method

The key idea of the RWCE-TB method is to prohibit the generation of invalid matched heat exchanger units, thus avoiding the adverse effects of infeasible structures on the entire HEN optimization process. The tabu conditions in RWCE-TB are divided into two categories. The first type of constraint occurs when an infeasible structure cannot be realized through inner utility substitutions. The second type of constraint arises when there is a mismatch in the heat exchanger unit, particularly when a low-temperature hot stream is matched with a high-temperature cold stream.
The primary process of the method is the same as that of the RWCE, except for a change in the operation of the new heat exchanger unit generation. A random empty node on the hot and cold streams is selected during the new individual generation stage to form a heat transfer match. If the temperature position meets the tabu-matching conditions, the location of the newly generated heat transfer unit is revisited to re-select the hot and cold streams. If not, the heat transfer match is randomly assigned a specific heat load, and a new heat transfer unit is generated, continuing the optimization downward. The stage of new heat exchanger generation of the RWCE is improved, as shown in Figure 7. The yellow parts are improvement to RWCE, while the blue one is the original parts of RWCE.

3.3.2. Steps of RWCE-TB Method

The main steps of the RWCE-TB method are as follows:
Step 1: Sort the temperatures
The import and export temperatures of all the hot and cold streams are sorted from smallest to largest and labeled sequentially to form an array, with the maximum value of the number being NT.
N T = 2 ( N H + N C )
Step 2: Divide the temperature intervals
Two temperatures, T low - mid and T mid - high , are defined as temperature boundaries to divide each stream of the HEN into three intervals: high temperature, medium temperature, and low temperature. T low - mid is the boundary for the division of low to medium temperatures, and Tmid-high is the boundary for the division of medium to high temperatures. The two temperature boundaries are set as follows:
Tlow-mid = Tint(NT/3)+1
Tmid-high = Tint(2NT/3)+1
where “int” is the round operator.
Step 3: Set the number of nodes
The allocation of nodes is based on the temperature intervals in which each stream is located and takes into account the maximum number of nodes allowed for a stream, denoted as Nmax. Depending on the number of temperature intervals a stream spans, the nodes are allocated according to specific principles. Specifically, the number of nodes allocated for streams in only one temperature interval is denoted as N1. For streams spanning two temperature intervals, the number of nodes assigned is denoted as N2. Similarly, for streams spanning three temperature intervals, the number of nodes allocated is represented as N3. The calculation of the number of nodes assigned for these three cases is determined using Equations (22)–(24).
N 1 = int ( N max / 3 ) + 1
N 2 = int ( 2 · N max / 3 ) + 1
N 3 = N max
Step 4: Tabu match with temperature interval
When the RWCE algorithm enters the generation of the heat exchanger unit operation, it randomly selects a group of nodes to be excluded from forming a match under the following conditions:
Step 4.1: If the temperature level of the hot node is lower than the temperature level of the cold stream, as shown in Equation (25), the node is reselected.
T n bH in < T MC ( n bH ) in
Step 4.2: If there is a temperature crossover between the hot and cold streams, as shown in Equations (26) and (27), the inner utilities substitute the infeasible stream matches. The heat load remains the same as the original amount at these nodes, as shown in Equation (28).
{ T n bH in T M C ( n bH ) out < Δ T min T n bH out T M C ( n bH ) in > Δ T min
{ T n bH in T M C ( n bH ) out > Δ T min T n bH out T M C ( n bH ) in < Δ T min
Q incu , n bH = Q inhu , M C ( n bH ) = Q n bH
The hot stream exchanges heat with the inner cold utility. In contrast, the cold stream exchanges heat with the inner hot utility. In this case, the temperature can be obtained from Equations (29) and (30). If the constraint of the inner utilities is not met, as shown in Equations (31)–(34), the nodes are reselected.
L M T D n bH inner = { ( T n bH in T CU out ) ( T n bH out T CU in ) L n ( T n bH in T CU out T n bH out T CU in ) , T n bH in T CU out T n bH out T CU in ( T n bH in T CU out ) + ( T n bH out T CU in ) 2 , T n bH in T CU out = T n bH out T CU in
L M T D M C ( n bH ) inner = { ( T HU in T M C ( n bH ) out ) ( T HU out T M C ( n bH ) in ) L n ( T HU in T M C ( n bH ) out T HU out T M C ( n bH ) in ) , T HU in T M C ( n bH ) out T HU out T M C ( n bH ) in ( T HU in T M C ( n bH ) out ) + ( T HU out T M C ( n bH ) in ) 2 , T HU in T M C ( n bH ) out = T HU out T M C ( n bH ) in
T n bH in T CU out > 0.0
T n bH out T CU in > 0.0
T HU in T M C ( n bH ) out > 0.0
T HU out T M C ( n bH ) in > 0.0
where L M T D n bH inner and L M T D M C ( n bH ) inner are the logarithmic mean temperature difference at the hot node nbH and cold node MC(nbH), respectively.

4. Cases Analysis

This section will implement and demonstrate the proposed heuristic algorithm with tabu matching to solve three classical HEN cases: H6C4, H7C3, and H13C7. We will compare the results obtained from our algorithm with the results reported in the literature for other methods to showcase the global search capability of our proposed method. The parameters of the RWCE algorithm and the number of nodes in the NSM are set as specified in Table 1.

4.1. Case 1 (H6C4)

Case 1 comprises ten streams, with six hot streams and four cold streams. The stream parameters are listed in Table 2. This example focuses on a typical test case, which has been extensively investigated by researchers to evaluate the performance of algorithms [28]. In this regard, Ahmad [28] utilized the pinch point method to achieve a minimum TAC of USD 707,400/yr. Yerramsetty [30] used a differential evolution method for simultaneous optimization and obtained a minimum TAC of USD 5,666,765/yr. Khorasany [31] proposed a hybrid optimization method and achieved a minimum TAC of USD 5,662,366/yr for this case. Zhang [32] employed an efficient process stream arrangement strategy based on a chessboard representation, resulting in a minimum TAC of USD 5,607,762/yr. Rathjens et al. [33] proposed a local optimization method embedded in a stochastic global search with a customized genetic algorithm and an SWS model. Xu et al. [34] introduced a phased modular concept, supporting functional and sub-functional combinations for efficient optimization. Chen et al. [35] proposed a polymorphic firefly algorithm with a self-adaptation method and achieved a minimum TAC of USD 5,592,255/yr.
The RWCE with the tabu-matching temperature intervals strategy is applied to optimize the HEN, determining temperature boundaries of 56 °C for the medium and low-temperature level intervals and 86 °C for the medium and high-temperature level intervals. The streams across three temperature level intervals, H2, H3, and C4, are each assigned nine nodes. The streams across two temperature level intervals, including H1, H6, C2, and C3, are allocated six nodes each. Lastly, the streams across one temperature level interval, H4, H5, and C1, are assigned three nodes each, as illustrated in Figure 8. The results of the HEN optimization using the NSM model with the original RWCE method (NSM & RWCE) and the RWCE with tabu-matching method (NSM & RWCE-TB) are shown in Figure 9 and Figure 10. Moreover, a comparison with published results is presented in Table 3.
Different colors represent various temperature intervals where each node is located, with red indicating the high-temperature interval, yellow for the medium-temperature interval, and blue for the low-temperature interval. The absence of a heat exchanger with a blue solid circle on the hot stream and a red solid circle on the cold stream indicates that the low-temperature level of the hot stream cannot be matched with the high-temperature level of the cold stream. Furthermore, neither figure has temperature crossover matching, indicating that such configurations are not allowed in the free-matching temperature intervals. However, the random matching in the NSM & RWCE method may produce heat exchanger units with matches on H4, C2, and C3, which are infeasible connections. The optimization process requires multiple iteration steps to eliminate these invalid matching structures. In contrast, the proposed method reduces the need for iterations to eliminate such invalid matches within the same number of iteration steps. As a result, it achieves a cost reduction of USD 1465/yr compared to the original NSM & RWCE approach at the same maximum iteration. Additionally, the proposed method performs better when compared with the literature results and achieves a cost reduction of USD 4101/yr compared to the literature results [20]. The results exhibit a decrease of 21% in comparison to the outcomes presented by Ahmad [28]. These findings highlight the efficacy of the methodology presented in this paper.

4.2. Case 2 (H7C3)

Case 2 consists of seven hot and three cold streams, first presented by Ahmad in the literature [36]. Table 4 provides problem data and the annual costs of heat exchanger units (Table 4). Ahmad obtained the minimum TAC using the pinch point method, which was USD 9,490,000/yr. Liu et al. [37] used a hybrid genetic algorithm and achieved a minimum annual integrated cost of USD 8,917,245/yr for the final structure of this case. Additionally, Liu et al. [38] used the RWCE algorithm with an improved step size to optimize the SWS model and obtained a minimum annual integrated cost of USD 8,707,983/yr for this example. The proposed method exhibits better performance compared to the literature results (Table 5) in this paper.
The division of temperature intervals and node assignments for Case 2 is shown in Figure 11. The results obtained using the NSM & RWCE and NSM & RWCE-TB methods are depicted in Figure 12 and Figure 13, respectively. One significant difference between the two structures is the varying number of heat exchanger units in the network. Since the fixed investment cost is not considered in this example, the presence of more heat exchanger units in the proposed method does not incur additional fixed investment costs. As a result, the proposed method includes seven more heat transfer units than the original model. The TAC of the proposed method is lower than that of the NSM & RWCE method because it obtains less utility heat transfer, leading to a reduction in the TAC.
The two structures obtained using NSM & RWCE and NSM & RWCE-TB methods share some similarities. Both structures have no heat exchanger on the H1 stream and only one cold utility. Additionally, there are more heat exchanger units on C2, and no heat exchanger units are present between the hot streams H1, H2, H3, and H4 and the cold stream C1 in the final structure of both HENs. However, the optimization process of the NSM & RWCE method requires several iterations to eliminate the heat exchange units between H1, H2, H3, and H4 and the cold stream C1 to achieve a better structure. On the other hand, the temperature-based tabu-matching heuristic method in NSM & RWCE-TB restricts the generation of such infeasible heat exchanger units, improving the optimization quality of the HEN. As a result, the minimum TAC obtained from the NSM & RWCE-TB method is USD 8943/yr lower than that of the NSM & RWCE method, and USD 1435/yr lower than the best reported in the literature by Liu et al. [38].

4.3. Case 3 (H13C7)

Case three consists of thirteen hot and seven cold streams, initially proposed by Kravanja and Soršak [39]. The specific parameters of the example are listed in Table 6. Several studies have previously optimized this case using different algorithms and obtained various minimum TAC values. For instance, Pavão et al. [40] used a combination of genetic and particle swarm algorithms to achieve a minimum TAC of USD 1,516,482/yr. Xiao et al. [41] optimized an SWS model and RWCE with a fine search strategy to obtain a minimum TAC of USD 1,447,482/yr. Zhang et al. [42] used a modified cuckoo algorithm and achieved a minimal TAC of USD 1,418,981/yr. Xu et al. [43] proposed a relaxation strategy for HEN synthesis with non-zero fixed capital costs. The generation and elimination of heat exchangers are promoted by retrofitting the formulation of costs, leading to a TAC of USD 1,412,801/yr. Caballero et al. [44] proposed a sequential approach combining the TransHEN and the HENDesign model, obtaining a TAC of USD 1,414,831/yr. Chang et al. [45] developed a global optimum search algorithm with a TAC of USD 1,407,203/yr.
For this case, the temperature boundaries for the low and medium temperature intervals are set at 140 °C, while those for the high and medium temperature intervals are set at 322 °C. The streams H1, H2, H3, H6, H7, H9, H10, H11, H12, H13, C3, C5, C6, and C7 spanning one temperature interval are assigned three nodes thereon, the streams H4, H5, C2, and C4 spanning two temperature intervals are posted with six nodes, and nine nodes are given to the stream C1 spanning three temperature level intervals, as shown in Figure 14. The configurations are shown in Figure 15 and Figure 16.
In both Figure 15 and Figure 16, all heat exchanger units are matched by stream nodes in adjacent or the same temperature intervals. The NSM & RWCE method resulted in four utilities, while the NSM & RWCE-TB method yielded three. The total number of possible matching relationships between hot and cold stream nodes in the optimization process is reduced despite the temperature interval tabu-matching strategy limiting infeasible matches. However, this does not impact the diversity of individual evolutions in the feasible domain, leading to high-quality optimization results. Table 7 indicates that the results presented in this paper are generally superior to those reported in previous publications. Comparing the proposed methodology to the original NSM-RWCE algorithm, it is found that the former leads to an annual savings of USD 5430. Moreover, it outperforms the literature findings [45] by 0.80%.

4.4. Algorithm Efficiency Analysis

The computational times of three cases are presented in Table 8 to illustrate the search capabilities of the RWCE-TB algorithm. It should be indicated that computations were carried out on a Windows Server system comprising an Intel(R) Core (TM) i5-7200 U CPU @ 2.50 GHz 2.70 GHz. The programming was executed in a Compaq Visual Fortran Version 6.6 platform.
Table 8 indicates that the efficiency of the NSM & RWCE-TB algorithm outperforms that of the traditional NSM & RWCE method in the studied cases. These results confirm that RWCE-TB boasts heightened search efficiency. Since simultaneous HEN synthesis is categorized as an NP-hard problem, solution accuracy within a reasonable computational timeframe takes precedence. Consequently, the TAC is utilized as the standard measure for evaluating solution efficacy. Due to various programming approaches and computation hardware, comparing computation times across different methods is challenging. Accordingly, comparing computation times can be achieved under standardized programming conditions. Hence, this paper refrains from comparing computational efficiency with other methods. In optimizing complex systems, the primary focus of this article remains on the quality of global optimization outcomes.

5. Conclusions

This paper presents a heuristic algorithm with tabu matching for HEN synthesis, aiming to enhance the optimization quality of the heuristic optimization method. The method is refined upon the foundation of the RWCE algorithm. It initiates by introducing the concept of high-, medium-, and low-temperature intervals. Subsequently, the number of nodes is dynamically determined according to these temperature intervals. The nodes on streams are flexibly matched within the framework of tabu rules, which prevents the matching of the low-temperature interval of hot streams with the high-temperature interval of cold streams, as well as streams that occur at temperature crossing. The primary innovation of this method lies in its capacity to prevent matches between streams exhibiting infeasible structures grounded in thermodynamic principles. This innovation concurrently limits the production of infeasible solutions while maintaining the extent of the viable region. The performed analyses demonstrate that compared with published data, the obtained TACs for H6C4, H7C3, and H13C7 case studies decrease by USD 4290/yr, USD 1435/yr, and USD 11,232/yr, respectively. Furthermore, the comparison of computational times shows that the proposed RWCE-TB algorithm outperforms the conventional RWCE in terms of computational efficiency, with a maximum improvement in efficiency of 31.2%. In addition to its computational advantages, the proposed model is easy to implement and can be applied to other heuristic methods.

Author Contributions

Conceptualization, G.C.; data curation, X.H.; investigation, W.Y.; methodology, X.H.; resources, G.C.; software, X.H. and H.S.; validation, H.S.; visualization, W.Y.; writing—original draft, X.H.; writing—review and editing, H.D. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China grand (Grant No. 21978171).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Nomenclature

Abbreviations
TACTotal annual cost
HENSHeat exchanger network synthesis
MINLPMixed-integer nonlinear programming
HENHeat exchanger network
SWSStage-wise superstructure
NSMNon-structural model
RWCERandom walk with compulsive evolution
RWCE-TBImproved Random walk with compulsive evolution with temperature interval tabu matching
Variables
AHeat transfer area, m2
CAArea cost coefficient of cold utility, heat exchangers, hot utility, USD/yr
CCUUtility cost coefficient of cold utility, USD/yr
CHUUtility cost coefficient of hot utility, USD/yr
hCoefficient of convective heat transfer, kw/m2/°C
QHeat load, kw
QCUHeat load of cold utility, kW
QHUHeat load of hot utility, kW
FFixFixed charge of cold utility, heat exchangers, hot utility, USD/yr
FCpHeat capacity flow rate, kw/°C
itIteration step
( f n ) i t TAC of individual n at iteration it, USD/yr
ITmaxMaximum number of iterations
NPPopulation size
NHNumber of hot streams
NCNumber of cold streams
NbHNumber of hot nodes
NbCNumber of cold nodes
ϕ Evolution probability
QminMinimum threshold of heat load, kW
QmaxMaximum threshold of heat load, kW
TTemperature, °C
δProbability of accepting imperfect solutions
LThe maximum walk step of heat loads, kW
εExponent for area cost
θGeneration probability
n bH Serial number of the hot stream node
n bC Serial number of the cold stream node
LMTDLogarithmic mean temperature difference, °C
M C ( n bH ) Serial number of the cold node connected with the hot stream node n bH
MH,newPosition of the newly generated hot node
MC,newPosition of the newly generated cold node
NmaxThe maximum number of nodes of a stream
XVariable is a binary variable with a value range of 0 and 1
ΔTminminimum approach temperature, °C
NdHnumber of node on each hot stream
NdCnumber of node on each cold stream
Superscripts
inInlet of streams
outOutlet of streams
innerInner utility
Subscripts
CCold stream
CUCold utility
HUHot utility
HHot stream
iHot stream index
jCold stream index
itIteration index
minMinimum
inhuInner hot utility
incuInner cold utility
newNew heat exchanger unit

References

  1. Amer, M.; Chen, M.-R.; Sajjad, U.; Ali, H.M.; Abbas, N.; Lu, M.-C.; Wang, C.-C. Experiments for suitability of plastic heat exchangers for dehumidification applications. Appl. Therm. Eng. 2019, 158, 654–664. [Google Scholar] [CrossRef]
  2. Short, M.; Isafiade, A.J. Thirty years of mass exchanger network synthesis—A systematic review. J. Clean. Prod. 2021, 304, 127112. [Google Scholar] [CrossRef]
  3. Chang, C.; Liao, Z.; Bagajewicz, M.J. New superstructure-based model for the globally optimal synthesis of refinery hydrogen networks. J. Clean. Prod. 2021, 292, 126022. [Google Scholar] [CrossRef]
  4. Kamat, S.; Bandyopadhyay, S.; Foo, D.C.Y.; Liao, Z. State-of-the-art review of heat integrated water allocation network synthesis. Comput. Chem. Eng. 2022, 167, 108003. [Google Scholar] [CrossRef]
  5. Lin, C.; Wang, B. Combined Heat and Power Dispatch with Start-Stop Schedule of Heat Exchange Stations. In Proceedings of the 2018 IEEE Power & Energy Society General Meeting (PESGM), Portland, OR, USA, 5–9 August 2018; pp. 1–5. [Google Scholar]
  6. Yang, X.; Sun, Y.; Wu, W.; Liu, H.; Wang, Y. Coordinated real-time power dispatch for integrated transmission and distribution networks based on model-based optimization and deep reinforcement learning. Energy Rep. 2023, 9, 1011–1020. [Google Scholar] [CrossRef]
  7. Zheng, W.; Lu, H.; Zhang, M.; Wu, Q.; Hou, Y.; Zhu, J. Distributed Energy Management of Multi-Entity Integrated Electricity and Heat Systems: A Review of Architectures, Optimization Algorithms, and Prospects. IEEE Trans. Smart Grid 2023, 1. [Google Scholar] [CrossRef]
  8. Linnhoff, B.; Flower, J.R. Synthesis of heat exchanger networks: I. Systematic generation of energy optimal networks. AIChE J. 1978, 4, 633–642. [Google Scholar] [CrossRef]
  9. Linnhoff, B.; Hindmarsh, E. The pinch design method for heat exchanger networks. Chem. Eng. Sci. 1983, 38, 745–763. [Google Scholar] [CrossRef]
  10. Zamora, J.M.; Grossmann, I.E. A comprehensive global optimization approach for the synthesis of heat exchanger networks with no stream splits. Comput. Chem. Eng. 1997, 21, 65–70. [Google Scholar] [CrossRef]
  11. Bergamini, M.L.; Grossmann, I.; Scenna, N.; Aguirre, P. An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput. Chem. Eng. 2008, 32, 477–493. [Google Scholar] [CrossRef]
  12. Lin, B.; Miller, D.C. Solving heat exchanger network synthesis problems with Tabu Search. Comput. Chem. Eng. 2004, 28, 1451–1464. [Google Scholar] [CrossRef]
  13. Dipama, J.; Teyssedou, A.; Sorin, M. Synthesis of heat exchanger networks using genetic algorithms. Appl. Therm. Eng. 2008, 28, 1763–1773. [Google Scholar] [CrossRef]
  14. Peng, F.; Cui, G. Efficient simultaneous synthesis for heat exchanger network with simulated annealing algorithm. Appl. Therm. Eng. 2015, 78, 136–149. [Google Scholar] [CrossRef]
  15. Xiao, Y.; Cui, G. A novel Random Walk algorithm with Compulsive Evolution for heat exchanger network synthesis. Appl. Therm. Eng. 2017, 115, 1118–1127. [Google Scholar] [CrossRef]
  16. Fu, D.; Yu, Z.; Lai, Y. Linking pinch analysis and shifted temperature driving force plot for analysis and retrofit of heat exchanger network. J. Clean. Prod. 2021, 315, 128235. [Google Scholar] [CrossRef]
  17. Orosz, Á.; How, B.S.; Friedler, F. Multiple-solution heat exchanger network synthesis using P-HENS solver. J. Taiwan Inst. Chem. Eng. 2022, 130, 103859. [Google Scholar] [CrossRef]
  18. Lakner, R.; Orosz, Á.; How, B.S.; Friedler, F. Synthesis of multiperiod heat exchanger networks: N-best networks with variable approach temperature. Therm. Sci. Eng. Prog. 2023, 42, 137696. [Google Scholar] [CrossRef]
  19. Yee, T.F.; Grossman, I.E. Simultaneous optimization models for heat integration. II. Heat exchanger network synthesis. Comput. Chem. Eng. 1990, 14, 1165–1184. [Google Scholar] [CrossRef]
  20. Pavão, L.V.; Costa, C.B.B.; Ravagnani, M.A.S.S. Heat exchanger networks retrofit with an extended superstructure model and a meta-heuristic solution approach. Comput. Chem. Eng. 2019, 125, 380–399. [Google Scholar] [CrossRef]
  21. Pavão, L.V.; Costa, C.B.B.; Ravagnani, M.A.S.S. A new stage-wise superstructure for heat exchanger network synthesis considering substages, sub-splits and cross flows. Appl. Therm. Eng. 2018, 143, 719–735. [Google Scholar] [CrossRef]
  22. Na, J.; Jung, J.; Park, C.; Han, C. Simultaneous synthesis of a heat exchanger network with multiple utilities using utility substages. Comput. Chem. Eng. 2015, 79, 70–79. [Google Scholar] [CrossRef]
  23. Huang, Y.; Zhuang, Y.; Xing, Y.; Liu, L.; Du, J. Multi-objective optimization for work-integrated heat exchange network coupled with interstage multiple utilities. Energy 2023, 273, 127240. [Google Scholar] [CrossRef]
  24. Xiao, Y.; Kayange, H.A.; Cui, G.; Chen, J. Non-structural model of heat exchanger network: Modeling and optimization. Int. J. Heat Mass Transf. 2019, 140, 752–766. [Google Scholar] [CrossRef]
  25. Aguitoni, M.C.; Pavão, L.V.; da Silva Sá Ravagnani, M.A. Heat exchanger network synthesis combining Simulated Annealing and Differential Evolution. Energy 2019, 181, 654–664. [Google Scholar] [CrossRef]
  26. Xiao, Y.; Sun, T.; Cui, G. Enhancing strategy promoted by large step length for the structure optimization of heat exchanger networks. Appl. Therm. Eng. 2020, 173, 115199. [Google Scholar] [CrossRef]
  27. Xiao, Y.; Cui, G.; Zhang, G.; Ai, L. Parallel optimization route promoted by accepting imperfect solutions for the global optimization of heat exchanger networks. J. Clean. Prod. 2022, 336, 130354. [Google Scholar] [CrossRef]
  28. Ahmad, S. Heat Exchanger Networks: Cost Tradeoffs in Energy and Capital. Ph.D. Thesis, University of Manchester Institute of Science and Technology (UMIST), Manchester, UK, 1985. [Google Scholar]
  29. Linnhoff, B.; Ahmad, S.J.C. Engineering, Cost optimum heat exchanger networks—1. Minimum energy and capital using simple models for capital cost. Comput. Chem. Eng. 1990, 14, 729–750. [Google Scholar] [CrossRef]
  30. Yerramsetty, K.M.; Murty, C.V.S. Synthesis of cost-optimal heat exchanger networks using differential evolution. Comput. Chem. Eng. 2008, 32, 1861–1876. [Google Scholar] [CrossRef]
  31. Khorasany, R.M.; Fesanghary, M. A novel approach for synthesis of cost-optimal heat exchanger networks. Comput. Chem. Eng. 2009, 33, 1363–1370. [Google Scholar] [CrossRef]
  32. Zhang, H.; Cui, G.; Xiao, Y.; Chen, J. A novel simultaneous optimization model with efficient stream arrangement for heat exchanger network synthesis. Appl. Therm. Eng. 2017, 110, 1659–1673. [Google Scholar] [CrossRef]
  33. Rathjens, M.; Fieg, G. A novel hybrid strategy for cost-optimal heat exchanger network synthesis suited for large-scale problems. Appl. Therm. Eng. 2020, 167, 114771. [Google Scholar] [CrossRef]
  34. Xu, Y.; Cui, G.; Han, X.; Xiao, Y.; Zhang, G. Optimization route arrangement: A new concept to achieve high efficiency and quality in heat exchanger network synthesis. Int. J. Heat Mass Transf. 2021, 178, 121622. [Google Scholar] [CrossRef]
  35. Chen, J.; Cui, G.; Shen, S. An polymorphic firefly algorithm with self-adaptation strategy for process system heat integration. Case Stud. Therm. Eng. 2023, 47, 103116. [Google Scholar] [CrossRef]
  36. Ahmad, S.; Patela, E. SUPERTARGET: Applications software for oil refinery retrofit. In Proceedings of the American Institute of Chemical Engineers Spring National Meeting, Houston, TX, USA, 29 March 1987. [Google Scholar]
  37. Liu, X.W.; Luo, X.; Ma, H.G. Studies on the retrofit of heat exchanger network based on the hybrid genetic algorithm. Appl. Therm. Eng. 2014, 62, 785–790. [Google Scholar] [CrossRef]
  38. Liu, P.; Cui, G.; Xiao, Y.; Chen, J. A new heuristic algorithm with the step size adjustment strategy for heat exchanger network synthesis. Energy 2018, 143, 12–24. [Google Scholar] [CrossRef]
  39. Sorsak, A.; Kravanja, Z. MINLP retrofit of heat exchanger networks comprising different exchanger types. In Proceedings of the 12th European Symposium on Computer Aided Process Engineering (ESCAPE-12), The Hague, The Netherlands, 26–29 May 2002; pp. 349–354. [Google Scholar]
  40. Pavao, L.V.; Costa, C.B.B.; da Silva Sá Ravagnani, M.A. Automated heat exchanger network synthesis by using hybrid natural algorithms and parallel processing. Comput. Chem. Eng. 2016, 94, 370–386. [Google Scholar] [CrossRef]
  41. Xiao, Y.; Cui, G.; Sun, T.; Chen, J. An integrated random walk algorithm with compulsive evolution and fine-search strategy for heat exchanger network synthesis. Appl. Therm. Eng. 2018, 128, 861–876. [Google Scholar] [CrossRef]
  42. Zhang, H.; Cui, G. Optimal heat exchanger network synthesis based on improved cuckoo search via Lévy flights. Chem. Eng. Res. Des. 2018, 134, 62–79. [Google Scholar] [CrossRef]
  43. Xu, Y.; Cui, G.; Deng, W.; Xiao, Y.; Ambonisye, H.K. Relaxation strategy for heat exchanger network synthesis with fixed capital cost. Appl. Therm. Eng. 2019, 152, 184–195. [Google Scholar] [CrossRef]
  44. Caballero, J.A.; Pavão, L.V.; Costa, C.B.B.; da Silva Sá Ravagnani, M.A. A Novel Sequential Approach for the Design of Heat Exchanger Networks. Front. Chem. Eng. 2021, 3, 733186. [Google Scholar] [CrossRef]
  45. Chang, C.; Liao, Z.; Costa, A.L.H.; Bagajewicz, M.J. Globally optimal synthesis of heat exchanger networks. Part III: Non-isothermal mixing in minimal and non-minimal networks. AIChE J. 2021, 67, 17393. [Google Scholar] [CrossRef]
Figure 1. Schematic diagram of the NSM.
Figure 1. Schematic diagram of the NSM.
Processes 11 02713 g001
Figure 2. Flowchart of the RWCE algorithm.
Figure 2. Flowchart of the RWCE algorithm.
Processes 11 02713 g002
Figure 3. Schematic diagram of temperature crossover.
Figure 3. Schematic diagram of temperature crossover.
Processes 11 02713 g003
Figure 4. H7C3 case with infeasible matching. “H”/”C” means the symbols of hot/cold streams; red and blue arrows represent the hot and cold streams, respectively. The value at the initial and final points of the arrows indicate the streams’ supply/target temperatures. A Black line and a set of bullets mean a heat exchanger unit, and the same as following figures.
Figure 4. H7C3 case with infeasible matching. “H”/”C” means the symbols of hot/cold streams; red and blue arrows represent the hot and cold streams, respectively. The value at the initial and final points of the arrows indicate the streams’ supply/target temperatures. A Black line and a set of bullets mean a heat exchanger unit, and the same as following figures.
Processes 11 02713 g004
Figure 5. Variation of TAC for individual optimization process that accepts infeasible solutions.
Figure 5. Variation of TAC for individual optimization process that accepts infeasible solutions.
Processes 11 02713 g005
Figure 6. The NSM of the H7C3 case. The red and blue arrows represent the hot and cold streams, respectively. The hollow bullets represent the nodes on the hot and cold streams that can be selected to form heat exchanger units, and the same as following figures.
Figure 6. The NSM of the H7C3 case. The red and blue arrows represent the hot and cold streams, respectively. The hollow bullets represent the nodes on the hot and cold streams that can be selected to form heat exchanger units, and the same as following figures.
Processes 11 02713 g006
Figure 7. The flow chart of the new heat exchanger generation in RWCE-TB.
Figure 7. The flow chart of the new heat exchanger generation in RWCE-TB.
Processes 11 02713 g007
Figure 8. Division of temperature intervals and node assignment for case 1.
Figure 8. Division of temperature intervals and node assignment for case 1.
Processes 11 02713 g008
Figure 9. Optimization results of the NSM&RWCE method (TAC = USD 5,589,808/yr). The values of heat load are writen near the equipment, kW, and the same as following figures.
Figure 9. Optimization results of the NSM&RWCE method (TAC = USD 5,589,808/yr). The values of heat load are writen near the equipment, kW, and the same as following figures.
Processes 11 02713 g009
Figure 10. Optimization results of the NSM&RWCE-TB method (TAC = USD 5,588,154/yr). The numbers inside the circles represent the heat exchanger’s identification number. A set of circles with the same number represents a single heat exchanger. Red, yellow, and blue circles indicate that the heat exchanger is in the high-temperature, medium-temperature, or low-temperature interval, and the same as following figures.
Figure 10. Optimization results of the NSM&RWCE-TB method (TAC = USD 5,588,154/yr). The numbers inside the circles represent the heat exchanger’s identification number. A set of circles with the same number represents a single heat exchanger. Red, yellow, and blue circles indicate that the heat exchanger is in the high-temperature, medium-temperature, or low-temperature interval, and the same as following figures.
Processes 11 02713 g010
Figure 11. Division of temperature intervals and node assignment for case 2.
Figure 11. Division of temperature intervals and node assignment for case 2.
Processes 11 02713 g011
Figure 12. Optimization results of the NSM & RWCE method (TAC= USD 8,715,496/yr).
Figure 12. Optimization results of the NSM & RWCE method (TAC= USD 8,715,496/yr).
Processes 11 02713 g012
Figure 13. Optimization results of the NSM&RWCE-TB method (TAC = USD 8,706,548/yr).
Figure 13. Optimization results of the NSM&RWCE-TB method (TAC = USD 8,706,548/yr).
Processes 11 02713 g013
Figure 14. Division of temperature intervals and node assignment for case 3.
Figure 14. Division of temperature intervals and node assignment for case 3.
Processes 11 02713 g014
Figure 15. Optimization results of the NSM & RWCE method (TAC= USD 1,401,311/yr).
Figure 15. Optimization results of the NSM & RWCE method (TAC= USD 1,401,311/yr).
Processes 11 02713 g015
Figure 16. Optimization results of the NSM & RWCE-TB method (TAC = USD 1,395,971/yr).
Figure 16. Optimization results of the NSM & RWCE-TB method (TAC = USD 1,395,971/yr).
Processes 11 02713 g016
Table 1. Parameter settings for calculation of the three cases.
Table 1. Parameter settings for calculation of the three cases.
NΔLQmaxQminτθδNmaxITmax
H6C41010020050.20.20.01148 × 108
H7C33020085050.20.20.005308 × 108
H13C73080120100.20.20.0198 × 108
Table 2. Problem data and annual costs of heat exchanger units of case study 1.
Table 2. Problem data and annual costs of heat exchanger units of case study 1.
StreamTin (°C)Tout (°C)FCp (kW/°C)h (kW/(m·°C)
H18545156.30.05
H21204050.00.05
H31253523.90.05
H4564612500.05
H5908615000.05
H622575500.05
C14055466.70.05
C255656000.05
C3651651800.05
C41017081.30.05
HU200198-0.05
CU1520-0.05
Annual cost of heat exchanger = 60 A (USD/yr) (A in m2)
Annual cost of hot utility = USD 100/kW/yr
Annual cost of cold utility = USD 15/kW/yr
Table 3. Comparison of optimization results for case 1.
Table 3. Comparison of optimization results for case 1.
Literature UnitsHot Utility/MWCold Utility/MWTAC/USD/yr
Ahmad [28]-15,40097967,074,000
Yerramstetty et al. [30]1320,75415,1405,666,756
Khorasany [31]1219,60514,0005,662,366
Zhang et al. [32]1920,27614,6705,607,762
Peng and Cui [14]1820,33914,7335,596,079
Rathjens et al. [33]1220,42014,8155,713,267
Xu et al. [34]1320,37714,7955,704,465 (with splits)
Chen [35]1920,54014,9355,592,255
NSM&RWCE (Figure 9)2220,25014,6445,589,808
NSM&RWCE-TB (Figure 10)2120,30814,7035,588,154
Table 4. Problem data and annual costs of heat exchanger units of case study 2.
Table 4. Problem data and annual costs of heat exchanger units of case study 2.
StreamTin (°C)Tout (°C)FCp (kW/°C)h (kW/(m2·°C)
H1140.040.0470.00.8
H2160.0120.0825.00.8
H3210.045.042.40.8
H4260.060.0100.00.8
H5280.0210.0357.10.8
H6350.0170.050.00.8
H7380.0160.0136.40.8
C1270.0385.0826.10.8
C2130.0270.0500.00.8
C320.0130.0363.60.8
HU500499-0.8
CU2040-0.8
Annual cost of heat exchanger = 300 A (USD/yr) (A in m2)
Annual cost of hot utility = USD 60/kW/yr
Annual cost of cold utility = USD 5/kW/yr
Table 5. Comparison of optimization results for case 2.
Table 5. Comparison of optimization results for case 2.
Literature UnitsHot Utility/MWCold Utility/MWTAC/USD/yr
Ahmad [36]11--9,490,000
Liu et al. [37]1592.9358.938,917,245
Liu et al. [38]3192.4058.408,707,983
NSM & RWCE (Figure 12)2792.6858.688,715,491
NSM & RWCE-TB (Figure 13)3392.4258.428,706,548
Table 6. Problem data and annual costs of heat exchanger units of case study 3.
Table 6. Problem data and annual costs of heat exchanger units of case study 3.
Stream Tin (°C)Tout (°C)FCp (kW/°C)h (kW/(m2·°C)
H157643723.10.06
H259939915.220.06
H353038215.150.06
H444923714.760.06
H536817710.70.06
H6121114149.61.0
H7202185258.21.0
H81851138.381.0
H914012059.891.0
H106966165.791.0
H11120688.741.0
H1267357.621.0
H131034.557621.30.06
C112334310.610.06
C2201566.651.2
C315615732912.0
C42018226.631.2
C518231831.191.2
C63183204011.832.0
C7322923.7817.60.06
HU927927-5.0
CU917-1.0
Annual cost of heat exchanger = 4000 + 500 A0.83 (USD/yr) (A in m2)
Annual cost of hot utility = USD 250/kW/yr
Annual cost of cold utility = USD 25/kW/yr
Table 7. Comparison of optimization results for case 3.
Table 7. Comparison of optimization results for case 3.
Literature UnitsHot Utility/MWCold Utility/MWTAC/USD/yr
Pavão et al. [40]211938106.931,516,482 (with splits)
Xiao et al. [41]231.86836.61,447,482
Zhang et al. [42]221.8310.001,418,981
Xu et al. [43]211.8310.041,412,801
Caballero et al. [44]211.8310.001,414,831(with splits)
Chang [45]201.8310.001,407,203 (with splits)
NSM & RWCE (Figure 15)221.8310.001,401,311
NSM & RWCE-TB (Figure 16)211.8310.001,395,971
Table 8. The computational times for three test cases.
Table 8. The computational times for three test cases.
CaseComputational Time (s) of the NSM & RWCEComputational Time (s) of the NSM & RWCE-TBEfficiency Improvement (%)
case110,585889116.0%
case213,311915831.2%
case364,61950,20922.3%
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Huang, X.; Shen, H.; Yue, W.; Duan, H.; Cui, G. A Tabu-Matching Heuristic Algorithm Based on Temperature Feasibility for Efficient Synthesis of Heat Exchanger Networks. Processes 2023, 11, 2713. https://doi.org/10.3390/pr11092713

AMA Style

Huang X, Shen H, Yue W, Duan H, Cui G. A Tabu-Matching Heuristic Algorithm Based on Temperature Feasibility for Efficient Synthesis of Heat Exchanger Networks. Processes. 2023; 11(9):2713. https://doi.org/10.3390/pr11092713

Chicago/Turabian Style

Huang, Xiaohuang, Hao Shen, Wenhao Yue, Huanhuan Duan, and Guomin Cui. 2023. "A Tabu-Matching Heuristic Algorithm Based on Temperature Feasibility for Efficient Synthesis of Heat Exchanger Networks" Processes 11, no. 9: 2713. https://doi.org/10.3390/pr11092713

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop