Bhuiyan, Tanveer H. | Search NASA

DOE OSTI2022

Optimal control to handle variations in moisture content and reactor in-feed rate

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 up to 100% without increasing the operating cost of the biomass pre-processing system for biomass with moisture ranging from 10 to 25%. Additionally, HPC reduces the cost of processing biomass by 0.36%–2.22%, and reduces processing time by 0.35%-2.24%. Furthermore, a biorefinery can adapt HPC to achieve its design capacity.

09 BIOMASS FUELS↗

DOE OSTI2021

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