Skip to main content

The Use of a Variable Length Chromosome for Permutation Manipulation in Genetic Algorithms

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

Permutations are difficult to represent and manipulate as chromosomes in genetic algorithms. Simple crossover often yields illegal solutions, and repair mechanisms appear to be very disruptive. A new chromosome structure, the Variable Length Sequence (VLS), and associated operators have been developed. The rationale is that the crossover should guarantee that the resulting solution is legal, and that the effect of disruption should be reduced by the retention of genetic memory within the chromosome. VLS is applied to the travelling salesman problem (TSP), and the results compared with those obtained using the PMX and C1 operators. VLS out-performs the other operators over a wide range of parameters.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.E. and Lingle, R.: Alleles, Loci, and the Travelling Salesman Problem. International Conference on Genetic Algorithms and Their Applications, pp 154–159. Hillsdale, NJ: Lawrence Erlbaum Associates 1985.

    Google Scholar 

  2. Reeves, C. Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Press 1993.

    Google Scholar 

  3. Dawkins, R.: The Blind Watchmaker. London: The Penguin Group 1991.

    Google Scholar 

  4. Dulbecco, R.: The Design of Life. Yale University 1987.

    Google Scholar 

  5. Jones, R.N. and Karp, A.: Introducing Genetics. London: John Murray (Publishers) Ltd. 1986

    Google Scholar 

  6. Lloyd, J.R.: Genes and Chromosomes. Basingstoke: Macmillan Education Ltd. 1986.

    Google Scholar 

  7. McLannahan, H.: Heredity and Variation. In Skelton, P. (ed.): Evolution: A Biological and Palaeontological Approach. Wokingham: Addison-Wesley Publishing Company 1993.

    Google Scholar 

  8. Levenick, J. R.: Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology. Proceedings of the Fourth International Conference on Genetic Algorithms, pp 123–127. Los Altos, CA: Morgan Kaufmann.

    Google Scholar 

  9. De Jong, K.A. Doctoral Dissertation. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. University of Michigan 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Robbins, P. (1995). The Use of a Variable Length Chromosome for Permutation Manipulation in Genetic Algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7535-4_39

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82692-8

  • Online ISBN: 978-3-7091-7535-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics