Abstract
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A major challenge to solving such problems is to capture possibly all the (representative) equivalent and diverse solutions. 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 so we use a hybrid approach (for initialization of the population) along with EA. Furthermore, the two-objective optimal solution front is not known a priori. Therefore, we use a multiobjective EA which produces diverse solution space and monitors convergence; the EA has been demonstrated to work effectively across complex problems of unknown nature. We tested this approach for designing networks of different sizes and found that the approach scales well with larger networks. Results thus obtained are compared with those obtained by two traditional approaches namely, the exhaustive search and branch exchange heuristics.
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
M. R. Garey and D. S. Johnson. Computers and Interactability: A Guide to the Theory of NP-Completeness, 1979. San Francisco, LA: Freeman.
D. Hochbaum (Ed.). Approximation Algorithms for NP-Hard problems, 1997. Boston, MA: PWS.
M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Trans. Communications, 25(1): 48–60, 1977.
V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, 286–292, 1993.
M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, 13(12): 1563–1568, 1995.
N. Boldon, N. Deo, and N. Kumar. Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Parallel Computing, 22(3): 369–382, 1996.
M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt. Bicriteria network design problems. J. Algorithms, 28(1): 142–171, 1998.
R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt. Approximation algorithms for degree-constrained minimum-cost network design problems. Algorithmica, 31(1): 58–78, 2001.
C. A. C. Coello, D. A. Van Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems, 2002. Boston, MA: Kluwer.
K. Deb. Multiobjective Optimization Using Evolutionary Algorithms, 2001. Chichester, UK: Wiley.
C. M. Fonseca and P. J. Fleming. 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. 26–37.
K. Deb et al. A fast non-dominated sorting genetic algorithm for multiobjective optimization: NSGA-II. Parallel Problem Solving from Nature, PPSN-VI: 849–858, 2000.
E. Zitzler, M. Laumanns and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm. EUROGEN 2001.
Knowles, J. D. and Corne, D. W. Approximating. Evolutionary Computation, 8(2): 149–172, 2000.
M. Laumanns, L. Thiele, K. Deo and E. Zitzler. Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation, 10(3): 263–182, 2002.
R. Kumar and P. I. Rockett. 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.
R. C. Purshouse and P. J. Fleming. Elitism, sharing and ranking choices in evolutionary multi-criterion optimization. Research Report No. 815, Dept. Automatic Control & Systems Engineering, University of Sheffield, Jan. 2002.
R. H. Jan, F. J. Hwang, and S. T. Cheng. Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. Reliability, 42(1): 63–69, 1993.
C. Ersoy and S. S. Panwar. Topological design of interconnected LAN/MAN Networks. IEEE J. Select. Areas Communication, 11(8): 1172–1182, 1993.
L. W. Clarke and G. Anandalingam. An integrated system for designing minimum cost survivable telecommunication networks. IEEE. Trans. Systems, Man and Cybernetics-Part A, 26(6): 856–862, 1996.
A. Atamturk and D. Rajan. Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at Berkeley.
T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 1995.
B. Baran and F. Laufer. Topological optimization of reliable networks using A-Teams. National Computer Center, National University of Asuncion, University Campus of San Lorenzo — Paraguay.
F. N. Abuali, D. A. Schnoenefeld, and R. L. Wainwright. Designing telecommunication networks using genetic algorithms and probabilistic minimum spanning Trees. In Proc. 1994 ACM Symp. Applied Computing, pp. 242–246, 1994.
K. T. Ko, K. S. Tang, C.Y. Chan, K. F. Man and S. Kwong. Using genetic algorithms to design mesh networks. IEEE Computer, 6–58, 1997.
R. Elbaum and M. Sidi. Topological design of local-area networks using genetic algorithms. IEEE/ACM Trans. Networking, 4(5): 766–777, 1996.
A. Kumar, R. M. Pathak, and Y.P. Gupta. Genetic-algorithm based reliability optimization for computer network expansion. IEEE Trans. Reliability, 44(1): 63–72, 1995.
A. R. P White, J. W. Mann, and G. D. Smith. Genetic algorithms and network ring design. Annals of Operational Research, 86: 347–371, 1999.
B. Dengiz, F. Altiparmak, and A. E. Smith. 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., Banerjee, N. (2003). Multicriteria Network Design Using Evolutionary Algorithm. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_113
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_113
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive