Article ID: | iaor2007511 |
Country: | Netherlands |
Volume: | 171 |
Issue: | 3 |
Start Page Number: | 797 |
End Page Number: | 810 |
Publication Date: | Jun 2006 |
Journal: | European Journal of Operational Research |
Authors: | Ribeiro Celso C., Noronha Thiago F. |
Keywords: | heuristics: tabu search |
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, followed by the solution of a partition colouring problem in a conflict graph. A new tabu search heuristic is also proposed for the partition colouring problem, which may be viewed as an extension of the graph colouring problem. Computational experiments are reported, showing that the tabu search heuristic outperforms the best heuristic for partition colouring by approximately 20% in the average and illustrating that the new approach for the problem of routing and wavelength assignment is more robust than a well established heuristic for this problem.