Routing and wavelength assignment in optical networks using bin packing based algorithms
From MaRDI portal
Publication:856305
DOI10.1016/j.ejor.2006.01.003zbMath1109.90015OpenAlexW2077182819MaRDI QIDQ856305
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.003
Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (12)
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem ⋮ Solving routing and wavelength assignment problem with maximum edge-disjoint paths ⋮ 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 ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ Shortest node-disjoint paths on random graphs ⋮ Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks ⋮ A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands ⋮ Variable neighborhood descent with iterated local search for routing and wavelength assignment ⋮ A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
Cites Work
This page was built for publication: Routing and wavelength assignment in optical networks using bin packing based algorithms
