Summary: Permutation Based GAs and Ordered Greed
Peter G. Anderson,
Computer Science Department
Rochester Institute of Technology,
Rochester, New York
anderson@cs.rit.edu http://www.cs.rit.edu/
February 2004
pg. 1
Abstract
Now, it gets interesting! Permutation-based GAs are fun!
Herein presenting crossover methods for permutations (that
preserve permutations).
Also: ordered greed.
pg. 2
Permutations: Now it Gets Interesting!
Use permutations when bit strings fall short:
· N Queens
· Assigning people to jobs.
· Assigning professors to sections.
· Assigning tasks to computers.

Source: Anderson, Peter G. - Department of Computer Science, Rochester Institute of Technology

Collections: Computer Technologies and Information Sciences