Download and share free MATLAB code, including functions, models, apps, support packages and toolboxes
This paper investigates a new meta-heuristic algorithm called Slime Mould algorithm (SMA) from different optimization aspects. The SMA algorithm was invented due to the fluctuating behavior of slime mold in nature. It has several new features with a unique mathematical model that uses adaptive ...
The existing slime mould algorithm clones the uniqueness of the phase of oscillation of slime mould conduct and exhibits slow convergence in local search space due to poor exploitation phase. This research work exhibits to discover the best solution for objective function by commingling slime mould al...
In order to solve the inverse kinematics (IK) of complex manipulators efficiently, a hybrid equilibrium optimizer slime mould algorithm (EOSMA) is proposed. Firstly, the concentration update operator of the equilibrium optimizer is used to guide the anisotropic search of the slime mould algorithm to...
Algorithm 1:Pseudo Code of the SMA. Begin Set:N denotes the number of current population; FES denotes the number of evaluations; D denotes the dimensions of optimization problem; Max-FES denotes maximum FES; 01 Initialize the positions of slime mould:Xi (i = 1, 2…, N); 05 Whil...
Algorithm 1: Pseudo-code of SMA Input: population size N Maximum number of iterations maxiter Dimension of the problem Dim Fixed conversion value z Output: Best fitness bF Best position Xb 1.While (t=1tomaxiter) 2. Calculate the fitness of all slime mould; 3. Update bF, Xb; 4. Calculat...
engineeringbenchmarkalgorithmoptimizationpaperbestevolutionary-algorithmsslimesmageneticmetaheuristicsswarm-intelligencealgorithms-and-data-structuresbest-practiceseyedali-mirjalilislime-mouldali-asghar-heidari UpdatedAug 9, 2024 MATLAB SLIME configuration with some extensions pre-installed. ...
The slime mould algorithm (SMA) is a population-basedswarm intelligenceoptimization algorithm that simulates the oscillatoryforaging behaviorof slime moulds. To overcome its drawbacks of slow convergence speed and premature convergence, this paper proposes an improved algorithm named PSMADE, which integrate...
The ant colony optimization (ACO) is one efficient approach for solving the travelling salesman problem (TSP). Here, we propose a hybrid algorithm based on