Nash evolutionary algorithms : Testing problem size in reconstruction problems in frame structures
Greiner, D., Periaux, J., Emperador, J., Galván, B., & Winter, G. (2016). Nash evolutionary algorithms : Testing problem size in reconstruction problems in frame structures. In M. Papadrakakis, V. Papadopoulos, G. Stefanou, & V. Plevris (Eds.), ECCOMAS Congress 2016 : VII European Congress on Computational Methods in Applied Sciences and Engineering : Proceedings, Volume II (pp. 3493-3504). National Technical University of Athens; ECCOMAS. https://doi.org/10.7712/100016.2050.6785
© the Authors, 2016.
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. ...
PublisherNational Technical University of Athens; ECCOMAS
Parent publication ISBN978-618-82844-0-1
ConferenceEuropean congress on computational methods in applied sciences and engineering
Is part of publicationECCOMAS Congress 2016 : VII European Congress on Computational Methods in Applied Sciences and Engineering : Proceedings, Volume II
Publication in research information system
MetadataShow full item record
Showing items with similar title or keywords.
Distributed multi-objective optimization methods for shape design using evolutionary algorithms and game strategies Leskinen, Jyri (University of Jyväskylä, 2012)
An Interactive Simple Indicator-Based Evolutionary Algorithm (I-SIBEA) for Multiobjective Optimization Problems Chugh, Tinkle; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2015)This paper presents a new preference based interactive evolutionary algorithm (I-SIBEA) for solving multiobjective optimization problems using weighted hypervolume. Here the decision maker iteratively provides her/his ...
Evolutionary design optimization with Nash games and hybridized mesh/meshless methods in computational fluid dynamics Wang, Hong (University of Jyväskylä, 2012)
Käenmäki, Antti; Morris, Ian D. (Wiley-Blackwell Publishing Ltd., 2018)A fundamental problem in the dimension theory of self‐affine sets is the construction of high‐dimensional measures which yield sharp lower bounds for the Hausdorff dimension of the set. A natural strategy for the construction ...
Poikolainen, Ilpo (University of Jyväskylä, 2014)