An integer programming approach to layer planning in communication networks
Başlık çevirisi mevcut değil.
- Tez No: 400952
- Danışmanlar: PROF. MARTINE LABBE
- Tez Türü: Doktora
- Konular: Endüstri ve Endüstri Mühendisliği, Industrial and Industrial Engineering
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2011
- Dil: İngilizce
- Üniversite: Université libre de Bruxelles (École polytechnique de Bruxelles)
- Enstitü: Yurtdışı Enstitü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: 195
Ö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 trac within the network such that all inter-subnetwork trac is routed through the hubs and all intra-subnetwork trac 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
- Hücresel imalatın başlangıç aşamaları için uzman sistem yaklaşımı
An Expert systems approach to the early stages of cellular manufacturing systems design
UFUK CEBECİ
- Multi-location assortment optimization under lead time effects
Teslim süresi etkisi altında çok konumlu ürün çeşidi en iyilemesi
UTKU KARACA
Yüksek Lisans
İngilizce
2018
Endüstri ve Endüstri Mühendisliğiİhsan Doğramacı Bilkent ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
DOÇ. ALPER ŞEN
- Elektrik üretim sistemlerinin optimal planlamasında yeni bir modelleme ve çözüm
Başlık çevirisi yok
SEMRA ÖZTÜRK
Doktora
Türkçe
1989
Elektrik ve Elektronik MühendisliğiMarmara ÜniversitesiElektrik Ana Bilim Dalı
PROF. DR. NESRİN TARKAN
- Risk-averse multi-stage mixed-integer stochastic programming problems
Riskten kaçınan çok aşamalı karma tam sayılı rassal programlama problemleri
ALİ İRFAN MAHMUTOĞULLARI
Doktora
İngilizce
2019
Endüstri ve Endüstri Mühendisliğiİhsan Doğramacı Bilkent ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
DR. ÖĞR. ÜYESİ ÖZLEM ÇAVUŞ İYİGÜN
PROF. DR. MEHMET SELİM AKTÜRK
- A mathematical programming model for aircraft fleet management
Havayolu filo yönetimi için bir matematiksel programlama modeli
ABDULLAH ENES BOLAT
Doktora
İngilizce
2019
Endüstri ve Endüstri MühendisliğiYıldız Teknik ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
DOÇ. DR. FAHRETTİN ELDEMİR