A 65-algorithm benchmark on a bi-objective repairable redundancy-allocation problem shows that algorithm rankings are budget-dependent and that Scaled Binomial Initialization changes relative performance.
Information Sciences 560, 68–91
1 Pith paper cite this work, alongside 227 external citations. Polarity classification is still indexing.
1
Pith paper citing it
227
external citations · OpenAlex
fields
cs.NE 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Large-scale benchmarking of multi-objective soft-computing metaheuristics for redundancy allocation in repairable k-out-of-n systems
A 65-algorithm benchmark on a bi-objective repairable redundancy-allocation problem shows that algorithm rankings are budget-dependent and that Scaled Binomial Initialization changes relative performance.