Because of descriptive nonlinearity and computational inefficiency,topology optimization with fatigue life under aperiodic loads has developed slowly.A fatigue constraint topology optimization method based on bidirect...Because of descriptive nonlinearity and computational inefficiency,topology optimization with fatigue life under aperiodic loads has developed slowly.A fatigue constraint topology optimization method based on bidirectional evolutionary structural optimization(BESO)under an aperiodic load is proposed in this paper.In viewof the severe nonlinearity of fatigue damagewith respect to design variables,effective stress cycles are extracted through transient dynamic analysis.Based on the Miner cumulative damage theory and life requirements,a fatigue constraint is first quantified and then transformed into a stress problem.Then,a normalized termination criterion is proposed by approximatemaximum stress measured by global stress using a P-normaggregation function.Finally,optimization examples show that the proposed algorithm can not only meet the requirements of fatigue life but also obtain a reasonable configuration.展开更多
The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot sprea...The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot spread uniformly, since the Pareto front shows different features, such as concave and convex. To improve the distribution uniformity of non-dominated solutions, a bidirectional decomposition based approach that constructs two search directions is proposed to provide a uniform distribution no matter what features problems have. Since two populations along two search directions show differently on diversity and convergence, an adaptive neighborhood selection approach is presented to choose suitable parents for the offspring generation. In order to avoid the problem of the shrinking search region caused by the close distance of the ideal and nadir points, a reference point update approach is presented. The performance of the proposed algorithm is validated with four state-of-the-art algorithms. Experimental results demonstrate the superiority of the proposed algorithm on all considered test problems.展开更多
Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has so...Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time.展开更多
To compensate for the imperfection of traditional bi-directional evolutionary structural optimization, material interpolation scheme and sensitivity filter functions are introduced. A suitable filter can overcome the ...To compensate for the imperfection of traditional bi-directional evolutionary structural optimization, material interpolation scheme and sensitivity filter functions are introduced. A suitable filter can overcome the checkerboard and mesh-dependency. And the historical information on accurate elemental sensitivity numbers are used to keep the objective function converging steadily. Apart from rational intervals of the relevant important parameters, the concept of distinguishing between active and non-active elements design is proposed, which can be widely used for improving the function and artistry of structures directly, especially for a one whose accurate size is not given. Furthermore, user-friendly software packages are developed to enhance its accessibility for practicing engineers and architects. And to reduce the time cost for large timeconsuming complex structure optimization, parallel computing is built-in in the MATLAB codes. The program is easy to use for engineers who may not be familiar with either FEA or structure optimization. And developers can make a deep research on the algorithm by changing the MATLAB codes. Several classical examples are given to show that the improved BESO method is superior for its handy and utility computer program software.展开更多
Search-based statistical structural testing(SBSST)is a promising technique that uses automated search to construct input distributions for statistical structural testing.It has been proved that a simple search algorit...Search-based statistical structural testing(SBSST)is a promising technique that uses automated search to construct input distributions for statistical structural testing.It has been proved that a simple search algorithm,for example,the hill-climber is able to optimize an input distribution.However,due to the noisy fitness estimation of the minimum triggering probability among all cover elements(Tri-Low-Bound),the existing approach does not show a satisfactory efficiency.Constructing input distributions to satisfy the Tri-Low-Bound criterion requires an extensive computation time.Tri-Low-Bound is considered a strong criterion,and it is demonstrated to sustain a high fault-detecting ability.This article tries to answer the following question:if we use a relaxed constraint that significantly reduces the time consumption on search,can the optimized input distribution still be effective in faultdetecting ability?In this article,we propose a type of criterion called fairnessenhanced-sum-of-triggering-probability(p-L1-Max).The criterion utilizes the sum of triggering probabilities as the fitness value and leverages a parameter p to adjust the uniformness of test data generation.We conducted extensive experiments to compare the computation time and the fault-detecting ability between the two criteria.The result shows that the 1.0-L1-Max criterion has the highest efficiency,and it is more practical to use than the Tri-Low-Bound criterion.To measure a criterion’s fault-detecting ability,we introduce a definition of expected faults found in the effective test set size region.To measure the effective test set size region,we present a theoretical analysis of the expected faults found with respect to various test set sizes and use the uniform distribution as a baseline to derive the effective test set size region’s definition.展开更多
基金Chinese National Natural Science Foundation(No.51890881)Science and Technology Project of Hebei Education Department(Nos.ZD2020156,QN2018228).
文摘Because of descriptive nonlinearity and computational inefficiency,topology optimization with fatigue life under aperiodic loads has developed slowly.A fatigue constraint topology optimization method based on bidirectional evolutionary structural optimization(BESO)under an aperiodic load is proposed in this paper.In viewof the severe nonlinearity of fatigue damagewith respect to design variables,effective stress cycles are extracted through transient dynamic analysis.Based on the Miner cumulative damage theory and life requirements,a fatigue constraint is first quantified and then transformed into a stress problem.Then,a normalized termination criterion is proposed by approximatemaximum stress measured by global stress using a P-normaggregation function.Finally,optimization examples show that the proposed algorithm can not only meet the requirements of fatigue life but also obtain a reasonable configuration.
文摘The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot spread uniformly, since the Pareto front shows different features, such as concave and convex. To improve the distribution uniformity of non-dominated solutions, a bidirectional decomposition based approach that constructs two search directions is proposed to provide a uniform distribution no matter what features problems have. Since two populations along two search directions show differently on diversity and convergence, an adaptive neighborhood selection approach is presented to choose suitable parents for the offspring generation. In order to avoid the problem of the shrinking search region caused by the close distance of the ideal and nadir points, a reference point update approach is presented. The performance of the proposed algorithm is validated with four state-of-the-art algorithms. Experimental results demonstrate the superiority of the proposed algorithm on all considered test problems.
基金Supported by the National Natural Science Foundation of China(60073043,70071042,60133010)
文摘Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time.
基金supported by the National Natural Science Foundation of China(No.51078311)
文摘To compensate for the imperfection of traditional bi-directional evolutionary structural optimization, material interpolation scheme and sensitivity filter functions are introduced. A suitable filter can overcome the checkerboard and mesh-dependency. And the historical information on accurate elemental sensitivity numbers are used to keep the objective function converging steadily. Apart from rational intervals of the relevant important parameters, the concept of distinguishing between active and non-active elements design is proposed, which can be widely used for improving the function and artistry of structures directly, especially for a one whose accurate size is not given. Furthermore, user-friendly software packages are developed to enhance its accessibility for practicing engineers and architects. And to reduce the time cost for large timeconsuming complex structure optimization, parallel computing is built-in in the MATLAB codes. The program is easy to use for engineers who may not be familiar with either FEA or structure optimization. And developers can make a deep research on the algorithm by changing the MATLAB codes. Several classical examples are given to show that the improved BESO method is superior for its handy and utility computer program software.
基金Publication of this article in an open access journal was funded by the Portland State University Library’s Open Access Fund.
文摘Search-based statistical structural testing(SBSST)is a promising technique that uses automated search to construct input distributions for statistical structural testing.It has been proved that a simple search algorithm,for example,the hill-climber is able to optimize an input distribution.However,due to the noisy fitness estimation of the minimum triggering probability among all cover elements(Tri-Low-Bound),the existing approach does not show a satisfactory efficiency.Constructing input distributions to satisfy the Tri-Low-Bound criterion requires an extensive computation time.Tri-Low-Bound is considered a strong criterion,and it is demonstrated to sustain a high fault-detecting ability.This article tries to answer the following question:if we use a relaxed constraint that significantly reduces the time consumption on search,can the optimized input distribution still be effective in faultdetecting ability?In this article,we propose a type of criterion called fairnessenhanced-sum-of-triggering-probability(p-L1-Max).The criterion utilizes the sum of triggering probabilities as the fitness value and leverages a parameter p to adjust the uniformness of test data generation.We conducted extensive experiments to compare the computation time and the fault-detecting ability between the two criteria.The result shows that the 1.0-L1-Max criterion has the highest efficiency,and it is more practical to use than the Tri-Low-Bound criterion.To measure a criterion’s fault-detecting ability,we introduce a definition of expected faults found in the effective test set size region.To measure the effective test set size region,we present a theoretical analysis of the expected faults found with respect to various test set sizes and use the uniform distribution as a baseline to derive the effective test set size region’s definition.
