SOMGA for Large Scale Function Optimization and Its Application

  • Dipti SinghEmail author
  • Kusum Deep
Part of the Studies in Computational Intelligence book series (SCI, volume 626)


Self Organizing Migrating Genetic Algorithm (SOMGA) is a hybridized variant of Genetic Algorithm (GA) inspired by the features of Self Organizing Migrating Algorithm, presented by Deep and Dipti (IEEE Congr Evol Comput, pp 2796–2803, 2007) [1]. SOMGA extracts the features of binary coded GA and real coded SOMA in such a way that diversity of the solution space can be maintained and thoroughly exploited keeping function evaluation low. It works with very less population size and tries to achieve global optimal solution faster in less number of function evaluations. Earlier SOMGA has been used to solve problems up to 10 dimensions with population size 10 only. This chapter is brake into three sections. In first section a possibility of using SOMGA to solve large scale problem (dimension up to 200) has been analyzed with the help of 13 test problems. The reason behind extension is that SOMGA works with very small population size and to solve large scale problems (dimension 200) only 20 population size is required. On the basis of results it has been concluded that SOMGA is efficient to solve large scale global optimization problems with small population size and hence required lesser function evaluations. In second section, two real life problems from the field of engineering as an application have been solved using SOMGA. In third section, a comparison between two ways of hybridization has been analyzed. There can be two approaches to hybridize a population based technique. Either by incorporating a deterministic local search in it or by merging it with other population based technique. To see the effect of both the approaches on GA, the results of SOMGA on five test problems are compared with the results of MA (GA+ deterministic local search). Results clearly indicates that SOMGA is less expensive and effective to solve these problems.


