Discrete Truss Optimization Using Rao Algorithms

Rao algorithms are known as simple, parameter-free metaheuristics that have shown good performance and are quite competitive in solving engineering optimization problems. Although Rao algorithms are quite new, they gain increasing attention from researchers. This paper freshly explores the applicability of Rao algorithms in solving discrete truss optimization problems. Furthermore, a novel adaptive scheme is proposed to balance the global exploration and the local exploitation of these algorithms and a composite Rao algorithm is established. Three benchmark truss structures are used to test the performance of the original and the new algorithms. The effect of the population size, the only required parameter, is investigated, and some remarks are drawn from the numerical results.