A Memetic Algorithm for Communication Network Design Taking into Consideration an Existing Network

  • Suwan Runggeratigul
Part of the Applied Optimization book series (APOP, volume 86)


This paper applies a memetic algorithm (MA) to solve a communication network design problem taking into consideration existing network facilities. The link capacity assignment problem in packet-switched networks (CA problem) is studied as an example of the network design problem. In the CA problem, we focus on the case in which link cost functions are piecewise linear concave, where the unit cost of the newly-installed link capacity is smaller than that of the existing link capacity. The MA in this paper is constructed by combining a genetic algorithm (GA) with a local search operator, which is a heuristic design algorithm previously developed for the CA problem. Experimental results show that MA solves the CA problem very efficiently, and the solutions obtained by MA are better than those by GA.


Communication network design Packet-switched networks Link capacity assignment Genetic algorithms Memetic algorithms. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. R. E. Burkard. Quadratic assignment problems. European Journal of Operational Research, 15: 283–289, 1984.MathSciNetzbMATHCrossRefGoogle Scholar
  2. M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Trans Commun, COM-25: 48–60, 1977.Google Scholar
  3. A. Gersht and R. Weihmayer. Joint optimization of data network design and facility selection. IEEE J Select Area Commun, 8: 1667–1681, 1990.CrossRefGoogle Scholar
  4. H. Ishibuchi, T. Murata, and S. Tomioka. Effectiveness of genetic local search algorithms. In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 505–512, 1997.Google Scholar
  5. K. Kawashima and H. Kobayashi. Network planning tools. Journal of IEICE, 76: 141–148, 1993.Google Scholar
  6. A. Kershenbaum. Telecommunications Network Design Algorithms. McGraw-Hill, New York, 1993.Google Scholar
  7. L. Kleinrock. Queueing Systems, Volume II. John Wiley & Sons, New York, 1976.Google Scholar
  8. P. Merz and B. Freisleben. A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In Proceedings of the 1999 Congress on Evolutionary Computation, pages 2063–2070, 1999.Google Scholar
  9. P. Moscato. Memetic algorithms: A short introduction. In D. Come, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 219–234. McGraw-Hill, London, 1999.Google Scholar
  10. S. Runggeratigul. Application of genetic algorithms to communication network design taking into consideration an existing network. In Proceedings of the Second Asia-Pacific Conference on Genetic Algorithms and Applications, pages 323–331, 2000.Google Scholar
  11. S. Runggeratigul and S. Tantaratana. Link capacity assignment in packet-switched networks: the case of piecewise linear concave cost function. IEICE Trans Commun, E82-B: 1566–1576, 1999.Google Scholar
  12. S. Runggeratigul, W. Zhao, Y. Ji, A. Aizawa, and S. Asano. Link capacity assignment in packet-switched network with existing network consideration. IEICE Trans Commun, E78-B: 709–719, 1995.Google Scholar
  13. M. Shinohara. Generalization of Pratt’s formula for dimensioning circuit-switched network. Computer Networks and ISDN Systems, 20: 115–126, 1990.CrossRefGoogle Scholar
  14. P. K. Verma. Performance Estimation of Computer Communication Networks. Computer Science Press, Rockville, 1989.Google Scholar
  15. B. Yaged. Minimum cost routing for static network models. Networks, 1: 139–172, 1971.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Suwan Runggeratigul
    • 1
  1. 1.Telecommunications Program Sirindhorn International Institute of TechnologyThammasat UniversityPathumthaniThailand

Personalised recommendations