The systematical integrating of the intelligent algorithms for global optimization such as genetic algorithm
simulated annealing algorithm and so on is discussed. The properties and characteristics of these intelligent algorithms and local search algorithms for optimization are analyzed respectively. A unified structure for a class of integrated intelligent algorithms for global optimization
IGIOA
is given
and some key factors in designing a particular integrating intelligent algorithm are presented. Some indices for evaluation and comparison of the integrated intelligent algorithms are proposed involving the evaluations of algorithms for optimization
time cost
and robustness. And a weighted index to combine these three evaluations used in selecting and comparing integrating intelligent algorithms is presented.
关键词
Keywords
references
张可村,李焕琴.工程优化方法与应用[M].科学出版社,2006.
EIBEN A E, ARTS E H,VAN HEE K M. Global convergence of genetic algorithms: an infinite Markov chain analysis[C]∥Parallel Problem Solving from Nature.Heidelberg,Berlin:Springer-Verlag,1991:4-12.
RUDOLPH G.Convergence properties of canonical genetic algorithms[J].IEEE Trans on Neural Network,1994,5(1):96-101.
QI X, PALMIERI F. Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space:part I [J].IEEE Trans on Neural Network,1994,5(1):102-119.
FAIGLE U, KEN W. Some convergence results for probabilistic tabu search[J].ORSA J on Computing, 1992,4(1):2-37.
WANG L,SMITH K. On chaotic simulated annealing [J]. IEEE Transactions on Neural Networks,1998,9(4):716-718.
KEANE A J.Genetic algorithm optimization of multi-peak problems: studies in convergence and robustness[J].Artificial Intelligence in Engineering, 1995,9(2):75-83.
WANG L,WANG M. A hybrid algorithm for earliness-tardiness scheduling problem with sequence dependent setup time[C]∥Proc of the 36th IEEE Conf on Decision and Control.Piscataway,NJ,USA:IEEE, 1997:1219-1222.