Search

The focus of this research is to evaluate the use of drones for the delivery of pediatric vaccines in remote areas of low income and low and middle income countries. Delivering vaccines in these regions is challenging because of the inadequate road networks, and long transportation distances that make it difficult to maintain the cold chain integrity during transportation. We propose a mixed integer linear program to determine the location of drone hubs to facilitate the delivery of vaccines. The model considers the operational attributes of drones, vaccine wastage in the supply chain, cold storage and transportation capacities. We develop a case study using data from Niger to determine the impact of drone deliveries in improving vaccine availability in Niger. Our numerical analysis show an 0.71 to 2.21 increase in vaccine availability. These improvements depend on the available budget to build drone hubs and purchase drones, and the population density in the region of study., Comment: 40 pages; 12 Tables; 11 Figures

Variations of physical and chemical characteristics of biomass reduce equipment utilization and increase operational costs of biomass processing. Biomass processing facilities use sensors to monitor the changes in biomass characteristics. Integrating sensory data into the operational decisions in biomass processing will increase its flexibility to the changing biomass conditions. In this paper, we propose a multi-stage stochastic programming model that minimizes the expected operational costs by identifying the initial inventory level and creating an operational decision policy for equipment speed settings. These policies take the sensory information data and the current biomass inventory level as inputs to dynamically adjust inventory levels and equipment settings according to the changes in the biomass' characteristics. We ensure that a prescribed target reactor utilization is consistently achieved by penalizing the violation of the target reactor feeding rate. A case study is developed using real-world data collected at Idaho National Laboratory's biomass processing facility. We show the value of multi-stage stochastic programming from an extensive computational experiment. Our sensitivity analysis indicates that updating the infeed rate of the system, the processing speed of equipment, and bale sequencing based on the moisture level of biomass improves the processing rate of the reactor and reduces operating costs., Comment: 26 pages, 5 figures

The variations in feedstock characteristics such as moisture and particle size distribution lead to an inconsistent flow of feedstock from the biomass pre-processing system to the reactor in-feed system. These inconsistencies result in low on-stream times at the reactor in-feed equipment. This research develops an optimal process control method for a biomass pre-processing system comprised of milling and densification operations to provide the consistent flow of feedstock to a reactor's throat. This method uses a mixed-integer optimization model to identify optimal bale sequencing, equipment in-feed rate, and buffer location and size in the biomass pre-processing system. This method, referred to as the hybrid process control (HPC), aims to maximize throughput over time. We compare HPC with a baseline feed forward process control. Our case study based on switchgrass finds that HPC reduces the variation of a reactor's feeding rate by 100\% without increasing the operating cost of the biomass pre-processing system for biomass with moisture ranging from 10 to 25\%. A biorefinery can adapt HPC to achieve its design capacity.

Variations of physical and chemical characteristics of biomass lead to an uneven flow of biomass in a biorefinery, which reduces equipment utilization and increases operational costs. Uncertainty of biomass supply and high processing costs increase the risk of investing in the US's cellulosic biofuel industry. We propose a stochastic programming model to streamline processes within a biorefinery. A chance constraint models system's reliability requirement that the reactor is operating at a high utilization rate given uncertain biomass moisture content, particle size distribution, and equipment failure. The model identifies operating conditions of equipment and inventory level to maintain a continuous flow of biomass to the reactor. The Sample Average Approximation method approximates the chance constraint and a bisection search-based heuristic solves this approximation. A case study is developed using real-life data collected at Idaho National Laboratory's pilot biomass processing facility. An extensive computational analysis indicates that sequencing of biomass bales based on moisture level, increasing storage capacity, and managing particle size distribution increase utilization of the reactor and reduce operational costs.

Blending biomass materials of different physical or chemical properties provides an opportunity to adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the thermochemical conversion process at the minimum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass quality. The proposed CCP model ensures that process requirements, which are impacted by physical and chemical properties of biomass, are met most of the time. We consider two problem settings, a centralized and a decentralized supply chain. We propose a mixed-integer linear program to model the blending problem in the centralized setting and a bilevel program to model the blending problem in the decentralized setting. We use the sample average approximation (SAA) method to approximate the chance constraints, and propose solution algorithms to solve this approximation. We develop a case study for South Carolina using data provided by the Billion Ton Study. Based on our results, the blends identified consist mainly of pine and softwood residues. The cost of the centralized supply chain is 2 to 6% lower, which shows that the assumption of centralized decision making leads to underestimating costs in the supply chain., Comment: 33 pages, 2 figures

Millions of young people are not immunized in low- and middle-income (LMI) countries because of low vaccine availability resulting from inefficiencies in cold supply chains. We create supply chain network design and distribution models to address the unique characteristics and challenges facing vaccine supply chains in LMI countries. The models capture the uncertainties of demand for vaccinations and the resulting impacts on immunization, the unique challenges of vaccine administration (such as open vial wastage), the interactions between technological improvements of vaccines and immunizations, and the trade-offs between immunization coverage rates and available resources. The objective is to maximize both the percentage of fully immunized children and the vaccine availability in clinics. Our research examines how these two metrics are affected by three factors: number of tiers in the supply chain, vaccine vial size, and new vaccine technologies. We tested the model using Niger's Expanded Program on Immunization, which is sponsored by the World Health Organization. We make many observations and recommendations to help LMI countries increase their immunization coverage., Comment: 36 pages, 10 figures

In recent years, there have been increasing concerns about the impacts of geomagnetic disturbances (GMDs) on electrical power systems. Geomagnetically-induced currents (GICs) can saturate transformers, induce hot-spot heating and increase reactive power losses. Unpredictable GMDs caused by solar storms can significantly increase the risk of transformer failure. In this paper, we develop a two-stage, distributionally robust (DR) optimization formulation that models uncertain GMDs and mitigates the effects of GICs on power systems through existing system controls (e.g., line switching, generator re-dispatch, and load shedding). This model assumes an ambiguity set of probability distributions for induced geo-electric fields which capture uncertain magnitudes and orientations of a GMD event. We employ state-of-the-art linear relaxation methods and reformulate the problem as a two-stage DR model. We use this formulation to develop a decomposition framework for solving the problem. We demonstrate the approach on the modified Epri21 system and show that the DR optimization method effectively handles prediction errors of GMD events.

Power distribution in remote communities often depends on off-grid microgrids. In order to address the reliability challenges for these microgrids, we develop a mathematical model for topology design, capacity planning, and operation of distributed energy resources in microgrids that includes N-1 security analysis. Due to the prohibitive size of the optimization problem, we develop a rolling-horizon algorithm that is combined with scenario-based decomposition to efficiently solve the model. We demonstrate the efficiency of our algorithm on an adapted IEEE test network and a real network from an Alaskan microgrid. We also compare our model's required solution time with commercial solvers and recently developed decomposition algorithms to solve similar problems., Comment: 21 Pages, 9 figures, submitted to Applied Energy

Since the alternating current optimal power flow (ACOPF) problem was introduced in 1962, developing efficient solution algorithms for the problem has been an active field of research. In recent years, there has been increasing interest in convex relaxations-based solution approaches that are often tight in practice. Based on these approaches, we develop tight piecewise convex relaxations with convex-hull representations, an adaptive, multivariate partitioning algorithm with bound tightening that progressively improves these relaxations and, given sufficient time, converges to the globally optimal solution. We illustrate the strengths of our algorithm using benchmark ACOPF test cases from the literature. Computational results show that our novel algorithm reduces the best-known optimality gaps for some hard ACOPF cases.