Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Gursoy, A." seçeneğine göre listele

Listeleniyor 1 - 4 / 4
Sayfa Başına Sonuç
Sıralama seçenekleri
  • 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.

| Karabük Üniversitesi | Kütüphane | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Kastamonu Yolu Demir Çelik Kampüsü, 78050 - Kılavuzlar, Karabük, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim