How to use the scuba diving metaphor to solve problem with neutrality ?

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 166-170

  Philippe, Collard ^a   Sébastien, Verel ^a   Manuel, Clergue ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

COMPARATIVES STUDIES; EVOLVABILITY; FITNESS LANDSCAPE; LOCAL SEARCH HEURISTICS; MANHATTAN METRIC; NATURAL EVOLUTION; REAL-WORLD PROBLEM; SCUBA DIVING; SEARCH HEURISTICS; TRAVEL DISTANCE;

TRAVELING SALESMAN PROBLEM;

EID: 85017406530     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. Lee Altenberg, The evolution of evolvability in genetic programming', in In Kinnear, Kim (editor). Advances in Genetic Programming. Cambrige, MA, pp. 47-74. The MIT Press, (1994).
2. Lionel Barnett, Netcrawling - optimal evolutionary search with neutral networks, in IEEE Congress on Evolutionary Computation 2001, pp. 30.37, COEX, World Trade Center, 159 Samseong-dong, Gangnamgu, Seoul, Korea, (2001). IEEE Press.
3. A. Chakraborti and B.K. Chakrabarti, The travelling salesman problem on randomly diluted lattices: Results for small-size systems, The European Physical Journal B, 16(4), 677-680, (2000).
4. N. Geard, J. Wiles, J. Hallinan, B. Tonkes, and B. Skellett, A comparison of neutral landscapes . nk, nkp and nkq, in Proceedings of the IEEE Congress on Evolutionary Computation, (2002).
5. N. Jakobi, P. Husbands, and I. Harvey, Noise and the reality gap: The use of simulation in evolutionary robotics, Lecture Notes in Computer Science, 929, 704-801, (1995).
6. S. A. Kauffman, .The origins of order.. Self-organization and selection in evolution, Oxford University Press, New-York, 1993.
7. M. Kimura, The Neutral Theory of Molecular Evolution, Cambridge University Press, Cambridge, UK, 1983.
8. M. Mitchell, S. Forrest, and J. H. Holland, The royal road for genetic algorithms: Fitness landscape and GA performance, in Proceedings of the First European Conference on Artificial Life, eds., F.J Varela and P. Bourgine, pp. 245.254, Cambridge, MA, (1992). MIT Press/Bradford Books.
9. M. Newman and R. Engelhardt, Effect of neutral selection on the evolution of molecular species, in Proc. R. Soc. London B., volume 256, pp. 1333-1338, (1998).
10. T.C. Stewart, Extrema selection: Accelerated evolution on neutral networks', in IEEE Congress on Evolutionary Computation 2001, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, (2001). IEEE Press.
11. Peter D. Turney, Increasing evolvability considered as a large scale trend in evolution', in GECCO'99 : Proceedings of the 1999 Genetic and Evolutionary Computation Conference, Workshop Program on evolvability, eds., Paul Marrow, Mark Shackleton, Jose-Luis Fernandez-Villacanas, and Tom Ray, pp. 43-46, (1999).
12. Vesselin K. Vassilev and Julian F. Miller, The advantages of landscape neutrality in digital circuit evolution', in ICES, pp. 252-263, (2000).
13. G. P. Wagner and L. Altenberg, Complexes adaptations and the evolution of evolvability', in Evolution, pp. 967-976, (1996).
14. S. Wright, The roles of mutation, inbreeding, crossbreeding, and selection in evolution', in Proceedings of the Sixth International Congress of Genetics 1, pp. 356.366, (1932).