https://github.com/copandrej/mpi-parallelization-of-sma

https://github.com/copandrej/mpi-parallelization-of-sma

Science Score: 23.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
  • .zenodo.json file
  • DOI references
    Found 4 DOI reference(s) in README
  • Academic publication links
    Links to: researchgate.net, sciencedirect.com
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (8.4%) to scientific vocabulary
Last synced: 10 months ago · JSON representation

Repository

Basic Info
  • Host: GitHub
  • Owner: copandrej
  • License: mit
  • Language: C
  • Default Branch: master
  • Size: 12.1 MB
Statistics
  • Stars: 0
  • Watchers: 0
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Fork of aliasgharheidaricom/Slime-Mould-Algorithm-A-New-Method-for-Stochastic-Optimization-
Created over 1 year ago · Last pushed over 1 year ago

https://github.com/copandrej/MPI-parallelization-of-SMA/blob/master/

# Slime mould algorithm: A new method for stochastic optimization

In this paper, a new stochastic optimizer, which is called slime mould algorithm (SMA), is proposed based upon the oscillation mode of slime mould in nature. The proposed SMA has several new features with a unique mathematical model that uses adaptive weights to simulate the process of producing positive and negative feedback of the propagation wave of slime mould based on bio-oscillator to form the optimal path for connecting food with excellent exploratory ability and exploitation propensity. The proposed SMA is compared with up-to-date metaheuristics in an extensive set of benchmarks to verify the efficiency. Moreover, four classical engineering structure problems are utilized to estimate the efficacy of the algorithm in optimizing engineering problems. The results demonstrate that the algorithm proposed benefits from competitive, often outstanding performance on different search landscapes. The source codes and info of SMA are publicly available at: http://www.aliasgharheidari.com//SMA.html

Slime mould algorithm: A new method for stochastic optimization
Shimin Li, Huiling Chen, Mingjing Wang, Ali Asghar Heidari, Seyedali Mirjalili
2020/4/3
Future Generation Computer Systems
DOI: https://doi.org/10.1016/j.future.2020.03.055
https://www.sciencedirect.com/science/article/pii/S0167739X19320941

Website of SMA: http://www.aliasgharheidari.com//SMA.html
You can find and run the SMA code online at http://www.aliasgharheidari.com//SMA.html

You can find the SMA paper at https://doi.org/10.1016/j.future.2020.03.055
Please follow the paper for related updates in researchgate: https://www.researchgate.net/publication/340431861_Slime_mould_algorithm_A_new_method_for_stochastic_optimization

  Main idea: Shimin Li
  Author and programmer: Shimin Li,Ali Asghar Heidari,Huiling Chen
  e-Mail: simonlishimin@foxmail.com
 
 Co-author:
             Huiling Chen(chenhuiling.jlu@gmail.com)
             Mingjing Wang(wangmingjing.style@gmail.com)
             Ali Asghar Heidari(aliasghar68@gmail.com, as_heidari@ut.ac.ir)
             Seyedali Mirjalili
             
             Researchgate: Ali Asghar Heidari https://www.researchgate.net/profile/Ali_Asghar_Heidari
             Researchgate: Huiling Chen https://www.researchgate.net/profile/Huiling_Chen


GitHub Events

Total
  • Push event: 37
Last Year
  • Push event: 37