Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/41402
Title: Nash evolutionary algorithms: testing problem size in reconstruction problems in frame structures
Authors: Greiner, D. 
Periaux, Jacques
Emperador Alzola, José María 
Galván, B. 
Winter, G. 
UNESCO Clasification: 1206 Análisis numérico
120601 Construcción de algoritmos
120699 Otras (especificar)
Keywords: Evolutionary algorithms
Frame optimization
Game strategies
Nash equilibrium
Structural design, et al
Issue Date: 2016
Publisher: National Technical University of Athens
Conference: 7th European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS Congress 2016 
Abstract: The use of evolutionary algorithms has been enhanced in recent years for solving real engineering problems, where the requirements of intense computational calculations are needed, especially when computational engineering simulations are involved (use of finite element method, boundary element method, etc). The coupling of game-theory concepts in evolutionary algorithms has been a recent line of research which could enhance the efficiency of the optimum design procedure and the quality of the design solutions achieved. They have been applied in several fields of engineering and sciences, mainly, in aeronautical and structural engineering (e.g: in computational fluid dynamics and solid mechanics problems). Among them, Nash-evolutionary algorithms (Nash-EAs) have been recently applied in the single-objective reconstruction inverse design problem in structural engineering (aiming to obtain the structure whose maximum stresses match those stresses considered as references), with successful speed-up of the structural optimum search. Several test cases of different search space size bar structures are handled here, with bar sized structures up to 105 bar elements. Particularly, frames-bar structures with rigid nodes where bending moment and shear effort should also be taken into consideration- are handled here. Influence of the structural size in the comparative performance of Nash-EAs will be investigated and tested. The performance of Nash-EAs improves significantly the one of the standard panmictic evolutionary algorithms. According to the results shown here, this advantage is greater when the problem size increases.
URI: http://hdl.handle.net/10553/41402
ISBN: 978-618-82844-0-1
DOI: 10.7712/100016.2050.6785
Source: 7th European Congress on Computational Methods in Applied Sciences and Engineering, (ECCOMAS 2016), v. 2, p. 3493-3504, 8 de junio 2016, Chair: 6785. Jorge Magalhaes-Mendes, David Greiner
Appears in Collections:Actas de congresos
Thumbnail
Adobe PDF (3,12 MB)
Show full item record

Page view(s)

107
checked on Jun 10, 2023

Download(s)

93
checked on Jun 10, 2023

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.