Skip to content
#

swarm-intelligence-algorithms

Here are 32 public repositories matching this topic...

A C# project to simulate and test a multiagent algorithm for finding multiple noisy radiation sources with spatial and communication constraints with an emulated environment. The algorithm tries to detect the source(s) of radiation with some robots in the monitoring fields. Each robot has a sensor mounted to detect the radiation concentration. The robots cooperate and communicate with each other to locate the sources based on the sensors readings using concepts from particle swarm optimization algorithm. You can see the attached paper for more detail... [Multiagent Algorithm for finding Multiple Noisy Radiation.pdf](Home_Multiagent Algorithm for finding Multiple Noisy Radiation.pdf)

  • Updated Sep 21, 2017
  • C#
RUN-Beyond-the-Metaphor-An-Efficient-Optimization-Algorithm-Based-on-Runge-Kutta-Method

The optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliché methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliché methods suffer from the locally efficient performance, biased verification methods on easy problems, and high similarity between their components' interactions. This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics. The proposed RUNge Kutta optimizer (RUN) was developed to deal with various types of optimization problems in the future. The RUN utilizes the logic of slope variations computed by the RK method as a promising and logical searching mechanism for global optimization. This search mechanism benefits from two active exploration and exploitation phases for exploring the promising regions in the feature space and constructive movement toward the global best solution. Furthermore, an enhanced solution quality (ESQ) mechanism is employed to avoid the local optimal solutions and increase convergence speed. The RUN algorithm's efficiency was evaluated by comparing with other metaheuristic algorithms in 50 mathematical test functions and four real-world engineering problems. The RUN provided very promising and competitive results, showing superior exploration and exploitation tendencies, fast convergence rate, and local optima avoidance. In optimizing the constrained engineering problems, the metaphor-free RUN demonstrated its suitable performance as well. The authors invite the community for extensive evaluations of this deep-rooted optimizer as a promising tool for real-world optimization. The source codes, supplementary materials, and guidance for the developed method will be publicly available at different hubs at http://aliasgharheidari.com/RUN.html.

  • Updated Aug 29, 2021
  • MATLAB

Improve this page

Add a description, image, and links to the swarm-intelligence-algorithms topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the swarm-intelligence-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more