A Multiobjective Gravitational Search Algorithm Applied to the Static Routing and Wavelength Assignment Problem

One of the most favorable technology for exploiting the huge bandwidth of optical networks is known as Wavelength Division Multiplexing (WDM). Given a set of demands, the problem of setting up all connection requests is known as Routing and Wavelength Assignment (RWA) problem. In this work, we suggest the use of computational swarm intelligent for solving the RWA problem. A new heuristic based on the law of gravity and mass interactions (Gravitational Search Algorithm, GSA) is chosen for this purpose, but adapted to a multiobjective context (MO-GSA). To test the performance of theMO-GSA, we have used a real-world topology, the Nippon Telegraph and Telephone (NTT, Japan). network and six sets of demands. After performing several comparisons with other approaches published in the literature, we can conclude that this algorithm outperforms the results obtained by other authors.

[1]  C. Siva Ram Murthy,et al.  WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .

[2]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[3]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[4]  Miguel A. Vega-Rodríguez,et al.  A Differential Evolution with Pareto Tournaments for solving the Routing and Wavelength Assignment problem in WDM networks , 2010, IEEE Congress on Evolutionary Computation.

[5]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Benjamín Barán,et al.  Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches , 2007, LANC.

[7]  Ahmed E. Kamal,et al.  A survey of multicasting protocols for broadcast-and-select single-hop networks , 2002, IEEE Netw..

[8]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[9]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[10]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[11]  Soco.  Soft Computing Models in Industrial and Environmental Applications, 5th International Workshop (SOCO 2010 , 2010 .

[12]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[13]  Benjamín Barán,et al.  A Multiobjective Ant Colony System for Vehicle Routing Problem with Time Windows , 2003, Applied Informatics.

[14]  Miguel A. Vega-Rodríguez,et al.  Solving the Routing and Wavelength Assignment Problem in WDM Networks by Using a Multiobjective Variable Neighborhood Search Algorithm , 2010, SOCO.