Skip to main content

Multicriteria Network Design Using Evolutionary Algorithm

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2724))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. R. Garey and D. S. Johnson. Computers and Interactability: A Guide to the Theory of NP-Completeness, 1979. San Francisco, LA: Freeman.

    MATH  Google Scholar 

  2. D. Hochbaum (Ed.). Approximation Algorithms for NP-Hard problems, 1997. Boston, MA: PWS.

    Google Scholar 

  3. M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Trans. Communications, 25(1): 48–60, 1977.

    Article  MathSciNet  Google Scholar 

  4. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, 286–292, 1993.

    Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. 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.

    Article  MATH  Google Scholar 

  7. 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.

    Article  MATH  MathSciNet  Google Scholar 

  8. 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.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. A. C. Coello, D. A. Van Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems, 2002. Boston, MA: Kluwer.

    MATH  Google Scholar 

  10. K. Deb. Multiobjective Optimization Using Evolutionary Algorithms, 2001. Chichester, UK: Wiley.

    Google Scholar 

  11. 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.

    Article  Google Scholar 

  12. 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.

    Google Scholar 

  13. E. Zitzler, M. Laumanns and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm. EUROGEN 2001.

    Google Scholar 

  14. Knowles, J. D. and Corne, D. W. Approximating. Evolutionary Computation, 8(2): 149–172, 2000.

    Article  Google Scholar 

  15. M. Laumanns, L. Thiele, K. Deo and E. Zitzler. Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation, 10(3): 263–182, 2002.

    Article  Google Scholar 

  16. 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.

    Article  Google Scholar 

  17. 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.

    Google Scholar 

  18. 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.

    Article  MATH  Google Scholar 

  19. C. Ersoy and S. S. Panwar. Topological design of interconnected LAN/MAN Networks. IEEE J. Select. Areas Communication, 11(8): 1172–1182, 1993.

    Article  Google Scholar 

  20. 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.

    Article  Google Scholar 

  21. A. Atamturk and D. Rajan. Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at Berkeley.

    Google Scholar 

  22. T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 1995.

    Google Scholar 

  23. 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.

    Google Scholar 

  24. 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.

    Google Scholar 

  25. 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.

    Google Scholar 

  26. R. Elbaum and M. Sidi. Topological design of local-area networks using genetic algorithms. IEEE/ACM Trans. Networking, 4(5): 766–777, 1996.

    Article  Google Scholar 

  27. 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.

    Article  Google Scholar 

  28. 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.

    Article  MATH  MathSciNet  Google Scholar 

  29. 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics