Skip to main content

A priori comparison of binary crossover operators: No universal statistical measure, but a set of hints

  • Methodologies
  • Conference paper
  • First Online:
Artificial Evolution (AE 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1363))

Included in the following conference series:

Abstract

The choice of an operator in evolutionary computation is generally based on comparative runs of the algorithms. However, some statistical a priori measures, based on samples of (parents-offspring), have been proposed to avoid such brute comparisons. This paper surveys some of these works in the context of binary crossover operators. We first extend these measures to overcome some of their limitations. Unfortunately, experimental results on well-known binary problems suggest that any of the measures used here can give false indications. Being all defined as averages, they can miss the important parts: none of the tested measures have been found to be a good indicator alone. However, considering together the mean improvement to a target value and the Fitness Operator Correlation gives the best predictive results. Moreover, detailed insights on the samples, based on some graphical layouts of the best offspring fitnesses, seem to allow more accurate predictions on the respective performances of binary crossover operators.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Altenberg. The schema theorem and Price's theorem. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 23–49, San Mateo, CA, 1995. Morgan Kaufmann.

    Google Scholar 

  2. S. Baluja. An empirical comparizon of seven iterative and evolutionary function optimization heuristics. Technical Report CMU-CS-95-193, Carnegie Mellon University, 1995.

    Google Scholar 

  3. S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithms. In A. Prieditis and S. Russel, editors, Proceedings of ICML95, pages 38–46. Morgan Kaufmann, 1995.

    Google Scholar 

  4. Y. Davidor. Epistasis variance: A viewpoint on representations, GA hardness, and deception. Complex systems, 4:369–383, 1990.

    Google Scholar 

  5. D. B. Fogel and A. Ghozeil. Using fitness distributions to design more efficient evolutionary computations. In T. Fukuda, editor, Proceedings of the Third IEEE International Conference on Evolutionary Computation, pages 11–19. IEEE, 1996.

    Google Scholar 

  6. D. E. Goldberg and M. Rudnick. Genetic algorithms and the variance of fitness. Complex Systems, 5:266–278, 1991.

    Google Scholar 

  7. J. J. Grefenstette. Predictive models using fitness distributions of genetic operators. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 139–161. Morgan Kaufmann, 1995.

    Google Scholar 

  8. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L. J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 184–192. Morgan Kaufmann, 1995.

    Google Scholar 

  9. L. Kallel and M. Schoenauer. Alternative random initialization in genetic algorithms. In Th. Bieck, editor, Proceedings of the 7th International Conference on Genetic Algorithms. Morgan Kaufmann, 1997. To appear.

    Google Scholar 

  10. B. Manderick, M. de Weger, and P. Spiessens. The genetic algorithm and the structure of the fitness landscape. In R. K. Belew and L. B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 143–150. Morgan Kaufmann, 1991.

    Google Scholar 

  11. M. Mitchell and J.H. Holland. When will a genetic algorithm outperform hill-climbing ? In S. Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, page 647, 1993.

    Google Scholar 

  12. N. J. Radcliffe and P. D. Surry. Fitness variance of formae and performance prediction. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 51–72. Morgan Kaufmann, 1995.

    Google Scholar 

  13. I. Rechenberg. Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart, 1973.

    Google Scholar 

  14. J. D. Schaffer, R. A. Caruana, L. Eshelman, and R. Das. A study of control parameters affecting on-line performance of genetic algorithms for function optimization. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 51–60. Morgan Kaufmann, 1989.

    Google Scholar 

  15. E.D. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325–336, 1990.

    Google Scholar 

  16. D. Whitley. Fundamental principles of deception in genetic search. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jin-Kao Hao Evelyne Lutton Edmund Ronald Marc Schoenauer Dominique Snyers

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kallel, L., Schoenauer, M. (1998). A priori comparison of binary crossover operators: No universal statistical measure, but a set of hints. In: Hao, JK., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1997. Lecture Notes in Computer Science, vol 1363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026608

Download citation

  • DOI: https://doi.org/10.1007/BFb0026608

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64169-8

  • Online ISBN: 978-3-540-69698-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics