{'fraction_non_alphanumeric': 0.016055045871559634, 'fraction_numerical': 0.0030581039755351682, 'mean_word_length': 5.712820512820513, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Parallel computational strategies for structural optimization

The objective of this paper is to investigate the efficiency of various computational algorithms implemented in the framework of structural optimization methods based on evolutionary algorithms. In particular, the efficiency of parallel computational strategies is examined with reference to evolution strategies (ES) and genetic algorithms (GA). Parallel strategies are implemented both at the level of the optimization algorithm, by exploiting the natural parallelization features of the evolutionary algorithms, as well as at the level of the repeated structural analysis problems that are required by ES and GA. In the latter case the finite element solutions are performed by the FETI domain decomposition method specially tailored to the particular type of problems at hand. The proposed methodology is generic and can be applied to all types of optimization problems as long as they involve large‐scale finite element simulations. The numerical tests of the present study are performed on sizing optimization of skeletal structures. The numerical tests demonstrate the computational advantages of the proposed parallel strategies, which become more pronounced in large‐scale optimization problems. Copyright © 2003 John Wiley & Sons, Ltd.