ON THE SOLUTION APPROACHES OF THE BAND COLLOCATION PROBLEM

Basit Öğe Kaydı
dc.contributor.authorKutucu, H.
dc.contributor.authorGursoy, A.
dc.contributor.authorKurt, M.
dc.contributor.authorNuriyev, U.
dc.date.accessioned2024-09-29T16:22:34Z
dc.date.available2024-09-29T16:22:34Z
dc.date.issued2019
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThis 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.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey-TUBiTAK 3001 Project, (:114F073)en_US
dc.identifier.endpage734en_US
dc.identifier.issn2146-1147
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-85085966216en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage724en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/10151
dc.identifier.volume9en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIsik Universityen_US
dc.relation.ispartofTurkish World Mathematical Society Journal of Applied and Engineering Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBand Collocation Problemen_US
dc.subjectDense Wavelength Division Multiplexingen_US
dc.subjectMeta-heuristic Algorithmsen_US
dc.titleON THE SOLUTION APPROACHES OF THE BAND COLLOCATION PROBLEMen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu