Skip to main content
SpringerLink
Log in

A Centralized Network Design Problem with Genetic Algorithm Approach

  • Conference paper
Computational Intelligence and Security (CIS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4456))

Included in the following conference series:

  • 986 Accesses

Abstract

A centralized network is a network where all communication is to and from a single site. In the combinatorial optimization literature, this problem is formulated as the capacitated minimum spanning tree problem (CMST). Up to now there are still no effective algorithms to solve this problem. In this paper, we present a completely new approach by using the genetic algorithms (GAs). For the adaptation to the evolutionary process, we developed a tree-based genetic representation to code the candidate solution of the CMST problem. Numerical analysis shows the effectiveness of the proposed GA approach on the CMST problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Ahuja, R.K., Orlin, J.B., Sharma, D.: A positive very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research letters 31, 185–194 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bäck, T., Hoffmeister, F., Schwefel, H.: A survey of evolution strategy. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 2–9. Morgan Kaufmann Publishers, San Mateo,CA (1991)

    Google Scholar 

  3. Chandy, K.M., Lo, T.: The capacitated minimum spanning tree. Networks 3, 173–182 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  4. Elias, D., Ferguson, M.J.: Topological design of multipoint teleprocessing networks. IEEE Trans. Commun. 22, 1753–1762 (1974)

    Article  Google Scholar 

  5. Garey, M., Johnson, D. (eds.): Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Co, San Francisco (1979)

    MATH  Google Scholar 

  6. Gavish, B.: Topological design of centralized computer networks–formulation and algorithms. Networks 12, 355–377 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gavish, B.: Formulation and algorithms for the capacitated minimal directed tree problem. J. Assoc. Comput. Machinery 30, 118–132 (1983)

    MathSciNet  MATH  Google Scholar 

  8. Gavish, B.: Augmented lagrangean based algorithms for centralized network design. IEEE transaction on Commun. 33, 1247–1257 (1985)

    Article  MathSciNet  Google Scholar 

  9. Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization. John Wiley & Sons, New York (2000)

    Google Scholar 

  10. Gouveia, L.: A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research 43, 130–141 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hall, L.: Experience with a cutting plane algorithm for the capacitated spanning tree problem. INFORMS Journal on Computing 8, 219–234 (1996)

    Article  MATH  Google Scholar 

  12. Holland, J.H.: Adaptation in natural and Artificial Systems. MIT Press, Cambridge, MA (1975)

    Google Scholar 

  13. Kershenbaum, A.: Computing capacitated minimal spanning trees efficiently. Networks 4, 299–310 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kershenbaum, A., Boorstyn, R.R., Oppenheim, R.: Centralized teleprocessing network design. Networks 13, 279–293 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kershenbaum, A.: Telecommunication Network Design Algorithms. McGraw-Hill, Inc, Singapore (1993)

    Google Scholar 

  16. Malik, K., Yu, G.: A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks 23, 525–532 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Papadimitriou, C.H.: The complexity of the capacitated tree problem. Networks 8, 217–230 (1978)

    Article  MathSciNet  Google Scholar 

  18. Reimann, M., Laumanns, M.: Savings based ant colony optimization for the capacitated minimum spanning tree problem. Computers & Operations Research 33, 1794–1822 (2006)

    Article  MATH  Google Scholar 

  19. Zhou, G., Gen, M.: An effective genetic algorithm approach to the quadratic minimum spanning tree problem. Computer & Operations Research 25, 229–237 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhou, G., Gen, M.: A genetic algorithm approach on tree-like telecommunication network design problem. Journal of The Operational Research Society 54, 248–254 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business and Administration, Zhejiang University of Technology, Zhejiang 310014, China

    Gengui Zhou, Zhenyu Cao, Jian Cao & Zhiqing Meng

Authors
  1. Gengui Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenyu Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jian Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhiqing Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Technology , Xidian University, 710071, Xi’an, China

    Yuping Wang

  2. Department of Computer Science , Hong Kong Baptist University, Hong Kong, China

    Yiu-ming Cheung

  3. Faculty of Applied Mathematics , Guangdong University of Technology, 5100006, Guangzhou, China

    Hailin Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, G., Cao, Z., Cao, J., Meng, Z. (2007). A Centralized Network Design Problem with Genetic Algorithm Approach. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74377-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74376-7

  • Online ISBN: 978-3-540-74377-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation