- Code for a
**binary genetic algorithm**while working thought the book:- binary_GA_Script.m (the main driver script with an example call)

- binary_GA.m (the main function)

- Needed subroutines
- var_encode.m (encode continuous variables into a binary representation)

- var_decode.m (undoes the binary encoding)

- var_encode_decode_Script.m (tests and verifies the above two routines)

- enforce_bounds.m (makes sure randomly generated trial points are inside the given finite domain)

- select_mates.m (implements various ways of selecting the parents)

- crossover.m (implements various crossover methods)

- mutate.m (implements the mutation procedure)

- var_encode.m (encode continuous variables into a binary representation)

- binary_GA_Script.m (the main driver script with an example call)
- chap_2_prob_7.m (experiments with binary genetic algorithms)

John Weatherwax Last modified: Sun May 15 03:46:24 EDT 2005