• Published 1996

An Empirical Comparison of Seven Iterative and Evolutionary Heuristics for Static Function Optimization ( Extended Abstract )

@inproceedings{Baluja1996AnEC,
  title={An Empirical Comparison of Seven Iterative and Evolutionary Heuristics for Static Function Optimization ( Extended Abstract )},
  author={Shumeet Baluja},
  year={1996}
}
I This report is a summary of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are exumined. The search spaces in these problems range from Z3Oo to 22040. The results indicate that using standard genetic algorithms for the optimization of staticfunctions does not yield a benefit… CONTINUE READING

Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

An Estimation of Distribution Algorithm Based Portfolio Selection Approach

Using a priori knowledge to create probabilistic models for optimization

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

expected) Ph.D. Thesis, University of California at Berkeley

  • A. Juels
  • 1996

Genetic Algorithms. 9-14

  • CA
  • Morgan Kaufmann Publishers. San Mateo, CA. uling Problems”
  • 1994

A Promising Genetic Algorithm Approach to JobShop Scheduling , Rescheduling , and OpenShop SchedForrest , S . and Mitchell , M ( 1993 ) ‘ What Makes a Problem Hard for a Genetic Algorithm ”

  • D. Come
  • Machine Learning
  • 1993