Global optimization for some engineering problems: dificulties and prospects

Abstract

On the basis of one engineering non-convex optimization problem – optimization of pile placement schemes in grillage type foundations, several global optimization algorithms are compared. Comparison reveals clear advantages of stochastic algorithms, among which the simulated annealing is most promising. The prospects of using simulated annealing on different computer platforms are shown; the largest solved problem contained 55 decision variables.