Genetic and Random Search Methods in Optimal Shape Design Problems

  • Authors:
  • J. Haslinger;D. Jedelský;T. Kozubek;J. Tvrdík

  • Affiliations:
  • KFK MFF UK, Ke Karlovu 5, 121 16 Praha 2, CZ (E-mail: haslin@apollo.karlov.mff.cuni.cz);Institute for Research and Applications of Fuzzy Modelling, University of Ostrava, Bráfova 7, 701 03 Ostrava 1, CZ;Dept. of Computer Science, VSB-Technical Univ., tř. 17. listopadu, 708 33 Ostrava 8, CZ;Dept. of Computer Science, Univ. of Ostrava, Bráfova 7, 701 03 Ostrava 1, CZ

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the application of two global optimization methods, namely of genetic and random search type algorithms in shape optimization. When the so-called fictitious domain approaches are used for the numerical realization of state problems, the resulting minimized function is non-differentiable and stair-wise, in general. Such complicated behaviour excludes the use of classical local methods. Specific modifications of the above-mentioned global methods for our class of problems are described. Numerical results of several model examples computed by different variants of genetic and random search type algorithms are discussed.