Spontaneous Fruit Fly Optimisation for truss weight minimisation: Performance evaluation based on the no free lunch theorem
Uche Onyekpe, Stratis Kanarachos, Michael E. Fitzpatrick

TL;DR
This paper introduces Spontaneous Fruit Fly Optimisation (s-FOA), a simplified and robust algorithm for truss weight minimisation, evaluated on benchmark problems and compared favorably with existing methods.
Contribution
The paper presents s-FOA, an improved, parameter-standardised version of c-FOA, designed to perform well across various nonlinear optimisation problems with minimal tuning.
Findings
s-FOA outperforms existing algorithms on benchmark problems
s-FOA demonstrates robustness and efficiency in truss optimisation
The method requires standard parameters and small population size
Abstract
Over the past decade, several researchers have presented various optimisation algorithms for use in truss design. The no free lunch theorem implies that no optimisation algorithm fits all problems; therefore, the interest is not only in the accuracy and convergence rate of the algorithm but also the tuning effort and population size required for achieving the optimal result. The latter is particularly crucial for computationally intensive or high-dimensional problems. Contrast-based Fruit-fly Optimisation Algorithm (c-FOA) proposed by Kanarachos et al. in 2017 is based on the efficiency of fruit flies in food foraging by olfaction and visual contrast. The proposed Spontaneous Fruit Fly Optimisation (s-FOA) enhances c-FOA and addresses the difficulty in solving nonlinear optimisation algorithms by presenting standard parameters and lean population size for use on all optimisation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms
