Results 151 to 160 of about 2,726 (189)
Some of the next articles are maybe not open access.

Slime Mould Algorithm for Solving Ambulance Dispatching Problem

2023
Rapid emergency medical service (EMS) response plays a very important role since some decisions highly impact the health of patients in critical times such as natural disasters and pandemics. In this paper, a metaheuristic approach called Slime Mould Algorithm (SMA) has been proposed to improve the response time for the ambulance dispatching problem ...
Khelfa C.   +5 more
openaire   +2 more sources

The Improved Slime Mould Algorithm with Piecewice Map

2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC), 2020
In this paper, we proposed an improved slime mould algorithm (SMA) with piecewise map. Simulation experiments were carried out with three types of benchmark functions, unimodal, multi-modal benchmark functions and those who have valleys in their three dimensional profiles.
Juan ZHAO, Zheng-Ming GAO, Bao-Lian Jia
openaire   +1 more source

Chaotic slime mould optimization algorithm for global optimization

Artificial Intelligence Review, 2021
Metaheuristic optimization methods; It is a well-known global optimization approach for large-scale search and optimization problems, commonly used to find the solution many different optimization problems. Slime mould optimization algorithm (SMA) is a recently presented metaheuristic technique that is inspired by the behavior of slime mould.
openaire   +1 more source

The improved slime mould algorithm with exponential functions

2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC), 2020
Applying the Slime Mould Algorithm (SMA) in optimization and coding it with Python programming language, we found that runtime warnings occurred because of the inherent limits of arctanh functions. Considering the circumstances that the maximum residual errors would be constrained and the maximum allowed iteration number would be bothering, we ...
Zheng-Ming GAO   +5 more
openaire   +1 more source

Slime Mould and Fungal Foraging Algorithms

2018
In this chapter we provide a brief introduction to some of the foraging behaviours of slime moulds and mycelial fungi. Growth in each organism is indeterminate, as their precise morphology is crucially determined by environmental influences, including resource distribution. We also describe a number of algorithms which have drawn inspiration from these
Anthony Brabazon, Seán McGarraghy
openaire   +1 more source

An Enhanced Slime Mould Algorithm for Function optimization

2021 3rd International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA), 2021
This study focuses on enhancement of one of the recently published metaheuristic algorithms known as slime mould algorithm (SMA). The slime mould algorithm has been shown to be a good competitive approach in the field of metaheuristics, however, it still suffers from poor exploitative behaviour, thus, suffers from slow convergence and lacks providing ...
openaire   +1 more source

The hybridized slime mould and particle swarm optimization algorithms

2020 IEEE 3rd International Conference on Automation, Electronics and Electrical Engineering (AUTEEE), 2020
Literal researches have proved that most of the algorithms are not capable to solve the problems whose solutions are not locating at the Origin. Due to the large ratio for individuals to maintain their historical trajectories in swarms of the slimed mould (SM), the SM algorithms would perform even worse.
Zhengming Gao, Juan Zhao, Suruo Li
openaire   +1 more source

Node localization in WSN using the slime mould algorithm

2023 6th International Conference on Signal Processing and Information Security (ICSPIS), 2023
Badis Lekouaghet   +3 more
openaire   +1 more source

Improved Slime Mould Algorithm

2022
Ali Kaveh, Kiarash Biabani Hamedani
openaire   +1 more source

A novel improved slime mould algorithm for engineering design

Soft Computing, 2023
Jingsen Liu   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy