Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Computers and Operations Research
IEEE/ACM Transactions on Networking (TON)
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
Journal of Heuristics
Wavelength Routing and Assignment in a Survivable WDM Mesh Network
Operations Research
On column generation formulations for the RWA problem
Discrete Applied Mathematics
Efficient implementations of heuristics for routing and wavelength assignment
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A biased random-key genetic algorithm for routing and wavelength assignment
Journal of Global Optimization
Review: Comparison of ILP formulations for the RWA problem
Optical Switching and Networking
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
Computers and Operations Research
Hi-index | 0.01 |
In this work we treat the Routing and Wavelength Assignment (RWA) with focus on minimizing the number of wavelengths to route demand requests. Lightpaths are used to carry the traffic optically between origin-destination pairs. The RWA is subjected to wavelength continuity constraints, and a particular wavelength cannot be assigned to two different lightpaths sharing a common physical link. We develop a Variable Neighborhood Descent (VND) with Iterated Local Search (ILS) for the problem. In a VND phase we try to rearrange requests between subgraphs associated to subsets of a partition of the set of lightpath requests. In a feasible solution, lightpaths belonging to a subset can be routed with the same wavelength. Thus, the purpose is to eliminate one subset of the partition. When VND fails, we perform a ILS phase to disturb the requests distribution among the subsets of the partition. An iteration of the algorithm alternates between a VND phase and a ILS phase. We report computational experiments that show VND-ILS was able to improve results upon powerful methods proposed in the literature.