2,201 research outputs found
Designing a robust supply chain network against disruptions
Supply chains are vulnerable to disruptions at any stage of the distribution system. These disruptions can be caused by natural disasters, production problems, or labor defects. The consequences of these disruptions may result in significant economic losses or even human deaths. Therefore, it is important to consider any disruption as an important factor in strategic supply chain design. Consequently, the primary outputs of this dissertation include insights for designing robust supply chains that are neither significantly nor adversely impacted by disruptions. The impact of correlated supplier failures is examined and how this problem can be modeled as a variant of a facility location problem is described. Two main problems are defined, the first being the design of a robust supply chain, and the second being the optimization of operational inspection schedules to maintain the quality of an already established supply chain. In this regard, both strategic and operational decisions are considered in the model and (1) a two-stage stochastic programming model; (2) a multi-objective stochastic programming model; and (3) a dynamic programming model are developed to explore the tradeoffs between cost and risk. Three methods are developed to identify optimal and robust solutions: an integer L-shaped method; a hybrid genetic algorithm using Data Envelopment Analysis; and an approximate dynamic programming method. Several sensitivity analyses are performed on the model to see how the model output would be affected by uncertainty. The findings from this dissertation will be able to help both practitioners designing supply chains, as well as policy makers who need to understand the impact of different disruption mitigation strategies on cost and risk in the supply chain
The GNAT method for nonlinear model reduction: effective implementation and application to computational fluid dynamics and turbulent flows
The Gauss--Newton with approximated tensors (GNAT) method is a nonlinear
model reduction method that operates on fully discretized computational models.
It achieves dimension reduction by a Petrov--Galerkin projection associated
with residual minimization; it delivers computational efficency by a
hyper-reduction procedure based on the `gappy POD' technique. Originally
presented in Ref. [1], where it was applied to implicit nonlinear
structural-dynamics models, this method is further developed here and applied
to the solution of a benchmark turbulent viscous flow problem. To begin, this
paper develops global state-space error bounds that justify the method's design
and highlight its advantages in terms of minimizing components of these error
bounds. Next, the paper introduces a `sample mesh' concept that enables a
distributed, computationally efficient implementation of the GNAT method in
finite-volume-based computational-fluid-dynamics (CFD) codes. The suitability
of GNAT for parameterized problems is highlighted with the solution of an
academic problem featuring moving discontinuities. Finally, the capability of
this method to reduce by orders of magnitude the core-hours required for
large-scale CFD computations, while preserving accuracy, is demonstrated with
the simulation of turbulent flow over the Ahmed body. For an instance of this
benchmark problem with over 17 million degrees of freedom, GNAT outperforms
several other nonlinear model-reduction methods, reduces the required
computational resources by more than two orders of magnitude, and delivers a
solution that differs by less than 1% from its high-dimensional counterpart
Cognitive Communications in White Space: Opportunistic Scheduling, Spectrum Shaping and Delay Analysis
abstract: A unique feature, yet a challenge, in cognitive radio (CR) networks is the user hierarchy: secondary users (SU) wishing for data transmission must defer in the presence of active primary users (PUs), whose priority to channel access is strictly higher.Under a common thread of characterizing and improving Quality of Service (QoS) for the SUs, this dissertation is progressively organized under two main thrusts: the first thrust focuses on SU's throughput by exploiting the underlying properties of the PU spectrum to perform effective scheduling algorithms; and the second thrust aims at another important QoS performance of the SUs, namely delay, subject to the impact of PUs' activities, and proposes enhancement and control mechanisms. More specifically, in the first thrust, opportunistic spectrum scheduling for SU is first considered by jointly exploiting the memory in PU's occupancy and channel fading. In particular, the underexplored scenario where PU occupancy presents a {long} temporal memory is taken into consideration. By casting the problem as a partially observable Markov decision process, a set of {multi-tier} tradeoffs are quantified and illustrated. Next, a spectrum shaping framework is proposed by leveraging network coding as a {spectrum shaper} on the PU's traffic. Such shaping effect brings in predictability of the primary spectrum, which is utilized by the SUs to carry out adaptive channel sensing by prioritizing channel access order, and hence significantly improve their throughput. On the other hand, such predictability can make wireless channels more susceptible to jamming attacks. As a result, caution must be taken in designing wireless systems to balance the throughput and the jamming-resistant capability. The second thrust turns attention to an equally important performance metric, i.e., delay performance. Specifically, queueing delay analysis is conducted for SUs employing random access over the PU channels. Fluid approximation is taken and Poisson driven stochastic differential equations are applied to characterize the moments of the SUs' steady-state queueing delay. Then, dynamic packet generation control mechanisms are developed to meet the given delay requirements for SUs.Dissertation/ThesisPh.D. Electrical Engineering 201
- …