Seeding the Initial Population With Feasible Solutions in Metaheuristic Optimization of Steel Trusses
Loading...

Date
2018
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Taylor & Francis Ltd
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
In 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.
Description
Kazemzadeh Azad, Saeid/0000-0001-9309-607X
ORCID
Keywords
Discrete optimization, steel trusses, metaheuristic algorithms, big bang-big crunch algorithm, AISC-LRFD
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0201 civil engineering
Citation
WoS Q
Q2
Scopus Q
Q2

OpenCitations Citation Count
53
Source
Engineering Optimization
Volume
50
Issue
1
Start Page
89
End Page
105
PlumX Metrics
Citations
CrossRef : 23
Scopus : 64
Captures
Mendeley Readers : 34
SCOPUS™ Citations
64
checked on Mar 10, 2026
Web of Science™ Citations
60
checked on Mar 10, 2026
Page Views
1
checked on Mar 10, 2026
Google Scholar™


