Efficient optimisation of structures using tabu search

by   Andy M. Connor, et al.

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.



page 1

page 2

page 3

page 4


A comparison of semi-deterministic and stochastic search techniques

This paper presents an investigation of two search techniques, tabu sear...

An efficient implementation of mass conserving characteristic-based schemes in 2D and 3D

In this paper, we develop the ball-approximated characteristics (B-char)...

Minimal Conditions for Beneficial Local Search

This paper investigates why it is beneficial, when solving a problem, to...

GOGMA: Globally-Optimal Gaussian Mixture Alignment

Gaussian mixture alignment is a family of approaches that are frequently...

Convex Optimisation for Inverse Kinematics

We consider the problem of inverse kinematics (IK), where one wants to f...

Search Algorithms for Mastermind

his paper presents two novel approaches to solving the classic board gam...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.