Modeling Simple Genetic Algorithms for Permutation Problems

https://doi.org/10.1016/B978-1-55860-356-1.50013-3Get rights and content

Abstract

An exact model of a simple genetic algorithm is developed for permutation based representations. Permutation based representations are used for scheduling problems and combinatorial problems such as the Traveling Salesman Problem. A remapping function is developed to remap the model to all permutations in the search space. The mixing matrices for various permutation based operators are also developed.

References (16)

  • Bridges, C., and Goldberg, D. (1987) An analysis of reproduction and crossover in a binary-coded genetic Algorithm....
  • Davis, L. (1985) Applying Adaptive Algorithms to Epistatic Domains. Proc. International Joint Conf. on Artificial...
  • DebK. et al.

    Analyzing Deception in Trap Functions

  • GoldbergD.

    Simple Genetic Algorithms and the Minimal, Deceptive Problem

  • GoldbergD.

    Genetic Algorithms in Search, Optimization and Machine Learning

    (1989)
  • Goldberg, D., and Lingle, R. Jr., (1985) Alleles, Loci, and the Traveling Salesman Problem. Proc. 1st International...
  • GrefenstetteJ.

    Deception Considered Harmful

  • KarguptaH. et al.

    Ordering Genetic Algorithms and Deception

There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1995 Morgan Kaufmann Publishers, Inc. Published by Elsevier Inc. All rights reserved.