Abstract
In this paper, a distributed genetic algorithm (DGA) for 3-connectivity communication network design is proposed and implemented on a transputer based parallel machine, ParsyTec Gcel-164. It is emphasized that how parallelism can be used with the genetic algorithm. Performance of the (sequential) genetic algorithm (GA) is compared to Dijkstra algorithm (DA) in terms of computation time and total link costs versus various network graph sizes. The efficiencies of the distributed genetic algorithm over the genetic algorithm and Dijkstra algorithm are reported and discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Davis L., Orvosh T., Cox A. and Qiu Y.: A genetic algorithm for survivable network design. The Proceedings of the Fifth International Conference on Genetic Algorithm, (1993) 408–415.
Esbensen H: Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. Networks, 26, (1995) 175–185.
Goldberg D. E.: Genetic algorithms in search, optimization and machine learning. ISBN 0-201-15767-5, (1989), Addison Wesley.
Holland J. H.: Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, (1975).
Huang R., Fogarty T.C.: Learning prototype control rules for combustion control with genetic algorithm. Periodicals of Modeling, Measurement and Control, C, 38, No. 4, (1993) 55–64.
Huang R., Ma J., Tsuboi E.: Communication network design via a genetic algorithm based learning algorithm. The Proceeding of the IASTED International Conference on Artificial Intelligence, Expert Systems and Neural Networks, (1996) 15–18.
Huang R., Ma J., Kunii T. L., Tsuboi E.: Parallel genetic algorithms for communication network design. The Proceeding of the Second Aizu International Symposium ] on Parallel AlgorithmsArchitectures Synthesis, (1997) 370–377.
Jog Prasanna, Gucht Dirk Van: Parallelization of probabilistic sequential search algorithms. The Proceedings of the 2nd International Conference on Genetic Algorithms, (1987) 170–176.
Kingston, J. H.: Algorithms and data structures. Addison-Wesley Publishing Company, ISBN 0 201 41705 7, (1990).
Monma C. L., Shallcross D. F.: Methods for designing communications networks with certain two-connected survivability constraints. Operations Research, 37, No. 4, (1989) 531–541.
Palmer C. C., Kershenbaum A.: An approach to a problem in network design using genetic algorithms. Networks, 26, (1995) 151–163.
ParsyTec: Software documentation, (1993).
Pettey Chrisia C., Leuze Michael R.: A theoretical investigation of a parallel genetic algorithm. The Proceedings of the 3rd International Conference on Genetic Algorithms, (1989) 398–405.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, J., Huang, R., Tsuboi, E. (1997). Designing and optimizing 3-connectivity communication networks using a distributed genetic algorithm. In: Polychronopoulos, C., Joe, K., Araki, K., Amamiya, M. (eds) High Performance Computing. ISHPC 1997. Lecture Notes in Computer Science, vol 1336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024213
Download citation
DOI: https://doi.org/10.1007/BFb0024213
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63766-0
Online ISBN: 978-3-540-69644-5
eBook Packages: Springer Book Archive