Abstract convex evolutionary search

FOGA'11 - Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI

Volumn , Issue , 2011, Pages 151-162

  Moraglio, Alberto ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY SEARCH; FITNESS LANDSCAPE; GEOMETRIC CONDITIONS; GEOMETRIC CROSSOVER; RECOMBINATION OPERATORS; SEARCH SPACES; SELECTION MECHANISM;

GEOMETRY; MATHEMATICAL OPERATORS;

GENETIC ALGORITHMS;

EID: 79956020561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967668     Document Type: Conference Paper

References (21)

1. Blumental and Menger. Studies in geometry. Freeman and Company, 1970.
2. K. D. Boese, A. B. Kahng, and S. Muddu. A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 15:101-113, 1994.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
4. K. DeJong. Evolutionary computation: a unified approach. The MIT Press, 2006.
5. J. W. Green. Approximately convex functions. Duke Mathematical Journal, 19:499-504, 1952.
6. W. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
7. P. Merz and B. Freisleben. Fitness landscapes and memetic algorithms. In D. Corne, M. Dorigo, and F. Glover, editors, New ideas in optimization. McGraw-Hill, 1999.
8. E. H. Moore. Definition of limit in general integral analysis. In Proceedings of the National Academy of Sciences of the United States of America, volume 1, pages 628-632, 1915.
9. A. Moraglio. Towards a geometric unification of evolutionary algorithms. PhD thesis, University of Essex, 2007.
10. A. Moraglio and R. Poli. Topological interpretation of crossover. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1377-1388, 2004. (Pubitemid 39747323)
11. K. Murota. Discrete convex analysis. Mathematical Programming, 83(1-3):313-371, 1998. (Pubitemid 128431419)
12. N. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183-205, 1991.
13. C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44:3-54, 2002. (Pubitemid 34410091)
14. F. Rothlauf. Representations for Genetic and Evolutionary Algorithms. Springer, 2002.
15. J. E. Rowe, M. D. Vose, and A. H. Wright. Group properties of crossover and mutation. Evolutionary Computation Journal, 10(2):151-184, 2002.
16. I. Singer. Abstract Convex Analysis. Wiley, 1997.
17. V. P. Soltan. Introduction to the Axiomatic Theory of Convexity. Shtinitsa, 1984.
18. C. R. Stephens and A. Zamora. EC theory: A unified viewpoint. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1394-1405, 2003.
19. P. D. Surry and N. J. Radcliffe. Formal algorithms + formal representations = search strategies. In Proceedings of Parallel Problem Solving from Nature Conference, pages 366-375, 1996. (Pubitemid 126128325)
20. M. van de Vel. Theory of Convex Structures. Elsevier, Amsterdam, 1993.
21. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transaction on Evolutionary Computation, 1(1):67-82, 1996. (Pubitemid 127771019)