Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem

DOI10.1007/S10878-015-9962-YzbMATH Open1353.90172OpenAlexW2300419167MaRDI QIDQ306092FDOQ306092

Authors: Xinyun Wu, Shengfeng Yan, Xin Wan, Zhipeng Lü 

Publication date: 31 August 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9962-y

Recommendations

• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• Routing and wavelength assignment by partition colouring
• Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem

zbMATH Keywords

network designtabu searchrouting and wavelength assignmentmulti-neighborhood searchperturbation operator

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• Tabu Search—Part I
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Routing and wavelength assignment by partition colouring
• On column generation formulations for the RWA problem
• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• Tabu Search—Part II
• Routing and wavelength assignment in optical networks using bin packing based algorithms
• Multi-neighborhood tabu search for the maximum weight clique problem
• An improved algorithm for the packing of unequal circles within a larger containing circle
• Tabu search with simple ejection chains for coloring graphs
• Iterated tabu search for the circular open dimension problem
• ILP formulations for the routing and wavelength assignment problem: symmetric systems
• Global optimization method for finding dense packings of equal circles in a circle

Cited In (3)

• Dual-neighborhood iterated local search for routing and wavelength assignment
• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks

This page was built for publication: Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306092)