Facility location and relocation problem: Models and decomposition algorithms
Başlık çevirisi mevcut değil.
- Tez No: 401304
- Danışmanlar: DR. GINO LIM
- Tez Türü: Doktora
- Konular: Endüstri ve Endüstri Mühendisliği, Industrial and Industrial Engineering
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2012
- Dil: İngilizce
- Üniversite: Unıversıty Of Houston
- Enstitü: Yurtdışı Enstitü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: Belirtilmemiş.
Özet
Özet yok.
Özet (Çeviri)
We consider the facility location and relocation problem (FLRP). Due to demand change in this problem, we may need to close some existing facilities from low demand areas and open new ones in newly emerging areas. Specifically, we discuss three optimization problems in FLRP. The first problem is to locate a certain number of facilities at a point in time, knowing that demand is subject to change and the total number of facilities may increase in the future. We develop a binary integer programming (BIP) model to find a set of initial and future facility locations. Utilizing the block-angular structure of the model, a decomposition algorithm is proposed to solve the problem. The second problem is the robust facility relocation problem. Suppose we already have a set of facilities and the demand distribution over the network has changed, however, we do not know the actual changes of demand. Therefore, different scenarios with known probabilities are used to capture such demand changes. We present two approaches to solve this problem. In the first approach, we develop a BIP model that can determine -reliable relocations that minimize the maximum regret associated with a set of scenarios whose cumulative probability is at least . In the second approach, we develop a BIP model that minimizes the expected weighted distance and ensures that relative regret for each scenario is no more than . We propose a Lagrangean decomposition algorithm to solve this problem. The third problem, which is the dynamic facility location and relocation problem, is designed to find locations for facilities in the aftermath of disasters such as hurricanes and earthquakes, where the population is in need of essential commodities due to the lack of infrastructure. We develop three MIP models, each having different objectives, and propose a heuristic algorithm to solve this problem. Numerical experiments are made to show the efficiency and complexity of our optimization models.
Benzer Tezler
- Algorithms for the vehicle routing problem with time windows and the location-routing problem
Zaman çerçeveli araç rotalama problemi ve yer bulma-rotalama problemi için algoritmalar
SUAT BOĞ
Yüksek Lisans
İngilizce
2006
Endüstri ve Endüstri MühendisliğiKoç ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
YRD. DOÇ. DR. SELÇUK SAVAŞ
YRD. DOÇ. DR. METİN TÜRKAY
- Dynamic relief provision planning for en route refugees in humanitarian logistics
İnsani lojistikte göç halindeki mülteciler için dinamik yardım sağlama planlaması
AMIRREZA PASHAPOUR
Doktora
İngilizce
2025
Endüstri ve Endüstri MühendisliğiKoç ÜniversitesiEndüstri Mühendisliği ve Operasyon Yönetimi
PROF. DR. FATMA SİBEL SALMAN ULUTAŞ
- İnsani yardım lojistiğinde dağıtım merkezi yer seçimi ve İstanbul uygulaması
Distribution center location selection in humanitarian logistics and Istanbul application
HAFİZE YILMAZ
Doktora
Türkçe
2021
Endüstri ve Endüstri Mühendisliğiİstanbul Teknik ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
DOÇ. DR. ÖZGÜR KABAK
- Çok uluslu işletmelerde yönetim ve organizasyon modelleri
Organization and management models in multinational companies
ÇEŞMİAHU AKSOYTÜRK
- Tersane yerleşimi optimizasyonu ve simülasyonu
Shipyard layout optimization and simulation
SALİM TAMER
Doktora
Türkçe
2023
Endüstri ve Endüstri Mühendisliğiİstanbul Teknik ÜniversitesiGemi İnşaatı ve Gemi Makineleri Mühendisliği Ana Bilim Dalı
PROF. DR. BARIŞ BARLAS