Grey Wolf Optimizer

The Whale Optimization Algorithm

http://masou-keshtkar.persiangig.com/document/sdarticle.pdf

GSA: A Gravitational Search Algorithm

This paper proposes a novel population-based optimization algorithm called Sine Cosine Algorithm (SCA) for solving optimization problems. The SCA creates multiple initial random candidate solutions and requires them to fluctuate outwards or towards the best solution using a mathematical model based on sine and cosine functions. Several random and adaptive variables also are integrated to this algorithm to emphasize exploration and exploitation of the search space in different milestones of optimization. The performance of SCA is benchmarked in three test phases. Firstly, a set of well-known test cases including unimodal, multi-modal, and composite functions are employed to test exploration, exploitation, local optima avoidance, and convergence of SCA. Secondly, several performance metrics (search history, trajectory, average fitness of solutions, and the best solution during optimization) are used to qualitatively observe and confirm the performance of SCA on shifted two-dimensional test functions. Finally, the cross-section of an aircraft's wing is optimized by SCA as a real challenging case study to verify and demonstrate the performance of this algorithm in practice. The results of test functions and performance metrics prove that the algorithm proposed is able to explore different regions of a search space, avoid local optima, converge towards the global optimum, and exploit promising regions of a search space during optimization effectively. The SCA algorithm obtains a smooth shape for the airfoil with a very low drag, which demonstrates that this algorithm can highly be effective in solving real problems with constrained and unknown search spaces. Note that the source codes of the SCA algorithm are publicly available at http://www.alimirjalili.com/SCA.html .

SCA: A Sine Cosine Algorithm for solving optimization problems

Salp Swarm Algorithm

Gravitational search algorithm is one of the new optimization algorithms that is based on the law of gravity and mass interactions. In this algorithm, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. In this article, a binary version of the algorithm is introduced. To evaluate the performances of the proposed algorithm, several experiments are performed. The experimental results confirm the efficiency of the BGSA in solving various nonlinear benchmark functions.

BGSA: binary gravitational search algorithm

Filter modeling using gravitational search algorithm

In this paper a new algorithm for edge detection using ant colony search is proposed. The problem is represented by a directed graph in which nodes are the pixels of an image. To adapt the problem, some modifications on original ant colony search algorithm (ACSA) are applied. A large number of experiments are employed to determine suitable algorithm parameters. We drive an experimental relationship between the size of the image to be analyzed and algorithm parameters. Several experiments are made and the results suggest the effectiveness of the proposed algorithm.

Saeid Saryazdi

Papers

GSA: A Gravitational Search Algorithm

BGSA: binary gravitational search algorithm

Filter modeling using gravitational search algorithm

Edge detection using ant algorithms

Disruption: A new operator in gravitational search algorithm