Using a genetic algorithm to optimize the gape of a snake jaw

  • Authors:
  • C. W. Liew

  • Affiliations:
  • Lafayette College, Easton, PA

  • Venue:
  • Proceedings of the 2004 ACM symposium on Applied computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

GA's have more success with optimizing a single configuration than with optimizing multiple configurations with connectivity constraints tying them together, i.e., variable geometry problems such as designing the variable geometry wings of a plane. This paper describes a GA based approach to solve variable geometry optimization problems where (a) the connectivity requirement cannot be easily specified or tested, (b) the space of configurations is made up of multiple disconnected spaces, thus making it likely that a GA would find sets of configurations that are not connected and (c) the cost of testing for connectivity, while examining each pair of configurations, is prohibitive. The approach has been tested and evaluated on a problem from computational biology, modeling the bones of a snake jaw.