A comparison of semi-deterministic and stochastic search techniques

by   Andy M. Connor, et al.

This paper presents an investigation of two search techniques, tabu search (TS) and simulated annealing (SA), to assess their relative merits when applied to engineering design optimisation. Design optimisation problems are generally characterised as having multi-modal search spaces and discontinuities making global optimisation techniques beneficial. Both techniques claim to be capable of locating globally optimum solutions on a range of problems but this capability is derived from different underlying philosophies. While tabu search uses a semi-deterministic approach to escape local optima, simulated annealing uses a complete stochastic approach. The performance of each technique is investigated using a structural optimisation problem. These performances are then compared to each other as and to a steepest descent (SD) method.


page 1

page 2

page 3

page 4


Efficient optimisation of structures using tabu search

This paper presents a novel approach to the optimisation of structures u...

Search Algorithms for Mastermind

his paper presents two novel approaches to solving the classic board gam...

Fractals2019: Combinatorial Optimisation with Dynamic Constraint Annealing

Fractals2019 started as a new experimental entry in the RoboCup Soccer 2...

Sum of Three Cubes via Optimisation

By first solving the equation x^3+y^3+z^3=k with fixed k for z and then ...

Evolutionary Optimisation Methods for Template Based Image Registration

This paper investigates the use of evolutionary optimisation techniques ...

Neural Simulated Annealing

Simulated annealing (SA) is a stochastic global optimisation technique a...