arrow
Return

Improved genetic operators for structural engineering optimization

delete1998-08-01
delete63
PRE
AI
L
Leite, JPB
T
Topping, BHV
DOI:10.1016/S0965-9978(98)00021-0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The initial motivation for the development of algorithms inspired by biological principles of evolution was the design and implementation of robust adaptive systems. Among the most utilized of these techniques are the Genetic Algorithms (GAs) which combine principles of population genetics and natural selection. Their growing popularity may be attributed to the ability of GAs as powerful function optimizers of general application to combinatorial problems that have been traditionally difficult to optimize.(1,2) (De Jong, K. A. and Spears, W. M., Using genetic algorithms to solve NP-complete problems. In Proceedings of the Third International Conference on Genetic Algorithms, June 1989, pp. 124-132; Hurley, S., Using Genetic Algorithms Based Search in Optimization. The Institute of Mathematics and its Applications, Vol. 29, March/April 1993, pp. 43-46.) Considerable progress has been made in identifying the limitations of the GAs resulting in a range of approaches and modifications which attempt to improve the efficiency of the GAs as function optimizers. These adaptive approaches in such GA-based optimizers are in general tailored to classes of functions. The engineering optimization problems may be governed by different classes of functions which result in very complex design spaces. In this paper a general purpose optimization technique is investigated, the best of the traditional methods may perform well but only in a narrow class of problems. Revised genetic operators and a new recombination scheme are presented in this paper. These features respectively increase the exploratory power of the GA while simultaneously introducing additional selection pressure to increase the speed of convergence. These features are designed to ensure the balance between effective exploration and selective pressure to exploit the better solutions which are the main power behind the GAs. The gain elf exploratory power not only extends the applicability of the method and improves the quality of the results but also helps prevent premature convergence. On the other hand, selective pressure applied locally may speed up the convergence while still refining the results. Finally, in order to map GAs onto engineering optimization problems, this paper draws some guidelines for handling the constraints using transformation methods. (C) 1998 Elsevier Science Limited and Civil-Comp Limited. All rights reserved.
Keywords:
STACKING-SEQUENCE
OPTIMAL-DESIGN
ALGORITHMS
SEARCH
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Advances in Engineering Software cover
Advances in Engineering Software
IF:
5.7
Papers:
3.3K
Citations:
1.2W

Organization

No organization information available
Cited Papers

Cited Papers

Interpersonal synchrony across vocal and lexical modalities in interactions involving children with autism spectrum disorder
err2022-09-08
err0
errOAAI
errRimita Lahiri; Md Nasir; Manoj Kumar; So Hyun Kim; Somer Bishop; Catherine Lord; Shrikanth Narayanan
errShare
errSave
A Qualitative Study of Intimate Partner Femicide and Orphans in Cyprus
err2017-07-31
err0
errOAAI
errAndreas Kapardis; Anna Costanza Baldry; Maria Konstantinou
errShare
errSave
errShare
errSave
Effect of Soiling on Power Output of a Photovoltaic System
err2020-02-22
err0
PREAI
errSonali Goel; Sobhit Panda; Nallapaneni Manoj Kumar; Renu Sharma
errShare
errSave
All day-long: Sticklebacks effectively forage on whitefish eggs during all light conditions
err2021-08-02
err0
errOAAI
errJan Baer; Sarah Maria Gugele; Joachim Bretzel; J. Tyrell DeWeber; Alexander Brinker
errShare
errSave
researcher View more