Variable neighborhood descent with iterated local search for routing and wavelength assignment

DOI10.1016/j.cor.2011.10.022zbMath1251.90069MaRDI QIDQ1761137

Philippe Mahey, Rodney R. Saldanha, Christophe Duhamel, Alexandre Xavier Martins, Mauricio C. de Souza

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.022

zbMATH Keywords

local search; network design; variable neighborhood descent; routing and assignment

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem, Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan, Solving routing and wavelength assignment problem with maximum edge-disjoint paths

Uses Software

• PERL
• TTTPLOTS

Cites Work

• Unnamed Item
• Routing and wavelength assignment by partition colouring
• Routing and wavelength assignment in optical networks using bin packing based algorithms
• Variable neighbourhood search: methods and applications
• On column generation formulations for the RWA problem
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• Probability distribution of solution time in GRASP: an experimental investigation
• TTT plots: a perl program to create time-to-target plots
• Wavelength Routing and Assignment in a Survivable WDM Mesh Network
• Variable Neighborhood Search