The present paper examines the feasibility of using neural network based function approximations in conjunction with a simulated annealing (SA) strategy for optimization of structural systems. Such a stochastic search method is more “tolerant” of errors in objective and constraint function information than the more traditional mathematical programming techniques. The improved counterpropagation (CP) neural network is used to generate these approximations, and includes features such as dynamic adjustment of the network size, optimization based training of outstar weights, andfuzzification of output. The CP network is easy to train, and preliminary numerical results indicate that the modifications to the network significantly improve the quality of function approximations. The SA based search for optimal designs is illustrated by the sizing of planar and spatial truss structures for minimum weight and constraints on allowable stress levels.
[1]
P. Hajela.
Genetic search - An approach to the nonconvex optimization problem
,
1990
.
[2]
Cecilia R. Aragon,et al.
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
,
1989,
Oper. Res..
[3]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.
[4]
Prabhat Hajela,et al.
Neural network based decomposition in optimal structural synthesis
,
1991
.
[5]
Prabhat Hajela,et al.
Neurobiological computational models in structural analysis and design
,
1991
.
[6]
Scott Kirkpatrick,et al.
Optimization by simulated annealing: Quantitative studies
,
1984
.
[7]
Alistair I. Mees,et al.
Convergence of an annealing algorithm
,
1986,
Math. Program..