Modified genetic algorithm with sampling techniques for chemical engineering optimization

被引:26
作者
Preechakul, Chirdpong [1 ]
Kheawhom, Soorathep [1 ]
机构
[1] Chulalongkorn Univ, Dept Chem Engn, Bangkok 10330, Thailand
关键词
Genetic algorithm; Latin hypercube sampling; Faure sequence sampling; Hammersley sequence sampling; GLOBAL OPTIMIZATION; SIMULATION;
D O I
10.1016/j.jiec.2008.09.003
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
In this work, we develop a new efficient technique to enhance the optimization ability, and to improve the convergence speed of genetic optimization algorithm. We investigate and introduce a number of sampling techniques to generate a good set of initial population that encourages the exploration through out the search space and hence achieves better discovery of possible global optimum in the solution space. The introduced sampling techniques include Latin hypercube sampling (LHS). Faure sequence sampling (FSS), and Hammersley sequence sampling (HSS). The performances of the proposed algorithms and a conventional genetic algorithm using uniformly random population are compared, both in terms of solution quality and speed of convergence. A number of test problems and a case study, optimization of multi-effect distillation, demonstrate the feasibility and effectiveness of the proposed techniques. With the same parameters, our technique provides a better solution and converge to the global optimum faster than the traditional genetic algorithm. (c) 2009 The Korean Society of Industrial and Engineering Chemistry. Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:110 / 118
页数:9
相关论文
共 33 条
[1]  
[Anonymous], 1997, NUMERICAL RECIPES C
[2]  
[Anonymous], 2004, Wiley InterScience electronic collection.
[3]  
Back T., 1997, HDB EVOLUTIONARY COM
[4]  
Back Thomas., 2000, Evolutionary computation 2: advanced algorithms and operators, V2
[5]   Retrospective on optimization [J].
Biegler, LT ;
Grossmann, IE .
COMPUTERS & CHEMICAL ENGINEERING, 2004, 28 (08) :1169-1192
[6]   A continuous genetic algorithm designed for the global optimization of multimodal functions [J].
Chelouah, R ;
Siarry, P .
JOURNAL OF HEURISTICS, 2000, 6 (02) :191-213
[7]  
Cho JH, 2006, J IND ENG CHEM, V12, P206
[8]  
Cho JH, 2007, J IND ENG CHEM, V13, P712
[9]   A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds [J].
Conn, AR ;
Gould, N ;
Toint, PL .
MATHEMATICS OF COMPUTATION, 1997, 66 (217) :261-+
[10]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338