Fruit fly optimisation algorithm with adaptive sign processing (Q2224053)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7305354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fruit fly optimisation algorithm with adaptive sign processing |
scientific article; zbMATH DE number 7305354 |
Statements
Fruit fly optimisation algorithm with adaptive sign processing (English)
0 references
3 February 2021
0 references
Summary: Inspired by probability estimation for code-words in adaptive arithmetic coding, a fruit fly optimisation algorithm with adaptive sign processing is presented to solve a class of optimisation problems with negative optimum point. Sign probability of previously optimal solutions are dynamically calculated, and signs of smell concentration judgement value are adaptively created, then drosophila swarms in this way will search more fast and stationary than the ones gained in random manner. Simulation results for test functions show the adaptive manner in sign processing is efficient and potential for fruit fly optimisation algorithm.
0 references
fruit fly optimisation
0 references
function optimisation
0 references
adaptive sign processing
0 references
random sign processing
0 references
negative optimum point
0 references
sign probability
0 references
drosophila swarms
0 references
simulation
0 references
0.7597082257270813
0 references
0.7524033188819885
0 references
0.7417179346084595
0 references
