A novel optimization method for solving constrained and unconstrained problems: modified Golden Sine Algorithm

A novel optimization method for solving constrained and unconstrained problems: modified Golden Sine Algorithm

Recently, the metaheuristic optimization algorithms inspired by nature and different science branches havebeen powerful solution methods for unconstrained, constrained, and engineering problems. Various metaheuristicoptimization algorithms have been proposed and they have been applied to problems in different fields. This paperproposes a novel optimization method based on a modified version of the Golden Sine Algorithm for solving unconstrained,constrained, and engineering problems. The basic idea behind the proposed modified Golden Sine Algorithm (GoldSA-II)depends on finding the optimum solution field in search space by using the decreasing pattern of the sine function andthe golden ratio. The performance of the proposed GoldSA-II is evaluated using 19 unconstrained benchmark functions,five constrained optimization test problems, and five real engineering design problems. The results of the proposedGoldSA-II are compared with best-known optimization algorithms using some well-known criteria. The obtained resultsshow that the GoldSA-II converges more accurately to the global solution in many benchmark functions.

___

  • Eskandar H, Sadollah A, Bahreininejad A, Hamdi M. Water cycle algorithm–a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 2012; 110: 151-166.
  • Mirjalili S, Mirjalili SM, Lewis A. Grey wolf optimizer. Adv Eng Softw 2014; 69: 46-61.
  • Lee KS, Geem ZW. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Method Appl M 2005; 194: 3902-3933.
  • Prakasam A, Savarimuthu N. Metaheuristic algorithms and polynomial Turing reductions: a case study based on ant colony optimization. Procedia Comput Sci 2015; 46: 388-395.
  • Fister Jr I, Yang XS, Fister D, Fister I. A brief review of nature-inspired algorithms for optimization. Elektrotehniski Vestnik/Electrotechnical Review 2013; 80: 1-7.
  • Holland JH. Genetic algorithms. Sci Am 1992; 267: 66-72.
  • Storn R, Price K. Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 1997; 11: 341-359.
  • Parpinelli RS, Lopes HS. An eco-inspired evolutionary algorithm applied to numerical optimization. In: 3rd World Congress on Nature and Biologically Inspired Computing (NaBIC 2011); 19–21 October 2011; Salamanca, Spain. pp. 466-471.
  • Kennedy J, Eberhart RC. Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks (ICNN ’95); 27 November–1 December 1995; Perth, WA, Australia. New York, NY, USA: IEEE. pp. 1942-1948.
  • Cheung NJ, Ding XM, Shen HB. OptiFel: a convergent heterogeneous particle swarm optimization for TakagiSugeno fuzzy modeling. IEEE T Fuzzy Syst 2014; 22: 919-933.
  • Cheng MY, Prayogo D. Symbiotic Organisms Search: a new metaheuristic optimization algorithm. Comput Struct 2014; 139: 98-112.
  • Dorigo M. Optimization, learning and natural algorithms. PhD, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy, 1992.
  • Tang R, Fong S, Yang XS, Deb S. Wolf search algorithm with ephemeral memory. In: IEEE 2012 Seventh International Conference on Digital Information Management (ICDIM 2012); 22–24 August 2012; Macao, China. New York, NY, USA: IEEE. pp. 165-172.
  • Yang XS. Firefly algorithm, stochastic test functions and design optimisation. Int J Bio-Inspir Com 2010; 2: 78-84 [15] Mirjalili S, Mirjalili SM. The whale optimization algorithm. Adv Eng Softw 2016; 95: 51-67.
  • Alatas, B. ACROA: Artificial chemical reaction optimization algorithm for global optimization. Expert Syst Appl 2011; 38: 13170-13180.
  • Cuevas E, Oliva D, Zaldivar D, Perez-Cisneros M, Sossa H. Circle detection using electro-magnetism optimization. Inform Sciences 2012; 182: 40-55.
  • Rashedi E, Pour HN, Saryazdi S. GSA: a gravitational search algorithm. Inform Sciences 2009; 179: 2232-2248.
  • Geem ZW, Kim JH, Loganathan GV. A new heuristic optimization algorithm: harmony search. Simulation 2001; 76: 60-68.
  • Shayeghi H, Dadashpour J. Anarchic society optimization based pid control of an automatic voltage regulator (avr) system. Electrical and Electronic Engineering 2012; 2: 199-207.
  • Atashpaz-Gargari E, Lucas C. Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation (CEC 2007); 25–28 September 2007; Singapore, Singapore. New York, NY, USA: IEEE. pp. 4661-4667.
  • Ramezani F, Lotfi S. Social-based algorithm. Appl Soft Comput 2013; 13: 2837-2856.
  • Kashan AH. League Championship Algorithm: a new algorithm for numerical function optimization. In: International Conference of Soft Computing and Pattern Recognition; 4–7 December 2009; Malacca, Malaysia. New York, NY, USA: IEEE. pp. 43-48.
  • Moosavian N, Roodsari BK. Soccer league competition algorithm: a novel meta-heuristic algorithm for optimal design of water distribution networks. Swarm Evol Comput 2014; 17: 14-24.
  • Salem SA. BOA: A novel optimization algorithm. In: International Conference on Engineering and Technology; 10–11 October 2012; Cairo, Egypt. New York, NY, USA: IEEE. pp. 1-5.
  • Mirjalili S. SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl-Based Syst 2016; 96: 120-133.
  • Tanyıldızı E, Demir G. Golden Sine Algorithm: A Novel Math-Inspired Algorithm. Adv Electr Comput En 2017; 17: 71-78.
  • Arora RK. Optimization Algorithms and Applications. 1st ed. Boca Raton, FL, USA: CRC Press, 2015.
  • Crepinšek M, Liu SH, Mernik M. Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 2013; 45: 1-33.
  • Coello CAC. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Method Appl M 2002; 191: 1245-1287.
  • Runarsson TP, Yao X. Stochastic ranking for constrained evolutionary optimization. IEEE T Evolut Comput 2000; 4: 284-294.
  • Jamil M, Yang XS. A literature survey of benchmark functions for global optimization problems. International Journal of Mathematical Modelling and Numerical Optimisation 2013; 4: 150-194.
  • Liu H, Cai Z, Wang Y. Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 2010; 10: 629-640.
  • Huang F, Wang L, He Q. An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 2007; 186: 340-356.
  • Derrac J, Garcia S, Molina D, Herrera F. A practical tutorial on the use of non-parametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 2011; 1: 3-18.