# On the Leader Selection in the Self-Organizing Migrating Algorithm

### Abstract

In this article, a novel leader selection strategy for the self-organizing migrating algorithm is introduced. This strategy replaces original AllToOne and AllToRand strategies. It is shown and statistically tested, that the new strategy outperforms the original ones. All the experiments were conducted on well known CEC 2014 benchmark functions according to the CEC competition rules and reported here.### References

Bujok, P., Tvrdik, J., Polakova, R. 2019. Comparison of nature-inspired population-based algorithms on continuous optimisation problems. Swarm and Evolutionary Computation, In Press. DOI: 10.1016/j.swevo.2019.01.006

Davendra, D. and Zelinka, I. 2016. Self-Organizing Migrating Algorithm: Methodology and Implementation. Springer International Publishing. DOI: 10.1007/978-3-319-28161-2

Davendra, D., Zelinka, I.,Bialic-Davendra, M., Senkerik, R., and Jasek, R. 2013. Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan. Mathematical and Computer Modelling 57, 1-2, pp. 100-110.

Davis, L. 1991. Handbook of genetic algorithms. Van Nostrand Reinhold, New York, USA.

Deep, K. et al. 2008. A self-organizing migrating genetic algorithm for constrained optimization. Applied Mathematics and Computation 198, 1, pp. 237-250.

Glover, F. W. and Kochenberger, G. A. 2006. Handbook of metaheuristics. Springer Science & Business Media.

Kadlec, P. and Raida, Z. 2011. A Novel Multi-Objective Self-Organizing Migrating Algorithm. Radioengineering 20, 4, pp. 804-816.

Liang, J. J., Qu, B. Y., and Suganthan, P. N. 2013. Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore.

Coelho, L. S. and Mariani, V. C. 2010. An efficient cultural self-organizing migrating strategy for economic dispatch optimization with valve-point effect. Energy Conversion and Management 51, 12, pp. 2580-2587.

Shi, Y. and Eberhart, R. 1998. A modified particle swarm optimizer. In Evolutionary Computation Proceedings (1998). IEEE, pp. 69-73. DOI: 10.1109/ICEC.1998.699146

Singh, D. and Agrawal, S. 2014. Hybridization of self organizing migrating algorithm with mutation for global optimization. In Proceedings of the international conference on mathematical sciences (ICMS). Elsevier, pp. 605-609.

Singh, D. and Agrawal, S. 2015. Hybridization of self organizing migrating algorithm with quadratic approximation and non uniform mutation for function optimization. In Proceedings of Fourth International Conference on Soft Computing for Problem Solving. Springer, pp. 373-387. DOI: 10.1007/978-81-322-2217-0_32

Storn, R. and Price, K. 1997. Differential evolution{a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization 11, 4, pp. 341-359.

Talbi, E.-G. 2009. Metaheuristics: from design to implementation. John Wiley & Sons.

Wolpert, D. H., Macready, W. G. et al. 1997. No free lunch theorems for optimization. IEEE transactions on evolutionary computation 1, 1, pp. 67-82.

Yang, X.-S. 2010. Firefly algorithm, stochastic test functions and design optimisation. arXiv:1003.1409. Retrieved from https://arxiv.org/abs/1003.1409

Zelinka, I. 2004. SOMA { self-organizing migrating algorithm. In New optimization techniques in engineering. Springer, pp. 167-217. DOI: 10.1007/978-3-540-39930-8_7

Zelinka, I. 2016. SOMA { Self-organizing Migrating Algorithm. In Self-Organizing Migrating Algorithm. Springer, pp. 3-49.

Zhang, H., Li, H., Tam, C. M. 2006. Particle swarm optimization for resource-constrained project scheduling. International Journal of Project Management 24, 1, pp. 83-92.

*MENDEL*. 25, 1 (Jun. 2019), 171-178. DOI:https://doi.org/10.13164/mendel.2019.1.171.

MENDEL open access articles are normally published under a Creative Commons Attribution-NonCommercial-ShareAlike (CC BY-NC-SA 4.0) https://creativecommons.org/licenses/by-nc-sa/4.0/ . Under the CC BY-NC-SA 4.0 license permitted 3rd party reuse is only applicable for non-commercial purposes. Articles posted under the CC BY-NC-SA 4.0 license allow users to share, copy, and redistribute the material in any medium of format, and adapt, remix, transform, and build upon the material for any purpose. Reusing under the CC BY-NC-SA 4.0 license requires that appropriate attribution to the source of the material must be included along with a link to the license, with any changes made to the original material indicated.