Abstract
In many computer communications network design problems, such as those faced by hospitals, universities, research centers, and water distribution systems, the topology is fixed because of geographical and physical constraints or the existence of an existing system. When the topology is known, a reasonable approach to design is to select components among discrete alternatives for links and nodes to maximize reliability subject to cost. This problem is NP-hard with the added complication of a very computationally intensive objective function. This paper compares the performance of three classic metaheuristic procedures for solving large and realistic versions of the problem: hillclimbing, simulated annealing and genetic algorithms. Three alterations that use local search to seed the search or improve solutions during each iteration are also compared. It is shown that employing local search during evolution of the genetic algorithm, a memetic algorithm, yields the best network designs and does so at a reasonable computational cost. Hillclimbing performs well as a quick search for good designs, but cannot identify the most superior designs even when computational effort is equal to the metaheuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aarts, E. and J.K. Lenstra. (1997). Local Search in Combinatorial Optimization. John Wiley & Sons.
Abuali, F.N., D.A. Schoenefeld, and R.L. Wainwright. (1994a). "Terminal Assignment in a Communications Network Using Genetic Algorithms." <In> Proceedings of the ACM Computer Science Conference, pp. 74–81.
Abuali, F.N., D.A. Schoenefeld, and R.L. Wainwright. (1994b). "Designing Telecommunications Networks Using Genetic Algorithms and Probabilistic Minimum Spanning Trees." <In> Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 242–246.
Aggarwal, K.K., Y.C. Chopra, and J.S. Bajwa. (1982). "Topological Layout of Links for Optimizing the Overall Reliability in a Computer Communication System." Microelectronics & Reliability22, 347–351.
Altiparmak, F., B. Dengiz, and A.E. Smith. (1998). "Reliability Optimization of Computer Communication Net-works Using Genetic Algorithms." <In> IEEE International Conference on System, Man and Cybernetics, SMC-98, USA pp. 4676–4681.
Altiparmak, F., B. Dengiz, and A.E. Smith. (2000). "An Evolutionary Approach for Reliability Optimization in Fixed Topology Computer Networks." Transactions on Operational Research in Turkey12, 57–75 <nt>(in English)</nt>.
Atiqullah, M.M. and S.S. Rao. (1993). "Reliability Optimization of Communication Networks Using Simulated Annealing." Microelectronics and Reliability33, 1303–1319.
Ball, M.O. and J.S. Provan. (1983). "Calculating Bounds on Reachability and Connectedness in Stochastic Networks." Networks13, 253–278.
Ball, M. and R.M. Van Slyke. (1977). "Backtracking Algorithms for Network Reliability Analysis." Annals of Discrete Mathematics1, 49–64.
Beltran, H.F. and D. Skorin-Kapov. (1994). "On Minimum Cost Isolated Failure Imune Networks." Telecommunications Systems3, 183–200.
Brown, J.I., C.J. Colbourn, and J.S. Devitt. (1993). "Network Transformations and Bounding Network Reliability." Networks23, 1–17.
Colbourn, C.J. (1987). The Combinatorics of Network Reliability.Oxford University Press, Oxford, U.K.
Davis, L., D. Orvosh, A. Cox, and Y. Qui. (1993). "A Genetic Algorithm for Survivable Network Design." <In> Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 408–415.
Dawkins, R. (1976). The Selfish Gene. Oxford University Press, Oxford, U.K.
Deeter, D.L. and A.E. Smith. (1998). "Economic Design of Reliable Networks." IIE Transactions30, 1161–1174.
DeJong, K.A. (1975). "An Analysis of the Behavior of a Class of Genetic Adaptive Systems." <nt>PhD Thesis</nt>, University of Michigan.
Dengiz, B., F. Altiparmak, and A.E. Smith. (1997a). "Local Search Genetic Algorithm for Optimal Design of Reliable Networks." IEEE Transactions on Evolutionary Computation1, 179–188.
Dengiz, B., F. Altiparmak, and A.E. Smith. (1997b). "Efficient Optimization of All-Terminal Reliable Networks, Using an Evolutionary Approach." IEEE Transactions on Reliability46, 18–26.
Eglese, R.W. (1990). "Simulated Annealing: A Tool for Operational Research." European Journal of Operational Research46, 271–281.
Glover, F., M. Lee, and J. Ryan. (1991). "Least-Cost Network Topology Design for a New Service: An Application of a Tabu Search." Annals of Operations Research33, 351–362.
Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
Jan, R.H. (1993). "Design of Reliable Networks." Computers and Operations Research20, 25–34.
Jan, R.H. F.J. Hwang, and S.T. Chen. (1993). "Topological Optimization of a Communication Network Subject to Reliability Constraint." IEEE Transactions on Reliability42, 63–70.
Kirkpatrick, S., C.D. Gerlatt, and N.P. Vecchi. (1983). "Optimization by Simulated Annealing." Science220, 671–680.
Koh, S.J. and C.Y. Lee. (1995). "A Tabu Search for the Survivable Fiber Optic Communication Network Design." Computers & Industrial Engineering28, 689–700.
Koumolos, C., J.R. Antony, and R. Jean. (1994). "A Survey of Simulated Annealing Applications to Operations Research Problems." Omega22, 41–56.
Kumar, A., R.M. Pathak, Y.P. Gupta, and H.R. Parsaei. (1995). "A Genetic Algorithm for Distributed System Topology Design." Computers & Industrial Engineering28, 659–670.
Kumar, A., R.M. Pathak, and Y.P. Gupta. (1995). "Genetic Algorithm Based Reliability Optimization for Computer Network Expansion." IEEE Transactions on Reliability44, 63–72.
Lundy, M. and A. Mees. (1986). "Convergence of an Annealing Algorithm." Mathematical Programming34, 111–124.
Nel, L. and C.J. Colbourn. (1990). "Combining Monte Carlo Estimates and Bounds for Network Reliability." Networks20, 277–298.
Pierre, S., M.-A. Hyppolite, J.-M. Bourjolly, and O. Dioume. (1995). "Topological Design of Computer Communication Networks Using Simulated Annealing." Engineering Applications of Artificial Intelligence8, 61–69.
Pirlot, M. (1992). "General Local Search Heuristics in Combinatorial Optimization: A Tutorial." Belgian Journal of Operations Research, Statistics and Computer Science32, 7–67.
Provan, J.S. and M.O. Ball. (1982). "The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected." SIAM Journals on Computing12, 777–788.
Radcliffe, N.J. (1994). "Formal Memetic Algorithms." (T. Fogarty, Evolutionary Computing<nt>ed.</nt>), <nt>Springer Lecture Notes in Computer Science</nt>, vol. 865, pp. 250–263.
Smith, A.E. and D.W. Coit. (1997). "Constraint-Handling Techniques-Penalty Functions." <nt>in</nt> Handbook of Evolutionary Computation, Institute of Physics Publishing and Oxford University Press, Bristol, U.K., Chapter C5.2.
Srivaree-ratana, C., A. Konak, and A.E. Smith. (2002). "Estimation of All-Terminal Network Reliability Using An Artificial Neural Network." Computers and Operations Research29, 849–868.
Venetsanopoulos, N. and I. Singh. (1986). "Topological Optimization of Communication Networks Subject to Reliability Constraints." Problem of Control and Information Theory15, 63–78.
Yeh, M.-S., J.-S. Lin, and W.-C. Yeh. (1994). "A New Monte Carlo Method for Estimating Network Re-liability." <In> Proceedings of the 16th International Conference on Computers & Industrial Engineering, pp. 723–726.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Altiparmak, F., Dengiz, B. & Smith, A.E. Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics. Journal of Heuristics 9, 471–487 (2003). https://doi.org/10.1023/B:HEUR.0000012447.32370.fd
Issue Date:
DOI: https://doi.org/10.1023/B:HEUR.0000012447.32370.fd