Author(s)

R. Bourisli & D.A. Kaminski

Abstract

A Genetic Algorithm with real-coded chromosomes is used to solve a potential flow problem in a contraction channel. A new uniform, successive-refinement strategy is presented wherein the algorithm starts with a coarse solution and works its way through multi-levels of refinements to arbitrary solution resolution. At each level of refinement, a line-by-line sweep-through method is used to obtain incremental solutions for various parts of the flow domain, thus reducing the number of GA constraints. A finite difference grid was used as the objective function to evaluate the fitness of the chromosomes. Results are very promising for five levels of refinements totalling more than 12,000 nodes. Small population sizes were found to be most effective, often yielding solutions in l

Keywords