Exportar Publicação

Gomes, I., Cancela, L. & Rebola, J. (2022). Exploring the tabu search algorithm as a graph coloring technique for wavelength assignment in optical networks. In de Ceglia, D., Raposo, M., Albella, P., & Ribeiro, P. (Ed.), Proceedings of the 10th International Conference on Photonics, Optics and Laser Technology (PHOTOPTICS 2022) . (pp. 59-68). Online: SCITEPRESS – Science and Technology Publications, Lda.

I. Gomes et al.,  "Exploring the tabu search algorithm as a graph coloring technique for wavelength assignment in optical networks", in Proc. of the 10th Int. Conf. on Photonics, Optics and Laser Technology (PHOTOPTICS 2022) , de Ceglia, D., Raposo, M., Albella, P., & Ribeiro, P., Ed., Online, SCITEPRESS – Science and Technology Publications, Lda, 2022, pp. 59-68

@inproceedings{gomes2022_1732210329551,
	author = "Gomes, I. and Cancela, L. and Rebola, J.",
	title = "Exploring the tabu search algorithm as a graph coloring technique for wavelength assignment in optical networks",
	booktitle = "Proceedings of the 10th International Conference on Photonics, Optics and Laser Technology (PHOTOPTICS 2022) ",
	year = "2022",
	editor = "de Ceglia, D., Raposo, M., Albella, P., & Ribeiro, P.",
	volume = "",
	number = "",
	series = "",
	doi = "10.5220/0010910000003121",
	pages = "59-68",
	publisher = "SCITEPRESS – Science and Technology Publications, Lda",
	address = "Online",
	organization = "",
	url = "https://www.scitepress.org/ProceedingsDetails.aspx?ID=O5TlbFtkXgk=&t=1"
}

TY  - CPAPER
TI  - Exploring the tabu search algorithm as a graph coloring technique for wavelength assignment in optical networks
T2  - Proceedings of the 10th International Conference on Photonics, Optics and Laser Technology (PHOTOPTICS 2022) 
AU  - Gomes, I.
AU  - Cancela, L.
AU  - Rebola, J.
PY  - 2022
SP  - 59-68
DO  - 10.5220/0010910000003121
CY  - Online
UR  - https://www.scitepress.org/ProceedingsDetails.aspx?ID=O5TlbFtkXgk=&t=1
AB  -  The aim of this work is to study the Tabu Search algorithm as a graph coloring technique for wavelength assignment in optical networks, a crucial function in optical network planning. The performance of the Tabu Search is assessed in terms of the number of wavelengths and computation time and is compared with the one of the most common Greedy algorithm. It is concluded that for real networks with a large number of nodes and a higher variance node degree of the path graph relatively to its average node degree value, the Greedy algorithm is preferable to the Tabu Search algorithm since it returns the same number of colors of Tabu Search, but in a shorter computation time.
ER  -