On decision-making in strong hybrid evolutionary algorithms

1. J.E. Beasley. Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069–1072, 1990.

   Google Scholar 

2. C. Cotta. On resampling in nature-inspired heuristics. In V. Botti, editor, Proceedings of the Seventh Conference of the Spanish Association for Artificial Intelligence, pages 145–154, 1997. In Spanish.

   Google Scholar 

3. C. Cotta and J.M. Troya. A hybrid genetic algorithm for the 0–1 multiple knapsack problem. In G.D. Smith, N.C. Steele, and R.F. Albrecht, editors, Artificial Neural Networks and Genetic Algorithms: Proceedings of the Third International Conference, pages 251–255, Wien, 1997. Springer-Verlag.

   Google Scholar 

4. D.E. Goldberg. Genetic algorithms and walsh functions: Parts i and ii. Complex Systems, 3:129–171, 1989.

   MATH  MathSciNet  Google Scholar 

5. W.E. Hart and R.K. Belew. Optimizing an arbitrary function is hard for the genetic algorithm. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 190–195, San Mateo, CA, 1991. Morgan Kaufmann.

   Google Scholar 

6. T.C. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, 1995.

   Google Scholar 

7. S. Khuri, T. Baeck, and J. Heitkoetter. The zero/one multiple knapsack problem and genetic algorithms. In E. Deaton, D. Oppenheim, J. Urban, and H. Berghel, editors, Proceedings of the 1994 ACM Symposium on Applied Computation, pages 188–193. ACM Press, 1994.

   Google Scholar 

8. Z. Michalewicz. A hierarchy of evolution programs: An experimental study. Evolutionary Computation, 1(1):51–76, 1993.

   Article  Google Scholar 

9. N.J. Radcliffe. Forma analysis and random respectful recombination. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 222–229, San Mateo, CA, 1991. Morgan Kaufmann.

   Google Scholar 

10. N.J. Radcliffe. The algebra of genetic algorithms. Annals of Maths and Artificial Intelligence, 10:339–384, 1994.

    Article  MATH  MathSciNet  Google Scholar 

11. N.J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183–205, 1994.

    MathSciNet  Google Scholar 

12. N.J. Radcliffe and P.D. Surry. Fitness variance of formae and performance prediction. In L. Whitley and M. Vose, editors, Foundations of Genetic Algorithms 3, pages 339–384. Morgan Kaufmann, 1994.

    Google Scholar 

13. N.J. Radcliffe and P.D. Surry. Fundamental limitations of search algorithms: Evolutionary computing in perspective. In J. Van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 255–291. Springer-Verlag, 1995.

    Google Scholar 

14. R.H. Storer, S.D. Wu, and R. Vaccari. New search spaces for sequencing problems with application to job-shop scheduling. Management Science, 38:1495–1509, 1992.

    Article  MATH  Google Scholar 

15. D.H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute, 1995.

    Google Scholar 

Download references