Related Experiment Video
Updated: Jul 12, 2025

A Method for Growing Bio-memristors from Slime Mold
Published on: November 2, 2017
Implementation of Chaotic Reverse Slime Mould Algorithm Based on the Dandelion Optimizer
Yi Zhang1, Yang Liu1, Yue Zhao1
1College of Electrical and Computer Science, Jilin Jianzhu University, Changchun 130119, China.
Abstract:
This paper presents a hybrid algorithm based on the slime mould algorithm (SMA) and the mixed dandelion optimizer. The hybrid algorithm improves the convergence speed and prevents the algorithm from falling into the local optimal. (1) The Bernoulli chaotic mapping is added in the initialization phase to enrich the population diversity. (2) The Brownian motion and Lévy flight strategy are added to further enhance the global search ability and local exploitation performance of the slime mould. (3) The specular reflection learning is added in the late iteration to improve the population search ability and avoid falling into local optimality. The experimental results show that the convergence speed and precision of the improved algorithm are improved in the standard test functions. At last, this paper optimizes the parameters of the Extreme Learning Machine (ELM) model with the improved method and applies it to the power load forecasting problem. The effectiveness of the improved method in solving practical engineering problems is further verified.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Radical Chain-Growth Polymerization: Overview
Laminar Flow: Problem Solving
Turbulent Flow: Problem Solving
Temperature is a key factor in CO2 solubility. In this case, the CO2 gas and the liquid are cooled to 20°C. Lower temperatures...
Radical Chain-Growth Polymerization: Chain Branching
Diversity of Protists IV

