Al momento, stai seguendo questo contributo
- Vedrai gli aggiornamenti nel tuo feed del contenuto seguito
- Potresti ricevere delle email a seconda delle tue preferenze per le comunicazioni
The Slime Mould Algorithm (SMA) uses two random search agents from the whole population to decide the future displacement and direction from the best search agents, which limits its exploitation and exploration. To solve this problem, an adaptive approach is investigated to decide whether opposition-based learning (OBL) will be used or not. Sometimes, the OBL is used to further increase the exploration. In addition, it maximizes the exploitation by replacing one random search agent with the best one in the position updating. The suggested technique is called an adaptive opposition slime mould algorithm (AOSMA). The proposed AOSMA algorithm would be useful for function optimization to solve real-world engineering problems.
Cita come
M. K. Naik, R. Panda, and A. Abraham, “Adaptive opposition slime mould algorithm,” Soft Comput., Aug. 2021, DOI: 10.1007/s00500-021-06140-2
Riconoscimenti
Ispirato da: Slime Mould Algorithm (SMA): A Method for Optimization
Ispirato: Equilibrium Slime Mould Algorithm (ESMA) Source Code
Informazioni generali
- Versione 1.0.0 (5,35 KB)
Compatibilità della release di MATLAB
- Compatibile con qualsiasi release
Compatibilità della piattaforma
- Windows
- macOS
- Linux
| Versione | Pubblicato | Note della release | Action |
|---|---|---|---|
| 1.0.0 |
