Biomimetics,
Journal Year:
2023,
Volume and Issue:
8(3), P. 305 - 305
Published: July 11, 2023
The
reptile
search
algorithm
is
an
effective
optimization
method
based
on
the
natural
laws
of
biological
world.
By
restoring
and
simulating
hunting
process
reptiles,
good
results
can
be
achieved.
However,
due
to
limitations
laws,
it
easy
fall
into
local
optima
during
exploration
phase.
Inspired
by
different
fields
organisms
with
varying
flight
heights,
this
paper
proposes
a
considering
heights.
In
phase,
introducing
altitude
abilities
two
animals,
northern
goshawk
African
vulture,
enables
reptiles
have
better
horizons,
improve
their
global
ability,
reduce
probability
falling
A
novel
dynamic
factor
(DF)
proposed
in
exploitation
phase
algorithm’s
convergence
speed
accuracy.
To
verify
effectiveness
algorithm,
test
were
compared
ten
state-of-the-art
(SOTA)
algorithms
thirty-three
famous
functions.
experimental
show
that
has
performance.
addition,
SOTA
applied
three
micromachine
practical
engineering
problems,
problem-solving
ability.
PLoS ONE,
Journal Year:
2023,
Volume and Issue:
18(1), P. e0280512 - e0280512
Published: Jan. 25, 2023
In
this
article,
an
improved
slime
mould
algorithm
(SMA-CSA)
is
proposed
for
solving
global
optimization
and
the
capacitated
vehicle
routing
problem
(CVRP).
This
improvement
based
on
mixed-strategy
of
Cauchy
mutation
simulated
annealing
to
alleviate
lack
capability
SMA.
By
introducing
strategy,
optimal
solution
perturbed
increase
probability
escaping
from
local
extreme
value;
in
addition,
strategy
introduced,
Metropolis
sampling
criterion
used
as
acceptance
expand
search
space
enhance
exploration
phase
achieve
solutions.
The
performance
SMA-CSA
evaluated
using
CEC
2013
benchmark
functions
problem.
all
experiments,
compared
with
ten
other
state-of-the-art
metaheuristics.
results
are
also
analyzed
by
Friedman
Wilcoxon
rank-sum
test.
experimental
statistical
tests
demonstrate
that
very
competitive
often
superior
algorithms
experiments.
its
efficiency
discrete
ability.
ACM Transactions on Asian and Low-Resource Language Information Processing,
Journal Year:
2023,
Volume and Issue:
22(7), P. 1 - 29
Published: April 14, 2023
A
large
volume
of
unstructured
data,
especially
text
is
generated
and
exchanged
daily.
Consequently,
the
importance
extracting
patterns
discovering
knowledge
from
textual
data
significantly
increasing.
As
task
automatically
recognizing
relations
between
two
or
more
entities,
semantic
relation
extraction
has
a
prominent
role
in
exploitation
raw
text.
This
article
surveys
different
approaches
types
English
most
proposed
methods
Persian.
We
also
introduce,
analyze,
compare
important
datasets
available
for
Persian
English.
Furthermore,
traditional
emerging
evaluation
metrics
supervised,
semi-supervised,
unsupervised
are
described,
along
with
pointers
to
commonly
used
performance
datasets.
Finally,
we
briefly
describe
challenges
relationships
dataset
creation
challenges.
In
order
to
effectively
strengthen
the
exploration
and
exploitation
capabilities
of
arithmetic
optimization
algorithm
(AOA)
balance
search
ability
between
two
is
realized,
a
novel
mathematical
operator-based
(MAOA)
proposed.
Firstly,
abilities
population
are
improved
through
symmetry
operators
median
operators,
respectively.
Secondly,
AOA
strengthened
by
using
sine–cosine
operator.
Finally,
MAOA
used
solve
spherical
mining
spanning
tree
(sphere
MST)
communication
network
problems.
Experimental
results
show
that
proposed
has
achieved
excellent
in
terms
accuracy,
robustness,
convergence
speed.
PLoS ONE,
Journal Year:
2022,
Volume and Issue:
17(9), P. e0275094 - e0275094
Published: Sept. 23, 2022
Particle
swarm
optimization
and
genetic
algorithms
are
two
classes
of
popular
heuristic
that
frequently
used
for
solving
complex
multi-dimensional
mathematical
problems,
each
one
with
its
advantages
shortcomings.
is
known
to
favor
exploitation
over
exploration,
as
a
result
it
often
converges
rapidly
local
optima
other
than
the
global
optimum.
The
algorithm
has
ability
overcome
extrema
throughout
process,
but
suffers
from
slow
convergence
rates.
This
paper
proposes
new
hybrid
nests
particle
operations
in
algorithm,
providing
general
population
prowess
sub-population
high
capabilities
optimization.
effectiveness
proposed
demonstrated
through
solutions
several
continuous
well
discrete
(traveling
salesman)
problems.
It
found
provides
better
balance
between
exploration
compared
both
parent
algorithms,
existing
achieving
consistently
accurate
results
relatively
small
computational
cost.
