Abstract
Genetic algorithm (GA) is a random search algorithm, which has been commonly used to solve optimization problems. A new encoding method of GA, adaptive degressive ary number encoding, is proposed in this paper. This paper firstly introduces the N-ary encoding genetic algorithm and then defines the degressive ary number encoded genetic algorithm. Based on degressive ary number encoded genetic algorithm, this paper proposes a feasible adaptive change rule of the ary number encoding, which can change ary number with the fitness function’s value. All the parameters are selected according to the parameters’ experiments. The proposed algorithm is used to solve the function optimization problems to test the performance. The performances of the proposed algorithm are compared with GA, some classic algorithms and some latest algorithms. The experiments show that the improved adaptive degressive ary number encoded genetic algorithm has a better searching ability and a faster rate of convergence.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Choi JN, Oh SK, Pedrycz W (2009) Identification of fuzzy relation models using hierarchical fair competition-based parallel genetic algorithms and information granulation. Appl Math Model 33(6):2791–2807
Czarn A, Macnish C, Vijayan K et al (2004) Statistical exploratory analysis of genetic algorithms: the influence of gray codes upon the difficulty of a problem. IEEE Trans Evol Comput 8(4):405–421
Derrac J, Garca S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18
Dongli LI, Xiangning HE (2001) Comparison between optimization of function achieved by genetic algorithm with binary code and octal code. J Zhejiang Univ Technol 29:308–311
Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heurist 2(1):5–30
Freitag K, Hildebrand L, Moraga C (1999) Quaternary coded genetic algorithms. In: Twenty ninth IEEE international symposium on multiple-valued logic. IEEE Computer Society, pp 194–199
Holland JH (1992) Adaptation in nature and artificial systems. MIT Press, Cambridge
Jaddi NS, Alvankarian J, Abdullah S (2016) Kidney-inspired algorithm for optimization problems. Commun Nonlinear Sci Numer Simul 42:358–369
Jensi R, Jiji GW (2016) An enhanced particle swarm optimization with levy flight for global optimization. Soft Comput 43:248–261
Jordehi AR (2015) Enhanced leader PSO (ELPSO): a new PSO variant for solving global optimization problems. Soft Comput 26:401–417
Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4(8):1942–1948
Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization
Liu M, Qian F (2004) The research based on degressive ary number encoded genetic algorithm. Inf Control 3(5):614–617
Ma X, Zhang L (2004) Distribution network reconfiguration based on genetic algorithm using decimal encoding. Diangong Jishu Xuebao/Trans China Electrotechn Soc 19(10):65–69
Maniscalco V, Polito SG, Intagliata A (2014) Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing. Soft Comput 18(9):1705–1714
Michalewicz Z, Janikow CZ, Krawczyk JB (1992) A modified genetic algorithm for optimal control problems. Comput Math Appl 23(12):83–94
Mirjalili S (2015) The ant lion optimizer. English Softw 83:80–98
Molga M, Smutnicki C (2005) Test functions for optimization needs. http://www.zsd.ict.pwr.wroc.pl/files/docs/functions.pdf
Roy JN, Maity GK, Gayen DK, Chattopadhyay T (2008) Terahertz optical asymmetric demultiplexer based tree-net architecture for all-optical conversion scheme from binary to its other 2 n radix based form. Chin Opt Lett (English version) 7:536–540
Schraudolph NN, Belew RK (1992) Dynamic parameter encoding for genetic algorithms. Mach Learn 9(1):9–21
Su S, Zhan D (2006) New genetic algorithm for the fixed charge transportation problem. In: The sixth world congress on intelligent control and automation, WCICA 2006. IEEE, pp 7039–7043
Verma OP, Aggarwal D, Patodi T (2016) Opposition and dimensional based modified firefly algorithm. Expert Syst 44:168–176
Yang XS (2010a) A new metaheuristic bat-inspired algorithm. Comput Knowl Technol 284:65–74
Yang XS (2010b) Firefly algorithm, lvy flights and global optimization. Res Dev Intell Syst 20:209–218
Yang XS, Deb S (2009) Cuckoo search via lvy flights. In: World congress on nature and biologically inspired computing, pp 210–214
Yehua Y (2001) Molecular genetics. China Agriculture Press, Beijing
Zhang Y (2014) Research on the encoding methods of genetic algorithm. East China University of Science and Technology, Shanghai
Zhong S (2000) The convergence and encoding of genetic algorithm. J Wuhan Univ Hydraul Electric Eng 33(1):108–112
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by A. Di Nola.
Rights and permissions
About this article
Cite this article
Zhang, Y., Liu, M. An improved genetic algorithm encoded by adaptive degressive ary number. Soft Comput 22, 6861–6875 (2018). https://doi.org/10.1007/s00500-017-2981-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-017-2981-0