Solving multi-objective routing and wavelength assignment in WDM network using hybrid evolutionary computation approach

  • Authors:

  • Pakorn Leesutthipornchai;Chalermpol Charnsripinyo;Naruemon Wattanapongsakorn

  • Affiliations:

  • Department of Computer Engineering, Faculty of Engineering, King Mongkut's University of Technology Thonburi, 126 Pracha-uthit Rd., Bangmod, Thungkru, Bangkok 10140, Thailand;National Electronics and Computer Technology Center, 112 Phahonyothin Road, Klong Luang, Pathumthani 12120, Thailand;Department of Computer Engineering, Faculty of Engineering, King Mongkut's University of Technology Thonburi, 126 Pracha-uthit Rd., Bangmod, Thungkru, Bangkok 10140, Thailand

  • Venue:
  • Computer Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.24

Visualization

Abstract

Routing and wavelength assignment (RWA) is a well-known issue in wavelength division multiplexing (WDM) optical networks. In this paper, we present RWA design for WDM networks by considering multiple design objectives which are maximizing the number of traffic demands to be served and minimizing the number of wavelength channels to be assigned. A hybrid evolutionary computation approach consisting of genetic algorithm for routing allocation with minimum degree first for wavelength assignment (GA-MDF) and the fast non-dominated sorting genetic algorithm (NSGA-II) to search for non-dominated solutions is applied for solving the multi-objective RWA network design problem. The hybrid evolutionary algorithm is used as a meta-heuristic technique for obtaining good solutions for various problem sizes. The obtained results are provided as candidate choices or non-dominated front. We compare the simulation results obtained from the NSGA-II with those obtained from the traditional Weighted-Sum approach. Numerical results show that our hybrid evolutionary computation approach is effective in solving the multi-objective RWA problem. The GA-MDF can outperform the FAR-FF method in both design objectives. In addition, the solutions from the NSGA-II are more diverse on the multi-objective space than those of the Weighted-Sum method. We also apply a Pruned mechanism to help cutting off numerous non-dominated solutions for making decision on the final solution.