The band collocation problem
Küçük Resim Yok
Tarih
2020
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In order to reduce costs in the telecommunication sector, many mathematical models have been developed. Over time, these models either fall out out of use or are revised according to new technological developments. The Bandpass Problem (BP) is an optimization problem introduced in 2004 to reduce hardware costs in communication networks. However, over time, technological advances in fiber-optic networks have caused the BP to lose functionality and usability. Major changes should be made to the model to make the BP functional again. It is necessary to define the problem after having made these changes as a new problem, not as a revised problem. In this paper, we first review the BP. We then discuss the notion that the BP has become unusable due to technological developments. We introduce a new problem called the Band Collocation Problem (BCP), which fixes the issues in the BP. We also develop several mathematical models of the BCP. Furthermore, we prove that the BCP is NP-hard. In order to encourage further research, we develop a Library of Band Collocation Problems. Finally, we present heuristic and meta-heuristic methods to solve the BCP and compare the computational results.
Açıklama
Anahtar Kelimeler
Combinatorial optimization problem, Heuristic algorithm, Meta-heuristic algorithm, Bandpass problem, Dense wavelength-division multiplexing technology, Telecommunication
Kaynak
Journal of Combinatorial Optimization
WoS Q Değeri
Q3
Scopus Q Değeri
Q2
Cilt
40
Sayı
2
