Azad, Saeıd KazemzadehAzad, Saeid KazemzadehDepartment of Civil Engineering2024-07-052024-07-052018530305-215X1029-027310.1080/0305215X.2017.12848332-s2.0-85012108449https://doi.org/10.1080/0305215X.2017.1284833https://hdl.handle.net/20.500.14411/3024Kazemzadeh Azad, Saeid/0000-0001-9309-607XIn spite of considerable research work on the development of efficient algorithms for discrete sizing optimization of steel truss structures, only a few studies have addressed non-algorithmic issues affecting the general performance of algorithms. For instance, an important question is whether starting the design optimization from a feasible solution is fruitful or not. This study is an attempt to investigate the effect of seeding the initial population with feasible solutions on the general performance of metaheuristic techniques. To this end, the sensitivity of recently proposed metaheuristic algorithms to the feasibility of initial candidate designs is evaluated through practical discrete sizing of real-size steel truss structures. The numerical experiments indicate that seeding the initial population with feasible solutions can improve the computational efficiency of metaheuristic structural optimization algorithms, especially in the early stages of the optimization. This paves the way for efficient metaheuristic optimization of large-scale structural systems.eninfo:eu-repo/semantics/closedAccessDiscrete optimizationsteel trussesmetaheuristic algorithmsbig bang-big crunch algorithmAISC-LRFDArticleQ2Q250189105WOS:000423744400006