CO2 Emission and Cost Optimization of Concrete-Filled Steel Tubular (CFST) Columns Using Metaheuristic Algorithms
Bibliographic record
Abstract
Concrete-filled steel tubular columns have garnered wide interest among researchers due to their favorable structural characteristics. To attain the best possible performance from concrete-filled steel tubular columns while reducing the cost, the use of optimization algorithms is indispensable. In this regard, metaheuristic algorithms are finding increasing application in structural engineering due to their high efficiency. Various equations that predict the ultimate axial load-carrying capacity (Nu) of concrete-filled steel tubular columns are available in design codes as well as in the research literature. However, most of these equations are only applicable within certain parameter ranges. To overcome this limitation, the present study adopts a recently developed set of equations for the prediction of Nu that have broader ranges of applicability. Furthermore, a newly developed metaheuristic algorithm, called the social spider algorithm, is introduced and applied in optimizing the cross-section of circular concrete-filled steel tubular columns. The improvement of the structural dimensioning under the Nu constraint is demonstrated. The objective underlying the optimization presented here is to minimize the CO2 emission and cost associated with the fabrication of concrete-filled steel tubular stub columns. In this context, the relationships between the cross-sectional dimensioning of circular concrete-filled steel tubular columns and the associated CO2 emissions and cost are characterized and visualized.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".