Skip to main content
Springer Nature Link
Log in

An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

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

Included in the following conference series:

  • 1204 Accesses

Abstract

This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the combined effect of the reordering operator and tournament selection, and the numerical solutions are presented as well. Pairwise, s-ary, and probabilistic tournament selection are all included in the proposed model. It is also demonstrated that the upper bound of the probability to apply the reordering operator, previously derived with proportionate selection, does not affect the performance. Therefore, tournament selection is a necessity when using a reordering operator in a genetic algorithm to handle the conditions studied in the present work.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Goldberg, D.E., Deb, K., Clark, J.H.: Genetic algorithms, noise, and the sizing of populations. Complex Systems 6 (1992) 333–362

    MATH  Google Scholar 

  2. Goldberg, D.E., Deb, K., Thierens, D.: Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers 32 (1993) 10–16

    Google Scholar 

  3. Goldberg, D.E., Bridges, C.L.: An analysis of a reordering operator on a GA-hard problem. Biological Cybernetics 62 (1990) 397–405

    Article  MATH  Google Scholar 

  4. Bagley, J.D.: The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan (1967) (University Microfilms No. 68–7556).

    Google Scholar 

  5. Cavicchio, Jr., D.J.: Adaptive Search Using Simulated Evolution. Unpublished doctoral dissertation, University of Michigan, Ann Arbor, MI (1970) (University Microfilms No. 25–0199).

    Google Scholar 

  6. Frantz, D.R.: Non-linearities in genetic adaptive search. PhD thesis, University of Michigan (1972) (University Microfilms No. 73–11,116).

    Google Scholar 

  7. Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI (1975)

    Google Scholar 

  8. Smith, S.F.: A learning system based on genetic adaptive algorithms. Dissertation Abstracts International 41 (1980) 4582B (University Microfilms No. 81–12638).

    Google Scholar 

  9. Davis, L., Smith, D.: Adaptive design for layout synthesis. Internal report, Texas Instruments, Dallas (1985)

    Google Scholar 

  10. Davis, L.: Applying adaptive algorithms to epistatic domains. Proceedings of the 9th International Joint Conference on Artificial Intelligence 1 (1985) 162–164

    Google Scholar 

  11. Goldberg, D.E., Lingle, Jr., R.: Alleles, loci, and the traveling salesman problem. Proceedings of an International Conference on Conference on Genetic Algorithms (1985) 154–159

    Google Scholar 

  12. Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms (1987) 224–230

    Google Scholar 

  13. Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: The genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms (1989) 133–140

    Google Scholar 

  14. Banzhaf, W.: The ‘molecular’ traveling salesman. Biological Cybernetics 64 (1990) 7–14

    Article  MATH  Google Scholar 

  15. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., Whitley, C.: A comparison of genetic sequencing operators. Proceedings of the Fourth International Conference on Genetic Algorithms (1991) 69–76

    Google Scholar 

  16. Goldberg, D.E.: Simple genetic algorithms and the minimal, deceptive problem. In Davis, L., ed.: Genetic algorithms and simulated annealing. Morgan Kaufmann Publishers, Inc., Los Altos, CA (1987) 74–88

    Google Scholar 

  17. Yamamura, M., Satoh, H., Kobayashi, S.: An Markov analysis of generation alternation models on minimal deceptive problems. In Wang, P.P., ed.: International Conference of Information Sciences: Fuzzy Logic, Intelligent Control & Genetic Algorithm. Volume 1., Durham, NC, Duke University (1997) 47–50

    Google Scholar 

  18. Novkovic, S., Šverko, D.: The minimal deceptive problem revisited: the role of ‘genetic waste’. Computers and Operations Research 25 (1998) 895–911

    Article  MATH  Google Scholar 

  19. Grefenstette, J.J.: Deception considered harmful. Foundations of Genetic Algorithms 2 (1993) 75–91

    Google Scholar 

  20. Forrest, S., Mitchell, M.: What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation. Machine Learning 13 (1993) 285–319

    Article  Google Scholar 

  21. Naudts, B., Verschoren, A.: Epistasis and deceptivity. Simon Stevin-Bulletin of the Belgian Mathematical Society 6 (1999) 147–154

    MATH  MathSciNet  Google Scholar 

  22. Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Foundations of Genetic Algorithms 1 (1991) 69–93 (Also TCGA Report 90007).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Department of General Engineering, University of Illinois, Urbana, IL, 61801, USA

    Ying-ping Chen

  2. Department of General Engineering, University of Illinois, Urbana, IL, 61801, USA

    David E. Goldberg

Authors
  1. Ying-ping Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David E. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lawrence Livermore National Laboratory, Center for Applied Scientific Computing (CASC), 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Yp., Goldberg, D.E. (2003). An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics