Abstract
A parallel version of a Genetic Algorithm is presented and implemented on a cluster of workstations. Even through our algorithm is general enough to be applied to a wide variety of problems, we used it to obtain optimal/suboptimal solutions to the well known Traveling Salesman Problem. The proposed algorithm is implemented using the Parallel Virtual Machine library over a network of workstations, and it is based on a master-slave paradigm and a distributed-memory approach. Tests were performed with clusters of 1, 2, 4, 8, and 16 workstations, using several real problems and population sizes. Results are presented to whow how the performance of the algorithm is affected by variations on the number of slaves, population size, mutation rate, and mutation interval. The results presented show the utility, efficiency and potential value of the proposed algorithm to tackle similar NP-Complete problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T.E. Anderson, D.E. Culler, D.A. Patterson and the NOW team A Case of NOW (Networks of Workstations). IEEE Micro, 15(1):54–64, February 1995.
L. Davis, editor. Handbook of GA. Van Nostrand, Reinhold, NY, 1991.
K. DeJong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Phd’s thesis, University of Michigan, Ann Arbor, MI, 1975.
B.R. Fox and M.B. McMahon. Genetic Operators for Sequencing Problems. In Rawlins [12], pages 284–300.
A. Geist, A. Beguellin, J. Dongarra, et al. PVM: Parallel Virtual Machine. A User’s Guide and Tutorial for Net. Parallel Comp. The MIT Press, 1994.
M. Gorges-Schleuter. Explicit Parallelism of Genetic Algorithms through Population Structures. Parallel Problem Solving from Nature, pages 150–159, 1991.
J. Holland. A daptation in Natural and Artificial Systems. U. Mich. Press, 1975.
Z. Michalewicz. Genetic Algorithms+Data Structures=Evolutionary Programs. Springer-Verlag, Berlin, Germany, 1993.
T.M. Mitchell. Machine Learning. Series in CS. McGraw-Hill, 1997.
H. Mühlenbein. Evolution in Time and Space—The Parallel Genetic Algorithm. In Rawlins [12], pages 317–337.
S. Rana, A.E. Howe, D. Whitley, and K. Mathias. Comparing Heuristic, Evolutionary and Local Search Approaches to Scheduling. In Proc. of the 3 rd Artificial Intelligence Planning Systems Conference, 1996.
G.J.E. Rawlins, editor. Foundations of Genetic Algorithms. Morgan-Kaufmann Publishers, Inc., San Mateo, California, 1991.
T. Starkweather, D. Whitley, and K. Mathias. Optimization Using Distributed Genetic Algorithms. Parallel Problem Solving from Nature, 1991.
R. Tanese. Distributed Genetic Algorithms. In Proc. of the 3 rd Int. Conf. on Genetic Algorithms, pages 434–439. Morgan-Kaufmann Publishers, Inc., 1989.
D. Whitley. A Genetic Algorithm Tutorial. Stat. and Computing, 4:65–85, 1994.
D. Whitley and T. Starkweather. Genitor II: a Distributed Genetic Algorithm. Journal Expt. Theory Artificial Intelligence, 2:189–214, 1990.
D. Whitley, T. Starkweather, and D. Shaner. The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In Davis [2], chapter 22, pages 350–372.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Sena, G., Isern, G., Megherbi, D. (1999). Implementation of a parallel genetic algorithm on a cluster of workstations: The Travelling Salesman Problem, a case study. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097908
Download citation
DOI: https://doi.org/10.1007/BFb0097908
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive