Geri Dön

An integer programming approach to layer planning in communication networks

Başlık çevirisi mevcut değil.

PDF İndir

  1. Tez No: 400952
  2. Yazar: FEYZULLAH AYKUT ÖZSOY
  3. Danışmanlar: PROF. MARTINE LABBE
  4. Tez Türü: Doktora
  5. Konular: Endüstri ve Endüstri Mühendisliği, Industrial and Industrial Engineering
  6. Anahtar Kelimeler: Belirtilmemiş.
  7. Yıl: 2011
  8. Dil: İngilizce
  9. Üniversite: Unıversıte Lıbre de Bruxelles (ecole Polytechnıque de Bruxelles)
  10. Enstitü: Yurtdışı Enstitü
  11. Ana Bilim Dalı: Belirtilmemiş.
  12. Bilim Dalı: Belirtilmemiş.
  13. Sayfa Sayısı: Belirtilmemiş.

Özet

Özet yok.

Özet (Çeviri)

In this thesis, we introduce the Partitioning-Hub Location-Routing problem (PHLRP), which can be classi ed as a variant of the hub location problem. PHLRP consists of partitioning a network into sub-networks, locating at least one hub in each subnetwork and routing the tra c within the network such that all inter-subnetwork tra c is routed through the hubs and all intra-subnetwork tra c stays within the sub-networks all the way from the source to the destination. Obviously, besides the hub location component, PHLRP also involves a graph partitioning component and a routing component. PHLRP nds applications in the strategic planning or deployment of the Intermediate System- Intermediate System (ISIS) Internet Protocol networks and the Less-than-truck load freight distribution systems. First, we introduce three IP formulations for solving PHLRP. The hublocation component and the graph partitioning components of PHLRP are modeled in the same way in all three formulations. More precisely, the hublocation component is represented by the p-median variables and constraints; and the graph partitioning component is represented by the size-constrained graph partitioning variables and constraints. The formulations di er from each other in the way the peculiar routing requirements of PHLRP are modeled. We then carry out analytical and empirical comparisons of the three IP formulations. Our thorough analysis reveals that one of the formulations is provably the tightest of the three formulations. We also show analytically that the LP relaxations of the other two formulations do not dominate each other. On the other hand, our empirical comparison in a standard branch-and-cut framework that is provided by CPLEX shows that not the tightest but the most compact of the three formulations yield the best performance in terms of solution time. From this point on, based on the insight gained from detailed analysis of the formulations, we focus our attention on a common sub-problem of the three formulations: the so-called size-constrained graph partitioning problem. We carry out a detailed polyhedral analysis of this problem. The main bene t from this polyhedral analysis is that the facets we identify for the size-constrained graph partitioning problem constitute strong valid inequalities for PHLRP. And nally, we wrap up our e orts for solving PHLRP. Namely, we present the results of our computational experiments, in which we employ some facets of the size-constrained graph partitioning polytope in a branch-and-cut algorithm for solving PHLRP. Our experiments show that our approach brings signi cant improvements to the solution time of PHLRP when compared with the default branch-and-cut solver of XPress.

Benzer Tezler

  1. Tez No

    252

    İzmir'de bazı yolların kapatılarak yaya bölgeleri oluşturma da kent peyzajını geliştirme açısından yeniden planlanması üzerinde araştırmalar

    Başlık çevirisi yok

    BAHAR TÜRKYILMAZ

    Yüksek Lisans

    Türkçe

    Türkçe

    1985

    Şehircilik ve Bölge PlanlamaEge Üniversitesi

    Şehir ve Bölge Planlama Ana Bilim Dalı

  2. Tez No

    207

    Kur'an-ı Kerim'de nasih-mensuh ayetlerin tesbiti

    Başlık çevirisi yok

    REMZİ KAYA

    Yüksek Lisans

    Türkçe

    Türkçe

    1986

    DinUludağ Üniversitesi

    Tefsir Ana Bilim Dalı

    DOÇ. DR. SAKIP YILDIZ

  3. Tez No

    8

    Eksternal etmoidektomiler

    Başlık çevirisi yok

    ERCÜMENT AKMAN

    Tıpta Uzmanlık

    Türkçe

    Türkçe

    1987

    Kulak Burun ve BoğazGazi Üniversitesi

    Kulak Burun Boğaz Ana Bilim Dalı

    PROF.DR. NECMETTİN AKYILDIZ

  4. Tez No

    257

    Kuyruk modelleri ve analizi üzerine bir uygulama

    Başlık çevirisi yok

    DİDEM ÖZPULAT

    Yüksek Lisans

    Türkçe

    Türkçe

    1985

    İstatistikEge Üniversitesi

    Bilgisayar Bilimleri ve Mühendisliği Ana Bilim Dalı

    DOÇ. DR. FİKRET İKİZ

  5. Tez No

    10

    Süt formüllerinin tüketim uygulamaları ve süt formüllerinin C vitamini içeriği ile pH değerleri

    Başlık çevirisi yok

    GÖNÜL VAROL

    Yüksek Lisans

    Türkçe

    Türkçe

    1986

    Besin Hijyeni ve Teknolojisiİstanbul Üniversitesi

    Çocuk Gelişimi Ana Bilim Dalı

    DOÇ. DR. TÜRKAN KUTLUAY

Geri Dön