Abstract
Reduction of the search space to the feasible region with global optimum is one of the approaches that can significantly improve the efficiency of a GA. This study focuses on the modelling of a GA with dynamical adjustment of a search space size to analytically establish the setting of a parameter k, which specifies a ratio of narrowing the boundaries of a search space. A general form of real valued version of one-max problem, which is a general linear pseudo-Boolean function with positive coefficients, is applied to analyse a GA with an adjustment of a search space size. The paper assesses an influence of a parameter k to an accuracy and velocity of the convergence of GA to an optimal solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amirjanov A (2004) A changing range genetic algorithm. Int J Numer Methods Eng 61(15):2660–2674
Amirjanov A (2006) The development a changing range genetic algorithm. Comput Methods Appl Mech Eng 195:2495–2508
Amirjanov A (2008) Modelling the dynamics of an adjustment of a search space size in a genetic algorithm. Int J Mod Phys C 19:1047–1062
Amirjanov A (2010) The dynamics of a changing range genetic algorithm. Int J Numer Meth Eng 81(15):892–909
Blickle T, Thiele L (1997) A comparison of selection schemes used in evolutionary algorithms. Evol Comput 4(4):361–394
Chelouah R, Siarry P (2000) A continuous genetic algorithm designed for the global optimization of multimodal functions. J Heuristics 6:191–213
Coello Coello CA (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191:1245–1287
Djurisic A, Elazar J, Rakic A (1997) Genetic algorithms for continuous optimization problems: a concept of parameter-space size adjustment. J Phys A 30:7849–7861
Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York
Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading Menlo Park
Hernández-Aguirre A, Botello-Rionda S, Coello Coello CA et al (2004) Handling constraints using multiobjective optimization concepts. Int J Numer Methods Eng 59(15):1989–2017
Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs. Springer-Verlag, New York
Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1–32
Miller B, Goldberg D (1997) Genetic algorithms, selection schemes, and the varying effects of noise. Evol Comput 4(2):113–131
Prügel-Bennett A, Shapiro J (1997) The dynamics of a genetic algorithm for simple random Ising systems. Physica D 104:75–114
Rogers A, Prügel-Bennett A (2000) The dynamics of a genetic algorithm on a model hard optimization problem. Complex Syst 11(6):437–464
Shapiro L (2001) Statistical mechanics theory of genetic algorithms. In: Kallel L, Naudts B, Rogers A (eds) Theoretical aspects of evolutionary computing. Springer, Berlin
Spiegel M (1971) Calculus of finite differences and difference equations. McGraw-Hill, Boston
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Amirjanov, A. The parameters setting of a changing range genetic algorithm. Nat Comput 14, 331–338 (2015). https://doi.org/10.1007/s11047-014-9420-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-014-9420-2