Parallel simulated annealing for structural optimization

The simulated annealing (SA) algorithm has proven to be a good technique fo r solving difficult combinatorial optimization problems. In engineering opt imization the SA has emerged as an alternative tool to solve problems which are difficult to solve by conventional mathematical programming techniques . The algorithm's major disadvantage is that solving a complex system may b e an extremely slow; convergence process, using much more processor time th an some conventional algorithms. Consequently, simulated annealing has not been widely accepted as an optimization algorithm for engineering problems. Attempts have been made to improve the performance of the algorithm either by reducing the annealing length or changing the generation and the accept ance mechanisms. However, these faster schemes, in general, do not inherit the SA properties of escaping from local minima. A more efficient way to re duce the processor time and make the SA a more attractive solution for engi neering problems is to add parallelism. However, the implementation and eff iciency of parallel SA models are in general problem dependent. Thus, this paper considers the evaluation of parallel schemes for engineering problems where the solution spaces may be very complex and highly constrained and f unction evaluations vary from medium to high cost. In addition, this paper provides guidelines for the selection of appropriate schemes for engineerin g problems. An engineering problem with relatively low fitness evaluation c ost and strong time constraint was used to demonstrate the lower bounds of applicability of parallel schemes. (C) 1999 Civil-Comp Ltd and Elsevier Sci ence Ltd. All rights reserved.