Abstract
ASPARAGOS is an implementation of an asynchronous parallel genetic algorithm. It simulates a continous population structure. Instead of modeling one large population ASPARAGOS introduces a continuous population structure. Individuals behave independent and due to the limited distance an individual may move, there are only local interactions. We get an algorithm which is very robust in parameter setting and which may deal with much smaller population sizes than needed with only one large population to overcome the problem of preconvergence. These results have been derived with the traveling salesman problem as testbed. The high quality solutions yielded show the effectiveness of ASPARAGOS especially with large problem sizes and give hope that it may serve as a general purpose optimization algorithm suitable for a wide range of applications.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.E. Baker, Adaptive Selection Methods for Genetic Algorithms, Proceedings first ICGA, Pittsburgh (1985) 101–111
J. Davis, Genetic Algorithms and Simulated Annealing, Morgan Kaufman Publ., Los Altos (1987)
K. A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Doctoral dissertation, University of Michigan, Dissertation Abstracts International 36(10), 5140B
G. Dueck, T. Scheuer, Threshold Accepting, IBM HDSC Technical Report 88.10.011 (1988)
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley (1989)
J. J. Grefenstette, Optimization of Control Parameters for Genetic Algorithms, IEEE Transactions on Systems, Man and Cybernetics 16(1), 122–128 (1986)
M. Gorges-Schleuter, H. Mühlenbein, The Traveling Salesman Problem — An Evolutionary Approach, Annual Report of the GMD 1988 (in german)
B. W. Kernighan, S. Lin, An Efficient Heuristic Procedure for the TSP, Operation Res. 21, 498–516 (1973)
H. Mühlenbein, M. Gorges-Schleuter, O. Krämer, New Solutions to the Mapping Problem of Parallel Systems — The Evolution Approach, Parallel Computing 6, 269–279 (1987)
H. Mühlenbein, M. Gorges-Schleuter, O. Krämer, Evolution Algorithm in Combinatorial Optimization, Parallel Computing 7, 65–88 (1988)
H. Mühlenbein, Parallel Genetic Algorithms, Population genetics, and Combinatorial Optimization, Proceedings third ICGA (1989)
G. Napierala, Ein paralleler Evolutionsalgorithmus zur Lösung des TSP, Master Thesis, University of Bonn (1989)
W. Padberg, G. Rinaldi, Optimization of a 532 — City Symmetric TSP, Operation Res. Lett. 6, 1–7 (1987)
Y. Rossier, M. Troyon, T. M. Liebling, Probabilistic Exchange Algorithms and Euclidean Traveling Salesman Problems, OR Spektrum 8, 151–164 (1986)
H.P. Schwefel, Collective Phenomena in Evolutionary Systems, in Problems of Constancy and Change, vol.2, Int. Society for General System Res., Budapest (1987)
S. Wright, Character Change, Speciation, and the Higher Taxa, Evolution 36(3), 427–443 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gorges-Schleuter, M. (1991). ASPARAGOS a parallel genetic algorithm and population genetics. In: Becker, J.D., Eisele, I., Mündemann, F.W. (eds) Parallelism, Learning, Evolution. WOPPLOT 1989. Lecture Notes in Computer Science, vol 565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55027-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-55027-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55027-3
Online ISBN: 978-3-540-46663-5
eBook Packages: Springer Book Archive