Based on a sequential word - level fault parallel fs algorithm , we develop a multi - processor fault parallel fs algorithin and a multi - processor pattern parallel fs algorithin 并設計了針對同步時序電路的基于單機字級故障并行fs算法的多機故障并行fs算法和基于確定性算法的多機測試碼并行fs算法。
Emerging in the early 1960s , the genetic algorithm and evolutionary algorithms in general took a place in computer science between deterministic and non - deterministic algorithms 遺傳算法(以及普遍意義上的進化算法)出現(xiàn)在20世紀60年代早期,并在計算機科學的確定性和非確定性算法之間占據(jù)了一席之位。
In this part , another global optimization method , direct is also tested . it is a deterministic method , not as ga , therefore possessing relatively stronger robustness . though the precision of the optimum it finds usually is not high , it has fast convergence rate and is also an appropriate choice for many engineering problems 在此部分還測試了另外一種全局優(yōu)化方法direct ,該方法不同于遺傳算法,是一種確定性算法,有較強的健壯性,雖找到的最優(yōu)解的精度不高,但收斂比較快,對于一般的工程問題也是一種合適的選擇。
Therefore , the original optimization model is transformed into the problem of cross sectional area optimization . this paper had great research on the development of optimization algorithm by analyzing typical optimal search method , such as greedy algorithm , simulated annealing algorithm , neural network and genetic algorithm ( ga ) . according to the characteristics of truss structure , we choose genetic algorithm as the solution way 本文在研究優(yōu)化算法發(fā)展過程的基礎上,分析了典型的優(yōu)化搜索方法:確定性算法如貪婪算法,隨機搜索算法如模擬退火算法,人工智能算法如神經(jīng)網(wǎng)絡及遺傳算法,根據(jù)桁架結(jié)構(gòu)優(yōu)化的特點,最終選擇以遺傳算法作為桁架結(jié)構(gòu)優(yōu)化設計的主要算法。