A hybrid ant strategy and genetic algorithm to tune the population size for efficient structural optimization
Author:
Kaveh A.,Shahrouzi M.
Abstract
PurposeAlthough genetic algorithm (GA) has already been extended to various types of engineering problems, tuning its parameters is still an interesting field of interest. Some recent works have addressed attempts requiring several GA runs, while more interesting approaches aim to obtain proper estimate of a tuned parameter during any run of genetic search. This paper seeks to address this issue.Design/methodology/approachIn this paper, a competitive frequency‐based methodology is proposed to explore the least proper population size as a major affecting control parameter of GAs. In the tuning stage, the indirect shared memory in ant strategies is borrowed in a discrete manner to generate a dynamic colony of the most successive recent solutions to be added into each new population. An adaptive variable band mutation based on direct index coding for structural problems is also employed to increase the convergence rate as well as to prevent premature convergence especially after determining a proper population size. As an important field of engineering problems, the method is then applied to a number of structural size and layout optimization examples in order to illustrate and validate its capability in capturing the problem optimum with reduced computational effort.FindingsIt was shown that improper fixed size population can lead to premature convergence. Applying the proposed method could result in a more efficient convergence to the global optimum compared with the fixed size population methods.Originality/valueA novel combination of genetic and ant colony approaches is proposed to provide a dynamic short‐term memory of the sampled representatives which can enrich the current population, avoiding unnecessary increase in its size and the corresponding computational effort in the genetic search. In addition, a dynamic band mutation is introduced and matched with such a search, to make it more efficient for structural purposes.
Subject
Computational Theory and Mathematics,Computer Science Applications,General Engineering,Software
Reference40 articles.
1. Baeck, T., Fogel, D. and Michalewicz, Z. (Eds) (1997), Handbook of Evolutionary Computation, Oxford University Press, New York, NY. 2. Biesbroek, R.G.J. and Ancarola, B.P. (2003), “Study of genetic algorithm settings for trajectory optimisation”, Proceedings of 54th International Astronautical Congress, Bremen, Germany. 3. Bonabeau, E., Dorigo, M. and Theraulaz, G. (2000), “The social insect paradigm for optimization and control”, Nature, Vol. 406 No. 6791, pp. 39‐42. 4. Cai, J. and Thierauf, G. (1993), “Discrete structural optimization using evolution strategies”, technical report, Department of Civil Engineering, University of Essen, Essen. 5. Camp, C.V., Pezeshk, S. and Cao, G. (1997), “Design of framed structures using a genetic algorithm”, in Frangopol, D.M. and Cheng, F.Y. (Eds), Advances in Structural Optimization, ASCE, New York, NY, pp. 19‐30.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|