Binary Swift Flight Optimization for Set Covering and Knapsack: Proposal Density Controls and Component Ablation

Binary adaptations of continuous metaheuristics combine search updates, binary sampling and feasibility repair. We formulate Binary Swift Flight Optimization (BSFO) and examine these components on nine weighted and five unicost set covering instances and 21 knapsack instances. The contribution combines an executable specification with diagnostics of complete configurations. Under the documented original settings, BSFO achieves the best or tied median objective among four algorithms. A Bernoulli control at density 0.92 achieves lower median cost than all four on five weighted instances. The original 150-iteration adaptive runs use Glide and Target with restart. A separate campaign compares adaptive BSFO, three fixed modes and a predetermined schedule using 375 runs with exactly 15,030 evaluations, including initialization and restarts. Micro executes in all 75 adaptive runs. One of 20 prespecified paired comparisons is significant after Holm correction, favoring adaptive BSFO over Target on scp61. Proposal trajectories, paired uncertainty and interpolation sensitivity further qualify interpretation. The findings support reporting density, repair and sampling controls alongside quality and computational cost. They do not establish a general advantage of adaptive switching or superiority under equal elapsed time stopping rules.

Authors

Institutions

Publication Details

Journal
Biomimetics
Published
2026-11-20
DOI
https://doi.org/10.3390/biomimetics11110845
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Binary Swift Flight Optimization for Set Covering and Knapsack: Proposal Density Controls and Component Ablation

Broderick Crawford, Wenceslao Palma, Ricardo Soto, Francisco Muñoz
1 links
Biomimetics
Metaheuristic Optimization Algorithms Research
article

Binary Swift Flight Optimization for Set Covering and Knapsack: Proposal Density Controls and Component Ablation

Broderick Crawford, Wenceslao Palma, Ricardo Soto, Francisco Muñoz
article en

Abstract

Binary adaptations of continuous metaheuristics combine search updates, binary sampling and feasibility repair. We formulate Binary Swift Flight Optimization (BSFO) and examine these components on nine weighted and five unicost set covering instances and 21 knapsack instances. The contribution combines an executable specification with diagnostics of complete configurations. Under the documented original settings, BSFO achieves the best or tied median objective among four algorithms. A Bernoulli control at density 0.92 achieves lower median cost than all four on five weighted instances. The original 150-iteration adaptive runs use Glide and Target with restart. A separate campaign compares adaptive BSFO, three fixed modes and a predetermined schedule using 375 runs with exactly 15,030 evaluations, including initialization and restarts. Micro executes in all 75 adaptive runs. One of 20 prespecified paired comparisons is significant after Holm correction, favoring adaptive BSFO over Target on scp61. Proposal trajectories, paired uncertainty and interpolation sensitivity further qualify interpretation. The findings support reporting density, repair and sampling controls alongside quality and computational cost. They do not establish a general advantage of adaptive switching or superiority under equal elapsed time stopping rules.

BiomimeticsVol. 11(11)
Pontificia Universidad Católica de Valparaíso (CL)
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon