Abstract
It is a broadly accepted fact that evolutionary algorithms (EA) have to be developed problem-specifically. Usually this is based on experience and experiments. Though, most EA environments are not suited for such an approach. Therefore, this paper proposes a few basic concepts which should be supplied by modern EA simulators in order to serve as a toolkit for the development of such algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Alicke, D. Arnold, and V. Dörrsam. (R)evolution in layout-planning — a new hybrid genetic algorithm to generate optimal aisles in a utility 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.
F. Amos, K. Jung, B. Kawetzki, W. Kuhn, O. Pertler, 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.
W. Banzhaf. Genotype-phenotype-mapping and neutral variation — a case study in genetic programming. In Davidor et al. [DSM94].
R.K. Belew and L.B. Booker, editors. Proceedings of the Fourth International Conference on Genetic Algorithms — ICGA V, San Mateo, California, 1991. Morgan Kaufmann.
T. Bäck, D.B. Fogel, and Z. Michalewiez, editors. Handbook of Evolutionary Computation. IOP Puplishing Ltd and Oxford University Press, 1997.
T. Bäck, F. Hoffmeister, and H.-P. Schwefel. A survey of evolution strategies. In Belew and Booker [BB91].
C. Bierwirth, D. Mattfeld, and H. Kopfer. On permutation representations for scheduling problems. In Voigt et al. [VERS96].
Laura Dekker, Jason Kingdon, and J. R. Filho. GAME Version 2.01, User's Manual. University College London, 1993.
D. Duvivier, Ph. Preux, and E.-G. Talbi. Climbing up NP-hard hills. In Voigt et al. [VERS96].
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.
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.
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.
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.
D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, 1989.
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].
J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
H. Iba, H. de Garis, and T. Sato. Genetic programming with local hill-climbing. In Davidor et al. [DSM94].
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.
B. Kawetzki. Topologieoptimierung diskreter Tragwerke mittels Evolutionsstrategien am Beispiel ebener Fachwerke. Master's thesis, University of Stuttgart, 1996. german.
J.R. Koza. Genetic Programming. MIT Press, 1992.
A. Leonhardi. Eine Beschreibungssprache für Evolutionäre Algorithmen. Master's thesis, University of Stuttgart, Institute of Computer Science, 1997. german.
S. Lin and B. Kernighan. An efficient heuristic procedure for the traveling salesman problem. Operations Res., 21:498–516, 1973.
M. McIlhagga, P. Husbands, and R. Ives. A comparison of search techniques on a wing-box optimisation problem. In Voigt et al. [VERS96].
P.D. Surry and N.J. Radcliffe. RPL2: A language and parallel framework for evolutionary computing. In Davidor et al. [DSM94].
M. Sebag and M. Schoenauer. Controlling crossover through inductive learning. In Davidor et al. [DSM94].
S. Tsutsui, A. Ghosh, and Y. Fujimoto. A robust solution searching scheme in genetic search. In Voigt et al. [VERS96].
H.-M. Voigt, J. Born, and J. Treptow. The Evolution Machine, Manual, Version 2.1. Institute for Informatics and Computing Techniques, Berlin, 1991.
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.
D. Vigo and V. Maniezzo. A genetic/tabu thresholding hybrid algorithm for the process allocation problem. Journal of Heuristics, 3(2):91–110, 1997.
D. Whitley, V.S. Gordon, and K. Mathias. Lamarckian evolution, the baldwin effect and function optimization. In Davidor et al. [DSM94].
D.H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions On Evolutionary Computation, 1(1):67–82, April 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leonhardi, A., Reissenberger, W., Schmelmer, T., Weicker, K., Weicker, N. (1998). Development of problem-specific evolutionary algorithms. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056881
Download citation
DOI: https://doi.org/10.1007/BFb0056881
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive