Research Papers

Evolving Hidden Genes in Genetic Algorithms for Systems Architecture Optimization

[+] Author and Article Information
Ossama Abdelkhalik

Department of Mechanical Engineering
and Engineering,
Mechanics Michigan Tech Univesity,
Houghton, MI 49931
e-mail: ooabdelk@mtu.edu

Shadi Darani

Department of Mechanical Engineering
and Engineering,
Mechanics Michigan Tech Univesity,
Houghton, MI 49931

1Corresponding author.

Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT,AND CONTROL. Manuscript received May 24, 2017; final manuscript received April 21, 2018; published online June 4, 2018. Assoc. Editor: Ming Xin.

J. Dyn. Sys., Meas., Control 140(10), 101015 (Jun 04, 2018) (11 pages) Paper No: DS-17-1273; doi: 10.1115/1.4040207 History: Received May 24, 2017; Revised April 21, 2018

The concept of hidden genes was recently introduced in genetic algorithms (GAs) to handle systems architecture optimization problems, where the number of design variables is variable. Selecting the hidden genes in a chromosome determines the architecture of the solution. This paper presents two categories of mechanisms for selecting (assigning) the hidden genes in the chromosomes of GAs. These mechanisms dictate how the chromosome evolves in the presence of hidden genes. In the proposed mechanisms, a tag is assigned for each gene; this tag determines whether the gene is hidden or not. In the first category of mechanisms, the tags evolve using stochastic operations. Eight different variations in this category are proposed and compared through numerical testing. The second category introduces logical operations for tags evolution. Both categories are tested on the problem of interplanetary trajectory optimization for a space mission to Jupiter, as well as on mathematical optimization problems. Several numerical experiments were designed and conducted to optimize the selection of the hidden genes algorithm parameters. The numerical results presented in this paper demonstrate that the proposed concept of tags and the assignment mechanisms enable the hidden genes genetic algorithms (HGGA) to find better solutions.

Copyright © 2018 by ASME
Your Session has timed out. Please sign back in to continue.


NSF, 2014, “ Cyber Physical Systems Program,” National Science Foundation, Alexandria, VA, accessed May 22, 2018, http://www.nsf.gov/funding/pgm_summ.jsp?pims_id=503286
Goldberg, D. E. , 1989, Genetic Algorithms in Search, Optimization and Machine Learning, 1st ed., Addison-Wesley Longman Publishing, Boston, MA.
Kennedy, J. , and Eberhart, R. C. , 1995, “ Particle Swarm Optimization,” IEEE International Conference on Neural Networks, Perth, Australia, Nov. 27–Dec. 1, pp. 1942–1948.
Dorigo, M. , Maniezzo, V. , and Colorni, A. , 1996, “ The Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Trans. Syst., Man, Cybern.-Part B, 26(1), pp. 29–41. [CrossRef]
Price, K. , Storn, R. M. , and Lampinen, J. A. , 2005, Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series), Springer, Berlin.
O’Reilly, U.-M. , and Oppacher, F. , 1994, Program Search With a Hierarchical Variable Length Representation: Genetic Programming, Simulated Annealing and Hill Climbing, Springer, Berlin, pp. 397–406.
Harvey, I. , 1992, “ Toward a Practice of Autonomous Systems,” First European Conference on Artifcial Life, pp. 346–354.
Harvey, I. , 1992, “ The Saga Cross: The Mechanics of Recombination for Species With Variable-Length Genotypes,” Second Conference on Parallel Problem Solving From Nature, Brussels, Belgium, Sept. 28–30, p. 271.
Lee, C.-Y. , and Antonsson, E. , 2000, “ Variable Length Genomes for Evolutionary Algorithms,” Genetic and Evolutionary Computation Conference (GECCO), Las Vegas, NV, July 8–12. https://www.researchgate.net/publication/220741828_Variable_Length_Genomes_for_Evolutionary_Algorithms
Zebulum, R. S. , Vellasco, M. , and Pacheco, M. A. , 2000, “ Variable Length Representation in Evolutionary Electronics,” Evol. Comput., 8(1), pp. 93–120. [CrossRef] [PubMed]
Ryoo, J. , and Hajela, P. , 2004, “ Handling Variable String Lengths in GA-Based Structural Topology Optimization,” Struct. Multidisc. Optim., 26(5), pp. 318–325.
Kim, I. Y. , and de Weck, O. , 2004, “ Variable Chromosome Length Genetic Algorithm for Structural Topology Design Optimization,” AIAA Paper No. 2004-1911.
Kim, I. Y. , and de Weck, O. , 2005, “ Variable Chromosome Length Genetic Algorithm for Progressive Refinement in Topology Optimization,” Struct. Multidisc. Optim., 29(6), pp. 445–456.
Abdelkhalik, O. , and Gad, A. , 2012, “ Dynamic-Size Multiple Populations Genetic Algorithm for Multigravity-Assist Trajectories Optimization,” AIAA J. Guid., Control, Dyn., 35(2), pp. 520–529. [CrossRef]
Nyew, H. M. , Abdelkhalik, O. , and Onder, N. , 2012, “ Structured Chromosome Evolutionary Algorithms for Multi-Gravity-Assist Trajectories Optimization,” AIAA Paper No. 2012–4519.
Nyew, H. M. , Abdelkhalik, O. , and Onder, N. , 2015, “ Structured-Chromosome Evolutionary Algorithms for Variable-Size Autonomous Interplanetary Trajectory Planning Optimization,” J. Aerosp. Inf. Syst., 12(3), pp. 314–328.
Khetan, A. , Lohan, D. J. , and Allison, J. T. , 2015, “ Managing Variable-Dimension Structural Optimization Problems Using Generative Algorithms,” Struct. Multidisc. Optim., 52(4), pp. 695–715.
Guo, X. , Zhang, W. , and Zhong, W. , 2014, “ Doing Topology Optimization Explicitly and Geometrically—A New Moving Morphable Components Based Framework,” ASME J. Appl. Mech., 81(8), p. 081009.
Yang, L. , 2011, “ Topology Optimization of Nanophotonic Devices,” Ph.D. thesis, Technical University of Denmark, Kongens Lyngby, Denmark. http://orbit.dtu.dk/files/5625332/phdthesis_LirongYang%20CMYK.pdf
Suzuki, K. , and Kikuchi, N. , 1991, “ A Homogenization Method for Shape and Topology Optimization,” Comput. Methods Appl. Mech. Eng., 93(3), pp. 291–318. [CrossRef]
Abdelkhalik, O. , 2013, “ Hidden Genes Genetic Optimization for Variable-Size Design Space Problems,” J. Optim. Theory Appl., 156(2), pp. 450–468. [CrossRef]
Abdelkhalik, O. , 2011, “ Multi-Gravity-Assist Trajectories Optimization: Comparison Between the Hidden Genes and the Dynamic-Size Multiple Populations Genetic Algorithms,” AIAA Paper No. AAS11-620.
Gad, A. , and Abdelkhalik, O. , 2011, “ Hidden Genes Genetic Algorithm for Multi-Gravity-Assist Trajectories Optimization,” AIAA J. Spacecr. Rockets, 48(4), pp. 629–641. [CrossRef]
Abdelkhalik, O. , and Darani, S. , 2016, “ Hidden Genes Genetic Algorithms for Systems Architecture Optimization,” Genetic and Evolutionary Computation Conference (GECCO'16), Denver, CO, July 20–24, pp. 629–636.
Starr, B. , 2012, “ Spooled DNA and Hidden Genes: The Latest Finding in How Our Dna is Organized and Read,” The Tech Museum of Innovation, Department of Genetics, Stanford School of Medicine, San Jose, CA, accessed May 23, 2018, http://genetics.thetech.org/original_news/news31
The National Institute of General Medical Sciences, 2010, “ The New Genetics,” National Institutes of Health, Bethesda, MD.
Park, J.-M. , Park, J.-G. , Lee, C.-H. , and Han, M.-S. , 1993, “ Robust and Efficient Genetic Crossover Operator: Homologous Recombination,” International Joint Conference Neural Networks (IJCNN ’93-Nagoya), Nagoya, Japan, Oct. 25–29, pp. 2975–2978.
Ku, S. , and Lee, B. , 2001, “ A Set-Oriented Genetic Algorithm and the Knapsack Problem,” IEEE Congress on Evolutionary Computation, Seoul, South Korea, May 27–30, pp. 650–654.
Vasile, M. , Minisci, E. , and Locatelli, M. , 2010, “ Analysis of Some Global Optimization Algorithms for Space Trajectory Design,” J. Spacecr. Rockets, 47(2), pp. 334–344. [CrossRef]
European Space Agency, Mission Analysis and Design, Advanced Concepts Team, 2017, “ Global Trajectory Optimisation Competition,” European Space Agency, Paris, France, accessed May 22, 2018, https://sophia.estec.esa.int/gtoc_portal/
Olympio, J. T. , and Marmorat, J.-P. , 2007, “ Global Trajectory Optimisation: Can We Prune the Solution Space When Considering Deep Space Maneuvers?,” European Space Agency, Noordwijk, The Netherlands, Final Report No. 2007/06/NL/HI. https://www.esa.int/gsp/ACT/doc/ARI/ARI%20Study%20Report/ACT-RPT-MAD-ARI-06-4101-CanWePrune-Politecnico-di-Milano.pdf
Derrac, J. , Garcia, S. , Molina, D. , and Herrera, F. , 2011, “ A Practical Tutorial on the Use of Nonparametric Statistical Tests as a Methodology for Comparing Evolutionary and Swarm Intelligence Algorithms,” J. Swarm Evol. Comput., 1(1), pp. 3–8.


Grahic Jump Location
Fig. 1

Interplanetary trajectory optimization problem topology

Grahic Jump Location
Fig. 2

Chemical tags (diamonds) and the “tails” of histone proteins (triangles) mark DNA to determine which genes will be transcribed. (picture is modified from Ref. [26]).

Grahic Jump Location
Fig. 3

Hidden genes and effective genes in two different chromosomes

Grahic Jump Location
Fig. 4

Crossover operation in HGGA

Grahic Jump Location
Fig. 5

Hidden genes genetic algorithms and the tags concept

Grahic Jump Location
Fig. 6

Tags of children as computed using the logic A

Grahic Jump Location
Fig. 7

Comparison of three HGGA tags mechanisms—using Schwefel 2.26 function

Grahic Jump Location
Fig. 8

Comparison of three HGGA tags mechanisms—using Egg holder function

Grahic Jump Location
Fig. 9

Success rate versus number of runs for the Earth–Jupiter trajectory optimization problem using mechanism A and logic A

Grahic Jump Location
Fig. 10

Mechanism A: EVEJ trajectory for MGADSM model

Grahic Jump Location
Fig. 11

Evolution of tags using logic C in the Earth–Jupiter problem

Grahic Jump Location
Fig. 12

Success rate versus number of runs for Schwefel 2.26 function using three different logics for tags evolution

Grahic Jump Location
Fig. 13

Success rate versus number of runs for Egg holder function using three different logics for tags evolution

Grahic Jump Location
Fig. 14

Success rate of the Schwefel 2.26 function for different stochastic mechanisms



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In