ON THE SOLUTION APPROACHES OF THE BAND COLLOCATION PROBLEM
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Isik University
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This paper introduces the first genetic algorithm approach for solving the Band Collocation Problem (BCP) which is a combinatorial optimization problem that aims to reduce the hardware costs on fiber optic networks. This problem consists of finding an optimal permutation of rows of a given binary rectangular matrix representing a communication network so that the total cost of covering all 1’s by Bands is minimum. We present computational results which indicate that we can obtain almost optimal solutions of moderately large size instances (up to 96 rows and 28 columns) of the BCP within a few seconds. © 2019. All rights reserved.
Açıklama
Anahtar Kelimeler
Band Collocation Problem, Dense Wavelength Division Multiplexing, Meta-heuristic Algorithms
Kaynak
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
WoS Q Değeri
Scopus Q Değeri
Q4
Cilt
9
Sayı
4
