1 Introduction
Heat exchangers (HEXs) play a major role in the performance of many systems that serve prominent roles in our society, ranging from heating and airconditioning systems used in residential and commercial applications, to plant operation for process industries. While these components are manufactured in a startlingly wide array of shapes and configurations [19], one extremely common configuration used in heating and airconditioning applications is that of the crossflow finandtube type, in which a refrigerant flows through a set of pipes and moist air flows across a possibly enhanced surface on the other side of the pipe, allowing thermal energy to be transferred between the air and the refrigerant.
Performance improvement and optimization of these components can be pursued by evaluating a number of different metrics, based upon the requirements of their application and their specific use case; these include component material reduction, size reduction, manufacturing cost reduction, reduction of pumping power, maximization of heating or cooling capacity, or some combination of these objectives. While some of these metrics are reasonably straightforward in concept (e.g., cost and size reduction), the heat capacity is influenced by many parameters, including the geometry of the heat exchanger, the inlet conditions on the airside (temperature, velocity, and humidity), and the inlet conditions on the refrigerant side (temperature, pressure, and mass flux). The aggregate performance of the entire fintube heat exchanger can thus be often viewed as the aggregate performance of the collection of tubes.
Due to the prevalence and importance of these components, systematic optimization of heat exchanger design has been a long standing research topic [16, 18, 21]. Many proposed methods use analytical approaches to improve the performance of heat exchangers. Heddenrich et al. [18] proposed a model to optimize the design of an aircooled heat exchanger for a userdefined tube arrangement, in which parameters such as tubes diameter, length, and fin spacing are optimized subject to a given heat transfer rate between air and water. They developed a software for the analysis of aircooled heat exchangers and was coupled with a numerical optimization program. Ragazzi [35] developed a computer simulation tool of evaporators with zeotropic refrigerant mixtures to investigate the influence of the number of coil rows and tube diameter on the overall heat exchanger performance. Reneaume et al. [36] also proposed a tool for computer aided design of compact plate fin heat exchangers, which allows optimization of the fins, the core, and the distributor under userdefined design and operating constraints. They formulated a nonlinear programming problem and solved it using a reduced Hessian successive quadratic programming algorithm.
The configuration of the connections between refrigerant tubes in a finandtube heat exchanger, also referred to as the refrigerant circuitry, has a significant effect on the performance of the heat exchanger, and as such has been studied as a candidate optimization variable. Because nonuniform air velocities across the heat exchanger face can result in different airside heat transfer characteristics and uneven refrigerant distribution can result in different refrigerantside heat transfer and pressure drop behavior, the specific path followed by the refrigerant through the heat exchanger as it evaporates can have a significant influence on many of the performance metrics of interest as demonstrated by [28, 29, 44, 48]. These researchers have studied the effect of improving refrigerant circuitry, and have concluded that circuitry optimization is often more convenient and less expensive as compared with other performance optimization approaches, such as changing the fin and tube geometries. The optimal refrigerant circuitry for one heat exchanger has also been found to be different from that of another heat exchanger [8, 15].
While current approaches for heat exchanger design often rely on design engineers to choose the circuitry configuration based upon their experience and the output of an enumerated set of simulations, the highly discontinuous and nonlinear relationship between the circuitry and the HEX performance motivates the study of systematic methods to identify optimized refrigerant circuitry design. Such a problem is particularly challenging because of the size of the decision space; even a simple HEX with tubes, one inlet, one outlet, and no branches or merges will have possible circuitry configurations, making exhaustive search algorithms insufficient for searching the entirety of the solution space. Moreover, there is no guarantee that the engineering effort required to use expert knowledge to optimize the HEX circuitry manually will result in an optimal configuration, especially for larger coils; a systematic optimization method that is capable of determining an optimal configuration would have the dual benefits of providing a better HEX and freeing up engineering time.
A variety of sophisticated approaches have recently been proposed to construct optimized refrigerant circuitry designs. Liang et al. [27] proposed a model that can be used to investigate the performance of a refrigerant circuitry through exergy destruction analysis. Domanski and Yashar [14] developed an optimization system, called ISHED (Intelligent System for Heat Exchanger Design), for finding refrigerant circuitry designs that maximize the capacity of heat exchangers under given technical and environmental constraints. Experiments demonstrated the ability of this tool to generate circuitry architectures with capacities equal to or superior to those prepared manually [15, 46, 47], particularly for cases involving nonuniform air distribution [13]. Wu et al. [45]
also developed a genetic algorithm that constructs every possible refrigerant circuitry to find an optimal circuitry configuration. Bendaoud et al.
[5] developed a FORTRAN program allowing them to study a large range of complex refrigerant circuit configurations. They performed simulations on an evaporator commonly employed in supermarkets, showing the effect of circuiting on operation and performance. Lee et al. [25] proposed a method for determining the optimal number of circuits for fintube heat exchangers. Their results demonstrated that this method is useful in determining the optimal number of circuits and can be used to determine where to merge or diverge refrigerant circuits in order to improve the heat exchanger performance.The aforementioned methods generally require either a significant amount of time to find the optimal refrigerant circuitry or produce a circuitry for which it is difficult to verify the practicality of its application. Genetic algorithms also generate random circuitry designs that may not satisfy connectivity constraints; feasible random circuitry designs for a HEX with one inlet and one outlet are easy to generate, but most randomly generated solutions with multiple inlets and outlets will be infeasible. Random operators, such as those used in conventional genetic algorithms, consequently may not lead to efficient search strategies or even feasible circuit layouts. Domanski and Yashar [14] were able to circumvent such problems by using domain knowledgebased operators, i.e., only perform changes that are deemed suitable according to domainknowledge, and use a symbolic learning method for circuit optimization. Such a unique set of domain knowledgebased operators and rules for the symbolic learning method that can find good solutions for different types of heat exchangers is not easy to define, however. These methods also may not efficiently explore the solution search space, as some tube connections are fixed during the optimization process [45].
One of the contributions of this paper is the presentation of heat exchanger circuitry optimization methods that generate feasible circuit designs without requiring extensive domain knowledge. As a result, the proposed approach can be readily applied to different types of heat exchangers. We incorporate only realistic manufacturing constraints to the optimization problem in a systematic way. We formulate the refrigerant circuitry design problem as a binary constrained optimization problem, and use CoilDesigner [22], a steadystate simulation and design tool for air to refrigerant heat exchangers, to simulate the performance of different refrigerant circuitry designs. We treat CoilDesigner as a blackbox system and apply derivativefree optimization (DFO) algorithms to optimize heat exchanger performance. While the DFO literature has recently been attracting significant attention, it currently lacks systematic comparisons between mixedinteger constrained DFO algorithms on industriallyrelevant problems [37]. A primary contribution of this paper is to provide results from a systematic comparison of four different mixedinteger constrained DFO algorithms and a boxbounded DFO algorithm that are applied to optimize heat exchanger circuitry using two different thermal efficiency criteria. We also use constraint programming methods to verify the results of the DFO methods for small heat exchangers.
The remainder of this paper is organized as follows. In Section 2, we present circuitry design principles of a heat exchanger. Section 3 describes the proposed formulation for optimizing the performance of heat exchangers. Section 4 details the DFO solvers that are used in this work. Section 5 presents the computational experiments on finding the best circuitry arrangements for heat exchangers. Conclusions from the research are presented in Section 6.
2 Heat exchanger circuitry
In general, the performance of a given heat exchanger depends on a wide variety of system parameters and inputs, including materials (e.g., working fluids, HEX construction), coil geometry (e.g., tube geometry, find construction), operating conditions (e.g., inlet temperature or humidity, mass flow rate), and circuitry configuration [33, 42]. For a given application or set of use cases, many of these parameters are set early in the design phase by economic or manufacturing process requirements. The circuitry configuration, in fact, is also strongly influenced by manufacturing and economic constraints; this imposes important limits on the size of the decision space. For the purposes of this paper, we will assume that all geometric and inlet characteristics are fixed, and that the main problem of interest is that of identifying the location and number of inlet and outlet streams, as well as the circuitry configuration, for a given HEX construction. This describes a very practicallyoriented problem, in which a manufacturing engineer is handed a specific coil and asked to specify the circuitry that will optimize its performance according to some metric.
A picture illustrating the circuitry for a representative heat exchanger is illustrated in Figure 1. Such heat exchangers are typically constructed by first stacking layers of aluminum fins together that contain preformed holes, and then pressfitting copper tubes into each set of aligned holes. The copper tubes are typically prebent into a U shape before insertion, so that two holes are filled at one time. After all of the tubes are inserted into the set of aluminum fins, the heat exchanger is flipped over and the other ends of the copper tubes are connected in the desired circuitry pattern. While the current picture only illustrates a very simple circuiting arrangement, many different connections can potentially be made between the tubes.
For the purposes of more clearly describing potential manufacturing constraints encountered in the construction of a fintube HEX, consider a diagram that illustrates the salient features relating to its circuitry. Figure 2 illustrates a HEX constructed of eight tubes (each represented by a circle) with six connections of two types; one type of connection is at the far end of the tubes, while the other type of connection the near (front) end of the tubes. In this framework, a crossed sign indicates that the refrigerant flows into the page, and a dotted sign indicates that the refrigerant flows out of the page. Similarly, a dotted line between two tubes indicates a tube connection on the far end of the tubes, while a solid line indicates a tube connection on the front end of the tubes. Different line colors are used to distinguish amongst different circuits. Tubes are numbered in order of top to bottom in each row (normal to air flow), and left to right (in the direction of air flow). For the example figure, tubes and involve inlet streams, while tubes and involve outlet streams.
In light of this diagram, consider one set of manufacturing constraints imposed on the connections between tubes. This set of constraints is such that adjacent pairs of tubes in each column, starting with the bottom tube, are always connected. For example, in Figure 2, this constraint implies that tubes and , tubes and , tubes and , and tubes and are always connected. The manufacturing process imposes this constraint because one set of bends at the far end of the coil are applied to the tubes before they are inserted into the fins, whereas the second set of connections or bends are introduced at the near end of the coil once a circuitry configuration is chosen. Other related manufacturingtype restrictions used to constrain the space of possible circuiting configurations includes the following:

Plugged tubes, i.e., tubes without connections, are not allowed

The connections on the farther end cannot be across rows unless they are at the edge of the coil

Inlets and outlets must always be located at the near end

Merges and splits are not allowed.
Figure 3 presents valid and invalid circuiting arrangements on a heat exchanger with eight tubes. The circuiting arrangement in Figure 2(c) is not valid since it violates the second and third of the aforementioned restrictions, i.e., the connection between tubes and is not allowed and outlet tube is not located at the near end. In addition, the circuiting arrangement in Figure 2(d) is invalid due to the merges and splits in tube .
While this set of constraints represents one set of relevant manufacturing concerns, it does not represent the totality of such issues. Other constraints might be included, such as penalties on the distance between tubes or the number of circuits. Such constraints might also be incorporated into an optimization method, but are not included here for the sake of algorithmic and computational simplicity.
3 Proposed model
3.1 Problem representation
The problem representation in terms of an optimization formulation is one of the key aspects of optimization approaches that determines the degree of their success. Here, the refrigerant circuitry problem is represented as a largescale binary combinatorial problem. We use graph theory concepts to depict a circuitry configuration as a graph, where the tubes are the nodes and the connections between tubes are the edges. For example, the adjacency matrix for the circuitry configuration shown in Figure 2 is the following:
Binary variables will be used to model connections between tubes. Since the graph is undirected, we need only the upper part of the adjacency matrix without the diagonal elements (no selfloops exist in a circuitry). Thus, we can limit the number of variables to , where is the number of tubes. The only drawback of treating the graph as undirected is that we do not know the start (inlet stream) and the end (outlet stream) of the circuits. Therefore, there are four feasible solutions for the above adjacency matrix (Figure 4). However, these feasible solutions produce very similar performance metrics. Extensive computational experiments showed that if a circuitry design has poor performance, it will not have a much better performance if we change the inlet and outlet streams. We preferred this approach, i.e., treating the graph as undirected, in order to create an optimization problem with significantly fewer variables, e.g., a heat exchanger with tubes can be modeled with only variables instead of .
The vector of variables
for the circuitry design problem contains binary variables. Each variable is associated with the connection of two tubes. A variable , , is equal to if the associated tubes are connected; otherwise . Let be the adjacency matrix. The elements of the solution vector are associated with an element of the upper part of matrix in order of left to right, and top to bottom:
The adjacency matrix and the solution vector of the heat exchanger shown in Figure 2 are the following:
3.2 Objective function
Various performance metrics have been used in order to evaluate and compare the performance of different circuitry designs [25, 45]. The most common goals when designing a heat exchanger is typically to maximize the heat capacity or to obtain the shortest joint tubes. Two targets of the refrigerant circuit optimization are considered in this work: (i) maximize the heat capacity, and (ii) maximize the ratio of the heat capacity to the pressure difference across the heat exchanger. Thus, the heat exchanger circuitry optimization problem can be symbolically expressed as:

To maximize the heat capacity:
where is the heat capacity related to the solution vector , is the number of tubes, is the number of decision variables, and the constraints on the farther and front end are presented in Section 3.3.

To maximize the ratio of the heat capacity to the pressure difference across the heat exchanger:
where is the pressure difference across the heat exchanger, and is a given limit for the heat capacity.
3.3 Constraints
As already discussed in Section 2, there are two types of connections allowed, connections on the farther end of the tubes and connections on the front end of the tubes. In order to produce a feasible circuitry arrangement, some constraints are set. The constraints on the farther end are derived from the first two restrictions of the circuitry arrangement problem that were described in Section 2: (i) plugged tubes are not allowed, and (ii) the connections on the farther end cannot be across rows unless they are at the edge of the coil. These two restrictions imply the constraints that should be set on the farther end. A heat exchanger with tubes in multiples of four has its tubes connected in pairs only in the same row; otherwise the first tubes in each row are connected together and the rest of the tubes are connected in pairs only in the same row. In each case, elements of vector are set equal to one. Figure 5 presents the connections on the farther end for a heat exchanger with eight tubes (Figure 4(a)) and for a heat exchanger with ten tubes (Figure 4(b)).
The restrictions on the connections on the front end are: (i) merges and splits are not allowed, and (ii) cycles are not allowed. The first restriction implies that every tube is connected with two tubes at most. Therefore, the sum of the elements of vector in each row and column , , of the adjacency matrix should be less than or equal to two. The second restriction implies that we should avoid cycles when connecting tubes. We already have connections between tubes on the farther end. Hence, we should add a constraint for every combination of two, three, etc. pairs of these tubes in order not to form a cycle.
3.4 Blackbox model
There are several simulation tools that have been developed for design and rating of heat exchangers like HTFS [3], EVAPCOND [32], and CoilDesigner [9]. We use the CoilDesigner to simulate the heat exchanger and compute the heat capacity and the ratio of the heat capacity to the pressure difference across the heat exchanger. We chose CoilDesigner for three reasons: (i) it is a highly customizable tool that allows the simulation of several types of heat exchangers, (ii) it has been validated on many data sets, and (iii) it provides an external communication interface for .NET framework. The existence of the external communication interface facilitates experimentation with different system parameters. The external interface also allows optimization studies to be carried out. In this study, we use the external communication interface to experiment with different designs and optimization algorithms in an entirely automated manner. Without such an interface, it would be impossible to perform the computational experiments in a reasonable amount of time through a graphical user interface of a simulation tool.
The exact relationship of the objective function with the decision variables is not explicit. CoilDesigner acts as a blackbox model since we cannot deduce any explicit expression for the objective function. Hence, we can give as input to CoilDesigner the structural parameters and work conditions of a heat exchanger and receive as output many performance metrics about the function of the heat exchanger. A complete enumeration of all valid combinations is not possible for large heat exchangers. Thus, a more systematic and intelligent method should be utilized. Section 4 presents the DFO solvers that we used to solve this problem.
4 Derivativefree optimization algorithms
Derivativefree optimization or optimization over blackbox models [37] is the optimization of a deterministic function over a domain of interest that may include lower and upper bounds on the problem variables and/or general constraints. In typical DFO applications, derivative information is unavailable, unreliable, or prohibitively expensive. DFO has been a long standing research topic with applications that range from science problems to medical problems to engineering problems (see discussion and references in [37]).
Historically, the development of DFO algorithms started with the works of Spendley et al. [43] and Nelder and Mead [31]. Recent works on the subject offered significant advances by providing convergence proofs [1, 11, 26], incorporating the use of surrogate models [6, 41], and offering software implementations of several DFO algorithms [2, 10, 17].
According to Rios and Sahinidis [37]
, DFO algorithms can be classified as:

direct or modelbased: direct algorithms determine search directions by computing values of the function directly, while modelbased algorithms construct and utilize a surrogate model of the function to guide the search process

local or global: depending upon whether they can refine the search domain arbitrarily or not

stochastic or deterministic: depending upon whether they require random search steps or not
In this paper, we formulate the refrigerant circuitry design problem as a binary constrained optimization problem. Hence, DFO solvers that can handle constraints and discrete variables are preferred. While the DFO literature has been attracting increasing attention, it currently lacks systematic comparisons between mixedinteger constrained DFO algorithms. Rios and Sahinidis [37] presented a systematic comparison of the performance of several boxbounded DFO solvers. There are review papers about algorithmic developments in constrained DFO solvers [7, 12, 24], but none of them presents a comparison across various constrained DFO solvers. Clearly, there is a need to systematically compare constrained DFO solvers and evaluate their ability to solve industriallyrelevant problems.
In this paper, we use five DFO algorithms: CMAES, MIDACO, NOMAD, TOMLAB/glcDirect, and TOMLAB/glcSolve. We included CMAES in this study because its performance was the best amongst all stochastic DFO solvers in the extensive computational study of [37]. We chose the other four solvers since they can handle general constraints and discrete variables. A brief description of each solver is given below:

CMAES [17]
: Covariance Matrix Adaption Evolution Strategy (CMAES) is a stochastic global DFO solver that can handle bound constraints. It is a MATLAB implementation of a genetic algorithm for nonlinear optimization in continuous domain. The algorithm progresses by learning covariance matrices, which helps approach the optimum and reduce population sizes significantly. By sampling a multivariate normal distribution with zero mean and covariance matrix, CMAES generates a cluster of new sampling points leading to a better solution.

MIDACO [40]: MIDACO is a stochastic global DFO solver that can handle bound and general constraints. It implements an ant colony optimization algorithm [38] with the oracle penalty method [39]
for constrained handling. The implemented ant colony optimization algorithm is based on multikernel Gaussian probability density functions that generate samples of iterates.

NOMAD [2]: Nonsmooth Optimization by Mesh Adaptive Direct Search (NOMAD) is a direct local DFO solver that can handle bound and general constraints. It is a C++ implementation of the MADS method [4] with different families of directions including GPS, LTMADS, and OrthoMADS in its poll step. Three strategies are integrated into NOMAD: (i) extreme barrier, (ii) filter technique, and (iii) progressive barrier (PB). It also applies a genetic search strategy derived from Variable Neighborhood Search (VNS) [30] to escape from local optima in searching global minima.

TOMLAB/glcDirect [20, pp.112117]: TOMLAB/glcDirect is deterministic global solver that can handle bound and general constraints. It implements an improved version of Jones at al. [23] DIRECT algorithm (DIvide a hyperRECTangle), a deterministic sampling method for solving multivariate global optimization problems under bound constraints.
TOMLAB/glcDirect and TOMLAB/glcSolve can handle general constraints and always produce feasible solutions. MIDACO and NOMAD use penalty approaches for constrained handling. Hence, we should check if the constraints are violated prior to calling CoilDesigner. CMAES does not explicitly handle constraints. However, we can return a null value in order to indicate that the generated circuitry is not feasible.
In the cases that we maximize the ratio of the heat capacity to the pressure difference across the heat exchanger, a blackbox constraint also exists, , where is a given limit for the heat capacity (in the computational experiments of this paper, we set this number equal to ). After calling CoilDesigner, we can export the heat capacity and penalize the objective function if :
(1) 
where is a userdefined weight for the violations (in the computational experiments of this paper, we set this number equal to , i.e., a value that is an order of magnitudes larger than the expected values of ).
5 Computational study
In order to validate the proposed model, we performed a computational study with the aim of optimizing the heat capacity and the ratio of the heat capacity to the pressure difference across the heat exchanger. For this study, we started by manually designing different circuitry architectures. The structural parameters and work conditions of the test cases are shown in Table 1. The only difference between the test cases is the number of tubes per row, ranging from to that result in heat exchangers having from to tubes.
Structural parameters  Work conditions  
# of depth rows  2  Refrigerant type  R134a 
Tube length (mm)  1,143  Refrigerant temperature (°C)  7 
Tube inside diameter (mm)  9.40  Refrigerant pressure (kPa)  350 
Tube outside diameter (mm)  10.06  Refrigerant mass flow rate (kg/s)  0.02 
Tube thickness (mm)  0.33  Refrigerant mass quality  0.15 
Tube horizontal spacing (mm)  19.05  Air inlet pressure (kPa)  101.325 
Tube vertical spacing (mm)  25.40  Air inlet temperature (°C)  24 
Tube internal surface  Smooth  Air flow rate ()  2 
Fin spacing (mm)  1.17  
Fins per inch  20  
Fin thickness (mm)  0.10  
Fin type  Louver  
Louver pitch (mm)  2  
Louver height (mm)  1 
Prior to applying the DFO solvers to optimize the different heat exchangers, we performed a simulation for all combinations of heat exchangers with , , , , and tubes. We formulated the circuitry optimization problem as a Constraint Satisfaction Problem (CSP) using Choco solver [34] in order to automate the procedure of finding all possible feasible circuitry designs. Choco is an opensource software that is used to formulate combinatorial problems in the form of CSPs and solve them with constraint programming techniques. The implemented search strategies of Choco produce all feasible solutions for each heat exchanger. We can evaluate each solution and gather various statistics that will help us to evaluate the performance of the DFO solvers. Note that we need to perform all combinations of inlet and outlet tubes for each solution since we used an undirected graph to represent the problem. Therefore, Choco will enumerate all feasible solutions and for each solution we need to consider all different combinations of inlet and outlet tubes. For example, if Choco finds the solution represented in Figure 3(a), then we need to simulate all four combinations (Figures 3(a) to 3(d)) of inlet and outlet tubes. Table 2 presents the number of solutions, the number of combinations, the number of combinations whose heat capacity is greater than , and the execution time for simulating all of the circuitry designs of heat exchangers with , , , , and tubes. The execution time reported for the heat exchanger with tubes includes the simulation of only one combination for each solution.
# of tubes  # of solutions  # of combinations  # of combinations ()  Execution time (sec) 
4  5  12  2  4 
6  37  104  48  72 
8  361  1168  544  926 
10  3,965  14,976  6,981  17,261 
12  54,539  232,512  41,899  72,985 

Notes: Solutions represent circuitries where the inlet and outlet tubes are not known. Different combinations of inlet and outlet tubes are simulated for each solution.
The number of valid circuitry designs for a heat exchanger with tubes is and the total simulation time was hours. Hence, it is obvious from the results that the complete enumeration of all combinations is costly and timeconsuming. However, the results of the complete enumeration will help us evaluate the performance of the DFO solvers in the next part of our computational experiments. Table 3 presents the results of the complete enumeration, while Figures 6 and 7 present the distribution of and , respectively. For , we include only the combinations for which heat capacity is greater than . Results show that the optimal heat capacity is close to or above for all heat exchangers. On the other hand, the optimal ratio of the heat capacity to the pressure difference across the heat exchanger ranges between and . The optimal solutions have objective function values that, on average, are % and % higher than the average heat capacity and pressure differences, respectively. Therefore, optimization of exchanger circuitry layout is very likely to improve significantly the efficiency of average heat exchanger designs.
# of tubes  ()  ()  
Minimum  Maximum  Average  Minimum  Maximum  Average  
4  3,619  4,053  3,807  407  413  410 
6  3,234  3,991  3,700  254  280  268 
8  2,963  3,977  3,675  190  1,446  560 
10  2,643  4,053  3,649  147  8,906  775 
12  2,528  4,034  3,716  120  8,229  575 
Next, we applied the five DFO solvers that were presented in Section 4 to the proposed constrained binary DFO problem. A limit of function evaluations and seconds was set for each run. Tables 5 to 9 present the detailed results of the optimization of the two objective functions, and . In each case, we report the best objective value, the execution time, and the number of function evaluations. A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits. Figure 8 presents a summary of the results for heat capacity optimization. TOMLAB/glcDirect and TOMLAB/glcSolve always find a solution that is optimal or nearoptimal. TOMLAB/glcDirect and TOMLAB/glcSolve find the same solution on instances. TOMLAB/glcDirect finds a better solution for and tubes with heat capacities of and , respectively, which represent a % and % improvement over TOMLAB/glcSolver. TOMLAB/glcSolve finds a better solution for , , and tubes with heat capacities of , , and , respectively, which represent a %, %, and improvement over the results from TOMLAB/glcDirect.
CMAES performs well on most problems. It finds the best solution for , , , , and tubes with heat capacities of , , , , and , respectively, which represent a %, %, %, %, and % improvement over the results from TOMLAB/glcSolve. However, it fails to solve the problems with more than tubes. MIDACO is able to find three best solutions for small heat exchangers (, , and tubes), but it fails to find a good solution for larger problems. In addition, MIDACO fails to even find a feasible solution for heat exchangers with more than tubes. Finally, the performance of NOMAD is not stable. It finds the best solution for tubes with a heat capacity of , but it fails to solve the two largest problems.
Timewise, TOMLAB/glcSolve is faster than TOMLAB/glcDirect on smaller instances ( tubes), but TOMLAB/glcDirect is much faster on larger instances ( tubes) and on average. Moreover, TOMLAB/glcDirect and TOMLAB/glcSolve are faster than CMAES but slower than MIDACO and NOMAD. This was expected since MIDACO and NOMAD produce many infeasible solutions and CoilDesigner is not executed in such cases. Regarding the number of function evaluations, TOMLAB/glcSolve performs slightly better than TOMLAB/glcDirect, CMAES, and NOMAD, on average, while MIDACO always reaches the limit of function evaluations.
# of tubes  CMAES  glcDirect  
()  Time  Function evaluations  ()  Time  Function evaluations  
4  4,053  66  164  4,053  5  5 
6  3,956  142  206  3,991  38  37 
8  3,977  332  457  3,977  531  361 
10  4,053  928  932  4,053  1,171  509 
12  4,022  2,624  1,474  4,022  1,862  533 
14  3,940  8,468  2,059  3,990  1,575  438 
16  4,090  14,720  2,500  4,089  5,518  1,306 
18  4,051  16,666  2,500  4,086  5,469  952 
20  4,078  7,927  2,500  4,075  5,535  886 
22  4,132  18,380  2,500  4,046  7,404  945 
24  4,201  29,301  2,500  4,050  18,688  1,309 
26  4,094  41,529  2,500  4,064  19,631  1,261 
28  4,077  63,046  2,500  4,002  23,833  1,489 
30        4,065  20,204  1,627 
32        4,004  33,781  1,309 
34        3,996  29,589  1,372 
36        4,022  39,201  1,512 
Geometric mean  4,055  4,309  1,287  4,034  3,590  578 

Notes: A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits.
# of tubes  glcSolve  MIDACO  
()  Time  Function evaluations  ()  Time  Function evaluations  
4  4,053  4  5  4,053  1,403  2,500 
6  3,991  35  37  3,956  545  2,500 
8  3,977  384  361  3,977  385  2,500 
10  4,053  820  481  4,053  577  2,500 
12  4,032  1,122  472  3,985  329  2,500 
14  3,990  1,553  442  3,990  407  2,500 
16  4,089  5,294  921  4,019  1,093  2,500 
18  4,063  5,254  840  3,927  1,303  2,500 
20  4,075  5,456  890  3,842  2,272  2,500 
22  4,046  7,324  946  3,849  3,026  2,500 
24  4,061  17,150  1,431  3,856  3,938  2,500 
26  4,064  20,316  1,261       
28  4,002  26,528  1,496       
30  4,065  22,683  1,287       
32  4,026  46,540  1,267       
34  3,996  75,810  1,376       
36  3,935  86,400  985       
Geometric mean  4,030  3,740  537  3,954  988  2,500 

Notes: A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits.
# of tubes  NOMAD  
()  Time  Function evaluations  
4  4,053  2.30  16 
6  3,951  10  196 
8  3,975  37  212 
10  4,053  76  204 
12  3,982  317  163 
14  3,923  317  163 
16  4,095  625  628 
18  3,926  813  869 
20  3,996  621  1,918 
22  4,034  695  1,841 
24  4,123  5,282  1,533 
26  3,948  5,278  2,488 
28  3,946  5,721  1,673 
30  3,871  3,250  1,786 
32  3,950  6,606  2,500 
34       
36       
Geometric mean  3,988  444  566 

Notes: A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits.
Figure 9 presents a summary of the results for the optimization of the ratio of the heat capacity to the pressure difference across the heat exchanger. Similar to the results obtained for the optimization of the heat capacity, TOMLAB/glcDirect and TOMLAB/glcSolve always find a solution that is optimal or nearoptimal. TOMLAB/glcDirect and TOMLAB/glcSolve find the same solution on instances. TOMLAB/glcDirect finds a better solution for tubes with an objective value of , which represents a % improvement over TOMLAB/glcSolver. TOMLAB/glcSolve finds the best solution for , , and tubes with objective values of , , and , respectively, which represent a %, %, and improvement over the results from TOMLAB/glcDirect.
CMAES performs well on most problems. It finds the best solution (along with other solvers) for , , and tubes. However, it fails to solve the problems with more than tubes. MIDACO is able to find some optimal solutions for small heat exchangers, but it fails to find a good solution for larger problems. In addition, MIDACO fails to find even a feasible solution for heat exchangers with , , and more than tubes. Finally, NOMAD performs well on most problems. It finds the best solution for tubes with an objective value of , which represents a % improvement over TOMLAB/glcDirect and TOMLAB/glcSolve. It also finds the best solution (along with other solvers) on four other problems (, , , and tubes).
Timewise, TOMLAB/glcSolve is faster than TOMLAB/glcDirect on smaller instances ( tubes), but TOMLAB/glcDirect is much faster on larger instances ( tubes), and on average. Moreover, TOMLAB/glcDirect and TOMLAB/glcSolve are faster than CMAES but slower than MIDACO and NOMAD. As already mentioned, MIDACO and NOMAD produce many infeasible solutions and CoilDesigner is not executed in such cases. Regarding the number of function evaluations, TOMLAB/glcSolve performs slightly better than TOMLAB/glcDirect on average. NOMAD performs less iterations than all other solver since it cannot solve the large problems. CMAES performs considerably more iterations than the aforementioned solvers, while MIDACO always reaches the limit of function evaluations.
# of tubes  CMAES  glcDirect  
(  Time  Function evaluations  (  Time  Function evaluations  
4  413  35  74  413  4  5 
6  277  168  374  280  38  37 
8  1,432  243  704  1,443  422  361 
10  8,881  2,424  1,262  8,900  1,143  518 
12  2,941  258  1,314  8,216  1,435  653 
14  26,219  453  2,500  26,219  2,920  774 
16  24,348  10,330  2,500  24,393  10,822  1,289 
18  30,803  850  2,500  30,830  7,525  1,100 
20  16,781  2,479  2,500  16,914  5,817  950 
22  21,064  2,768  2,500  43,517  8,976  1,124 
24  53,108  39,808  2,500  53,518  24,885  1,520 
26  69,995  43,514  2,500  70,005  23,064  1,578 
28  90,080  68,198  2,500  90,080  26,807  1,640 
30        74,998  23,374  1,471 
32        74,023  27,337  1,524 
34        82,445  32,506  1,622 
36        91,031  44,523  1,698 
Geometric mean  9,995  1,845  1,350  18,138  4,043  649 

Notes: A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits.
# of tubes  glcSolve  MIDACO  
(  Time  Function evaluations  (  Time  Function evaluations  
4  413  4.40  5  413  1,323  2,500 
6  280  35  37  280  512  2,500 
8  1,443  387  345  1,417  300  2,500 
10  8,894  960  531  8,905  721  2,500 
12  8,216  1,553  654  2,944  196  2,500 
14  26,219  3,186  775  26,219  400  2,500 
16  24,393  10,939  1,299  24,295  1,023  2,500 
18  30,830  8,234  1,104  30,767  1,391  2,500 
20  16,914  6,759  963       
22  43,517  10,581  1,134       
24  53,646  27,617  1,551  35,930  5,641.30  2,500 
26  70,005  26,683  1,577       
28  90,080  34,272  1,673       
30  75,109  37,244  1,590       
32  74,023  35,346  1,536       
34  82,445  77,147  1,641       
36  91,031  86,400  1,237       
Geometric mean  18,141  4,813  643  5,248  768  2,500 

Notes: A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits.
# of tubes  NOMAD  
(  Time  Function evaluations  
4  413  2  16 
6  279  14  207 
8  1,432  43  191 
10  8,905  66  195 
12  2,894  99  183 
14  26,219  317  163 
16  24,306  973  434 
18  30,889  756  481 
20       
22       
24  33,529  4,874  812 
26  49,829  4,316  859 
28  90,080  6,440  443 
30  57,070  10,388  1,223 
32  73,859  9,604  997 
34       
36       
Geometric mean  11,371  447  314 

Notes: A dash (“”) is used to indicate when a solver did not find a feasible solution in the given limits.
Results for the optimization of the two objective functions showed that TOMLAB/glcDirect and TOMLAB/glcSolve can efficiently solve the proposed model and produce optimal or nearoptimal solutions. Comparing those results with the complete enumeration results for the five heat exchangers with to tubes, TOMLAB/glcDirect and TOMLAB/glcSolve found:

For the optimization of heat capacity, four optimal solutions and a nearoptimal solution that deviates from the optimal solution by only %

For the optimization of the ratio of the heat capacity to the pressure difference across the heat exchanger, two optimal solutions and three nearoptimal solutions that deviate from the optimal solution by an average of only %.
Hence, the use of constraint programming on the smaller heat exchangers verifies that the results generated by TOMLAB/glcDirect and TOMLAB/glcSolve are optimal or nearoptimal.
6 Conclusions
Optimization of a heat exchanger design is a very important task since it can improve the performance of the designed heat exchanger. Most of the proposed methods aim to optimize the heat capacity by finding optimal values for structural parameters, such as tube thickness and fin spacing, and operating conditions, such as the refrigerant temperature and pressure. Another significant task when designing a highly efficient heat exchanger is to optimize the refrigerant circuitry. Design engineers currently choose the refrigerant circuitry according to their experience and heat exchanger simulations. However, there are many possible refrigerant circuitry candidates and thus, the design of an optimized refrigerant circuitry is difficult.
In this paper, we proposed a new formulation for the refrigerant circuitry design problem. We modeled this problem as a constrained binary optimization problem. We used CoilDesigner to simulate the performance of different refrigerant circuitry designs. CoilDesigner acts as a blackbox since the exact relationship of the objective function with the decision variables is not explicit. DFO algorithms are suitable for solving this blackbox model since they do not require explicit functional representations of the objective function and the constraints. We applied five DFO solvers on heat exchangers. Results showed that TOMLAB/glcDirect and TOMLAB/glcSolve can find optimal or nearoptimal refrigerant circuitry designs on all instances. We also used constraint programming methods to verify the results of the DFO methods for small heat exchangers. The results show that the proposed method provides optimal refrigerant circuitries satisfying realistic manufacturing constraints. The proposed heat exchanger circuitry optimization methods generate optimal or nearoptimal circuit designs without requiring extensive domain knowledge. As a result, the proposed approach can be readily applied to different types of heat exchangers.
Another contribution of the paper was the comparison between four mixedinteger constrained DFO solvers and one boxbounded DFO solver on industriallyrelevant problems. These solvers were applied to optimize heat exchanger circuitry using two different thermal efficiency criteria. We found that TOMLAB/glcDirect and TOMLAB/glcSolve had the best performance.
In future work, we plan to consider other important performance metrics such as the shortest joint tubes and the production cost. In addition, future work should also optimize other parameters of the heat exchanger design, e.g., the tube thickness, the fin spacing, and the refrigerant temperature and pressure.
=0mu plus 1mu
References
 [1] Abramson, M.A., Audet, C.: Convergence of mesh adaptive direct search to secondorder stationary points. SIAM Journal on Optimization 17, 606–609 (2006)
 [2] Abramson, M.A., Audet, C., Couture, G., Dennis, Jr., J.E., Le Digabel, S.: The Nomad project (Current as of 29 December, 2016). http://www.gerad.ca/nomad/
 [3] Aspentech: HTFS Home Page (Current as of 29 December, 2016). http://htfs.aspentech.com/
 [4] Audet, C., Dennis Jr., J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM Journal on Optimization 17, 188–217 (2006)
 [5] Bendaoud, A.L., Ouzzane, M., Aidoun, Z., Galanis, N.: A new modeling procedure for circuit design and performance prediction of evaporator coils using CO as refrigerant. Applied Energy 87, 2974–2983 (2010)
 [6] Booker, A.J., Meckesheimer, M., Torng, T.: Reliability based design optimization using design explorer. Optimization and Engineering 5, 179–205 (2004)
 [7] Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixedinteger nonlinear programming, MINLP, and constrained derivativefree optimization, CDFO. European Journal of Operational Research 252, 701–727 (2016)
 [8] Casson, V., Cavallini, A., Cecchinato, L., Del Col, D., Doretti, L., Fornasieri, E., Rossetto, L., Zilio, C.: Performance of finned coil condensers optimized for new HFC refrigerants/Discussion. ASHRAE Transactions 108, 517 (2002)
 [9] Center for Environmental Energy Engineering: CoilDesigner Home Page (Current as of 29 December, 2016). http://www.ceee.umd.edu/consortia/isoc/coildesigner
 [10] COINOR Project: Derivative Free Optimization (Current as of 29 December, 2016). http://projects.coinor.org/Dfo
 [11] Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivativefree trustregion algorithms to first and second order critical points. SIAM Journal on Optimization 20, 387–415 (2009)

[12]
Das, S., Suganthan, P.N.: Differential evolution: A survey of the
stateoftheart.
IEEE Transactions on Evolutionary Computation
15, 4–31 (2011)  [13] Domanski, P.A., Yashar, D.: Optimization of finnedtube condensers using an intelligent system. International Journal of Refrigeration 30, 482–488 (2007)
 [14] Domanski, P.A., Yashar, D., Kaufman, K.A., Michalski, R.S.: An optimized design of finnedtube evaporators using the learnable evolution model. HVAC&R Research 10, 201–211 (2004)
 [15] Domanski, P.A., Yashar, D., Kim, M.: Performance of a finnedtube evaporator optimized for different refrigerants and its effect on system efficiency. International Journal of Refrigeration 28, 820–827 (2005)
 [16] Fax, D.H., Mills, R.R.: Generalized optimal heat exchanger design. ASME Transactions 79, 653–661 (1957)

[17]
Hansen, N.: The CMA Evolution Strategy: A tutorial (Current as of 29
December, 2016).
http://www.lri.fr/~hansen/cmaesintro.html  [18] Hedderich, C.P., Kelleher, M.D., Vanderplaats, G.N.: Design and optimization of aircooled heat exchangers. Journal of Heat Transfer 104, 683–690 (1982)
 [19] Hewitt, G.F., Shires, G.L., Bott, T.R.: Process Heat Transfer, vol. 113. CRC press Boca Raton, FL (1994)
 [20] Holmström, K., Göran, A.O., Edvall, M.M.: User’s Guide for TOMLAB 7. Tomlab Optimization (2010). http://tomopt.com
 [21] Jegede, F.O., Polley, G.T.: Optimum heat exchanger design: process design. Chemical Engineering Research & Design 70, 133–141 (1992)
 [22] Jiang, H., Aute, V., Radermacher, R.: CoilDesigner: A generalpurpose simulation and design tool for airtorefrigerant heat exchangers. International Journal of Refrigeration 29, 601–610 (2006)
 [23] Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Application 79, 157–181 (1993)
 [24] Kolda, T.G., Lewis, R.M., Torczon, V.J.: Optimization by direct search: New perspectives on some classical and modern methods. SIAM Review 45, 385–482 (2003)
 [25] Lee, W.J., Kim, H.J., Jeong, J.H.: Method for determining the optimum number of circuits for a fintube condenser in a heat pump. International Journal of Heat and Mass Transfer 98, 462–471 (2016)
 [26] Lewis, R.M., Torczon, V.J.: A globally convergent augmented lagrangian pattern search algorithm for optimization with general constraints and simple bounds. SIAM Journal on Optimization 12, 1075–1089 (2002)
 [27] Liang, S.Y., Wong, T.N., Nathan, G.K.: Study on refrigerant circuitry of condenser coils with exergy destruction analysis. Applied Thermal Engineering 20, 559–577 (2000)
 [28] Liang, S.Y., Wong, T.N., Nathan, G.K.: Numerical and experimental studies of refrigerant circuitry of evaporator coils. International Journal of Refrigeration 24, 823–833 (2001)
 [29] Matos, R.S., Laursen, T.A., Vargas, J.V.C., Bejan, A.: Threedimensional optimization of staggered finned circular and elliptic tubes in forced convection. International Journal of Thermal Sciences 43, 477–487 (2004)
 [30] Mladenović, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)
 [31] Nelder, J.A., Mead, R.: A simplex method for function minimization. Computer Journal 7, 308–313 (1965)
 [32] NIST: EVAPCOND Home Page (Current as of 29 December, 2016). https://www.nist.gov/servicesresources/software/evapcond
 [33] Oliet, C., PerezSegarra, C.D., Danov, S., Oliva, A.: Numerical simulation of dehumidifying finandtube heat exchangers: Semianalytical modelling and experimental comparison. International Journal of Refrigeration 30, 1266–1277 (2007)
 [34] Prud’homme, C., Fages, J.G., Lorca, X.: Choco Solver Documentation (Current as of 29 December, 2016). http://www.chocosolver.org
 [35] Ragazzi, F.: Thermodynamic optimization of evaporators with zeotropic refrigerant mixtures. Tech. rep., Air Conditioning and Refrigeration Center. College of Engineering. University of Illinois at UrbanaChampaign. (1995)
 [36] Reneaume, J.M., Pingaud, H., Niclout, N.: Optimization of plate fin heat exchangers: a continuous formulation. Chemical Engineering Research and Design 78, 849–859 (2000)
 [37] Rios, L.M., Sahinidis, N.V.: Derivativefree optimization: A review of algorithms and comparison of software implementations. Journal of Global Optimization 56, 1247–1293 (2013)
 [38] Schlüter, M., Egea, J.A., Banga, J.R.: Extended ant colony optimization for nonconvex mixed integer nonlinear programming. Computers & Operations Research 36, 2217–2229 (2009)
 [39] Schlüter, M., Gerdts, M.: The oracle penalty method. Journal of Global Optimization 47, 293–325 (2010)
 [40] Schlüter, M., Munetomo, M.: MIDACO User Guide. MIDACOSOLVER (2016). http://www.midacosolver.com/
 [41] Serafini, D.B.: A framework for managing models in nonlinear optimization of computationally expensive functions. Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University, Houston, TX (1998)
 [42] Singh, V., Aute, V., Radermacher, R.: Numerical approach for modeling airtorefrigerant finandtube heat exchanger with tubetotube heat transfer. International Journal of Refrigeration 31, 1414–1425 (2008)
 [43] Spendley, W., Hext, G.R., Himsworth, F.R.: Sequential application for simplex designs in optimisation and evolutionary operation. Technometrics 4, 441–461 (1962)
 [44] Wang, C.C., Jang, J.Y., Lai, C.C., Chang, Y.J.: Effect of circuit arrangement on the performance of aircooled condensers. International Journal of Refrigeration 22, 275–282 (1999)
 [45] Wu, Z., Ding, G., Wang, K., Fukaya, M.: Application of a genetic algorithm to optimize the refrigerant circuit of finandtube heat exchangers for maximum heat transfer or shortest tube. International Journal of Thermal Sciences 47, 985–997 (2008)
 [46] Yashar, D.A., Lee, S., Domanski, P.A.: Rooftop airconditioning unit performance improvement using refrigerant circuitry optimization. Applied Thermal Engineering 83, 81–87 (2015)

[47]
Yashar, D.A., Wojtusiak, J., Kaufman, K., Domanski, P.A.: A dualmode evolutionary algorithm for designing optimized refrigerant circuitries for finnedtube heat exchangers.
HVAC&R Research 18, 834–844 (2012)  [48] Yun, J.Y., Lee, K.S.: Influence of design parameters on the heat transfer and flow friction characteristics of the heat exchanger with slit fins. International Journal of Heat and Mass Transfer 43, 2529–2539 (2000)
Comments
There are no comments yet.