锦标赛选拔
渡线
数学优化
模拟退火
遗传算法
收敛速度
地铁列车时刻表
帕累托原理
适应度函数
元优化
算法
人口
选择(遗传算法)
最优化问题
计算机科学
工程类
数学
人工智能
计算机网络
频道(广播)
社会学
人口学
操作系统
作者
Tony Kanjirath,Ekambaram Thirupalli
标识
DOI:10.1080/15376494.2018.1516253
摘要
Genetic algorithm (GA)-based optimization is a common approach to deal with problems that have a large solution space. Composite laminate design is one such problem due to the substantial number of candidates that arise from the selection and stacking of lamina. Many authors have successfully demonstrated GA-based approach in stacking sequence optimization. A few of them extending it to as far as selecting the candidate lamina for the candidate laminate. However, a vast majority of the literature is limited to optimizing a single parameter such as Margin of Safety, Buckling Load Factor, etc., while neglecting other parameters or assigning ill-suited weights to obtain a unified fitness function. In this paper, we will be discussing a novel Elite–Scout Genetic Algorithm (ESGA) for multi-objective optimization which will result in the Pareto-optimal solution(s). The algorithm is based on the first multiple elitist selection method, integrated with the concept of a scout operator. ESGA incorporates a population dependent growing crossover rate, and decaying mutation rate. The growth and decay are modeled along the lines of the cooling schedule as found in simulated annealing (SA). This will ensure greater flexibility of the algorithm by accommodating better exploration of the solution space without deterring the convergence of the solution.
科研通智能强力驱动
Strongly Powered by AbleSci AI