2020
DOI: 10.1007/978-3-030-52067-0_2
|View full text |Cite
|
Sign up to set email alerts
|

The Human Mental Search Algorithm for Solving Optimisation Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…Gradient-based approaches such as back-propagation are widely used for MLNN training, but have drawbacks such as being sensitive to the initial weights and a tendency to get stuck in local optima. Population-based metaheuristic (PBMH) algorithms such as particle swarm optimisation (PSO) [7], differential evolution [8], and human mental search (HMS) [9], [10] are capable of overcoming these problems. PBMHs are problem-independent optimisation algorithms that find an optimal solution using a population of candidate solutions and some specific operators.…”
Section: Introductionmentioning
confidence: 99%
“…Gradient-based approaches such as back-propagation are widely used for MLNN training, but have drawbacks such as being sensitive to the initial weights and a tendency to get stuck in local optima. Population-based metaheuristic (PBMH) algorithms such as particle swarm optimisation (PSO) [7], differential evolution [8], and human mental search (HMS) [9], [10] are capable of overcoming these problems. PBMHs are problem-independent optimisation algorithms that find an optimal solution using a population of candidate solutions and some specific operators.…”
Section: Introductionmentioning
confidence: 99%