Yazar "Nuriyev, U." seçeneğine göre listele

Listeleniyor 1 - 5 / 5
  • Küçük Resim Yok
    Öğe
    The band collocation problem: A library of problems and a metaheuristic approach
    (CEUR-WS, 2016) Kutucu, H.; Gursoy, A.; Kurt, M.; Nuriyev, U.
    In this paper, we consider the Band Collocation Problem (BCP) which may find an application in telecommunication networks, to design an optimal packing of information flows on different wavelengths into groups for obtaining the highest available cost reduction using wavelength division multiplexing (WDM) technology. We give a review of its mathematical models. The linear and nonlinear models have been implemented in GAMS (the General Algebraic Modeling System) and solved using the CPLEX and KNITRO solvers, respectively. Then, we introduce the BCP Library (BCPLib) including 1296 problem instances with different properties that can be accessed at http://www.izmir.edu.tr/bps. Finally, we improve a simulated annealing (SA) meta-heuristic to solve the BCP. The proposed algorithm is performed using two local search methods for several test instances of the BCPLib and compared with the solutions obtained by a genetic algorithm. Experimental results showed that the proposed algorithm improves the quality of solutions. Copyright © by the paper's authors.
  • Küçük Resim Yok
    Öğe
    A heuristic algorithm for the band collocation problem
    (Institute of Electrical and Electronics Engineers Inc., 2017) Gursoy, A.; Kurt, M.; Kutucu, H.; Nuriyev, U.
    In this paper we present a heuristic algorithm for the The Band Collocation Problem (BCP) which may have some applications in the field of telecommunication. First, we give the definition the BCP. Second, we explain how we create the problem instances with known optimal solutions as a library. Third, we propose the heuristic algorithm. Then, we analysis and interpret the results of the proposed algorithm on the problem instances with known optimal solutions. Finally, we suggest new ideas about the BCP and its solution approaches. © 2016 IEEE.
  • Küçük Resim Yok
    Öğe
    ON THE SOLUTION APPROACHES OF THE BAND COLLOCATION PROBLEM
    (Turkic World Mathematical Soc, 2019) Kutucu, H.; Gursoy, A.; Kurt, M.; Nuriyev, U.
    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.
  • Küçük Resim Yok
    Öğe
    ON THE SOLUTION APPROACHES OF THE BAND COLLOCATION PROBLEM
    (Isik University, 2019) Kutucu, H.; Gursoy, A.; Kurt, M.; Nuriyev, U.
    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.
  • Küçük Resim Yok
    Öğe
    The optimization of the bandpass lengths in the multi-bandpass problem
    (Springer Verlag, 2014) Kurt, M.; Kutucu, H.; Gürsoy, A.; Nuriyev, U.
    The Bandpass problem has applications to provide a cost reduction in design and operating telecommunication network. Given a binary matrix A m×n and a positive integer B called the Bandpass length, a set of B consecutive non-zero elements in any column is called a Bandpass. No two bandpasses in the same column can have common rows. The general Bandpass Problem consists of finding an optimal permutation of rows of the matrix A that produces the maximum total number of bandpasses having the same given bandpass length B in all columns. The Multi- Bandpass problem includes different bandpass lengths Bj in each column j of the matrix A, where j = 1,2, ?,n. In this paper, we propose an extended formulation for the Multi-Bandpass problem. A given Bj may not be always efficient bandpass lengths for the communication network. Therefore, it is important to find an optimal values of the bandpass lengths in the Multi-Bandpass problem. In this approach, the lengths in each destination are defined as zj and we present a model to find the optimal values of zj. Then, we calculate the approximate solution of this model using genetic algorithm for the problem instances which are presented in an online library. © Springer-Verlag Berlin Heidelberg 2014.