This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and a set of communication requests, the static RWA deals with the problem of assigning suitable paths and wavelengths to the requests. We introduce benchmark instances from the SND library to the RWA and argue that these instances are more challenging than previously used random instances. We analyze the properties of several instances in detail and propose an improved construction heuristic to handle 'problematic' instances. Our iterated local search finds the optimum for most instances.
In REF , we presented a new set of benchmark instances, on which an iterated local search (ILS) algorithm was applied.
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem
EvoCOP
Mathematics Chemistry Computer Science