Skip to main content

Advertisement

SpringerLink
Log in

Robust confidence intervals applied to crossover operator for real-coded genetic algorithms

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this work we propose a new approach to crossover operators for real-coded genetic algorithms based on robust confidence intervals. These confidence intervals are an alternative to standard confidence intervals. In this paper, they are used for localising the search regions where the best individuals are placed. Robust confidence intervals use robust localization and dispersion estimators that are highly recommendable when the distribution of the random variables is not known or is distorted. Both situations are likely when we are dealing with the best individuals of the population, especially if the problem under study is multimodal. The performance of the crossovers based on robust intervals is evaluated using a well characterised set of optimisation problems. We have chosen problems with different features of modality, separability, regularity, and correlation among their variables. The results show that the performance of the crossovers based on robust confidence intervals is less dependent on the problem than the performance of the crossovers based on Gaussian confidence intervals. We have also made comparisons between several standard crossovers that show very interesting results, which support the idea underlying the defined operators.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ackley D (1987) An empirical study of bit vector function optimisation. Genet algorithms Simul Annealing. Morgan Kaufmann, Sanfrancisco, pp 170–215

  • Baker JE (1985) Adaptive selection methods for genetic algorithms. In: Grefenstette JJ (ed) 1st International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates, Hillsdale, pp 101–111

  • Bäck JH (1996). Evolutionary algorithms in theory and practice. Oxford University Press, Oxford

    MATH  Google Scholar 

  • Bäck T, Fogel D and Michalewicz Z (1997). Handbook of evolutionary computation. Institute of Physics Publishing Ltd, Bristol and Oxford University Press, New York

    MATH  Google Scholar 

  • Bebis G, Georgiopoulos M and Kasparis T (1997). Coupling weight elimination with genetic algorithms to reduce network size and preserve generalization. Neurocomputing 17: 167–194

    Article  Google Scholar 

  • Bersini H, Dorigo M, Langerman S, Seront G, Gambardella LM (1996) Results of the first international contest on evolutionary optimisation (1st iceo). In: Proceedings of IEEE international conference on evolutionary computation, IEEE-EC 96, IEEE Press, Nagoya, Japan, May 20–22, pp 611–615

  • De Jong KD (1975) An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, Departament of Computer and Communication Sciences, University of Michigan, Ann Arbor

  • Deb K and Agrawal RB (1995). Simulated binary crossover for continuous search space. Complex Syst 9(2): 115–148

    MATH  MathSciNet  Google Scholar 

  • Deb K and Beyer H-G (2001). Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2): 195–219

    Article  Google Scholar 

  • Dunn OJ and Clark V (1974). Applied statistics: analysis of variance and regression. Wiley, New York

    MATH  Google Scholar 

  • Eiben AE and Bäck Th (1997). Empirical investigation of multi-parent recombination operators in evolution strategies. Evol Comput 5(3): 347–365

    Article  Google Scholar 

  • Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and interval-shemata. In: Darrell Whitley L (ed) Foundation of genetic algorithms, vol 2. Morgan Kaufmann, San Mateo, pp 187C3.3.7: 1–C3.3.7:8.–202

  • Fletcher R and Powell MJD (1963). A rapidly convergent descent method for minimization. Comput J 6(2): 163–168

    MATH  MathSciNet  Google Scholar 

  • Friedman JH (1994) An overview of predictive learning and function approximation. In: Cherkassky V, Friedman JH, Wechsler H (eds) From statistics to neural networks, theory and pattern recognition applications. NATO ASI Series F, vol 136. Springer, Heidelberg, pp 1–61

  • Garcfa-Pedrajas N, Hervás-Martfnez C and Ortiz-Boyer D (2005). Cooperative coevolution of artificial neural network ensembles for pattern classification. IEEE Trans Evol Comput 9(3): 271–302

    Article  Google Scholar 

  • Goldberg DE (1989). Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York

    MATH  Google Scholar 

  • Gross A (1976). Confidence interval robustness with long-tailed symmetric distributions. J Am Stat Assoc 71(354): 409–416

    Article  MATH  Google Scholar 

  • Hajela P (2002). Soft computing in multidisciplinary aerospace design-new direction for research. Prog Aerosp Sci 38(1): 1–21

    Article  Google Scholar 

  • Hampel FR (1974). The influence curve and its role in robust estimation. J Am Stat Assoc 69: 383–393

    Article  MATH  MathSciNet  Google Scholar 

  • Herrera F, Lozano M and Sánchez AM (2005). Hybrid crossover operators for real-coded genetic algorithms: an experimental study. Soft Comput 9(4): 280–298

    Article  MATH  Google Scholar 

  • Herrera F and Lozano M (2000). Gradual distributed real-coded genetic algorithms. IEEE Trans Evol Comput 4(1): 43–63

    Article  Google Scholar 

  • Herrera F, Lozano M and Sánchez AM (2003). A taxonomy for the crossover operator for real-coded genetic algorithms: an experimental study. Int J Intell Syst 18: 309–338

    Article  MATH  Google Scholar 

  • Hervás-Martfnez C and Ortiz-Boyer D (2005). Analyzing the statistical features of cixl2 crossover offspring. Soft Comput 9(4): 270–279

    Article  Google Scholar 

  • Hettmansperger TP and McKean JW (1998). Robust nonparametric statistical methods. Arnold John/Wiley, London/New York

    MATH  Google Scholar 

  • Huber PJ (1972). Robust statistics: a review. Ann Math Stat 43(4): 1041–1067

    Article  MathSciNet  Google Scholar 

  • Huber PJ (1981). Robust statistics. Wiley, New York

    MATH  Google Scholar 

  • Kendall M and Stuart S (1977). The advanced theory of statistics, vol 1. Distribution Theory. Griffin & Company, London

    MATH  Google Scholar 

  • Kita H (2001). A comparison study of self-adaptation in evolution strategies and real-code genetic algorithms. Evol Comput 9(2): 223–241

    Article  MathSciNet  Google Scholar 

  • Kita H, Ono I, Kobayashi S (1998) Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms. In: IEEE International Conference on Evolutionary Computation ICEC’98, pp 529–534, Anchorage, Alaska, USA, 5–9

  • Levene H (1960) In contributions to probability and statistics. Essays in Honor of Harold Hotelling, pp 278–292

  • Michalewicz Z (1992). Genetic algorithms + data structures = evolution programs. Springer, New York

    MATH  Google Scholar 

  • Miller RG (1981). Simultaneous statistical inference, 2nd edn. Wiley, New York

    Google Scholar 

  • Miller RG (1996). Beyond ANOVA, basics of applied statistics. Chapman & Hall, London

    Google Scholar 

  • Mosteller F and Tukey JW (1977). Data analysis and regression. Addison-Wesley, Reading

    Google Scholar 

  • Neyman J (1937). Outline of a theory of statistical estimation based on the classical theory of probability. Philos Trans R Soc Lond A 236: 333–380

    Article  Google Scholar 

  • Ono I, Kobayashi S (1997) A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In: 7th International Conference on Genetic Algorithms, pp 246–253, July, Michigan State University, Morgan Kaufman, Michigan, USA

  • Ortiz-Boyer D, Hervás-Martfnez C and Garcfa-Pedrajas N (2005). Cixl2: A crossover operator for evolutionary algorithms based on population features. J Artif Intell Res 24: 1–48

    Article  MATH  Google Scholar 

  • Ortiz-Boyer D, Hervás-Martfnez C, Muñoz-PTrez J (2003) Metaheuristics: computer decision-making. Study of genetic algorithms with crossover based on confidence intervals as an alternative to classic least squares estimation methods for non-linear models, pp 127–151. Kluwer, Dordrecht

  • Rastrigin LA (1974) Extremal control systems. In: Theoretical foundations of engineering cybernetics series. Nauka, Russian, Moscow

  • Rosenbrock HH (1960). An automatic method for finding the greatest or least value of a function. Comput J 3(3): 175–184

    Article  MathSciNet  Google Scholar 

  • Rudolph G (2001). Self-adaptive mutations may lead to premature convergence. IEEE Trans Evol Comput 5(4): 410–414

    Article  Google Scholar 

  • Satoh H, Yamamura M, Kobayashi S (1996) Minimal generation gap model for gas considering both exploration and exploitation. In: Proceeding of the IIZUKA: methodologies for the conception, design, and application of intelligent Systems, pp 494–497

  • Schlierkamp-Voosen D (1994) Strategy adaptation by competition. In: Second European congress on intelligent techniques and soft computing, pp 1270–1274

  • Schwefel HP (1981) Numerical optimization of computer models. English translation of Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie (1977). Wiley, New York

  • Schwefel HP (1995) Evolution and optimum seeking. Wiley

  • Snedecor GW and Cochran WG (1980). Statistical methods. Iowa State University Press, Ames

    Google Scholar 

  • Spedicato E (1975) Computational experience with quasi-newton algorithms for minimization problems of moderately large size. Technical Report CISE-N-175, Centro Informazioni Studi Esperienze, Segrate (Milano), Italy

  • Tamhane AC and Dunlop DD (2000). Statistics and data analysis. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Tucker A, Crampton J and Swift S (2005). Rgfga: an efficient representation and crossover for grouping genetic algorithms. Evol Comput 13(4): 477–499

    Article  Google Scholar 

  • Whitley D, Mathias K, Rana S and Dzubera J (1996). Evaluating evolutionary algorithms. Artif Intell 85(1–2): 245–276

    Article  Google Scholar 

  • Wolpert DH and Macready WG (1997). The no free lunch theorems for optimization. IEEE Trans Evol Comput 1(1): 67–82

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Numerical Analysis, University of Córdoba, Córdoba, Spain

    Domingo Ortiz-Boyer, César Hervás-Martínez & Nicolás García-Pedrajas

Authors
  1. Domingo Ortiz-Boyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. César Hervás-Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolás García-Pedrajas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Domingo Ortiz-Boyer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ortiz-Boyer, D., Hervás-Martínez, C. & García-Pedrajas, N. Robust confidence intervals applied to crossover operator for real-coded genetic algorithms. Soft Comput 12, 809–833 (2008). https://doi.org/10.1007/s00500-007-0237-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-007-0237-0

Keywords

Search

Navigation