Topology optimization with efficient rules of cellular automata

被引:10
|
作者
Bochenek, Bogdan [1 ]
Tajs-Zielinska, Katarzyna [1 ]
机构
[1] Cracow Univ Technol, Inst Appl Mech, Krakow, Poland
关键词
Cellular automata; Local rules; Topology optimization; SENSITIVITY-ANALYSIS; DESIGN;
D O I
10.1108/EC-03-2012-0064
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Purpose - Biologically inspired techniques like cellular automata (CA) are gaining nowadays attention of designers. This is because they are effective, do not require gradient information, and one can easily combine this type of algorithm, with any finite element structural analysis code. The purpose of this paper is to develop a CA algorithm based on novel local rules oriented at solving compliance-based topology optimization problems. Design/methodology/approach - The design domain is divided into lattice of cells, states of which are updated synchronously. The proposed rules include information coming from an individual cell and from its neighborhood, and by introducing weighting parameters allow to control and modify topology generation process. Findings - The performance of the developed algorithm is very satisfactory, and a comparison with results of other authors, obtained with the use of various optimization techniques, shows efficiency of the present topology generation process. The results found within approach of this paper are in a good agreement with the ones already reported, both for optimal topologies and values of minimal compliance, which in some cases are found even improved. Practical implications - The algorithm presented in the paper is quite general what allows its easy application to engineering design problems. Moreover, the local update rules are simple, so they can be easily implemented into professional FEM analysis codes, as an efficient add-on module for topology optimization. Originality/value - The main advantage of the developed algorithm is that it is a fast convergent technique and usually requires far less iterations as to achieve the solution, when compared to other approaches. What is also important does not require any additional density filtering. It also overcomes some drawbacks of traditional approaches so that changing mesh density does not influence resulting topologies and solutions are free from checkerboard effect.
引用
收藏
页码:1086 / 1106
页数:21
相关论文
共 50 条
  • [31] Modeling dynamic urban growth using cellular automata and particle swarm optimization rules
    Feng, Yongjiu
    Liu, Yan
    Tong, Xiaohua
    Liu, Miaolong
    Deng, Susu
    LANDSCAPE AND URBAN PLANNING, 2011, 102 (03) : 188 - 196
  • [32] EFFICIENT CHARACTERIZATION OF CELLULAR AUTOMATA
    DAS, AK
    GANGULY, A
    DASGUPTA, A
    BHAWMIK, S
    CHAUDHURI, PP
    IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1990, 137 (01): : 81 - 87
  • [33] An algorithm of finding rules for a class of cellular automata
    Kou, Lei
    Zhang, Fangfang
    Chen, Luobing
    Ke, Wende
    Yuan, Quande
    Wan, Junhe
    Wang, Zhen
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2023, 21 (04) : 189 - 199
  • [34] Determinism in cellular automata - Investigation of transition rules
    Supratid, S
    Sadananda, R
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INTELLIGENT SENSING AND INFORMATION PROCESSING, 2004, : 391 - 396
  • [35] Evolution of Cellular Automata with Conditionally Matching Rules
    Bidlo, Michal
    Vasicek, Zdenek
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 1178 - 1185
  • [36] Discovery of cellular automata rules using cases
    Maeda, K
    Sakama, C
    DISCOVERY SCIENCE, PROCEEDINGS, 2003, 2843 : 360 - 368
  • [37] Cryptographic Properties of Bipermutive Cellular Automata Rules
    Leporati, Alberto
    Mariot, Luca
    JOURNAL OF CELLULAR AUTOMATA, 2014, 9 (5-6) : 437 - 475
  • [38] Classification of the totalistic and the semitotalistic rules of cellular automata
    TanakaYamawaki, M
    Kitamikado, S
    1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 748 - 753
  • [39] A Study on Reversible Rules of Probabilistic Cellular Automata
    Pattanayak, Anupam
    Dhal, Subhasish
    2020 IEEE CALCUTTA CONFERENCE (CALCON), 2020, : 39 - 44
  • [40] Single Parent Generalization of Cellular Automata Rules
    Ashlock, Daniel
    McNicholas, Sharon
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,