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ı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
This paper introduces the first genetic algorithm approach for solving theBand Collocation Problem (BCP) which is a combinatorial optimization problem thataims to reduce the hardware costs on fiber optic networks. This problem consists offinding an optimal permutation of rows of a given binary rectangular matrix representinga 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 optimalsolutions of moderately large size instances (up to 96 rows and 28 columns) of the BCPwithin a few seconds.
Açıklama
Anahtar Kelimeler
Kaynak
TWMS (Turkic World Mathematical Society) Journal of Applied and Engineering Mathematics
WoS Q Değeri
Scopus Q Değeri
Cilt
9
Sayı
4
