Abstract
In this paper, we revisit a general class of multicriteria multiconstrained network design problems and attempt to solve, in a novel way, with a Distributed Evolutionary Algorithm (EA). A major challenge to solving such problems is to capture possibly all the (representative) equivalent and diverse solutions at convergence. In this work, we formulate, without loss of generality, a bi-criteria bi-constrained communication network topological design problem. Two of the primary objectives to be optimized are network delay and cost subject to satisfaction of reliability and flow-constraints. This is a NP-hard problem and the two-objective optimal solution front is not known a priori. Therefore, we adopt randomized search method and use multiobjective EA that produces diverse solution-space. We employ a distributed version of the algorithm and generate solutions from multiple tribes to ensure convergence. We tested this approach for designing networks of different sizes and found that the approach scales well with larger networks. Results are compared with those obtained by two traditional approaches namely, the exhaustive search and a heuristic search.
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
Garey, M.R., Johnson, D.S.: Computers and Interactability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard problems. PWS, Boston (1997)
Gerla, M., Kleinrock, L.: On the topological design of distributed computer networks. IEEE Trans. Communications 25(1), 48–60 (1977)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, 286–292 (1993)
Borah, M., Owens, R.M., Irwin, M.J.: An edge-based heuristic for Steiner routing. IEEE Trans. Computer Aided Design of Integrated Circuits and Systems 13(12), 1563–1568 (1995)
Boldon, N., Deo, N., Kumar, N.: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Parallel Computing 22(3), 369–382 (1996)
Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Bicriteria network design problems. J. Algorithms 28(1), 142–171 (1998)
Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Approximation algorithms for degree-constrained minimum-cost network design problems. Algorithmica 31(1), 58–78 (2001)
Coello, C.A.C., VanVeldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer, Boston (2002)
Deb, K.: Multiobjective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)
Fonseca, C.M., Fleming, P.J.: Multiobjective optimization and multiple constraint handling with evolutionary algorithms – Part I: a unified formulation. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans 28(1), 26–37 (1998)
Deb, K., et al.: A fast non-dominated sorting genetic algorithm for multiobjective optimization: NSGA-II. Parallel Problem Solving from Nature PPSN-VI, 849–858 (2000)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. In: EUROGEN 2001 (2001)
Knowles, J.D., Corne, D.W.: Approximating the non-dominated front using the Pareto Achieved Evolution Strategy. Evolutionary Computation 8(2), 149–172 (2000)
Laumanns, M., Thiele, L., Deo, K., Zitzler, E.: Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation 10(3), 263–282 (2002)
Kumar, R., Rockett, P.I.: Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm. Evolutionary Computation 10(3), 283–314 (2002)
Purshouse, R.C., Fleming, P.J.: Elitism, sharing and ranking choices in evolutionary multi-criterion optimization. Research Report No. 815, Dept. Automatic Control & Systems Engineering, University of Sheffield (January 2002)
Jan, R.H., Hwang, F.J., Cheng, S.T.: Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. Reliability 42(1), 63–69 (1993)
Ersoy, C., Panwar, S.S.: Topological design of interconnected LAN/MAN Networks. IEEE J. Select. Areas Communication 11(8), 1172–1182 (1993)
Clarke, L.W., Anandalingam, G.: An integrated system for designing minimum cost survivable telecommunication networks. IEEE. Trans. Systems, Man and Cybernetics- Part A 26(6), 856–862 (1996)
Atamturk, A., Rajan, D.: Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at Berkeley
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization (1995)
Ribeiro, C.C., Rosseti, I.: A parallel GRASP heuristic for the 2-path network design problem. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, p. 922. Springer, Heidelberg (2002)
Baran, B., Laufer, F.: Topological optimization of reliable networks using A-Teams. National Computer Center, National University of Asuncion, University Campus of San Lorenzo - Paraguay
Abuali, F.N., Schnoenefeld, D.A., Wainwright, R.L.: Designing telecommunication networks using genetic algorithms and probabilistic minimum spanning Trees. In: Proc. 1994 ACM Symp. Applied Computing, pp. 242–246 (1994)
Ko, K.T., Tang, K.S., Chan, C.Y., Man, K.F., Kwong, S.: Using genetic algorithms to design mesh networks. IEEE Computer 30(8), 56–61 (1997)
Kwong, S., Chan, T.M., Man, K.F., Chong, H.W.: The use of multiple objective genetic algorithm in self-healed network. Applied Soft Computing 2, 104–128 (2002)
Elbaum, R., Sidi, M.: Topological design of local-area networks using genetic algorithms. IEEE/ACM Trans. Networking 4(5), 766–777 (1996)
Kumar, A., Pathak, R.M., Gupta, Y.P.: Genetic-algorithm based reliability optimization for computer network expansion. IEEE Trans. Reliability 44(1), 63–72 (1995)
White, A.R.P., Mann, J.W., Smith, G.D.: Genetic algorithms and network ring design. Annals of Operational Research 86, 347–371 (1999)
Dengiz, B., Altiparmak, F., Smith, A.E.: Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. Evolutionary Computation 1(3), 179–188 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, R. (2003). Multicriteria Network Design Using Distributed Evolutionary Algorithm. In: Pinkston, T.M., Prasanna, V.K. (eds) High Performance Computing - HiPC 2003. HiPC 2003. Lecture Notes in Computer Science, vol 2913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24596-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-24596-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20626-2
Online ISBN: 978-3-540-24596-4
eBook Packages: Springer Book Archive