Solving constrained optimization problems with sine-cosine algorithm

Simge Ekiz, Pakize Erdoğmuş, Büşra Özgür


Optimization algorithms aim to find the optimum values that give the maximum or minimum result of a function under given circumstance.
There are many approaches to solve optimization problems. Stochastic population-based optimization approaches tend to give the best results in a reasonable time. Two of the state-of-art stochastic optimization algorithms are Genetic Algorithms (GA) and Particle Swarm Optimization(PSO). In addition, Sine-Cosine Algorithm is one of the recently developed stochastic population-based optimization algorithms. It is claimed that Sine-Cosine has a higher speed than the counterparts of it. Moreover, Sine-Cosine Algorithm occasionally outperforms other optimization algorithms including GA and PSO. This algorithm is successful because it can balance exploration and exploitation smoothly.
In the previous studies, the above-mentioned algorithms were evaluated and compared to each other for the unconstrained optimization test functions. But there is no study on constrained optimization test problems. In this study, we aim to show the performance of Sine-Cosine Algorithm on constrained optimization problems. In order to achieve this, we are going to compare the performances by using well-known constrained test functions


Sine-Cosine Optimization Algorithm, Constrained Optimization Problems, Penalty Method

Full Text:



A. Askarzadeh, “A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm,” Comput. Struct., vol. 169, pp. 1–12, 2016.

“Swarm Behaviour.” [Online]. Available:

Z. Michalewicz and M. Schoenauer, “Evolutionary Algorithms for Constrained Parameter Optimization Problems,” Evol. Comput., vol. 4, no. 1, pp. 1–32, 1996.

J. A. Joines and C. R. Houck, “On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA’s,” in Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, 1994, pp. 579–584.

X. Hu and R. Eberhart, “Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization,” Optimization, vol. 2, no. 1, pp. 1677–1681, 2002.

O. Yeniay, “Penalty function methods for constrained optimization with genetic algorithms,” Math. Comput. Appl., vol. 10, no. 1, pp. 45–56, 2005.

Q. He and L. Wang, “An effective co-evolutionary particle swarm optimization for constrained engineering design problems,” Eng. Appl. Artif. Intell., vol. 20, no. 1, pp. 89–99, 2007.

A. Homaifar, C. X. Qi, and S. H. Lai, “Constrained Optimization Via Genetic Algorithms,” Simulation, vol. 62, no. 4, pp. 242–253, 1994.

S. Mirjalili, “SCA: A Sine Cosine Algorithm for solving optimization problems,” Knowledge-Based Syst., vol. 96, pp. 120–133, 2016.

R. Courant, “Variational methods for the solution of problems of equilibrium and vibrations,” Bull. Am. Math. Soc., vol. 49, no. 1, pp. 1–24, 1943.

J. Kennedy and R. Eberhart, “Particle swarm optimization,” Neural Networks, 1995. Proceedings., IEEE Int. Conf., vol. 4, pp. 1942–1948 vol.4, 1995.

J. Brownlee, “Particle Swarm Optimization.” [Online]. Available: [Accessed: 26-Apr-2017].

A. R. Hedar, “Global Optimization Test Problems.” [Online]. Available:



  • There are currently no refbacks.

Copyright (c) 2017 Periodicals of Engineering and Natural Sciences (PEN)

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN: 2303-4521

Digital Object Identifier DOI: 10.21533/pen

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License