Self organizing migrating algorithm Genetic algorithm Large scale global optimization Real life problems 


  1. 1.
    Deep, K., Singh, D.: A new hybrid self organizing migrating genetic algorithm for function optimization. In: IEEE Congress on Evolutionary Computation, pp. 2796–2803 (2007)Google Scholar
  2. 2.
    Grefensette, J.: Lamarckian learning in multi-agent environment In: Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, CA, Morgan Kauffman (1994)Google Scholar
  3. 3.
    Kasprzyk, G.P., Jasku, M.: Application of hybrid genetic algorithms for deconvulation of electrochemical responses in SSLSV method. J. Electroanal. Chem. 567, 39–66 (2004)CrossRefGoogle Scholar
  4. 4.
    Chelouah, R., Siarry, P.: A hybrid method combining continuous Tabu search and Nelder–Mead simplex algorithm for global optimization of multiminima functions. Eur. J. Oper. Res. 161, 636–654 (2005)CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    Wang, L., Tang, F., Wu, H.: Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation. Appl. Math. Comput. 171, 1141–1156 (2005)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    Javadi, A., Farmani, A.R., Tan, T.P.: A hybrid intelligent genetic algorithm. Adv. Eng. Inf. 19, 255–262 (2005)CrossRefGoogle Scholar
  7. 7.
    Fan, S.K.S., Liang, Y.C., Zahara, E.: a genetic algorithm and a particle swarm optimizer hybridized with Nelder–Mead simplex search. Comput. Ind. Eng. 50, 401–425 (2006)CrossRefGoogle Scholar
  8. 8.
    Hwang, F.S., Song, H.R.: A hybrid real parameter genetic algorithm for function optimization. Adv. Eng. Inf. 20, 7–21 (2006)Google Scholar
  9. 9.
    Zhang, G., Lu, H.: Hybrid real coded genetic algorithm with quasi-simplex technique. Int. J. Comput. Sci. Netw. Secur. 6(10), 246–255 (2006)Google Scholar
  10. 10.
    Wei, L., Zhao, M.: A Nitche hybrid genetic algorithm for global optimization of continuous multi modal functions. Appl. Math. Comput. 160, 649–661 (2005)CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    Premalatha, K., Nataranjan, A.M.: Hybrid PSO and GA for global optimization. Int. J. Open Probl. Comput. Math. 2 (2009)Google Scholar
  12. 12.
    Khosravi, A., Lari, A., Addeh, J.: A new hybrid of evolutionary and conventional optimization algorithm. Appl. Math. Sci. 6, 815–825 (2012)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Ghatei, S., et al.: A new hybrid algorithm for optimization using PSO and GDA. J. Basic Appl. Sci. Res. 2, 2336–2341 (2012)Google Scholar
  14. 14.
    Esmin, A., Matwin, S.: A hybrid particle swarm optimization algorithm with genetic mutation. Int. J. Innovative Comput. Inf. Control 9, 1919–1934 (2013)Google Scholar
  15. 15.
    Zelinka I., Lampinen, J.: SOMA-self organizing migrating algorithm. In: Mendal, 6th International Conference on Soft Computing, Brno, Czech Republic, vol. 80, issue-2, p. 214 (2000)Google Scholar
  16. 16.
    Oplatkova, Z., Zelinka, I.: Investigation on Shannon-Kotelnik theorem impact on SOMA algorithm performance. In: Proceedings 19th European Conference on Modelling and Simulation Yuri Merkuryev, Richard Zobel (2005)Google Scholar
  17. 17.
    Zelinka, I.: Analytic programming by means of soma algorithm. In: Proceeding of 8th International Conference on Soft Computing Mendel ’02, Brno, Czech Republic, pp. 93–101 (2002). ISBN 80-214-2135-5Google Scholar
  18. 18.
    Nolle, L., Zelinka, I.: SOMA applied to optimum work roll profile selection in the hot rolling of wide steel. In: Proceedings of the 17th European Simulation Multiconference ESM 2003, Nottingham, UK, pp. 53–58 (2003). ISBN 3-936150-25-7, 9-11Google Scholar
  19. 19.
    Nolle, L., Zelinka, I., Hopgood, A.A., Goodyear, A.: Comparision of an self organizing migration algorithm with simulated annealing and differential evolution for automated waveform tuning. Adv. Eng. Softw. 36, 645–653 (2005)CrossRefGoogle Scholar
  20. 20.
    Nolle, L.: SASS applied to optimum work roll profile selection in the hot rolling of wide steel. Knowl. Based Syst. 20(2), 203–208 (2007)CrossRefGoogle Scholar
  21. 21.
    Zelinka, I., Lampinen, J., Nolle, L.: On the theoretical proof of convergence for a class of SOMA search algorithms. In: Proceedings of the 7th International MENDEL Conference on Soft Computing, Brno, CZ, pp. 103–110, 6–8 June 2001. ISBN 80-214-1894-XGoogle Scholar
  22. 22.
    Zelinka, I., Oplatkova, Z., Nolle, L.: Boolean symmetry function synthesis by means of arbitrary evolutionary algorithms—comparative study. In: Proceedings of the 18th European Simulation Multiconference ESM 2004, Magdeburg, Germany, pp. 143–148, June 2004. ISBN 3-936150-35-4, 13-14Google Scholar
  23. 23.
    Onwubolu, C.G., Babu, B.V.: New Optimization Techniques in Engineering. Springer, Heidelberg (2004). ISBN 3-540-20167-XCrossRefzbMATHGoogle Scholar
  24. 24.
    Prasad, B.N., Saini, J.S.: Optimal thermo hydraulic performance of artificially roughened solar air heaters. J. Solar Energy 47, 91–96 (1991)CrossRefGoogle Scholar
  25. 25.
    Pant, M.: Genetic Algorithms for Global Optimization and their Applications. Ph.D. thesis, Department of Mathematics, IIT Roorkee, Formerly University of Roorkee (2003)Google Scholar
  26. 26.
    Tsutsui, S., Fujimoto, Y.: Phenotypic forking genetic algorithm (p-fGA). In: IEEE International Conference on Evolutionary Computing (ICEC ’95), Vol. 2, pp. 556–572 (1995)Google Scholar
  27. 27.
    Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming Theory and Algorithms. Wiley, New York (1993)zbMATHGoogle Scholar
  28. 28.
    Ali, M.M., Khompatraporn, C., Zabinasky, Z.: A numerical evaluation of several global optimization algorithms on selected benchmark test problems. J. Global Optim. 31, 635–672 (2005)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Applied SciencesGautam Buddha UniversityGreater NoidaIndia
  2. 2.Indian Institute of Technology RoorkeeRoorkeeIndia

Personalised recommendations