Parallel Processing in Optimal Structural Design Using Simulated Annealing

The need to reliably solve large structural design optimization problems in a reasonable time frame naturally leads to the investigation of the scope of parallel processing in optimization. Parallel optimization may be approached in two general ways. First, the analysis could be the target of parallel processing specially if it is significantly large compared with the overall computation. The second approach is the parallel implementation of the optimization algorithm, which can then be easily adapted for solving any appropriately formulated optimization problem. In this work the basics of parallel computer architectures and some popular parallelization strategies are described. Simulated annealing (SA), a stochastic, discrete optimization technique, is chosen for its global capability, robustness, and suitability for parallel processing. The concept of "shakeup" in SA, which simulates re-annealing, is introduced. The beneficial effects of shakeup for escaping local optima is demonstrated by solving a two-dimensional multimodal optimization problem. A pin-jointed 10-storied multibay plane truss structure is considered as an example optimization problem and has been solved using both serial as well as parallel versions of the S A algorithm. The parallel result, achieved with a relatively small parallel configuration of the computer, indicates that very large structural designs can be optimized in much shorter times along with high probability of achieving global solutions even on moderately sized parallel computers.

[1]  Bolennarth Svensson,et al.  A substructuring approach to optimum structural design , 1987 .

[2]  Emile H. L. Aarts,et al.  Some miscellaneous topics , 1987 .

[3]  H. H. Müller-Slany Application of Optimization Procedures to Substructure Synthesis , 1991 .

[4]  Hojjat Adeli,et al.  Optimization of large structures on multiprocessor machines , 1990, [1990] Proceedings. Second IEEE Workshop on Future Trends of Distributed Computing Systems.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[7]  Charbel Farhat Which parallel finite element algorithm for which architecture and which problem , 1990 .

[8]  D.B. Davidson,et al.  A parallel processing tutorial , 1990, IEEE Antennas and Propagation Magazine.

[9]  Susann Ragsdale Parallel Programming , 1991 .

[10]  Mohamed El-Sayed,et al.  Optimum structural design with parallel finite element analysis , 1991 .

[11]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[12]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[13]  Jaroslaw Sobieszczanski-Sobieski,et al.  Structural sizing by generalized, multilevel optimization , 1987 .

[14]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[15]  Pierre Roussel-Ragot,et al.  A problem independent parallel implementation of simulated annealing: models and experiments , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..