Significance of locality and selection pressure in the grand deluge evolutionary algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1141, Issue , 1996, Pages 686-695

  Rudolph, Günter ^a   Sprave, Joachim ^b  

^a Informatik Centrum Dortmund (ICD)   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; PARAMETER ESTIMATION;

CONTROL MECHANISM; LOCAL INTERACTIONS; NEIGHBORHOOD PATTERN; PARAMETER SETTING; PARAMETER STUDIES; SELECTION PRESSURES; SELF-ADJUSTING; STRUCTURED POPULATION;

PROBLEM SOLVING;

EID: 84958976333     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1032     Document Type: Conference Paper

References (14)

1. T. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
2. G. Borgefors. Distance transformations in arbitrary dimensions. Computer Vision, Graphics, and Image Processing, 27:321-345, 1984.
3. G. Dueck. New optimization heuristics: the great deluge algorithm and the recordto-record travel. Journal of Computional Physics, 104:86-92, 1993.
4. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, Reading (MA), 1989.
5. M. Gorges-Schlenter. ASPARAGOS: an asynchronous parallel genetic optimization strategy. In J.D. Schaffer, editor, Genetic Algorithms, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 422-427. Morgan Kaufman, San Mateo, 1989.
6. S. Khuri, Th. Bgck, and J. HeitkStter. 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 Computing, pages 188-193. ACM Press, New York, 1994.
7. H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer. Evolution algorithms in combinatorial optimization. Parallel Computing, 7:65-88, 1988.
8. M.E. Palmer and S.J. Smith. Improved evolutionary optimization of difficult landscapes: Control of premature convergence through scheduled sharing. Complex Systems, 5:443-458, 1991.
9. G. Rudolph. Parallel approaches to stochastic global optimization. In W. Joosen and E. Milgrom, editors, Parallel Computing: From Theory to Sound Practice, Proceedings of the European Workshop on Parallel Computing (EWPC 92), pages 256-267. IOS Press, Amsterdam, 1992.
10. G. Rudolph. Convergence properties of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5(1):96-101, 1994.
11. G. Rudolph and J. Sprave. A cellular genetic algorithm with self-adjusting acceptance threshold. In Proceedings of the First IEE/1EEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pages 365-372. IEE, London, 1995.
12. P. Spiessens and B. Manderick. A massively parallel genetic algorithm: Implementation and first analysis. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth Conference on Genetic Algorithms, pages 279-286. Morgan Kaufmann, San Mateo, 1991.
13. J. Sprave. Parallelisierung Genetischer Algorithmen zur Suche und Optimierung. Diplomarbeit, University of Dortmund, Department of Computer Science, 1990.
14. J. Sprave. Linear neighborhood evolution strategies. In A.V. Sebald and L.J. Fogel, editors, Proceedings of the 3rd Annual Conference on Evolutionary Programming, pages 42-51. World Scientific, River Edge (N3), 1994.