Integrated vehicle routing and warehouse location problem
Entegre araç rotalama ve depo yerleşimi problemi
- Tez No: 136746
- Danışmanlar: YRD. DOÇ. DR. SELÇUK SAVAŞ, YRD. DOÇ. DR. METİN TÜRKAY
- Tez Türü: Yüksek Lisans
- Konular: Endüstri ve Endüstri Mühendisliği, Industrial and Industrial Engineering
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2003
- Dil: İngilizce
- Üniversite: Koç Üniversitesi
- Enstitü: Fen Bilimleri Enstitüsü
- Ana Bilim Dalı: Endüstri Mühendisliği Ana Bilim Dalı
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: 88
Özet
Özet yok.
Özet (Çeviri)
ABSTRACT This thesis proposes an exact algorithm for the integrated vehicle routing and warehouse location problem, known as WLRP. WLRP helps the supply chain managers to make strategic level decisions, and may be used in a supply chain environment at different industrial sectors. Previous work on WLRP emphasized heuristic and metaheuristic solution approaches that do not guarantee optimality. In search of optimality, other related and well-studied problems are investigated and it is concluded that there is a close relationship between the vehicle routing problem with time windows (VRPTW) and WLRP. Therefore, first the VRPTW is studied extensively as a foundation to WLRP. Recent studies on VRPTW call attention to column generation methods together with the branch and bound algorithm. The column generation algorithm with dynamic programming is used and in this thesis a new dynamic programming formulation is presented. Furthermore, for heterogeneous fleet problems, a new variant of vehicle routing problem (VRP) is formulated which is named as the vehicle routing problem with time windows and discrete capacities (VRPTWDC); and the dynamic program is modified for this problem. The WLRP is formulated as a set partitioning problem and column generation technique is applied. The dynamic program is extensively modified to handle the problem more effectively, the bounds are tightened using 2-path cuts and the subtours are eliminated using a separation algorithm. Finally, branch and bound method is applied to solve WLRP optimally. All benchmark problems in WLRP literature are solved and it is illustrated that the proposed algorithm yields better solutions compared to algorithms reported in the literature. IV
Benzer Tezler
- Tedarik zinciri dağıtım ağı kapsamında depo yeri seçimi probleminin ve araç rotalama probleminin bütünleşik çözümü
Integrated solution of the warehouse location problem and the vehicle routing problem within the scope of supply chain distribution network
TUBA EZGİ ÇAKIR ESEN
Doktora
Türkçe
2022
İşletmeİstanbul Üniversitesiİşletme Ana Bilim Dalı
DR. ÖĞR. ÜYESİ BİRGÜL KÜÇÜK ÇIRPIN
- Yer seçimi ve araç rotalama problemi: Gıda sektöründe bir uygulama
Location routing problem: An application in food industry
ESRA YAŞAR
Yüksek Lisans
Türkçe
2017
Endüstri ve Endüstri MühendisliğiNecmettin Erbakan ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
YRD. DOÇ. DR. AHMET REHA BOTSALI
- Afet sonrası dağıtım problemi için bütünleşik bir çözüm yaklaşımı
An integrated solution approach for the post-disaster distribution problem
BUKET ŞEN
Yüksek Lisans
Türkçe
2021
Endüstri ve Endüstri MühendisliğiSakarya ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
PROF. DR. EMİN GÜNDOĞAR
- Kapasite kısıtlı yerleştirme rotalama probleminin bir melez karınca kolonisi algoritması ile çözümü
Solution of capacitated location routing problem with hybrid ant colony algorithm
SÜMEYYE GİZEM ÇAKAR
Yüksek Lisans
Türkçe
2021
Endüstri ve Endüstri MühendisliğiSakarya ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
PROF. DR. HARUN REŞİT YAZĞAN
- İnsansız hava aracıyla araç rotalama problemine genetik algoritma yaklaşımı
Genetic algorithm approach for drone routing problem
AHMET MACİT AYTEKİN
Yüksek Lisans
Türkçe
2023
Endüstri ve Endüstri MühendisliğiYıldız Teknik ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
PROF. NİHAN ÇETİN DEMİREL