Robust optimization criteria: state-of-the-art and new issues

Uncertain parameters appear in many optimization problems raised by real-world applications. To handle such problems, several approaches to model uncertainty are available, such as stochastic programming and robust optimization. This study is focused on robust optimization, in particular, the criteria to select and determine a robust solution. We provide an overview on robust optimization criteria … Read more

A biased random-key genetic algorithm for routing and wavelength assignment

The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to … Read more

A genetic algorithm with random keys for routing and wavelength assignment

The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to … Read more

Efficient implementations of heuristics for routing and wavelength assignment

The problem of Routing and Wavelength Assignment in Wavelength Division Multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned to different wavelengths. When the objective is to minimize the total number of wavelengths used, … Read more

Routing and wavelength assignment by partition coloring

We show in this work how the problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, followed by the solution of a partition coloring problem in a conflict graph. A new tabu search heuristic is also proposed for the … Read more