Analyzing of Usage Effect of the Distribution Functions for SMDO Algorithm via Benchmark Function with Matlab Toolbox
Abstract
This paper presents solution comparisons of benchmark functions by using stochastic multi-parameters
divergence (SMDO) method with different distribution functions. Using benchmark functions is an
important method in measuring the effectiveness of algorithms. Because benchmark functions are used by
all algorithm producers while trying their algorithms and this provides a good tool for the others to compare
their algorithms with similar procedures. Benchmark functions are used in this paper for the main purpose
of analyzing randomization process. It is known that distribution functions take place a vital role in getting
random numbers. These random numbers are used in stochastic methods through specifying step size. It
is believed that a suitable random number acquisition process can support the search processes of
algorithms. In this study the effects of distribution functions on benchmark functions are analyzed. For
this purpose, a program is developed with MATLAB. The comparisons via the help of this program is
shown in tabular form. The results are analyzed from the viewpoint of whether developing the
randomization process makes contribution to problem solving power of algorithms. In this study SMDO
algorithm is analyzed with different distribution functions by using different benchmark functions. In
addition, in the study, a useful friend-friendly Matlab toolbox is proposed in which SMDO algorithm can
be tested over different benchmark functions according to different distribution functions.
(https://www.mathworks.com/matlabcentral/fileexchange/75044-smdo-with-distribution-function-forbenchmarking)
Keywords
References
- [1] M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms. 2005.
- [2] R. Hemmecke, M. Köppe, J. Lee, and R. Weismantel, “Nonlinear integer programming,” in 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, 2010.
- [3] C. Zhang and R. Ordóñez, “Numerical optimization,” in Advances in Industrial Control, 2012.
- [4] L. Bianchi, M. Dorigo, L. M. Gambardella, and W. J. Gutjahr, “A survey on metaheuristics for stochastic combinatorial optimization,” Nat. Comput., 2009, doi: 10.1007/s11047-008-9098-4.
- [5] J. H. He, “Homotopy perturbation technique,” Comput. Methods Appl. Mech. Eng., 1999, doi: 10.1016/S0045-7825(99)00018-3.
- [6] J. H. He, “Comparison of homotopy perturbation method and homotopy analysis method,” Appl. Math. Comput., 2004, doi: 10.1016/j.amc.2003.08.008.
- [7] X. S. Yang, “Firefly algorithm, stochastic test functions and design optimization,” Int. J. Bio-Inspired Comput., 2010, doi: 10.1504/IJBIC.2010.032124.
- [8] X. S. Yang, “Flower pollination algorithm for global optimization,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, doi: 10.1007/978-3-642-32894-7_27.
Details
Primary Language
English
Subjects
-
Journal Section
Research Article
Publication Date
September 30, 2020
Submission Date
April 17, 2020
Acceptance Date
July 16, 2020
Published in Issue
Year 2020 Volume: 11 Number: 3