Transportation network design models with costefficiency, capacity balancing, and resilience
Başlık çevirisi mevcut değil.
- Tez No: 760206
- Danışmanlar: DR. MURAT ERKOC
- Tez Türü: Doktora
- Konular: Ulaşım, Şehircilik ve Bölge Planlama, Transportation, Urban and Regional Planning
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2020
- Dil: İngilizce
- Üniversite: University of Miami
- Enstitü: Yurtdışı Enstitü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: 292
Özet
Özet yok.
Özet (Çeviri)
In this dissertation, a well-known network design and optimization problem that exists in transportation is considered. The corresponding problem is known as service network design problem (SNDP) in the Operations Research literature and lies somewhere between the tactical and operational planning levels. The service network design problem addresses the questions such as where, when, by which vehicle and how often a transportation service should be performed on the network. SNDPs are usually studied on a time-space (also known as time-expanded) network because the problem seeks answers for the 'when' question. For this reason, the output of an SNDP is a schedule that can be implemented in a finite period of time for a rolling basis in most cases. This thesis consists of three main parts in which an independent research problem is studied and prepared for the publication. The first part addresses a generic SNDP for the consolidation-based freight carriers on randomly generated networks; however, the second and third parts rely on the same business problem of a major express shipment carrier in the Caribbean. In the first part (Chapter 2), we study a generalized version of the service network design problem that explicitly incorporates tactical capacity planning for peak demand periods. The objective of the problem is to minimize the overall opera- tional costs by optimally routing and scheduling assets that transport a given set of commodities to be delivered between origin and destination nodes over multiple periods on a transportation service network. We propose an arc-based formulation that employs three alternative approaches for balancing demand and supply in transportation service networks: demand shifting, asset leasing, and outsourcing. We develop valid inequalities to reduce the solution space of the proposed model and present a comprehensive numerical study to assess and demonstrate the computational performance of the model and the contribution of the valid inequalities. We also propose a multi-phase heuristic algorithm, referred to as the dedicate-mergeand-meld algorithm (DMaM), for tackling large size problems. Numerical analysis is carried out to demonstrate that the DMaM algorithm has promising potential for obtaining good solutions in considerably short time windows for large size problems, where the commercial solver fails to initialize the branch-and-bound algorithm due to excessive memory usage. The second part (Chapter 3) considers strategic (location), tactical (allocation), and operational level (routing and scheduling) decisions within the same network design problem simultaneously. The practical aircraft (feeder) routing and scheduling problem of a major express cargo carrier is modeled as a service network design problem on a hierarchical hub-and-spoke network. The company aims to locate hubs at the bottom level of the hierarchy. We formulate the operational problem as a pathbased model and then incorporate the tactical and strategic level decisions into the problem gradually. A multi-step solution procedure is proposed; this first executes an initial data processing that involves data wrangling, route generation, and elimination in order to contain the size of the solution space for the mathematical model. We
Benzer Tezler
- Demiryollarında boş yük vagonlarının dağıtılması
Başlık çevirisi yok
LÜTFÜ GÜRAN
Yüksek Lisans
Türkçe
1998
İnşaat Mühendisliğiİstanbul Teknik Üniversitesiİnşaat Mühendisliği Ana Bilim Dalı
PROF. DR. ORAL TÜMAY
- Urban transportation network design problem with sustainability considerations
Başlık çevirisi yok
NARGES SHAHRAKİ
Doktora
İngilizce
2015
Endüstri ve Endüstri MühendisliğiKoç ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
PROF. DR. METİN TÜRKAY
- Chance-constrained stochastic programming models for humanitarian relief network design
İnsani yardım müdahale ağı tasarımı için olasılıksal kısıt içeren rassal programlama modelleri
ÖZGÜN ELÇİ
Yüksek Lisans
İngilizce
2016
Endüstri ve Endüstri MühendisliğiSabancı ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
DOÇ. DR. NİLAY NOYAN BÜLBÜL
DOÇ. DR. KEREM BÜLBÜL
- Oyun teorisi ile ulaşım ağ tasarımı
Transportation network design whit game theoritical approach
ÖZGÜR CENGİZ
Yüksek Lisans
Türkçe
2005
İnşaat MühendisliğiPamukkale Üniversitesiİnşaat Mühendisliği Ana Bilim Dalı
DOÇ. DR. HALİM CEYLAN
- Routing in trucking service network design problem with transshipments and driver regulations
Aktarmalar ve sürüş düzenlemeleri içeren araç servis ağı tasarlama probleminde rotalama
EKİN ÖZGÜRBÜZ
Yüksek Lisans
İngilizce
2022
Endüstri ve Endüstri MühendisliğiBoğaziçi ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
PROF. DR. FİKRET ÜMİT BİLGE