Search published articles


Showing 2 results for Sine Cosine Algorithm

S. Gholizadeh, R. Sojoudizadeh,
Volume 9, Issue 2 (4-2019)
Abstract

This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical functions has been demonstrated in literature. However, its performance in tackling the discrete optimization problems of truss structures is not competitive compared with the existing metaheuristic algorithms. In the framework of the proposed MSCA, a number of worst solutions of the current population is replaced by some variants of the global best solution found so far. Moreover, an efficient mutation operator is added to the algorithm that reduces the probability of getting stuck in local optima. The efficiency of the proposed MSCA is illustrated through multiple benchmark optimization problems of truss structures.
M. Ilchi Ghazaan , A.h. Salmani Oshnari , A. M. Salmani Oshnari,
Volume 13, Issue 1 (1-2023)
Abstract

Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Algorithm (SCA) is a stochastic optimization method that employs sine and cosine based mathematical models to update a randomly generated initial population. In this paper, we developed a new hybrid approach called hybrid CBO with SCA (HCBOSCA) to obtain reliable structural design optimization of discrete and continuous variable structures, where a memory was defined to intensify the convergence speed of the algorithm. Finally, three structural problems were studied and compared to some state of the art optimization methods. The experimental results confirmed the competence of the proposed algorithm.
 

Page 1 from 1     

© 2024 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb