On the solution approaches of the band collocation problem
Citation
Kutucu, H., Gürsoy, A., Kurt, M. & Nuriyev, U. (2019). On the solution approaches of the band collocation problem. TWMS Journal of Applied and Engineering Mathematics, 9(4), 724-734.Abstract
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.
Source
TWMS Journal of Applied and Engineering MathematicsVolume
9Issue
4URI
https://hdl.handle.net/11729/2764http://jaem.isikun.edu.tr/web/index.php/archive/103-vol9no4/460
Collections
The following license files are associated with this item: