An anti-greedy random walk algorithm for heat exchanger network synthesis

Le résumé fourni par la source

Heat exchanger network (HEN) synthesis is a vibrant research field in process system engineering, with substantial contributions to energy conservation and emissions reduction initiatives. The optimal design of a heat exchanger network is not an easy task due to the abundance of local optima in the solution space caused by the non-linear, non-convex, and discontinuous nature of the problem. Generally, several heuristic algorithms employ a greedy evolutionary mechanism, optimize through greedily accepting the decrease in the objective function, and converge to obtain the optimal solution. The Random Walk algorithm has a simple evolutionary mechanism, is prone to mutation, and exhibits high flexibility. However, the algorithm's inherent persistent greediness in searching restrict the scope of the search. Thus, this paper proposes an anti-greedy concept based on the Random Walk method to serve as the basis of a new synthesis approach called the Anti-greedy Random Walk algorithm. Two strategies are proposed in the algorithm, which broaden the solution domain by slowing down rapid unit reduction and accepting imperfect solutions, respectively. One strategy is to thoroughly search for the integer and continuous variables of the HEN problem by covering a much larger search space . Another is to escape the local extrema and move forward to discover more possibilities. Quantitative data demonstrates the algorithm's ability to avoid the local extrema and enhance the search effectiveness. Three different scales of classical cases are used in this work and the obtained results are superior to the published ones.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.