ON THE SOLUTION APPROACHES OF THE BAND COLLOCATION PROBLEM

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 re...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 9; no. 4; p. 724
Main Authors Kutucu, H, Gursoy, A, Kurt, M, Nuriyev, U
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2019
Elman Hasanoglu
Subjects
Algorithms
Collocation
Combinatorial analysis
Fiber optic equipment
Fiber optic networks
Fiber optics
Frequency division multiplexing
Genetic algorithms
Optical communication
Optimization
Permutations
Production scheduling
Online AccessGet full text

Cover

More Information
Summary: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. Keywords: Band Collocation Problem, Dense Wavelength Division Multiplexing, Meta-heuristic Algorithms AMS Subject Classification: 90C05, 90C09, 90B18, 93A30, 90C27, 90C59
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2146-1147
2146-1147