{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:13:22Z","timestamp":1760242402278,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T00:00:00Z","timestamp":1498780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>As one of the evolutionary heuristics methods, genetic algorithms (GAs) have shown a promising ability to solve complex optimization problems. However, existing GAs still have difficulties in finding the global optimum and avoiding premature convergence. To further improve the search efficiency and convergence rate of evolution algorithms, inspired by the mechanism of biological DNA genetic information and evolution, we present a new genetic algorithm, called GA-TNE+DRO, which uses a novel triplet nucleotide coding scheme to encode potential solutions and a set of new genetic operators to search for globally optimal solutions. The coding scheme represents potential solutions as a sequence of triplet nucleotides and the DNA reproduction operations mimic the DNA reproduction process more vividly than existing DNA-GAs. We compared our algorithm with several existing GA and DNA-based GA algorithms using a benchmark of eight unconstrained optimization functions. Our experimental results show that the proposed algorithm can converge to solutions much closer to the global optimal solutions in a much lower number of iterations than the existing algorithms. A complexity analysis also shows that our algorithm is computationally more efficient than the existing algorithms.<\/jats:p>","DOI":"10.3390\/a10030076","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T10:04:58Z","timestamp":1498817098000},"page":"76","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Genetic Algorithm Using Triplet Nucleotide Encoding and DNA Reproduction Operations for Unconstrained Optimization Problems"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4899-6316","authenticated-orcid":false,"given":"Wenke","family":"Zang","sequence":"first","affiliation":[{"name":"School of Management Science and Engineering, Shandong Normal University, Jinan 250014, China"}]},{"given":"Weining","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Texas at San Antonio, San Antonio, TX 78249, USA"}]},{"given":"Wenqian","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Shandong Normal University, Jinan 250014, China"}]},{"given":"Xiyu","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Shandong Normal University, Jinan 250014, China"}]}],"member":"1968","published-online":{"date-parts":[[2017,6,30]]},"reference":[{"key":"ref_1","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, University of Michigan Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.asoc.2015.10.048","article-title":"Improved accelerated PSO algorithm for mechanical engineering optimization problems","volume":"40","author":"Guedria","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential Evolution\u2014A simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"777","DOI":"10.3934\/jimo.2014.10.777","article-title":"Solving structural engineering design optimization problems using an artificial bee colony algorithm","volume":"10","author":"Garg","year":"2014","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2012.09.015","article-title":"Multi-objective reliability redundancy allocation problem using particle swarm optimization","volume":"64","author":"Garg","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1016\/j.eswa.2014.09.046","article-title":"Self-adaptive differential evolution algorithm with discrete mutation control parameters","volume":"42","author":"Fan","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Garg, H. (2015). A hybrid GA-GSA algorithm for optimizing the performance of an industrial system by utilizing uncertain data. Handbook of Research on Artificial Intelligence Techniques and Algorithms, IGI Global.","DOI":"10.4018\/978-1-4666-7258-1.ch020"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Pelusi, D., Mascella, R., and Tallini, L. (2017). Revised gravitational search algorithms based on evolutionary-fuzzy systems. Algorithms, 10.","DOI":"10.3390\/a10020044"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.amc.2015.11.001","article-title":"A hybrid PSO-GA algorithm for constrained optimization problems","volume":"274","author":"Garg","year":"2016","journal-title":"Appl. Math. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2015.05.001","article-title":"An efficient biogeography based optimization algorithm for solving reliability optimization problems","volume":"24","author":"Garg","year":"2015","journal-title":"Swarm Evol. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Nabil, B., Guenda, K., and Gulliver, A. (2015). Construction of codes for DNA computing by the greedy algorithm. ACM Commun. Comput. Algebra., 49.","DOI":"10.1145\/2768577.2768583"},{"key":"ref_13","unstructured":"Mayukh, S., and Ghosal, P. (2015, January 8\u201310). Implementing Data Structure Using DNA: An Alternative in Post CMOS Computing. Proceedings of the 2015 IEEE Computer Society Annual Symposium on VLSI, Montpellier, France."},{"key":"ref_14","unstructured":"Huang, Y., Tian, Y., and Yin, Z. (2010, January 23\u201324). Design of PID controller based on DNA COMPUTING. Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence (AICI), Sanya, China."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1109\/TBME.2009.2033263","article-title":"A feasible solution to the beam-angle-optimization problem in radiotherapy planning with a DNA-based genetic algorithm","volume":"57","author":"Yongjie","year":"2010","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.cor.2016.05.003","article-title":"A biased random key genetic algorithm for the field technician scheduling problem","volume":"75","author":"Damm","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10951-015-0457-6","article-title":"A genetic algorithm for the robust resource leveling problem","volume":"19","author":"Li","year":"2016","journal-title":"J. Sched."},{"key":"ref_18","unstructured":"Ding, Y.S., and Ren, L.H. (2000, January 8\u201311). DNA genetic algorithm for design of the generalized membership-type Takagi-Sugeno fuzzy control system. Proceedings of the 2000 IEEE International Conference on Systems, Man, and Cybernetics, Nashville, TN, USA."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/j.apm.2012.03.046","article-title":"A modified DNA genetic algorithm for parameter estimation of the 2-chlorophenol oxidation in supercritical water","volume":"37","author":"Zhang","year":"2013","journal-title":"Appl. Math. Model."},{"key":"ref_20","first-page":"1076","article-title":"Optimization of short-time gasoline blending scheduling problem with a DNA based hybrid genetic algorithm","volume":"49","author":"Chen","year":"2010","journal-title":"Comput. Chem. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ijhydene.2012.10.026","article-title":"An adaptive RNA genetic algorithm for modeling of proton exchange membrane fuel cells","volume":"38","author":"Zhang","year":"2013","journal-title":"Int. J. Hydrog. Energy"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3763","DOI":"10.1166\/jctn.2016.5209","article-title":"A DNA genetic algorithm inspired by biological membrane structure","volume":"13","author":"Zang","year":"2016","journal-title":"J. Comput. Theor. Nanosci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.apm.2014.04.035","article-title":"Type-1\/type-2 fuzzy logic systems optimization with RNA genetic algorithm for double inverted pendulum","volume":"39","author":"Sun","year":"2015","journal-title":"Appl. Math. Model."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1750023","DOI":"10.1142\/S0218001417500239","article-title":"Automatic density peaks clustering using DNA genetic algorithm optimized data field and Gaussian process","volume":"31","author":"Zang","year":"2017","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"7799","DOI":"10.1142\/S0218001417500100","article-title":"Spectral clustering based on density combined with DNA genetic algorithm","volume":"31","author":"Zang","year":"2017","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/978-3-319-31854-7_53","article-title":"Searching parameter values in support vector machines using DNA genetic algorithms","volume":"9567","author":"Zang","year":"2016","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_27","unstructured":"Yoshikawa, T., Furuhashi, T., and Uchikawa, Y. (1997, January 13\u201316). The effects of combination of DNA coding method with pseudo-bacterial GA. Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, IN, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(02)00134-2","article-title":"Topics in the theory of DNA computing","volume":"287","author":"Amos","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/LCOMM.2011.022411.101804","article-title":"An elitism strategy based genetic algorithm for streaming pattern discovery in wireless sensor networks","volume":"15","author":"Cheng","year":"2011","journal-title":"Commun. Lett. IEEE"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1093\/genetics\/145.2.519","article-title":"The genealogy of samples in models with selection","volume":"145","author":"Neuhauser","year":"1997","journal-title":"Genetics"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Haupt, R.L., and Haupt, S.E. (2004). Practical Genetic Algorithms, John Wiley & Sons, Inc.. [2nd ed.].","DOI":"10.1002\/0471671746"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Mirjalili, S., Mirjalili, S.M., and Hatamlou, A. (2015). Multi-verse optimizer: A nature inspired algorithm for global optimization. Neural Comput. Appl.","DOI":"10.1007\/s00521-015-1870-7"},{"key":"ref_33","unstructured":"Liang, J., Qu, B., and Suganthan, P. (2013). Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization, Nanyang Technological University. Technical Report."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/3\/76\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:40:57Z","timestamp":1760208057000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/3\/76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,30]]},"references-count":33,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2017,9]]}},"alternative-id":["a10030076"],"URL":"https:\/\/doi.org\/10.3390\/a10030076","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2017,6,30]]}}}