Application of the parallel adaptive genetic simulated annealing algorithm for the synthesis of heat exchanger networks

A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is developed. The proposed hybrid approach constructs an efficient genetic simulated annealing algorithm for global search, whereas the iterative hill climbing method as a local search technique is incorporated into genetic simulated annealing loop to speed up the convergence of the algorithm. To efficiently locate quality solutions to complex nonconvex MINLP problems, a self-adaptive scheme is developed in the parallel adaptive genetic simulated annealing to maintain a better tradeoff between the global and local search, which can improve the convergence speed and computational efficiency compared with some other hybrid genetic algorithm methods. For the evaluations, we use some well-known standard benchmark functions. The computational results demonstrate the effectiveness and robustness of the present approach. Further, the proposed algorithm is tailored to find optimum solution to heat exchanger network synthesis problem. The results presented prove that the proposed method is a very efficient global optimization tool for large dimensional, nonconvex MINLP problems. © 2012 Curtin University of Technology and John Wiley & Sons, Ltd.

[1]  Krishna M. Yerramsetty,et al.  Synthesis of cost-optimal heat exchanger networks using differential evolution , 2008, Comput. Chem. Eng..

[2]  Gintaras V. Reklaitis,et al.  A language for describing process scheduling problems , 1998 .

[3]  Pingjing Yao,et al.  Synthesis and optimization of heat integrated distillation systems using an improved genetic algorithm , 1998 .

[4]  Ignacio E. Grossmann,et al.  Simultaneous optimization models for heat integration—II. Heat exchanger network synthesis , 1990 .

[5]  B. Lin,et al.  Solving heat exchanger network synthesis problems with Tabu Search , 2004, Comput. Chem. Eng..

[6]  Byung Rae Cho,et al.  A Markovian approach to determining optimum process target levels for a multi-stage serial production system , 2004, Eur. J. Oper. Res..

[7]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[8]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..

[9]  David E. Goldberg,et al.  Adaptive Hybrid Genetic Algorithm for Groundwater Remediation Design , 2005 .

[10]  Ignacio E. Grossmann,et al.  Part II. Future perspective on optimization , 2004, Comput. Chem. Eng..

[11]  Eric S. Fraga,et al.  Evaluation of hybrid optimization methods for the optimal design of heat integrated distillation sequences , 2003 .

[12]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[13]  Yoke San Wong,et al.  Development of a parallel optimization method based on genetic simulated annealing algorithm , 2005, Parallel Comput..

[14]  Kevin C. Furman,et al.  Computational complexity of heat exchanger network synthesis , 2001 .

[15]  Hongmei Yu,et al.  A combined genetic algorithm/simulated annealing algorithm for large scale system energy integration , 2000 .

[16]  Venkat Venkatasubramanian,et al.  A hybrid genetic algorithm for efficient parameter estimation of large kinetic models , 2004, Comput. Chem. Eng..

[17]  Marian Jaskuła,et al.  Application of the hybrid genetic-simplex algorithm for deconvolution of electrochemical responses in SDLSV method , 2004 .

[18]  Daniel R. Lewin,et al.  A generalized method for HEN synthesis using stochastic optimization. II. : The synthesis of cost-optimal networks , 1998 .

[19]  Santhoji Katare,et al.  A hybrid swarm optimizer for efficient parameter estimation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).