Abstract
In this paper a parallel simulator of Genetic Algorithms is described. The target machine is a parallel distributed-memory system whose processors have been configured in a WK-Recursive topology. A diffusion mechanism of useful local information among processors has been carried out. Specifically, simulations of genetic processes have been conducted using the Travelling Salesman Problem as an artificial environment. The experimental results are presented and discussed. Furthermore, performance with respect to well-known problems taken from literature is shown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhann B, Lee S and Ming J, ‘Self-Optimizing Image Segmentation System Using a Genetic Algorithm’, Proc. of the Fourth Int. Conf. on Genetic Algorithms, Belew R K and Booker L B eds., Morgan Kaufmann Pub., 362-369, 1991.
Treleaven P and Goonatilake S, ‘Intelligent Financial Techniques’, Proc. of the Workshop on Parallel Problem Solving from Nature: Applications in Statistics and Economics, EUROSTAT, 1992.
Reeves C and Steele N, ‘Problem-solving by simulated genetic processes: a review and applications to Neural Networks’, Tenth IASTED Int. Symposium on Applied Informatics, Hamza M H ed., 269-272, Innsbruck, Austria, February 10–12, 1992.
Cui J, Fogarty T C and Gammack J G, ‘Searching databases using Parallel Genetic Algorithms on a Transputer Computing Surface’, Proc. of the Third Annual Conference of the Meiko User Society, Manchester Business School, University of Manchester, April 9–10, 1992.
Holland J H, ‘Adaptation in Natural and Artificial Systems’, University of Michigan Press, Ann Arbor, 1975.
Manderick B and Spiessens P, ‘Fine-grained Parallel Genetic Algorithms’, Proc. of the Third Int. Conf. on Genetic Algorithms, S chaffer J D ed., Morgan Kaufmann Pub., 428-433, 1989.
Tanese R, ‘Distributed Genetic Algorithms’, Proc. of the Third Int. Conf. on Genetic Algorithms, Schaffer J D ed., Morgan Kaufmann Pub., 434-439, 1989.
Mühlenbein H, Schomisch M and Born J, ‘The parallel genetic algorithm as function optimizer’, Parallel Computing, 17, 619–632, North-Holland, 1991.
Goldberg D E, ‘Genetic Algorithms in Search, Optimisation, and Machine Learning’, Addison-Wesley, Reading, Mass., 1989.
Mühlenbein H, ‘Evolution in Time and Space — The Parallel Genetic Algorithm’, Foundations of Genetic Algorithms, Rawlins G ed., 316-337, Morgan Kaufmann Pub., 1992.
Kirkpatrick S, Gelatt C D and Vecchi M P, ‘Optimization by Simulated Annealing’, Science, 220, 671–680, 1983.
Beightler CS, Phillips DT and Wilde DJ, ‘Foundations of optimization’, Englewood Cliffs, NJ: Prentice-Hall, 1979.
Grefenstette J, Gopal R, Rosmaita B and Van Gucht D, ‘Genetic Algorithms for the Traveling Salesman Problem’, Proc. of the Int. Conf. on Genetic Algorithms and Their Applications, Grefenstette J ed., 160-165, 1985.
Davis L, ‘Job shop scheduling with Genetic Algorithms’, Proc. of the Int. Conf. on Genetic Algorithms and Their Applications, Grefenstette J ed., 136-140, (Erlbaum L, 1988, original proceedings 1985).
Goldberg D and Lingle R, ‘Alleles, loci and the Traveling Salesman Problem’, Proc. of the Int. Conf. on Genetic Algorithms and Their Applications, Grefenstette Jed., 154-159, (Erlbaum L, 1988, original proceedings 1985).
Reeves C, ‘An Introduction to Genetic Algorithms’, 33rd OR Society Conference Tutorial Papers, Birmingham, 1991.
Delia Vecchia G and Sanges C, ‘A Recursively Scalable Network VLSI Implementation’, Future Generation Computer Systems, 4, 3, 235–243, North Holland, Amsterdam, 1988.
Ambati B K, Ambati J and Mokhtar M M, ‘Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem’, Biological Cybernetics, 65, 31–35, Springer-Verlag, Berlin, 1991.
De Falco I, Del Balio R, Tarantino E and Vaccaro R, ‘Simulation of Genetic Algorithms on MIMD Multicomputers’, to appear in Parallel Processing Letters, 1993.
De Falco I, Del Balio R, Tarantino E and Vaccaro R, ‘A Self-replication-based Parallel Adaptive Strategy for the Travelling Salesman Problem’, submitted to the Fifth Int. Conf. on Genetic Algorithms, to be held at the University of Illinois, Urbana-Champaign, Illinois, USA, July 17–22, 1993.
Eilon, Watson-Gandy and Christofides, ‘Distribution Management: mathematical modeling and practical analysis’, Operational Research Quarterly, 20, 309, 1969.
Whitley D, Starkweather T, Fuquay D A, ‘Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination’, Proc. of the Third Int. Conf. on Genetic Algorithms, Schaffer J D ed., Morgan Kaufmann Pub., 133-140, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag/Wien
About this paper
Cite this paper
De Falco, I., Del Balio, R., Tarantino, E., Vaccaro, R. (1993). Mapping Parallel Genetic Algorithms on WK-Recursive Topologies. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7533-0_50
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82459-7
Online ISBN: 978-3-7091-7533-0
eBook Packages: Springer Book Archive