Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm

Abstract

The Routing and Wavelength Assignment problem is a graph optimization problem which deals with optical networks, where communication requests in a network have to be fulfilled. In this paper, we present a multilevel distributed memetic algorithm (ML-DMA) for the static RWA which finds provable optimal solutions for most benchmark instances with known lower bounds and is capable of handling large instances. Components of our ML-DMA include iterated local search, recombination, multilevel scaling, and a gossip-based distribution algorithm. Results demonstrated that our ML-DMA is among the most sophisticated heuristic RWA algorithms published so far.

Stratified prototype selection based on a steady-state memetic algorithm: a study of scalability

“…MAs have been shown to be more efficient (i.e., needing fewer evaluations to find optima) and more effective (identifying higher quality solutions) than traditional EAs for some problem domains. In the literature, we can find a lot of applications of MAs to different problems; see [29] for an understanding of MA issues, and [4,18,30] for examples of MAs applied to different domain problems.…”

Solving routing and wavelength assignment problem with maximum edge-disjoint paths

“…The first one decomposes the problem into two subproblems, the routing subproblem and wavelength assignment problem [8,1,14,18,23] to be solved separately. The other one solves the two subproblems simultaneously [21,6,15,22]. The study in [1] employed a multicommodity flow formulation combined with randomized rounding to calculate the route for each request.…”

“…Computational results indicate that better solutions can be found than those obtained by a multistart variant of BFD in less time on average. In recent years, other soft computing techniques such as the particle swarm optimization (PSO) [8], artificial bee colony (ABC) [11] and memetic algorithm [6] were applied to solve the RWA problem. For the PSO and ABC algorithms, several route candidates are precomputed for each request using the kth-shortest paths algorithm.…”

“…Then a bin-packing based method is used to solve the wavelength assignment problem. Different local search approaches were proposed in [16] and [6]. Both works construct the initial solution by BFD-RWA [21].…”

“…The experimental results showed that VND-ILS is able to improve the solution quality significantly. In [6], a memetic algorithm which includes the ILS, mutation, and recombination operators was proposed. In addition, a multilevel algorithm was applied to address large size instances.…”