Effective and Efficient Caching in Genetic Algorithms

@article{Santos2001EffectiveAE,
  title={Effective and Efficient Caching in Genetic Algorithms},
  author={Eunice E. Santos and Eugene Santos},
  journal={International Journal on Artificial Intelligence Tools},
  year={2001},
  volume={10},
  pages={273-301}
}
Hard discrete optimization problems using randomized methods such as genetic algorithms require large numbers of samples from the solution space. Each candidate sample/solution must be evaluated using the target fitness/energy function being optimized. Such fitness computations are a bottleneck in sampling methods such as genetic algorithms. We observe that the caching of partial results from these fitness computations can reduce this bottleneck. We provide a rigorous analysis of the run-times… CONTINUE READING
4 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Efficiency of parallel genetic algorithms for protein folding on the 2-d hp model

  • Eunice E. Santos, Lin Lu, Eugene Santos, Jr.
  • Proceedings of the Fifth Joint Conferences on…
  • 2000
1 Excerpt

On the complexity of protein folding

  • Pieluigi Crescenzi, Deborah Goldman, Mihalis Yannakanis
  • Journal of Computational Biology,
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…