基于禁忌搜索的结构优化
Efficient optimisation of structures using tabu search
摘要：
本文提出了一种新的方法来优化的结构，使用禁忌搜索（TS）方法。TS是一种元启发式算法，它通过使用不同时间跨度的灵活内存周期来引导局部搜索方法走向全局最优解。结果是建立良好的十杆桁架问题，并发表在文献中的结果进行比较。在第一示例中，桁架被优化以最小化质量，并且结果与使用替代TS实现获得的结果进行比较。在第二个例子中，该问题有多个目标，这些目标使用博弈论复合成单个目标函数值。在一般情况下，结果表明，TS方法是能够解决结构优化问题，至少有效地作为其他数值优化方法。
英文摘要：
This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method. TS is a metaheuristic which is used to guide local search methods towards a globally optimal solution by using flexible memory cycles of differing time spans. Results are presented for the well established ten bar truss problem and compared to results published in the literature. In the first example a truss is optimised to minimise mass and the results compared to results obtained using an alternative TS implementation. In the second example, the problem has multiple objectives that are compounded into a single objective function value using game theory. In general the results demonstrate that the TS method is capable of solving structural optimisation problems at least as efficiently as other numerical optimisation approaches.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
