Finding reasonably good solutions using a fewer number of objective function evaluations has long been recognized as a good attribute of an optimization algorithm. This becomes more important, especially when dealing with very high-dimensional optimization problems, since contemporary algorithms often need a high number of iterations to converge. Furthermore, the excessive computational effort required to handle the large number of design variables involved in the optimization of large-scale steel double-layer grids with complex configurations is perceived as the main challenge for contemporary structural optimization techniques. This paper aims to enhance the convergence properties of the standard guided stochastic search (GSS) algorithm to handle computationally expensive and very high-dimensional optimization problems of steel double-layer grids. To this end, a repair deceleration mechanism (RDM) is proposed, and its efficiency is evaluated through challenging test examples of steel double-layer grids. First, parameter tuning based on rigorous analyses of two preliminary test instances is performed. Next, the usefulness of the proposed RDM is further investigated through two very high-dimensional instances of steel double-layer grids, namely a 21,212-member free-form double-layer grid, and a 25,514-member double-layer multi-dome, with 21,212 and 25,514 design variables, respectively. The obtained numerical results indicate that the proposed RDM can significantly enhance the convergence rate of the GSS algorithm, rendering it an efficient tool to handle very high-dimensional sizing optimization problems.