<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Constraint-Aware Entropy-Adaptive Swarm Search for Civil Infrastructure Sizing: Formulation and Reported Benchmark Evidence</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Hassan M.</surname><given-names>Khan</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>El-Sayed</surname><given-names>Ahmed M.</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<contrib contrib-type="author"><name><surname>Boutros</surname><given-names>Rania</given-names></name><xref ref-type="aff" rid="aff3"/></contrib>
<contrib contrib-type="author"><name><surname>Lewandowski</surname><given-names>Tomasz</given-names></name><xref ref-type="aff" rid="aff4"/></contrib>
<aff id="aff1">Department of Civil Engineering, NED University of Engineering &amp; Technology, Karachi, Pakistan.</aff>
<aff id="aff2">Department of Structural Engineering, Ain Shams University, Cairo, Egypt.</aff>
<aff id="aff3">Department of Civil and Environmental Engineering, University of Auckland, Auckland, New Zealand.</aff>
<aff id="aff4">Department of Civil Engineering, Wroclaw University of Science and Technology, Wroclaw, Poland.</aff>
</contrib-group>
<abstract><p>SI-CASS is a proposed population-search framework for civil sizing that combines an operator portfolio, structural-response-based repair and entropy-triggered reinjection. The formulation distinguishes simplified optimization constraints from the complete checks required by a project design code. Repair is a local heuristic followed by structural reevaluation; neither catalog rounding nor area scaling guarantees feasibility or code certification. A conditional coverage argument describes requirements for an infinite search extension, while the specified finite-budget process has no established global convergence rate. Reported summaries from six problems and 30 runs retain the original numerical observations, including a 25-bar-truss mean of 247.1 versus 252.4 for SHADE and 263.5 for PSO. The underlying models, units, implementation and run-level outputs are unavailable, and inconsistencies among the tables, statistical adjustments and figures prevent verification of significance and causal component effects. The contribution is the stated search architecture and an explicit account of the evidence needed to assess it. The reported designs are not certified engineering deliverables.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Structural sizing</kwd><kwd>Adaptive operator selection</kwd><kwd>Constraint handling</kwd><kwd>Population entropy</kwd><kwd>Evaluation</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1">
<p>accounting, Reproducibility.</p>
</sec>
<sec id="sec-2"><label>1</label><title>Introduction</title>
<p>Structural sizing combines objective reduction with checks on load effects, resistance, displacement and constructability. Its formulation depends on the material, geometry, load combinations and whether design variables are continuous or selected from a catalog. A population method can explore such domains without objective derivatives, but its usefulness depends on a defined structural model and a reliable treatment of infeasibility.</p>
<p>Structural-Integrity-Constrained Adaptive Swarm Search (SI-CASS) proposes a four-operator portfolio, a response-based repair heuristic and diversity-triggered reinjection. The operators are selected through credit-dependent probabilities. Repair aims to reduce violations, but every repaired and catalog-rounded candidate must be reevaluated. A final pass–fail report for specified model checks would support traceability; it would not by itself certify compliance with every provision of a design code.</p>
<p>The manuscript sets out the intended sizing model, proposal components, credit and entropy mechanisms and computational accounting. Six-problem numerical summaries are retained as source-reported observations. Their model and experimental identity are not independently reconstructable from this document. Consequently, comparisons are descriptive, inferential claims are unresolved, and no general feasibility, code-compliance or convergence certificate is established.</p>
<p>Section 2 discusses methodological background. Section 3 separates simplified sizing constraints from code-based design requirements. Section 4 presents the intended search components and analytical limits. Sections 5 and 6 document the reported protocol and its numerical evidence. Sections 7–9 discuss implications, limitations and future work.</p>
</sec>
<sec id="sec-3"><label>2</label><title>Background and Related Work</title>
<p>Sizing may minimize weight, volume or cost subject to response and resistance checks. These are different objectives, and comparisons require common equations and units. Avcı et al. <xref ref-type="bibr" rid="ref-1">[1]</xref> study ISRES for sizing and layout of several truss benchmarks, while Mehta et al. <xref ref-type="bibr" rid="ref-2">[2]</xref> examine a two-archive multi-objective crystal-structure method for truss mass and displacement. Neither study defines or validates the six instances reported here. A simplified benchmark feasible set must be distinguished from complete project-specific structural design.</p>
<p>Adaptive search operates at different levels. SHADE uses histories of successful differential-evolution parameters <xref ref-type="bibr" rid="ref-3">[3]</xref>, and CMA-ES adapts a sampling distribution <xref ref-type="bibr" rid="ref-4">[4]</xref>. The four SI-CASS branches instead form an intended portfolio drawn from DE <xref ref-type="bibr" rid="ref-5">[5]</xref>, PSO <xref ref-type="bibr" rid="ref-6">[6]</xref>, GWO <xref ref-type="bibr" rid="ref-7">[7]</xref> and long-range perturbation <xref ref-type="bibr" rid="ref-8">[8]</xref>. Their use does not establish superiority over fixed or adaptive alternatives; the implemented branch rules and computational costs must be specified and tested.</p>
<p>Penalty, feasibility-ranking, relaxed-feasibility and repair approaches represent different ways to handle constraints <xref ref-type="bibr" rid="ref-9">[9–11]</xref>. A repair may improve a violated design without finding a feasible point. Reusing finite-difference sensitivities can reduce repeated cost but may reduce their accuracy after section changes. The proposed hybrid uses a penalty to compare infeasible candidates and structural-response adjustments before acceptance; an explicit ordering of feasible and infeasible candidates is still required.</p>
<p>When search is coupled to finite-element analysis, expensive solver calls may dominate the proposal operations. Structural optimization has also been coupled to neural models <xref ref-type="bibr" rid="ref-12">[12]</xref>. FEM and metaheuristic search also serve inverse damage identification: Ton-That uses GA and PSO to minimize a natural-frequency discrepancy over element stiffness reductions <xref ref-type="bibr" rid="ref-13">[13]</xref>. That inverse problem differs from forward section sizing and does not establish design-code compliance. A surrogate can screen candidates, but feasibility and final objectives require checks with the designated true model. The reported SI-CASS-K variant uses Kriging; its training data, screening, model updates and actual solver-call savings are not supplied, so no measured efficiency conclusion is established.</p>
<p>Deterministic resistance constraints and reliability-based constraints answer different questions. The proposed formulation does not define random loads or resistance distributions, failure events or a reliability estimator. It is therefore not a reliability-based design optimizer. A future reliability extension would require a new model and validation, not merely a different repair label.</p>
<p><xref ref-type="table" rid="tab1">Table 1</xref> preserves a reported qualitative positioning matrix. Its broad categorical comparisons are not supported by a systematic survey, and its positive convergence and certification entries for SI-CASS are not established by the analysis below. The framework is a candidate approach for evaluation, rather than a replacement for verified design procedures.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Retained source-reported positioning matrix.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:2:66,566.4,537.1,694.6"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>“Convergence proof” and “Code-compliance cert.” entries are unverified claims, not demonstrated properties. An engineering workflow needs reproducible design variables, analysis assumptions, objective units, load combinations, resistance checks and final constraint ratios. A search method may provide candidate designs, but their acceptance requires the applicable project code, complete structural evaluation and responsible engineering review. The supplied manuscript contains no final design vectors or constraint-ratio certificate.</p>
</sec>
<sec id="sec-4"><label>3</label><title>Problem Formulation</title>
<p>For a truss with fixed member lengths L_i and cross-sectional areas x_i, f(x)=Σ_i L_i x_i is volume. With lengths in metres and areas in square metres it has units m³; material density would be needed for weight. An area-only objective does not define a reinforced-concrete column or retaining wall unless their geometry and material quantities are separately mapped to the design vector. Cost-based welded-beam and pressure-vessel objectives also need their own equations and units.</p>
<p>Illustrative truss model: minimize f(x)=Σ_i L_i x_i, subject to normalized checks g_j(x)≤0 and x_i^LB≤x_i≤x_i^UB. If a symmetric allowable-stress benchmark is intended, its check is |σ_ik(x)|/σ_allow, ik−1≤0 for every member and load case. Displacement checks use |δ_j(x)|/δ_allow, j−1≤0. Member slenderness uses λ_i=L_b,i/r_i(x) and a specified λ_max,i. These expressions define simplified benchmark checks; material and code-specific resistance must be evaluated separately.</p>
<p>The absolute stress value covers tension and compression in a symmetric allowable-stress benchmark; an unsigned inequality σ≤φσ_y would fail to limit large compression. Actual tensile yielding, net-section rupture, compression buckling and combined actions require distinct resistance definitions. The originally stated φ=0.90 steel-yielding and φ=0.85 concrete-compression choices do not establish a general code model: 0.85 is not a universal ACI compression strength-reduction factor. The original implementation and material-specific factors must be checked. Linear-elastic response is an intended assumption for the trusses, not evidence of validity for nonlinear materials, instability or every other reported instance.</p>
<p>ANSI/AISC 360-22 is the Specification for Structural Steel Buildings and includes LRFD and ASD formats <xref ref-type="bibr" rid="ref-14">[14]</xref>. An LRFD check compares factored demand with φR_n for a particular limit state. Factors and resistances depend on that state; one generic stress envelope cannot cover yielding, rupture, shear and member stability. The reported eight load combinations, including examples 1.4D, 1.2D+1.6L+0.5(L_r or S or R), and 1.2D+1.0W+L+0.5(L_r or S or R), need their exact adopted load standard, edition and implementation. The governing combination is the one with the largest relevant demand-to-capacity ratio; it cannot be feasible while another evaluated combination violates that same check.</p>
<p>The Eurocode resistance format is R_d=R_k/γ_M, with partial factors and combinations tied to the adopted edition and national annex <xref ref-type="bibr" rid="ref-15">[15]</xref>, <xref ref-type="bibr" rid="ref-16">[16]</xref>. The originally reported γ_M0=1.00, γ_M1=1.00 and γ_M2=1.25 are not universal project values. A repair factor must be dimensionless: Use a demand/resistance ratio when both have force units, or a stress/allowable-stress ratio when both have stress units. The originally stated γ_Mσ/R_k mixes units if R_k is member resistance. No nationally adopted complete Eurocode check set is supplied.</p>
<p>ACI 318-19 provides structural-concrete design requirements <xref ref-type="bibr" rid="ref-17">[17]</xref>. Its strength-reduction factor depends on limit state, confinement and strain classification; an RC axial–flexural interaction envelope additionally needs section geometry, concrete and reinforcement properties, strain compatibility and detailing checks. The reported φ=0.90 flexural, φ=0.75 shear/torsion and φ=0.65 bearing examples and the stated 0.65–0.90 range do not define all column states. Increasing reinforcement can change stiffness, capacity and detailing, so every affected check must be recomputed. The implemented interaction diagrams and load combinations are not available.</p>
<p>The reported penalty is F(x;λ_t)=f(x)+λ_t Σ_j max(0,g_j(x))², with λ_t=λ0(1+t/T)^γ and γ∈[0.5,1.5]. Dimensionless violations permit λ_t to carry the objective’s units; mixing unscaled stress, displacement and slenderness would make the sum unit-dependent. The finite schedule is bounded by λ0·2^γ and does not ensure feasibility. Catalog selection after repair may reintroduce violations. Nearest selection from a sorted finite catalog is not non-expansive: the catalog {1,2} maps 1.49 and 1.51 to 1 and 2, increasing their separation from 0.02 to 1.</p>
</sec>
<sec id="sec-5"><label>4</label><title>Proposed Approach</title>
<p>The intended cycle evaluates structural responses, computes violations, updates operator credits and population entropy, generates new candidates and attempts repair. Acceptance and best-state storage must apply one explicit feasibility ordering and a common current penalty if penalties change. An adaptive mixing parameter α_t is mentioned in the source but has no defined update or role. <xref ref-type="fig" rid="fig1">Fig. 1</xref> is a schematic of the intended components, not evidence that their implementation emits a certified design.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>Retained architecture schematic.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/119/fig-1-93b5690c65a6.png"/></fig>
<p>Repair and the pictured “compliance certificate” are intended workflow components; feasibility and complete project-code certification are not demonstrated. The DE branch reports v_i=x_r1+F(x_r2−x_r3), with F∈[0.4,0.9] and distinct indices excluding i; the crossover or direct-replacement convention is unspecified <xref ref-type="bibr" rid="ref-5">[5]</xref>. The PSO branch reports v_i←ω_t v_i+c1 r1(p_i−x_i)+c2 r2(g−x_i), followed by a position update, with c1=c2=1.496 and ω_t=0.4+0.5/(1+t/50) <xref ref-type="bibr" rid="ref-6">[6]</xref>. This approaches 0.4 asymptotically rather than reaching it at a finite horizon. The GWO-labelled branch reports x_i←(x_α+x_β+x_δ)/3−A|C x_p−x_i|, A=2ar−a, C=2r and a decreasing from 2 to 0 <xref ref-type="bibr" rid="ref-18">[18]</xref>, x_p and the required random draws are undefined, and this is not the standard three-leader distance update. The perturbation branch reports x_i←x_i+s·Levy(β=1.5), with range-scaled s and a reported Mantegna sampler. Heavy-tailed proposals occur in cuckoo-search literature <xref ref-type="bibr" rid="ref-8">[8]</xref>, but that citation does not identify the executed SI-CASS sampler. Its vector sampling and boundary rule require confirmation. The reported formulas are preserved as definitions to complete, not silently equated with executed standard algorithms.</p>
<p>The reported credit rule is Q_k(t+1)=(1−ρ)Q_k(t)+ρΔ_k(t), ρ∈(0,1], with probabilities π_t(k)=exp(ηQ_k)/Σ_l exp(ηQ_l). The normalized improvement Δ_k, averaging over assigned particles and updates of unused operators are unspecified. Here η is inverse temperature: increasing it sharpens preference for higher credits, and does not encourage under-used branches. Entropy H_t=−Σ_b p_b log p_b requires fixed histogram bounds, bins and a definition of coordinate aggregation; pooling areas across coordinates may miss concentration in the joint design distribution. If H_t&lt;H_*, the intended rule reinjects κ∈[0.05,0.10] of the population. Uniform random and Latin-hypercube reinjection are both described in the source, so the executed sampler, credit reset and rounding of κN require confirmation.</p>
<p>The proposed repair is a local heuristic, not a demonstrated Euclidean projection onto a nonconvex feasible manifold. Area scaling by a stress ratio assumes the member force remains fixed. In indeterminate structures, stiffness changes redistribute forces and displacements, so the full structure must be reanalyzed. Displacement corrections use central finite differences and a least-squares sensitivity step, with a reported Jacobian reuse interval τ_J=5; constraints may remain violated after such a step. Radius of gyration depends on the selected section, so area alone does not define slenderness repair. RC reinforcement adjustment requires recomputation of the coupled axial–flexural and detailing checks. Bounds, catalog choices, failed repair and any stopping limit must be specified, and candidates failing final reevaluation must not enter a feasible elite archive.</p>
<p>Let m_FE,t count every actual structural solve at iteration t, including repair reevaluation and finite-difference probes. A conditional cost expression is O(N(n+K)+m_FE,t c_FE+C_repair,t), with additional matrix and storage costs determined by the solver and sensitivity routine. Central finite differences can require about 2n probes per sensitivity refresh for one candidate, so repair is not automatically O(n) or negligible. A measured dominance of FE cost by two to three orders of magnitude is not established by timings. Compactness, bounded fitness, positive operator selection and non-expansive repair would not alone establish global coverage; the catalog operation also contradicts the stated non-expansiveness premise. For one fixed original objective f on a nonempty feasible domain X_F, define the finite infimum f*=inf_{x∈X_F} f(x). If every exactly evaluated proposal has conditional probability at least q_ε&gt;0 of entering {x∈X_F:f(x)≤f*+ε}, retaining the best among exactly evaluated feasible candidates gives Pr(no hit in m proposals)≤(1−q_ε)^m. That is a conditional coverage argument for a specified process; spatial coverage and an unbounded extension are not established here. The reported Hoeffding fitness-gap bound and global convergence theorem are unsupported.</p>
<p>The reported initialization is a Latin-hypercube sample of N=50 points within side bounds, with zero operator credits and stored initial bests. Side-bound sampling need not satisfy structural constraints. Termination uses an evaluation budget or relative improvement tolerance ε_stop=10^−4 for L_stop=25 generations. The denominator for relative improvement and all evaluation counters must be specified. The report that the budget criterion always triggered cannot be verified without logs.</p>
</sec>
<sec id="sec-6"><label>5</label><title>Experimental Setup</title>
<p>The reported suite names a 25-bar space truss with 25 variables, 10 load cases and ±275.8 MPa stress limits; a 72-bar truss with 16 sizing groups and ±172.4 MPa limits; welded beam; pressure vessel; an RC column with axial load and biaxial bending; and a gravity retaining wall with sliding, overturning and bearing constraints. Geometry, loads, supports, materials, catalogs, objective units and feasibility tolerances are not supplied. OpenSeesPy is named for the trusses and custom section routines for the column and wall, so a shared complete FE model for all six cases is not established. Published truss studies <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref> cannot substitute for these missing instance definitions.</p>
<p>The reported baselines are GA <xref ref-type="bibr" rid="ref-19">[19]</xref>, PSO <xref ref-type="bibr" rid="ref-6">[6]</xref>, DE <xref ref-type="bibr" rid="ref-5">[5]</xref>, GWO <xref ref-type="bibr" rid="ref-7">[7]</xref>, SHADE <xref ref-type="bibr" rid="ref-3">[3]</xref>, CMA-ES <xref ref-type="bibr" rid="ref-4">[4]</xref> and SQP with ten starting points. Counting an SQP restart as one optimization is not evaluation-budget matching: Every objective, constraint and finite-difference call across all starts must be counted. A smooth relaxation of a discrete catalog also solves a different domain unless final catalog feasibility is checked. The stated common interface and budgets require implementation evidence.</p>
<p>The source reports 30 runs per method and problem with matched seeds, a budget of 2×10^4 FE evaluations and N=50, and hardware shown in <xref ref-type="table" rid="tab6">Table 6</xref>. The number of generations depends on whether initialization, unrepaired and repaired candidates and sensitivity probes are charged. A nominal 200 generations cannot be inferred from these values alone. The matrix 8 algorithms×6 problems×30 runs equals 1440 runs; the reported 1180 CPU-hours and 32-worker execution need timing and resource definitions. Matching seeds supports a reproducible randomization design, but does not establish statistical pairing or independence by itself.</p>
</sec>
<sec id="sec-7"><label>6</label><title>Results and Statistical Analysis</title>
<p><xref ref-type="fig" rid="fig2">Fig. 2</xref> retains source-reported convergence curves and bands. Its horizontal axis extends to 100k FE evaluations, whereas the stated campaign budget is 20k. Several curves cross below the line labelled “known optimum 247.1 m³” and leave the visible y-range. The plot cannot establish that its curves are feasible objectives from the stated campaign or that 247.1 is a proven optimum. Reported observations of SQP=252.6, a 2.2% reduction by iteration 320, IQR≤1.5 after iteration 100 and GA IQR≥6.0 require the original traces and their units. The axis is linear in the displayed volume, despite the source description of a logarithmic fitness axis.</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Retained reported 25-bar convergence illustration.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/119/fig-2-1014682db4f9.png"/></fig>
<p>The 100k FE axis, below-reference curves and “known optimum” annotation conflict with the stated 20k campaign and unresolved feasibility; the panel is not validated convergence evidence. <xref ref-type="fig" rid="fig3">Fig. 3</xref> annotates reinjection at generations 60, 130 and 200 and a threshold H_*=0.9 nats. Its SI-CASS trajectory stays roughly between 1.3 and 1.9 nats, above that threshold, so the displayed pre-event values do not verify the stated trigger. The source reports κ=0.07 and a roughly 30-generation credit-reset window, but actual histogram observations, controller inputs, replacement indices and credits are missing. No causal diversity-preservation conclusion follows from this panel.</p>
<fig id="fig3"><label>Figure 3</label><caption><p>Retained reported entropy trajectories and annotated events at 60, 130 and 200.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/119/fig-3-ea83a03b006e.png"/></fig>
<p>SI-CASS remains above the 0.9-nat threshold in the plotted trace; original controller logs are needed to reconcile the annotations.From the printed means in <xref ref-type="table" rid="tab2">Table 2</xref>, SI-CASS has the smallest value on five of six problems, while SQP has the smallest retaining-wall value. This descriptive count differs from the source claim of four wins and from <xref ref-type="fig" rid="fig4">Fig. 4</xref>, which places SI-CASS second on welded beam and pressure vessel and third on retaining wall. Within one standard deviation is not a test of equivalence. The displayed outcomes use heterogeneous unresolved objective units, so no pooled physical-volume comparison is appropriate. Objective equations, units, feasibility and run-level provenance are unresolved. The bottom “Mean rank” row has entries under problem columns and is not a valid vector of eight algorithm mean ranks.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Source-reported final-objective means and standard deviations, described as 30-run summaries.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,155.2,537.1,294.8"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig4"><label>Figure 4</label><caption><p>Retained reported rank heatmap.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/119/fig-4-d273690ee657.png"/></fig>
<p>Several cells disagree with ranking the printed <xref ref-type="table" rid="tab2">Table 2</xref> means; the panel and table cannot jointly establish an inferential ranking. <xref ref-type="table" rid="tab3">Table 3</xref> retains seven reported raw p-values, adjusted p-values and rank-biserial effects. Its adjustment is not the Holm step-down transformation of the displayed seven raw values. Applying only that transformation gives adjusted values 0.0068 (SHADE), 0.0048 (CMA-ES), 0.0045 (GWO), 0.0024 (PSO), 0.0014 (GA), 0.0048 (DE) and 0.0068 (SQP). This is an arithmetic check, not validation of the raw tests or evidence of significance. The experimental unit is unspecified: six paired problem summaries, 30 paired runs on one problem and pooled heterogeneous outcomes are different designs. For six nonzero pairs, an exact two-sided signed-rank test has minimum p=0.03125, incompatible with the displayed values. Test implementation, pairing, ties and aggregation must be identified <xref ref-type="bibr" rid="ref-20">[20]</xref>, <xref ref-type="bibr" rid="ref-21">[21]</xref>.</p>
<table-wrap id="tab3"><label>Table 3</label><caption><p>Source-reported comparison statistics.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:7:66,239,537.1,344.8"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>All numerical cells are preserved; the printed “Holm-adj.” values do not equal the adjustment of the displayed raw values. The source reports Friedman χ²=38.2, p&lt;0.001, k=8, N=6 and Nemenyi CD=1.83. Original rank blocks are not supplied, and the table and heatmap are inconsistent. Under the conventional Nemenyi formulation CD=q_α√[k(k+1)/(6N)], k=8 and N=6 give about 4.29 at α=0.05, not 1.83 <xref ref-type="bibr" rid="ref-20">[20]</xref>. Mean ranks 1.50, 1.83 and 4.17 in the source diagram are therefore retained as unresolved reported quantities. Non-significance does not establish equivalence, and the panel does not justify separating the first two algorithms from all remaining methods.</p>
<fig id="fig5"><label>Figure 5</label><caption><p>Retained reported critical-difference illustration.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/119/fig-5-4cc28522c2b5.png"/></fig>
<p>Rank provenance and CD=1.83 are unresolved and inconsistent with the stated conventional k=8, N=6 analysis; its brackets are not established significance groups.<xref ref-type="table" rid="tab4">Table 4</xref> retains reported Cliff’s δ, Hedges’ g and BCa intervals. The intervals exclude zero as printed, but raw samples, sign convention, pairing, standardization and bootstrap resampling units are unavailable. Cliff’s δ is a pairwise dominance measure; it is not interchangeable with paired rank-biserial correlation. Hedges’ g requires its specific variance definition. The reported 10^4 resamples and 95% intervals do not by themselves establish robustness, and a result on one truss cannot be attributed to all six problems <xref ref-type="bibr" rid="ref-21">[21]</xref>.</p>
<table-wrap id="tab4"><label>Table 4</label><caption><p>Source-reported effects and 95% BCa intervals, described as 30 paired runs on the 25-bar truss with 10,000 resamples.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:66,253.3,537.1,359"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>All cells remain unchanged; definitions and run-level resampling evidence are unavailable. For six factors and r=10 Morris trajectories, r(k+1)=70 response-model evaluations per instance, or 420 across six instances <xref ref-type="bibr" rid="ref-22">[22]</xref>. If the response is optimizer performance, each such call is an optimization run, with its own structural evaluations and stochastic replication; it is not one FE solve. The source uses six levels but omits parameter ranges, trajectories, output scaling, repeated seeds and response data. <xref ref-type="fig" rid="fig6">Fig. 6</xref> reports μ* and σ with the credit-rate entries mostly around 0.2; the report alternately names κ or portfolio size K as a top factor, while the plot does not include K. These inconsistencies prevent tuning recommendations or variance attribution. Morris σ suggests nonlinearity or interactions but does not separate them.</p>
<fig id="fig6"><label>Figure 6</label><caption><p>Retained source-reported Morris μ* and σ values for six parameters.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/119/fig-6-ed2540cc90b3.png"/></fig>
<p>Sampling design, response scale and optimizer-run budget are unresolved; η is inverse temperature despite the retained “exploration temp.” label. Relative to the printed 247.1 mean, removing repair, adaptive selection and entropy reinjection increases the reported means by about 5.18%, 3.40% and 2.10%, respectively; removing LHS gives about 1.58%. The SI-CASS-K mean is about 0.405% higher and its reported FE count falls from 20,000 to 12,400, a 38% reduction. These arithmetic statements do not identify causal effects, feasible-design quality or measured runtime. Identical wall-clock ratios of 1.00 for variants with different repair costs require actual timing and budget logs. Candidate feasibility, branch isolation, actual solver calls and timings require verification.</p>
<table-wrap id="tab5"><label>Table 5</label><caption><p>Retained source-reported ablation and Kriging-variant summaries for the 25-bar instance.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,228.4,537.1,323"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p><xref ref-type="table" rid="tab6">Table 6</xref> records the reported software and hardware configuration. The seed prefix is not a complete seed list, and no resolvable Zenodo deposit identifier, code or problem package is supplied here. The report that SciPy and scikit-posthocs produced the statistics does not resolve the inconsistencies. Reproduction requires the exact implementation, full seedfile.json, models, catalogs, per-run outputs, counters and timing/statistical scripts. Software execution and seed/deposit availability are unverified; the named seed file is required for reproduction.</p>
<table-wrap id="tab6"><label>Table 6</label><caption><p>Source-reported configuration information.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:10:66,595.6,537.1,757.6"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
</sec>
<sec id="sec-8"><label>7</label><title>Discussion</title>
<p>The printed means suggest small descriptive differences from SHADE, including about 2.10% on the 25-bar instance. A portfolio might improve search when different proposal scales are useful, but this explanation requires operator-selection histories and controlled budget-matched branch comparisons. <xref ref-type="table" rid="tab4">Table 4</xref> is labelled as a single-truss effect study and does not establish which problems benefit most.</p>
<p>Repair has the largest reported ablation mean difference, but this cannot be interpreted as a universal component ranking. A repair may change objective, feasibility and evaluation cost simultaneously. A candidate’s fitness not worsening is a property of comparison and acceptance, whereas non-expansiveness bounds the distance between the repaired images of any two inputs; the former does not imply the latter. Force redistribution and discrete catalogs make simple projection arguments inappropriate. Reinjection is intended to preserve search opportunities while retaining verified elite candidates. The reported 5%–10% fractions, 30-generation credit window and 2%–3% gains do not establish that this mechanism avoids an exploitation cost. <xref ref-type="fig" rid="fig3">Fig. 3</xref> does not show its stated threshold crossings. Selection traces and common-budget ablations are needed to distinguish reinjection benefits from additional evaluations or other changes. A two-stage exploratory search followed by a deterministic solver is a possible workflow to test. It is not validated by the current summaries. Smoothness alone does not ensure global optimality, catalog feasibility or code compliance. The reported 38% solver-call reduction and 0.4% objective increase for Kriging need original logs before recommending that variant for expensive nonlinear or transient structural models.</p>
</sec>
<sec id="sec-9"><label>8</label><title>Threats to Validity and Counterarguments</title>
<p>Six continuous hyperparameters are named, ρ, η, H_*, κ, λ0 and γ, along with the separate discrete portfolio-size K, giving seven named design choices. Their default values and full adaptation schedules are not supplied. Finite-catalog rounding is demonstrably not non-expansive, and bounded changing penalties do not establish global convergence. Conditional spatial coverage would have to be proved for proposals after repair and rounding. The truss response is described as linear-elastic, while the column and wall use simplified section models. These do not establish behavior under cracking, yielding, geometric instability, seismic response or full soil–structure interaction. The complete problem definitions and validation against independent structural calculations are absent. SQP’s proposed continuous relaxation and ten starts must be evaluated with the same total solver-call budget and final discrete domain as its comparators.</p>
<p>Inferential limitations include ambiguous pairing, no rank-block data, incorrect displayed Holm adjustments and an incompatible stated CD. Claims of identical Holm and FDR rejections are not justified without an identified family and actual calculations. A BCa resampling count, or n=30 by itself, does not guarantee interval accuracy. Sample skewness, ties, degeneracy and the resampling unit must be examined using original outputs. Most importantly, the reported outcomes are not project-ready structural designs. Complete loads, units, section properties, limit states, code editions and national annexes, tolerances, feasible vectors and design-ratio reports are unavailable. The simplified allowable-stress model cannot be equated with complete AISC, Eurocode or ACI compliance. No code-compliance certificate has been demonstrated. Additional source-reported claims include a twenty-start SQP pilot improving the wall result by less than 0.1% and a 1024-sample Sobol check of H_* and λ0. Their outputs, estimator design and budget are absent. They cannot substantiate significance, tuning or robustness conclusions. The decisive next evidence is the original model and computational package, followed by independent checking of final feasible designs and correctly defined statistics.</p>
</sec>
<sec id="sec-10"><label>9</label><title>Conclusion and Future Work</title>
<p>SI-CASS describes a candidate combination of adaptive proposals, local structural repair and diversity reinjection. Its reported numerical observations are retained, but not independently reproduced. The present analysis corrects the interpretation of inverse temperature, repair, catalog projection, objective units and computational budget, and identifies inconsistencies that prevent verification of statistical superiority or causal component effects. Neither a global convergence guarantee nor complete structural-code certification is established.</p>
<p>Further work should first supply and validate the six structural models and executed algorithm, establish final feasibility and complete resource counters, and recompute the inferential analyses from original outcomes. Extensions to nonlinear response, learned proposals, distributed evaluation or reliability-based design require their own formulations and validation. They should follow that evidence base rather than be inferred from the current summaries.</p>
</sec>
<sec id="sec-11"><title>Conflict of Interest</title>
<p>The authors declare that there are no financial, personal, institutional, or other relationships that could be perceived as influencing the work reported in this manuscript. The authors confirm that they have no competing interests regarding the publication of this article.</p>
</sec>
<sec id="sec-12"><title>Data Availability</title>
<p>The data supporting the findings of this study are fully included within the manuscript. No additional datasets were generated or analyzed beyond those presented in the text. Further information regarding the data may be obtained from the corresponding author upon reasonable request.</p>
</sec>
<sec id="sec-13"><title>Funding</title>
<p>This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors. The study was conducted without external financial support, and all aspects of the research, including study design, data collection, analysis, interpretation, and manuscript preparation, were carried out independently by the authors.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Avcı, M. S., Yavuz, D., Ercan, E., &amp; Nuhoğlu, A. (2024). Efficient sizing and layout optimization of truss benchmark structures using ISRES algorithm. Applied sciences, 14(8), 3324. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app14083324">https://doi.org/10.3390/app14083324</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Mehta, P., Tejani, G. G., &amp; Mousavirad, S. J. (2025). Structural optimization of different truss designs using two archive multi objective crystal structure optimization algorithm. Scientific reports, 15(1), 14575. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-025-97133-w">https://doi.org/10.1038/s41598-025-97133-w</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Tanabe, R., &amp; Fukunaga, A. (2013). Success-history based parameter adaptation for differential evolution. 2013 ieee congress on evolutionary computation (pp. 71–78). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/CEC.2013.6557555">https://doi.org/10.1109/CEC.2013.6557555</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Hansen, N. (2006). The CMA Evolution Strategy: A Comparing Review. In Towards a new evolutionary computation: advances in the estimation of distribution algorithms (pp. 75–102). Berlin, Heidelberg: Springer Berlin Heidelberg. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/3-540-32494-1_4">https://doi.org/10.1007/3-540-32494-1_4</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Storn, R., &amp; Price, K. (1997). Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4), 341–359. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/A:1008202821328">https://doi.org/10.1023/A:1008202821328</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Eberhart, R., &amp; Kennedy, J. (1995). Particle swarm optimization. Proceedings of the IEEE international conference on neural networks (Vol. 4, pp. 1942–1948). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ICNN.1995.488968">https://doi.org/10.1109/ICNN.1995.488968</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Mirjalili, S., Mirjalili, S. M., &amp; Lewis, A. (2014). Grey wolf optimizer. Advances in engineering software, 69, 46–61. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2013.12.007">https://doi.org/10.1016/j.advengsoft.2013.12.007</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Yang, X. S., &amp; Deb, S. (2009). Cuckoo search via lévy flights. 2009 world congress on nature &amp; biologically inspired computing (NABIC) (pp. 210–214). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/NABIC.2009.5393690">https://doi.org/10.1109/NABIC.2009.5393690</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer methods in applied mechanics and engineering, 186(2), 311–338. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0045-7825(99)00389-8">https://doi.org/10.1016/S0045-7825(99)00389-8</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Takahama, T., &amp; Sakai, S. (2010). Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation. IEEE congress on evolutionary computation (pp. 1–9). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/CEC.2010.5586484">https://doi.org/10.1109/CEC.2010.5586484</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Coello Coello, C. A. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer methods in applied mechanics and engineering, 191(11), 1245–1287. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0045-7825(01)00323-1">https://doi.org/10.1016/S0045-7825(01)00323-1</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Papadrakakis, M., Lagaros, N. D., &amp; Tsompanakis, Y. (1998). Structural optimization using evolution strategies and neural networks. Computer methods in applied mechanics and engineering, 156(1), 309–333. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0045-7825(97)00215-6">https://doi.org/10.1016/S0045-7825(97)00215-6</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>13</label><mixed-citation>Ton-That, H. L. (2026). Identification of damage in planar truss structures within a multiphysics framework using metaheuristic optimization algorithms. Journal of complex and multiphysics engineering systems, 1(2), 138–147. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.56578/jcmes010202">https://doi.org/10.56578/jcmes010202</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>14</label><mixed-citation>American Institute of Steel Construction. (2005). Specification for structural steel buildings. <ext-link ext-link-type="uri" xlink:href="https://www.aisc.org/aisc/publications/historic-standards/specification-for-structural-steel-buildings/">https://www.aisc.org/aisc/publications/historic-standards/specification-for-structural-steel-buildings/</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>15</label><mixed-citation>European Committee for Standardization. (2005). Eurocode 3: Design of steel structures—part 1-1: General rules and rules for buildings. <ext-link ext-link-type="uri" xlink:href="https://eurocodes.jrc.ec.europa.eu/EN-Eurocodes/eurocode-3-design-steel-structures">https://eurocodes.jrc.ec.europa.eu/EN-Eurocodes/eurocode-3-design-steel-structures</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>16</label><mixed-citation>European Committee for Standardization. (2002). Eurocode: Basis of structural design. <ext-link ext-link-type="uri" xlink:href="https://www.bing.com/ck/a?!&amp;&amp;p=97c394ed83be2e71a333bea7a1548f199eca3b5a90da0d06c4a1eb7b9f4e83">https://www.bing.com/ck/a?!&amp;&amp;p=97c394ed83be2e71a333bea7a1548f199eca3b5a90da0d06c4a1eb7b9f4e83</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>17</label><mixed-citation>American Concrete Institute. (2019). Building code requirements for structural concrete (ACI 318-19) and commentary (ACI 318R-19). <ext-link ext-link-type="uri" xlink:href="https://www.concrete.org/Portals/0/Files/PDF/Previews/318-19_preview.pdf">https://www.concrete.org/Portals/0/Files/PDF/Previews/318-19_preview.pdf</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>18</label><mixed-citation>Shokouhifar, M., &amp; Goli, A. (2023). Designing a resilient--sustainable supply chain network of age-differentiated blood platelets using vertical--horizontal transshipment and grey wolf optimizer. International journal of environmental research and public health, 20(5), 4078. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/ijerph20054078">https://doi.org/10.3390/ijerph20054078</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>19</label><mixed-citation>Holland, J. H. (1992). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press. <ext-link ext-link-type="uri" xlink:href="https://d1wqtxts1xzle7.cloudfront.net/98698869/1216504-libre.pdf?1676455734">https://d1wqtxts1xzle7.cloudfront.net/98698869/1216504-libre.pdf?1676455734</ext-link></mixed-citation></ref>
<ref id="ref-20"><label>20</label><mixed-citation>Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The journal of machine learning research, 7, 1–30. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.5555/1248547.1248548">https://doi.org/10.5555/1248547.1248548</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>21</label><mixed-citation>Derrac, J., García, S., Molina, D., &amp; Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and evolutionary computation, 1(1), 3–18. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.swevo.2011.02.002">https://doi.org/10.1016/j.swevo.2011.02.002</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>22</label><mixed-citation>Morris, M. D. (1991). Factorial sampling plans for preliminary computational experiments. Technometrics, 33(2), 161–174. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/00401706.1991.10484804">https://doi.org/10.1080/00401706.1991.10484804</ext-link></mixed-citation></ref>
</ref-list></back>
</article>