Code and Results for Chapter 5

• optimization.py
  
  • many optimization routines now accept a user provided starting location
  • randomoptimize now keeps track of the random inputs tried so we don't retry them when searching
  • implements multiple start annealing
  • implements a quicker exit if best solution does not change after ten iterations
  • fixes small bug in geneticoptimize in coding of the mutation operation function mutate
  • fixed bug in hillclimb having to do with trying solutions that were not allowable (one outside of the input domain)
• run_all.py (runs and demonstrates some of the above additions)