Abstract
This chapter presents a hybrid variant of self organizing migrating algorithm (NMSOMA-M) for large scale function optimization, which combines the features of Nelder Mead (NM) crossover operator and log-logistic mutation operator. Self organizing migrating algorithm (SOMA) is a population based stochastic search algorithm which is based on the social behavior of group of individuals. The main characteristics of SOMA are that it works with small population size and no new solutions are generated during the search, only the positions of the solutions are changed. Though it has good exploration and exploitation qualities but as the dimension of the problem increases it trap to local optimal solution and may suffer from premature convergence due to lack of diversity mechanism. This chapter combines NM crossover operator and log-logistic mutation operator with SOMA in order to maintain the diversity of population and to avoid the premature convergence. The proposed algorithm has been tested on a set of 15 large scale unconstrained test problems with problem size taken as up to 1000. In order to see its efficiency over other population based algorithms, the results are compared with SOMA and particle swarm optimization algorithm (PSO). The comparative analysis shows the efficiancy of the proposed algorithm to solve large scale function optimization with less function evaluations.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Particle Swarm Optimization
- Mutation Operator
- Crossover Operator
- Premature Convergence
- Quadratic Approximation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Zelinka, I., Lampinen, J.: SOMA - Self organizing migrating algorithm. In: Proceedings of the 6th International Mendel Conference on Soft Computing, Brno, Czech, Republic, pp. 177–187 (2000)
Domingo, O.B., Cessae, H.M., Nicolas, G.P.: CIXL2: A crossover operator for evolutionary algorithms based on research. Journal of Artificial Intelligence Research 24, 1–48 (2005)
Chelouah, R., Siarry, P.: A hybrid method combining continuous tabu search and nelder – Mead simplex algorithm for global optimization of multiminima functions. European Journal of Operational Research 161, 636–654 (2005)
Deep, K., Dipti, S.: A new hybrid self organizing migrating genetic algorithm for function optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 2796–2803 (2007)
Fan, K.-S., Liang, Y.C., Zahara, E.: A genetic algorithm and a particle swarm optimizer hybridized with nelder-mead simplex search. Computers and Industrial Engineering 50, 401–425 (2006)
Premalatha, K., Nataranjan, A.M.: Hybrid PSO and GA for global optimization. International Journal of Open Problems and Computational Mathematics 2(4), 597–608 (2009)
Khosravi, A., Lari, A., Addeh, J.: A new hybrid of evolutionary and conventional optimization algorithm. Applied Mathematical Sciences 6, 815–825 (2012)
Ghatei, S., Panahi, F.T., Hosseinzadeh, M., Rouhi, M., Rezazadeh, I., Naebi, A., Gahtei, Z., Khajei, R.P.: A new hybrid algorithm for optimization using PSO and GDA. Journal of Basic and Applied Scientific Research 2, 2336–2341 (2012)
Esmin, A.A.A., Matwin, S.: A hybrid particle swarm optimization algorithm with genetic mutation. International Journal of Innovative Computing, Information and Control 9, 1919–1934 (2013)
Pant, M., Thangaraj, R., Abraham, A.: A new PSO algorithm with crossover operator for global optimization problems. In: Corchado, E., Corchado, J.M., Abraham, A. (eds.) Innovations in Hybrid Intelligent Systems, vol. 44, pp. 215–222. Springer, Heidelberg (2007)
Bansal, J.C., Deep, K.: Quadratic approximation PSO for economic dispatch problems with valve-point effects. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds.) SEMCCO 2010. LNCS, vol. 6466, pp. 460–467. Springer, Heidelberg (2010)
Deep, K., Thakur, M.: A new mutation operator for real coded genetic algrithms. Applied Mathematics and computation 193, 229–247 (2007)
Xing, L.N., Chen, Y.W., Yang, K.W.: A novel mutation operator base on immunity operation. European Journal of Operational Research 197, 830–833 (2009)
Deep, K., Shashi, Katiyar, V.K.: A new real coded genetic algorithm operator: Log logistic mutation. In: Deep, K., Nagar, A., Pant, M., Bansal, J.C. (eds.) Proceedings of the International Conference on SocProS 2011. AISC, vol. 130, pp. 193–200. Springer, Heidelberg (2012)
Mohan, C., Shankar, K.: Random search technique for global optimization. Asia Pacific Journal of Operations Research 11, 93–101 (1994)
Deep, K., Das, K.N.: Quadratic approximation based hybrid genetic algorithm function optimization. Applied Mathematics and Computations 203, 86–98 (2008)
Deep, K., Bansal, J.C.: Hybridization of particle swarm optimization with quadratic approximation. Opsearch 46, 3–24 (2009)
Deep, K., Das, K.N.: Performance improvement of real coded genetic algorithm with quadratic approximation based hybridization. International Journal of Intelligent Defence Support Systems 2, 319–334 (2010)
Pant, M., Thangaraj, R., Abraham, A.: A new quantum behaved particle swarm optimization. In: Keijzer, M. (ed.) Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO, Netherlands, pp. 87–94 (2008)
Singh, D., Agrawal, S., Singh, N.: A novel variant of self organizing migrating algorithm for function optimization. In: Pant, M., Deep, K., Nagar, A., Bansal, J.C. (eds.) Proceedings of the Third International Conference on Soft Computing for Problem Solving. AISC, vol. 258, pp. 225–234. Springer, Heidelberg (2014)
Eberhart, R.C., Kennedy, J.: Partcle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948. IEEE Service Center, Piscataway (1995)
Zelinka, I.: SOMA - Self organizing migrating algorithm. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 167–217. Springer, Heidelberg (2004)
Spendley, W., Hext, G.R., Himsworth, F.R.: Sequential application of simplex designs in optimization and evolutionary operation. Technometrics 4, 441–461 (1962)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Singh, D., Agrawal, S. (2015). Self Organizing Migrating Algorithm with Nelder Mead Crossover and Log-Logistic Mutation for Large Scale Optimization. In: Acharjya, D., Dehuri, S., Sanyal, S. (eds) Computational Intelligence for Big Data Analysis. Adaptation, Learning, and Optimization, vol 19. Springer, Cham. https://doi.org/10.1007/978-3-319-16598-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-16598-1_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16597-4
Online ISBN: 978-3-319-16598-1
eBook Packages: EngineeringEngineering (R0)