scholarly journals Improved genetic algorithm with two-level multipoint approximation for complex frame structural optimization

2020 ◽  
Vol 1509 ◽  
pp. 012017
Author(s):  
Xingyu Ren ◽  
Jiayi Fu ◽  
Hai Huang
2018 ◽  
Vol 73 ◽  
pp. 39-49 ◽  
Author(s):  
Guifang Shao ◽  
Yali Shangguan ◽  
Jiping Tao ◽  
Jiwen Zheng ◽  
Tundong Liu ◽  
...  

2021 ◽  
Vol 12 (1) ◽  
pp. 407
Author(s):  
Tianshan Dong ◽  
Shenyan Chen ◽  
Hai Huang ◽  
Chao Han ◽  
Ziqi Dai ◽  
...  

Truss size and topology optimization problems have recently been solved mainly by many different metaheuristic methods, and these methods usually require a large number of structural analyses due to their mechanism of population evolution. A branched multipoint approximation technique has been introduced to decrease the number of structural analyses by establishing approximate functions instead of the structural analyses in Genetic Algorithm (GA) when GA addresses continuous size variables and discrete topology variables. For large-scale trusses with a large number of design variables, an enormous change in topology variables in the GA causes a loss of approximation accuracy and then makes optimization convergence difficult. In this paper, a technique named the label–clip–splice method is proposed to improve the above hybrid method in regard to the above problem. It reduces the current search domain of GA gradually by clipping and splicing the labeled variables from chromosomes and optimizes the mixed-variables model efficiently with an approximation technique for large-scale trusses. Structural analysis of the proposed method is extremely reduced compared with these single metaheuristic methods. Numerical examples are presented to verify the efficacy and advantages of the proposed technique.


2016 ◽  
Vol 663 ◽  
pp. 466-473 ◽  
Author(s):  
Tun-Dong Liu ◽  
Liang-You Xu ◽  
Gui-Fang Shao ◽  
Na-Na Tu ◽  
Ji-Ping Tao ◽  
...  

Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


Sign in / Sign up

Export Citation Format

Share Document