The band collocation problem

Hakan Kutucu (), Arif Gursoy (), Mehmet Kurt () and Urfat Nuriyev ()
Additional contact information
Hakan Kutucu: Karabuk University
Arif Gursoy: Ege University
Mehmet Kurt: Bahcesehir University
Urfat Nuriyev: Ege University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 2, No 8, 454-481

Abstract: Abstract 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.

Keywords: Combinatorial optimization problem; Heuristic algorithm; Meta-heuristic algorithm; Bandpass problem; Dense wavelength-division multiplexing technology; Telecommunication; 90C27; 90C59; 90C09 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00576-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:40:y:2020:i:2:d:10.1007_s10878-020-00576-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00576-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().