Multi-agent list-based threshold-accepting algorithm for numerical optimisation (Q2224048)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multi-agent list-based threshold-accepting algorithm for numerical optimisation |
scientific article |
Statements
Multi-agent list-based threshold-accepting algorithm for numerical optimisation (English)
0 references
3 February 2021
0 references
Summary: Traditional list-based threshold-accepting (LBTA) algorithm is similar with simulated annealing (SA) algorithm, depends on an intense local search method, and utilises a list filling procedure with threshold values to search the solution space effectively. Inspired by the learning ability of particle swarm optimisation (PSO), multi-agent LBTA (MLBTA) involves the learning knowledge to guide its sampling, explores the solution space in a co-evolution mode. Compare with multi-agent SA (MSA) algorithm adapting the same local search version, MLBTA incorporates a dynamic list of threshold values which is adapted according to the topology of the solution space and tunes only one parameter. Dispense with sophisticated parameters as MSA, MLBTA balances the intensification and diversification iteratively. Computational results on functions optimisation and protein structure prediction (PSP) problems show that MLBTA algorithm achieves better or comparable performances with MSA.
0 references
list-based algorithms
0 references
threshold-accepting algorithms
0 references
multi-agent systems
0 references
MAS
0 references
agent-based systems
0 references
particle swarm optimisation
0 references
PSO
0 references
numerical optimisation
0 references
local search
0 references
simulated annealing
0 references
intensification
0 references
diversification
0 references
functions optimisation
0 references
protein structure prediction
0 references
PSP
0 references