Combining Artificial Neural Network and Seeker Optimization Algorithm for Predicting Compression Capacity of Concrete-Filled Steel Tube Columns
Bibliographic record
Abstract
Accurate and reliable estimation of the axial compression capacity can assist engineers toward an efficient design of circular concrete-filled steel tube (CCFST) columns, which are gaining popularity in diverse structural applications. This study proposes a novel methodology based on computational intelligence for estimating the compression capacity of CCFST. Accordingly, a conventional artificial neural network (ANN) is hybridized with a metaheuristic algorithm called the seeker optimization algorithm (SOA). Utilizing information such as the column’s length, compressive strength of ultra-high-strength concrete, and the diameter, thickness, yield stress, and ultimate stress of the steel tube, the capacity of the column is predicted through non-linear calculations. In addition to the SOA, the future search algorithm (FSA) and social ski driver (SSD) are used as comparative benchmarks. The prediction results showed that the SOA-ANN can learn and predict the compression capacity pattern with high accuracy (relative error < 2.5% and correlation > 0.99). Also, this model outperformed both benchmark hybrids (i.e., FSA-ANN and SSD-ANN). Apart from accuracy, the configuration of the SOA-ANN is simpler owing to the smaller population recruited for the optimization task. An explicit formula for the proposed model is developed, which, owing to its observed efficiency, can be reliably applied to CCFST columns for the early estimation of the compression capacity.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".