Dispersive Flies Optimisation¶
A bounded population optimizer that moves coordinates from a fitter ring neighbor using the current swarm-best displacement, with thresholded disturbance.
Core Idea¶
Dispersive Flies Optimisation (DFO) is a population method for searching a bounded numerical space. In the original rule, each fly is a candidate vector scored by an objective to minimize. For each coordinate, the better of its two ring neighbors supplies a focus, while the difference between the current swarm best and the fly's current position supplies a randomly scaled displacement. A disturbance condition can replace that proposed coordinate. The combination of ring-local focus, swarm-best displacement and conditional coordinate replacement distinguishes the baseline method.[1]
Writing the current fly as \(x_i\), its fitter ring neighbor as \(x_{i_n}\), and the current swarm best as \(x_s\), the printed guided proposal is \(x^{t+1}_{i,d}=x^t_{i_n,d}+U(0,1)(x^t_{s,d}-x^t_{i,d})\). The original pseudocode then tests \(r<d_t\) and, if true, replaces the proposal with \(x_{\min,d}+r(x_{\max,d}-x_{\min,d})\). It prints the same \(r\) in the test and replacement without saying whether a fresh draw is made. The rule is therefore reported literally here; a full-range uniform distribution conditional on replacement cannot be inferred.[1]
Structural Signature¶
Signature: bounded candidate vectors → current fitness ranking → fitter ring-neighbor focus and current swarm-best differential → optional thresholded coordinate disturbance → repeated evaluated population update.[1]
- Candidates and fitness. Each fly occupies a position in a real-valued bounded search space. The chosen objective scores positions, so changing the objective can change the selected guides without moving a fly.[1]
- Two guides with different jobs. The fitter left/right ring neighbor supplies the proposal's coordinate center. The current swarm best supplies the displacement relative to the fly. Swapping the latter for the neighbor-best term changes the printed baseline equation.[1][2]
- Coordinate disturbance. The printed threshold condition can overwrite a guided coordinate with a bound-based value. This is a stochastic interruption of the guided move, not a theorem that every reset reaches the whole interval or that the method always escapes a local optimum.[1]
- Iteration under a budget. Fitness is reevaluated and positions are updated through the fly population. Original Algorithm 1 does not exempt the best fly from its update loop, so guaranteed preservation of an elite is not a constitutive role.[1]
What It Is Not¶
DFO is not Particle Swarm Optimization (PSO) under another insect name. The PSO version compared in the original paper carries velocity and personal-best state; the printed DFO move uses neither. Nor is the current best necessarily copied untouched into the next generation: original DFO Algorithm 1 loops over all flies. The separate genetic-algorithm comparator has an explicit elite-size-one choice, which should not be imported into DFO.[1]
It is also not a claim about real flies, a global-convergence proof, or a guarantee of superiority over other optimizers. Fly swarming supplies the design metaphor; the original tests are computational benchmarks with selected controls and settings. A named DFO Adaptation may alter the constitutive coordinate rule, as the medical-imaging study does.[1][2]
Scope of Application¶
The baseline operates on bounded, objective-scored numerical vectors. The original paper tests continuous benchmark functions and compares a no-disturbance DFO-c control. A later study reports applying the printed baseline update to three bounded PID gains for a simulated DC motor, with integral time-weighted absolute error (ITAE) as the quantity minimized. Those settings show the same source-reported method at unlike numerical tasks, not a claim about all DFO implementations.[1][3]
The PID report contains two presentation inconsistencies: its pseudocode assigns \(x_k\) inside an \(i\)-loop, and its printed evaluation cap differs from the 100 iterations in its parameter table. Without the authors' executed code, its simulation supports a reported application and an exact printed update formula, not proof that every pseudocode line ran as written or that a physical controller was deployed.[3]
Clarity¶
The word “best” has a precise time and scope here. At each evaluation, the best fly is the current lowest-fitness member of the population, while the better neighbor is selected from the fly's two ring neighbors. Neither means a particle's historical personal best. The neighbor centers a coordinate proposal; the swarm-best-minus-current difference changes its spread. Stating those roles makes the update reproducible and separates baseline DFO from adaptations that substitute a different guide.[1]
Manages Complexity¶
A DFO run can be specified with a small set of operational choices: objective, coordinate bounds and dimension, population size, disturbance threshold, random-number handling and evaluation budget. The population's own scored positions supply proposal information; a derivative of the objective is not required by the printed move. This makes a black-box numerical objective usable, while leaving practical performance dependent on evaluation cost, bounds, settings and stochastic draws.[1]
The small rule does not remove evaluation complexity. A population must be scored repeatedly, and a favorable result on one benchmark or one motor model does not establish performance on a different landscape or data distribution.[1][3]
Abstract Reasoning¶
The method illustrates how a population can couple local selection with population-level displacement without retaining each agent's velocity or personal-best trajectory. If a run stagnates, the diagnostic question is whether guides have become uninformative, whether the disturbance setting is too weak or too strong for the available budget, or whether the objective and bounds describe the intended problem. This is an analysis of the rule's roles, not a source-proved guarantee that adjusting one parameter will fix a run.[1]
Knowledge Transfer¶
The reusable lesson is to describe a named optimizer by its actual update and state, then test applications against that mechanism. In a new problem, first state what coordinates encode, what fitness is minimized, and which bounds make a fly feasible. Next identify the current swarm best, each ring neighbor comparison, the disturbance formula and the stopping budget. If a paper changes the differential, fitness direction or update loop, record that variant explicitly before transferring results.[1][3][2]
Examples¶
Continuous benchmark search. In the original study, flies are bounded numerical vectors scored on test functions. The ring comparison picks each fly's better neighbor, the current best provides the second term of the coordinate proposal, and \(d_t\) controls whether the proposed coordinate is replaced. The no-disturbance DFO-c comparison probes what happens when that interruption is removed within the tested settings. Its reported performance and diversity are benchmark findings, not an all-objective theorem.[1]
Simulated motor PID tuning. Acharya and colleagues map three fly coordinates to proportional, integral and derivative gains \(K_p,K_i,K_d\) within \([0.01,20]\). Their stated fitness is ITAE to minimize. They print the baseline ring-neighbor/swarm-best update, use 50 flies and report a disturbance threshold of 0.001 with 100-iteration MATLAB/Simulink comparisons. The fly therefore represents a candidate controller setting, not a physical fly or a controller component. Because the paper's index and stopping-budget lines conflict internally, the example remains a source-reported use of the baseline rule rather than audited implementation evidence.[3]
Structural Tensions¶
Guided concentration versus disturbance. The neighbor and current-best terms guide a fly using scored positions already in the population. A triggered replacement instead discards that coordinate proposal and samples according to the printed bound formula. Increasing disturbance frequency spends more updates away from those guides, while suppressing it can leave a concentrated population exploring narrowly. The original no-disturbance control makes this opposition testable for its benchmarks, but the printed reuse of \(r\) prevents a full-range uniform conditional-reset claim. Diagnostic question: under the stated objective, bounds and evaluation budget, does a chosen disturbance threshold find enough better candidates to justify the guided moves it replaces? That answer changes whether to use the threshold, reduce it, or compare against the no-disturbance control; no universal setting follows from the cited trials.[1]
Structural–Framed Character¶
DFO sits toward the structural side of the structural–framed spectrum: bounded vectors, current objective scores, ring indices, coordinate arithmetic and a stopping budget define an executable relation. Its evaluative weight is limited to the objective supplied by the user of the optimizer; the update can be stated without endorsing that objective as socially desirable. Human-practice dependence lies in choosing the objective, bounds and acceptable budget, not in interpreting a human gesture or institution during an update. Institutional origin explains the named 2014 publication but is not needed to execute the method. The vocabulary of “flies” and “swarming” travels poorly outside computational optimization; translating the equation rather than the animal image exposes its mechanism. This is primarily recognition of a numerical update structure, with a metaphor imported for its name rather than for its proof. The portable skeleton is the finite input-to-output procedure of Prime Algorithm operating on the candidate/objective specification of Optimization Problem, not evidence that this named ring-and-disturbance method applies as a Prime across all substrates. Its character: mostly structural within numerical optimization, with a fly-swarm frame and a human-chosen fitness goal.[1][3]
Structural Core vs. Domain Accent¶
The broader skeleton is a bounded, randomized procedure that takes an objective-scored candidate space and returns a best-found candidate. Prime Algorithm carries the procedural part; the live Optimization Problem node carries the decision variables, feasible bounds and objective that this procedure presupposes. DFO adds a domain-bound mechanism: two ring neighbors are compared, the fitter one centers a coordinate, the current swarm best supplies a displacement, and a disturbance condition can overwrite that proposal. These are mathematical/computational roles in numerical optimization, not a transferable pattern of any group that has neighbors or a “best” member.
The fly metaphor, benchmark suite, PID gain names and motor model are accents or instances. The named method does not clear the Prime bar: its particular ring indexing, coordinate update and thresholded replacement have not been shown to recur as the same necessary relation across unrelated substrates. The medical study is a nearby named relative, not license to widen the core: its Eq.9 replaces the swarm-best differential with a neighbor-best differential, so its mammogram results do not demonstrate the exact baseline move.[1][2]
Instantiates / Related Primes¶
This entry presupposes Optimization Problem and is a kind of Algorithm.
Prime Algorithm — strict kind of. Given an objective, bounds, population and evaluation budget, DFO specifies effective randomized steps and a best-found output. Its algorithmic correctness is execution of those steps; no global-optimum guarantee is implied. Optimization Problem — strict prerequisite. Decision coordinates, bounds, fitness and minimization sense must be specified before a “best” fly can be selected. DFO is a solver procedure operating on that specification, not a kind of optimization problem.[1]
PSO and Differential Evolution — related methods. The original paper compares DFO with population optimizers, but their distinct update/state rules do not make either a strict parent. The live Search Algorithm entry has a local-search branch yet also states a frontier-bearing core; this entry does not assert a strict edge through that unresolved parent boundary.[1]
Relationships to Other Abstractions¶
Current abstraction Dispersive Flies Optimisation Domain-specific
Parents (2) — more general patterns this builds on
-
Dispersive Flies Optimisation is a kind of Algorithm Prime
DFO is a finite randomized input-to-output procedure with prescribed update steps and a stopping budget.Given bounds, objective, population, disturbance threshold and an evaluation budget, DFO prescribes effective fitness, selection, coordinate-proposal and replacement steps and returns a best found candidate when its budget ends. Random draws make its output stochastic, but the finite, executable procedure satisfies Algorithm's genus without promising the global optimum.
-
Dispersive Flies Optimisation presupposes Optimization Problem Domain-specific
DFO requires bounded decision vectors, a fitness objective, and a minimization sense to select its guides.DFO receives numerical candidate coordinates and bounds, an objective that ranks candidates, and a minimization sense defining current best and better neighbor. Those are the decision variables, feasible domain, objective and sought optimum of an Optimization Problem. DFO is a procedure operating on such a specification rather than a kind of problem.
Hierarchy paths (3) — routes to 3 parentless roots
- Dispersive Flies Optimisation → Algorithm → Function (Mapping)
- Dispersive Flies Optimisation → Algorithm → Iteration
- Dispersive Flies Optimisation → Optimization Problem → Optimization
Neighborhood in Abstraction Space¶
Dispersive Flies Optimisation sits in a sparse region of the domain-specific corpus (94th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (2551 abstractions)
Nearest neighbors
- Stochastic Tunneling — 0.79
- Kinetic Exchange Models of Markets — 0.78
- Evolutionary Algorithm — 0.78
- Searching the conformational space for docking — 0.78
- Marine Protected Area Network — 0.78
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
The 2016 mammogram method is a DFO adaptation whose Eq.9 uses neighbor-best-minus-current instead of swarm-best-minus-current. Its image results do not establish clinical diagnostic accuracy. The 2017 SVM paper repeats the baseline-looking update but prints \(\arg\min f\) while calling F-measure itself a fitness to maximize, without explaining a sign conversion; it is useful context, not a fully mapped second positive for best selection. Neither paper should be used to repair the original baseline formula silently.[2][4]
References¶
[1] Mohammad Majid al-Rifaie, Dispersive Flies Optimisation, Proceedings of the Federated Conference on Computer Science and Information Systems (2014), pp.529–538, DOI 10.15439/2014F142; original full paper, §III Eq.(3) and Algorithm 1, printed pp.530–531; §§IV–V comparator and bounded experiments, pp.531–537. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s ↩t ↩u
[2] Mohammad Majid al-Rifaie and Ahmed Aber, Dispersive Flies Optimisation and Medical Imaging, author manuscript for Recent Advances in Computational Optimization, Studies in Computational Intelligence 610, 183–203, DOI 10.1007/978-3-319-21133-6_11; §II Eq.(3) and §V.A adapted Eq.(9), PDF pp.1–2 and 8–9. This is an adaptation, not a baseline-rule positive. registry ↩a ↩b ↩c ↩d ↩e
[3] Bishwa Babu Acharya, Sandeep Dhakal, Aayush Bhattarai and Nawraj Bhattarai, PID Speed Control of DC Motor Using Meta-Heuristic Algorithms, International Journal of Power Electronics and Drive Systems 12(2), 822–831 (2021), DOI 10.11591/ijpeds.v12.i2.pp822-831; original article PDF, abstract p.822; §2.4.2 pseudocode p.825; §2.5 Eq.(11), §2.6 Table 2 pp.826–827; §3.3 Tables 4–5 pp.827–829. Author-reported simulation, no implementation code inspected. registry ↩a ↩b ↩c ↩d ↩e ↩f
[4] Haya Abdullah Alhakbani and Mohammad Majid al-Rifaie, Optimising SVM to Classify Imbalanced Data Using Dispersive Flies Optimisation, Proceedings of the Federated Conference on Computer Science and Information Systems (2017), pp.399–402, DOI 10.15439/2017F91; original full paper, §II.A Algorithm 1 and §III, printed pp.400–401. The arg-min/F-measure-maximization inconsistency is unresolved. registry ↩