A memetic algorithm for communication network design taking into consideration an existing network

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 (CA) 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 CA.

[1]  Alexander Gersht,et al.  Joint Optimization of Data Network Design and Facility Selection , 1990, IEEE J. Sel. Areas Commun..

[2]  Pramode K. Verma.  Performance estimation of computer communication networks: a structured approach , 1989 .

[3]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[4]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[5]  Masaaki Shinohara.  Generalization of Pratt's Formula for Dimensioning Circuit-Switched Networks , 1990, Comput. Networks ISDN Syst..

[6]  Sawasd Tantaratana,et al.  Link Capacity Assignment in Packet-Switched Networks: The Case of Piecewise Linear Concave Cost Function , 1999 .

[7]  Yusheng Ji,et al.  Link Capacity Assignment in Packet-Switched Network with Existing Network Consideration , 1995 .

[8]  Hisao Ishibuchi,et al.  Effectiveness of Genetic Local Search Algorithms , 1997, ICGA.

[9]  B. Freisleben,et al.  A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Konosuke Kawashima,et al.  Network Planning Tools ( Network Planning 4. Techniques and Tools for Network Planning 42) , 1993 .

[11]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[12]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[13]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[14]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .