skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Hidden Genes Genetic Algorithms for Systems Architecture Optimization
The concept of hidden genes was recently introduced in genetic algorithms to handle variable-size design space optimization problems. This paper presents new developments in hidden genes genetic algorithms. Mechanisms for assigning (selecting) the hidden genes in the chromosomes of genetic algorithms are presented. In the proposed mechanisms, a tag is assigned for each gene; this tag determines whether the gene is hidden or not, while they evolve over generations using stochastic operations. These mechanisms are tested on mathematical optimization problems and on a trajectory optimization problem for a space mission to Jupiter. In the conducted tests, one of the proposed hidden genes assignment mechanism has enabled the hidden genes genetic algorithms to find better (lower cost) solutions, while other mechanisms has shown to be able to find close solutions.  more » « less
Award ID(s):
1446622
PAR ID:
10019749
Author(s) / Creator(s):
;
Date Published:
Journal Name:
ACM Proceedings, Genetic and Evolutionary Computation Conference, GECCO
Page Range / eLocation ID:
629 to 636
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Journal of Dynamic Systems, Measurement, and Control)
    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. 
    more » « less
  2. ; ; (, Genetic programming and evolvable machines)
    We introduce and experimentally demonstrate the utility of tag-based genetic regulation, a new genetic programming (GP) technique that allows programs to dynamically adjust which code modules to express.Tags are evolvable labels that provide a flexible mechanism for referencing code modules. Tag-based genetic regulation extends existing tag-based naming schemes to allow programs to “promote” and “repress” code modules in order to alter expression patterns. This extension allows evolution to structure a program as a gene regulatory network where modules are regulated based on instruction executions. We demonstrate the functionality of tag-based regulation on a range of program synthesis problems. We find that tag-based regulation improves problem-solving performance on context-dependent problems; that is, problems where programs must adjust how they respond to current inputs based on prior inputs. Indeed, the system could not evolve solutions to some context-dependent problems until regulation was added. Our implementation of tag-based genetic regulation is not universally beneficial, however. We identify scenarios where the correct response to a particular input never changes, rendering tag-based regulation an unneeded functionality that can sometimes impede adaptive evolution. Tag-based genetic regulation broadens our repertoire of techniques for evolving more dynamic genetic programs and can easily be incorporated into existing tag-enabled GP systems. 
    more » « less
  3. ; ; ; ; ; (, Applied Computing and Intelligence)
    Computational tools have been used in structural engineering design for numerous objectives, typically focusing on optimizing a design process. We first provide a detailed literature review for optimizing truss structures with metaheuristic algorithms. Then, we evaluate an effective solution for designing truss structures used in structural engineering through a method called the mountain gazelle optimizer, which is a nature-inspired meta-heuristic algorithm derived from the social behavior of wild mountain gazelles. We use benchmark problems for truss optimization and a penalty method for handling constraints. The performance of the proposed optimization algorithm will be evaluated by solving complex and challenging problems, which are common in structural engineering design. The problems include a high number of locally optimal solutions and a non-convex search space function, as these are considered suitable to evaluate the capabilities of optimization algorithms. This work is the first of its kind, as it examines the performance of the mountain gazelle optimizer applied to the structural engineering design field while assessing its ability to handle such design problems effectively. The results are compared to other optimization algorithms, showing that the mountain gazelle optimizer can provide optimal and efficient design solutions with the lowest possible weight. 
    more » « less
  4. ; ; ; (, Proceedings of Building Simulation 2023: 18th Conference of IBPSA)
    To maximize indoor daylight, design projects commonly use commercial optimization tools to find optimum window configurations. However, experiments show that such tools either fail to find the optimal solution or are very slow to compute in certain conditions.This paper presents a comparative analysis between a gradient-free optimization technique, Covariance Matrix Adaptation Evolution Strategy (CMA-ES), and the widely used Genetic Algorithm (GA)-based tool, Galapagos, to optimize window parameters to improve indoor daylight in six locations across different latitudes. A novel combination of daylight metrics, sDA, and ASE, is proposed for single-objective optimization comparison. Results indicate that GA in Galapagos takes progressively more time to converge, from 11 minutes in southernmost to 11 hours in northernmost latitudes, while runtime for CMA-ES is consistently around 2 hours. On average, CMA-ES is 1.5 times faster than Galapagos, while consistently producing optimal solutions. This paper can help researchers in selecting appropriate optimization algorithms for daylight simulation based on latitudes, runtime, and solution quality. 
    more » « less
  5. ; ; (, Proceedings of the European Wave and Tidal Energy Conference)
    Wave Energy Converters (WEC) are deployed in arrays to improve the overall quality of the delivered power to the grid and reduce the cost of power production by minimizing the cost of design, deployments, mooring, maintenance, and other associated costs. WEC arrays often contain devices of identical dimensions and modes of operation. The devices are deployed in close proximity, usually having destructive inter-device hydrodynamic interactions. However, in this work, we explore optimizing the number of devices in the array and concurrently, the dimensions of the individual devices (heterogeneous) to achieve better performance compared to an array of identical devices (homogeneous) with comparable overall submerged volume. A  techno-economic objective function is formulated to measure the performance of the array while accounting for the volume of material used by the arrays. The power from the array is computed using a time-domain array dynamic model and an optimal constrained control. The hydrodynamic coefficients are computed using a semi-analytical method to enable computationally efficient optimization. The Hidden Gene Genetic Algorithm (HGGA) formulation is used in this optimization problem.  During the optimization, tags are assigned to genes to determine whether they are active or hidden. An active gene simulates an active WEC device in the heterogeneous array, while the hidden gene results in a reduction in the total number of devices in the array compared with the homogeneous array. The volume of the heterogeneous array is constrained to be close to that of the homogeneous array. These hidden tags do not exclude the associated devices from the optimization process; these devices keep evolving with the active devices as they might become active in subsequent generations. Heterogeneous arrays were found to perform better than homogeneous arrays. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email