A parallel genetic clustering for inverse problems

  • Telega H 
  • Schaefer R 
  • Cabib E 
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1541)


A parallel global optimization strategy for an ill posed inverse problem in computational mechanics is proposed. It contains a rough recognition of basins of attraction of local minima (clustering) with the use of genetic algorithms. Two levels of parallelism are involved. Basic asymptotic properties of the proposed genetic clustering will be proved. The computational example of the optimal pretractions design in a network structure (hanging roof) will be also shortly described.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Billingsley, P.: Probability and measure. John Wiley & Sons, New York (1979)MATHGoogle Scholar
  2. 2.
    Cabib, E., Davini, C., Chong-Quing Ru: A Problem in the Optimal Design of Networks under Transverse Loading. Quarterly of Appl. Mathematics, Vol. XLVIII, (1990) 252–263Google Scholar
  3. 3.
    Goldberg D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)Google Scholar
  4. 4.
    Horst, Panos M. Pardalos: Handbook of Global Optimization. Kluwer Ac. Publisher (1995)Google Scholar
  5. 5.
    Vose, M.: Modeling Genetic Algorithms with Markov Chains. Annals of Mathematics and Artificial Intelligence, no 5 (1992) 79–88MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Telega H 
    • 1
  • Schaefer R 
    • 1
  • Cabib E 
    • 2
  1. 1.Institute of Computer ScienceJagiellonian UniversityPoland
  2. 2.Department of Civil EngineeringUniversity of UdineItaly

Personalised recommendations