Development of problem-specific evolutionary algorithms

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

Volumn 1498 LNCS, Issue , 1998, Pages 388-397

  Leonhardi, Alexander ^a   Reissenberger, Wolfgang ^a   Schmelmer, Tim ^b   Weicker, Karsten ^c   Weicker, Nicole ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITY OF KANSAS   (United States)

^c UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BASIC CONCEPTS;

EVOLUTIONARY ALGORITHMS;

EID: 84878597046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056881     Document Type: Conference Paper

References (31)

1. K. Alicke, D. Arnold, and V. Dörrsam. (R)evolution in layout-planning - a new hybrid genetic algorithm to generate optimal aisles in a ficility layout. In H.-J. Zimmermann, editor, Eufit 97 - 5th European Congress on Intelligent Techniques and Soft Computing, pages 788-793, Aachen, 1997. Verlag Mainz, Wissenschaftsverlag, Aachen.
2. P. Amos, K. Jung, B. Kawetzki, W. Kuhn, O. Pertier, R. Reißing, and M. Schaal. Endbericht der Projektgruppe Genetische Algorithmen. Technical Report FK95/1, University of Stuttgart, Institute of Computer Science, Dept. Formal Concepts, 1995. german.
3. W. Banzhaf. Genotype-phenotype-mapping and neutral variation - a case study in genetic programming. In Davidor et al. [DSM94].
4. R.K. Belew and L.B. Booker, editors. Proceedings of the Fourth International Conference on Genetic Algorithms - ICGAV, San Mateo, California, 1991. Morgan Kaufmann.
5. T. Bäck, D.B. Fogel, and Z. Michalewiez, editors. Handbook of Evolutionary Computation. IOP Puplishing Ltd and Oxford University Press, 1997.
6. T. Bäck, F. Hoffmeister, and H.-P. Schwefel. A survey of evolution strategies. In Belew and Booker [BB91].
7. C. Bierwirth, D. Mattfeld, and H. Kopfer. On permutation representations for scheduling problems. In Voigt et al. [VERS96].
8. Laura Dekker, Jason Kingdon, and J. R. Filho. GAME Version 2.01, User's Manual. University College London, 1993.
9. D. Duvivier, Ph. Preux, and E.-G. Talbi. Climbing up NP-hard hills. In Voigt et al. [VERS96].
10. Y. Davidor, H.-P. Schwefel, and R. Maenner, editors. Parallel Problem Solving from Nature - PPSN III, volume 866 of Lecture Notes in Computer Science, Berlin, 1994. Springer-Verlag.
11. D.B. Fogel. An analysis of evolutionary programming. In D.B. Fogel and J. W. Atmar, editors. Proceedings of the First annual Conference on Evolutionary Programming, La Jolla, 1992. Evolutionary Programming Society.
12. H.-L. Fang, P. Ross, and D. Corne. A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems. In Proceedings of the Fifth Int. Conf. on Genetic Algorithms, pages 375-382. Morgan Kaufmann Publishers, 1993.
13. M. Großmann, A. Leonhardi, and T. Schmidt. Abschlußbericht der Projektgruppe Evolutionäre Algorithmen. Technical Report 2, University of Stuttgart, Institute of Computer Science, 1997. german.
14. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, 1989.
15. J.J. Grefenstette. A User's Guide to GENESIS, Version 5.0, 1990. M. Herdy. Evolution strategies with subjective selection. In Voigt et al. [VERS96].
16. J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
17. H. Iba, H. de Garis, and T. Sato. Genetic programming with local hill-climbing. In Davidor et al. [DSM94].
18. K. Jung and N. Weicker. Funktionale Spezifikation des Software-Tools EAGLE. Technical Report FK95/2, University of Stuttgart, Institute of Computer Science, Dept. Formal Concepts, 1995. german.
19. B. Kawetzki. Topologieoptimierung diskreter Tragwerke mittels Evolutionsstrategien am Beispiel ebener Fachwerke. Master's thesis, University of Stuttgart, 1996. german.
20. J.R. Koza. Genetic Programming. MIT Press, 1992.
21. A. Leonhardi. Eine Beschreibungssprache für Evolutionäre Algorithmen. Master's thesis, University of Stuttgart, Institute of Computer Science, 1997. german.
22. S. Lin and B. Kernighan. An efficient heuristic procedure for the traveling salesman problem. Operations Res., 21:498-516, 1973.
23. M. McIlhagga, P. Husbands, and R. Ives. A comparison of search techniques on a wing-box optimisation problem. In Voigt et al. [VERS96].
24. P.D. Surry and N.J. Radcliffe. RPL2: A language and parallel framework for evolutionary computing. In Davidor et al. [DSM94].
25. M. Sebag and M. Schoenauer. Controlling crossover through inductive learning. In Davidor et al. [DSM94].
26. S. Tsutsui, A. Ghosh, and Y. Fujimoto. A robust solution searching scheme in genetic search. In Voigt et al. [VERS96].
27. H.-M. Voigt, J. Born, and J. Treptow. The Evolution Machine, Manual, Version 2.1. Institute for Informatics and Computing Techniques, Berlin, 1991.
28. H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors. Parallel Problem Solving from Nature - PPSN IV, volume 1141 of Lecture Notes in Computer Science, Berlin, 1996. Springer-Verlag.
29. D. Vigo and V. Maniezzo. A genetic/tabu thresholding hybrid algorithm for the process allocation problem. Journal of Heuristics, 3(2):91-110, 1997.
30. D. Whitley, V.S. Gordon, and K. Mathias. Lamarckian evolution, the bald-win effect and function optimization. In Davidor et al. [DSM94].
31. D.H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions On Evolutionary Computation, 1(1):67-82, April 1997.