Abstract
In this paper an efficient evolutionary algorithm is proposed which could be applied to real-time problems such as robotics applications. The only parameter of the proposed algorithm is the “Population Size” which makes the proposed algorithm similar to parameter-less algorithms, and the only operator applied during the algorithm execution is the bacterial conjugation operator, which makes using and implementation of the proposed algorithm much easier. The procedure of the bacterial conjugation operator used in this algorithm is different from operators of the same name previously used in other evolutionary algorithms such as the pseudo bacterial genetic algorithm or the microbial genetic algorithm. For a collection of 23 benchmark functions and some other well-known optimization problems, the experimental results show that the proposed algorithm has better performance when compared to particle swarm optimization and a simple genetic algorithm.
Similar content being viewed by others
References
L. Huang, L.-x. Ding, W.-w. Du, Improved self-adaptive genetic algorithm with varying population size, in Proceedings of the 2009 Fifth International Conference on MEMS NANO, and Smart Systems (ICMENS '09) (2009), pp. 77–79
R. Breukelaar, T. Baeck, Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata, in Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO '08) (2008), pp. 1101–1102
A. Mehrafsa, A. Sokhandan, G. Karimian, A Timed-based approach for genetic algorithm: theory and applications. IEICE Trans. Inf. Syst. E94-D(6), 1306–1320 (2011)
A.J.F. Griffiths, J.H. Miller, D.T. Suzuki, R.C. Lewontin, W.M. Gelbart, An Introduction to Genetic Analysis, 8th edn. (W. H. Freeman, New York, 2004)
I. Harvey, The Microbial Genetic Algorithm, Springer, Lecture Notes in Computer Science, vol. 5778 (2011), pp. 126–133
P. Smith, Conjugation—a bacterially inspired form of genetic recombination, in Proceedings of Late Breaking Papers at the Genetic Programming Conference (1996), pp. 167–176
C. Perales-Gravan, R. Lahoz-Beltra, An AM radio receiver designed with a genetic algorithm based on a bacterial conjugation genetic operator. IEEE Trans. Evol. Comput. 12, 129–142 (2008)
N.E. Nawa, T. Furuhashi, Fuzzy system parameters discovery by bacterial evolutionary algorithm. IEEE Trans. Fuzzy Syst. 7, 608–616 (1999)
S. Das, A. Chowdhury, A. Abraham, A bacterial evolutionary algorithm for automatic data clustering, in Proceedings of the Eleventh conference on Congress on Evolutionary Computation (2009), pp. 2403–2410
X. Yao, Y. Liu, G. Lin, Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)
M. Angelova, T. Pencheva, Tuning genetic algorithm parameters to improve convergence time. Int. J. Chem. Eng. 2011, 1–7 (2011)
PSC. Particle Swarm Central, http://www.particleswarm.info
M. Clerc, Standard Particle Swarm Optimisation: From 2006 to 2011, Particle Swarm Central (2011)
M. Clerc, Beyond standard particle swarm optimisation. Int. J. Swarm Intell. Res. (IJSIR) 1(4), 46–61 (2010)
D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)
H. Asada, J.-J. E. Slotine, Robot Analysis and Control, 1st edn. (John Wiley & Sons, New York, 1986)
Y. Yang, G. Peng, Y. Wang, H. Zhang, A new solution for inverse kinematics of 7-DOF manipulator based on genetic algorithm, in Proceedings of the IEEE International Conference on Automation and Logistics (2007), pp. 1947–1951
Acknowledgments
The authors would like to thank the anonymous referees for their helpful comments and suggestions to improve the paper. Also the authors would like to thank their partners in the University of Tabriz for their cooperation in preparing this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mehrafsa, A., Sokhandan, A. & Karimian, G. A high performance genetic algorithm using bacterial conjugation operator (HPGA). Genet Program Evolvable Mach 14, 395–427 (2013). https://doi.org/10.1007/s10710-013-9185-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10710-013-9185-x