Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Discrete Simulation Optimization Approach Towards Calibration of an Agent-based Simulation Model of Hepatitis C Virus Transmission
98
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This study demonstrates the implementation of the stochastic ruler discrete simulation optimization method for calibrating an agent-based model (ABM) developed to simulate hepatitis C virus (HCV) transmission. The ABM simulates HCV transmission between agents interacting in multiple environments relevant for HCV transmission in the Indian context. Key outcomes of the ABM are HCV and injecting drug user (IDU) prevalences among the simulated cohort. Certain input parameters of the ABM need to be calibrated so that simulation outcomes attain values as close as possible to real-world HCV and IDU prevalences. We conceptualize the calibration process as a discrete simulation optimization problem by discretizing the calibration parameter ranges, defining an appropriate objective function, and then applying the stochastic ruler random search method to solve this problem. We also present a method that exploits the monotonic relationship between the simulation outcomes and calibration parameters to yield improved calibration solutions with lesser computational effort.
rate research
Read More
A probabilistic performance-oriented control design optimization approach is introduced for flight systems. Aiming at estimating rare-event probabilities accurately and efficiently, subset simulation is combined with surrogate modeling techniques to improve efficiency. At each level of subset simulation, the samples that are close to the failure domain are employed to construct a surrogate model. The existing surrogate is then refined progressively. In return, seed and sample candidates are screened by the updated surrogate, thus saving a large number of calls to the true model and reducing the computational expense. Afterwards, control parameters are optimized under rare-event chance constraints to directly guarantee system performance. Simulations are conducted on an aircraft longitudinal model subject to parametric uncertainties to demonstrate the efficiency and accuracy of this method.
This brief introduction to Model Predictive Control specifically addresses stochastic Model Predictive Control, where probabilistic constraints are considered. A simple linear system subject to uncertainty serves as an example. The Matlab code for this stochastic Model Predictive Control example is available online.
In this paper, we propose a relaxation to the stochastic ruler method originally described by Yan and Mukai in 1992 for asymptotically determining the global optima of discrete simulation optimization problems. We show that our proposed variant of the stochastic ruler method provides accelerated convergence to the optimal solution by providing computational results for two example problems, each of which support the better performance of the variant of the stochastic ruler over the original. We then provide the theoretical grounding for the asymptotic convergence in probability of the variant to the global optimal solution under the same set of assumptions as those underlying the original stochastic ruler method.
In this paper we propose a novel method to establish stability and, in addition, convergence to a consensus state for a class of discrete-time Multi-Agent System (MAS) evolving according to nonlinear heterogeneous local interaction rules which is not based on Lyapunov function arguments. In particular, we focus on a class of discrete-time MASs whose global dynamics can be represented by sub-homogeneous and order-preserving nonlinear maps. This paper directly generalizes results for sub-homogeneous and order-preserving linear maps which are shown to be the counterpart to stochastic matrices thanks to nonlinear Perron-Frobenius theory. We provide sufficient conditions on the structure of local interaction rules among agents to establish convergence to a fixed point and study the consensus problem in this generalized framework as a particular case. Examples to show the effectiveness of the method are provided to corroborate the theoretical analysis.
The outbreak of coronavirus disease 2019 (COVID-19) has led to significant challenges for schools, workplaces and communities to return to operations during the pandemic, while policymakers need to balance between individuals safety and operational efficiency. In this paper, we present a mixed-integer programming model for redesigning routes and bus schedules for the University of Michigan (UM)s campus bus system, to prepare for students return in the 2020 Fall semester. To ensure less than 15-minute travel time for all routes and to enforce social distancing among passengers, we propose a hub-and-spoke design and utilize real data of student activities to identify hub locations and reduce the number of bus stops used in the new routes. The new bus routes, although using only 50% or even fewer seats in each bus, can still satisfy peak-hour demand in regular semesters at UM. We sample a variety of scenarios that cover variations of peak demand, social-distancing requirements, broken-down buses or no-shows of drivers, to demonstrate the system resiliency of the new routes and schedules via simulation. Our approach can be generalized to redesign public transit systems with social distancing requirement during the pandemic, to reduce passengers infection risk.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
