Abstract
Genetic algorithm (GA) is one of the most popular and robust stochastic optimization tools used in various fields of research and industrial applications. It had been applied for solving many global optimization problems for the last few decades. However, it has a poor theoretical assurance to reach the globally optimal solutions, while solving the complex multi-modal problems. Restart strategy plays an important role in overcoming this limitation of a GA to a certain extent. Although there are a few restart methods available in the literature, these are not adequate. In this paper, a novel restart strategy is proposed for solving complex multi-modal optimization problems using a real-coded genetic algorithm (RCGA). To show the superiority of the proposed scheme, ten complex multi-modal test functions have been selected from the CEC 2005 benchmark functions and its results are compared with that of the other strategies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Liberti, L., Kucherenko, S.: Comparison of deterministic and stochastic approaches to global optimization. Int. Trans. Oper. Res. 12(3), 263–285 (2005)
Moles, C.G., Mendes, P., Banga, J.R.: Parameter estimation in biochemical pathways: a comparison of global optimization methods. Genome Res. 13(11), 2467–2474 (2003)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)
Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29–41 (1996)
Yang, X.-S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2010)
Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), pp. 65–74. Springer, Heidelberg (2010)
Wang, Y., Huang, J., Dong, W.S., Yan, J.C., Tian, C.H., Li, M., Mo, W.T.: Two-stage based ensemble optimization framework for large-scale global optimization. Eur. J. Oper. Res. 228(2), 308–320 (2013)
Ng, C.-K., Li, D.: Test problem generator for unconstrained global optimization. Comput. Oper. Res. 51(Suppl. C), 338–349 (2014)
dos Santos Coelho, L., Ayala, H.V.H., Mariani, V.C.: A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization. Appl. Math. Comput. 234(Suppl. C), 452–459 (2014)
Boender, C.G.E., Romeijin, H.E.: Stochastic methods. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization. Kluwer Academic Publishers, Boston (1995)
Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical report, Nanyang Technological University, Singapore, May 2005 and KanGAL Report 2005, IIT Kanpur, India (2005)
Ghannadian, F., Alford, C., Shonkwiler, R.: Application of random restart to genetic algorithms. Inf. Sci. 95(1), 81–102 (1996)
Beligiannis, G.N., Tsirogiannis, G.A., Pintelas, P.E.: Restartings: a technique to improve classic genetic algorithms’ performance. In: International Conference on Computational Intelligence 2004, pp. 404–407 (2004)
Hughes, J.A., Houghten, S., Ashlock, D.: Recentering and restarting a genetic algorithm using a generative representation for an ordered gene problem. Int. J. Hybrid Intell. Syst. 11(4), 257–271 (2014)
Dao, S.D., Abhary, K., Marian, R.: An improved structure of genetic algorithms for global optimisation. Prog. Artif. Intell. 5(3), 155–163 (2016)
Suksut, K., Kerdprasop, K., Kerdprasop, N.: Support vector machine with restarting genetic algorithm for classifying imbalanced data. Int. J. Futur. Comput. Commun. 6(3), 92 (2017)
Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Found. Genet. Algorithms 1, 69–93 (1991)
Agrawal, R.B., Deb, K.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115–148 (1995)
Deb, K., Goyal, M.: A combined genetic adaptive search (GeneAS) for engineering design. Comput. Sci. inf. 26, 30–45 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Das, A.K., Pratihar, D.K. (2018). A Novel Restart Strategy for Solving Complex Multi-modal Optimization Problems Using Real-Coded Genetic Algorithm. In: Abraham, A., Muhuri, P., Muda, A., Gandhi, N. (eds) Intelligent Systems Design and Applications. ISDA 2017. Advances in Intelligent Systems and Computing, vol 736. Springer, Cham. https://doi.org/10.1007/978-3-319-76348-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-76348-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76347-7
Online ISBN: 978-3-319-76348-4
eBook Packages: EngineeringEngineering (R0)