{"title":"Reducing Risks During Natural Disasters With Optimal Resource Allocation By Multi-Agent Optimization","authors":"Alina Vereshchaka, Nathan Margaglio, Wen Dong","doi":"10.1109/WSC40007.2019.9004931","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004931","url":null,"abstract":"Natural disasters are notable for the high costs associated with responding to and recovering from them. In this paper we address the issue of critical resources allocation during natural disaster, that incorporates the level of importance of the effected region and cost parameter. Our risk reducing model can be applied to online stochastic environments in the domain of natural disasters. The framework achieves more efficient resource allocation in response to dynamic events and is applicable to problems where disaster evolves alongside the response efforts.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"59 88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124272748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mitigating Customers’ Downsell Risk for Single-Leg Revenue Management with Demand Dependencies","authors":"Lin Li, Yuan Zhou","doi":"10.1109/WSC40007.2019.9004885","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004885","url":null,"abstract":"With increased complexity of customers choice behaviors, practical optimization approaches often involve decomposing a network revenue management problem into multiple single-leg problems. While dynamic programming approaches can be used to solve single-leg problems exactly, they are not scalable and require precise information about the customers’ arrival rates. On the other hand, the traditional heuristics are often static which do not explicitly consider the remaining time horizon in the optimization. This motivates us to find scalable and efficient dynamic heuristics that work well with the complex customers choice models. We develop two expected marginal seat revenue type heuristics for the single-leg dynamic revenue management problems in airline industry and evaluate its performances using Monte Carlo simulation. The initial simulation results indicate that our proposed heuristics are computationally efficient and fairly robust. This study provides a foundation for potential future extensions to solve larger network problems.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117339852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Harnessing Concurrency in Synchronous Block Diagrams to Parallelize Simulation on Multi-Core Hosts","authors":"A. Naderlinger","doi":"10.1109/WSC40007.2019.9004866","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004866","url":null,"abstract":"Model-based and simulation-supported engineering based on the formalism of synchronous block diagrams is among the best practices in software development for embedded and real-time systems. As the complexity of such models and the associated computational demands for their simulation steadily increase, efficient execution strategies are needed. Although there is an inherent concurrency in most models, tools are not always capable of taking advantage of multi-core architectures of simulation host computers to simulate blocks in parallel. In this paper, we outline the conceptual obstacles in general and discuss them specifically for the widely used simulation environment Simulink. We present an execution mechanism that harnesses multi-core hosts for accelerating individual simulation runs through parallelization. The approach is based on a model transformation. It does not require any changes in the simulation engine, but introduces minimal data propagation delays in the simulated signal chains. We demonstrate its applicability in an automotive case study.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"32 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127382485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David Bell, D. Groen, N. Mustafee, J. Ozik, S. Strassburger
{"title":"Hybrid Simulation Development – Is It Just Analytics?","authors":"David Bell, D. Groen, N. Mustafee, J. Ozik, S. Strassburger","doi":"10.1109/WSC40007.2019.9004923","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004923","url":null,"abstract":"Hybrid simulations can take many forms, often connecting a diverse range of hardware and software components with heterogeneous data sets. The scale of examples is also diverse with both the high-performance computing community using high-performance data analytics (HPDA) to the synthesis of software libraries or packages on a single machine. Hybrid simulation configuration and output analysis is often akin to analytics with a range of dashboards, machine learning, data aggregations and graphical representation. Underpinning the visual elements are hardware, software and data architectures that execute hybrid simulation code. These are wide ranging with few generalized blueprints, methods or patterns of development. This panel will discuss a range of hybrid simulation development approaches and endeavor to uncover possible strategies for supporting the development and coupling of hybrid simulations.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127443755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Reward Function for Bayesian Feasibility Determination","authors":"J. He, Seong-Hee Kim","doi":"10.1109/WSC40007.2019.9004875","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004875","url":null,"abstract":"In Bayesian feasibility determination, a typical reward function is either the 0-1 or linear reward function. We propose a new type of reward function for Bayesian feasibility determination. Our proposed reward function emphasizes the importance of barely feasible/infeasible systems whose mean performance measures are close to the threshold. There are two main reasons why the barely feasible/infeasible systems are more important. First, the overall accuracy on solving a feasibility determination problem is heavily affected by those difficult systems. Second, if the decision maker wants to further find the best feasible system, it is likely that one of the barely feasible/infeasible systems is the best feasible. We derive a feasibility determination procedure with the new reward function in a Bayesian framework. Our experiments show that the Bayesian optimal procedure with the new reward function performs the best in making correct decisions on difficult systems when compared to existing procedures.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127548229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation of Allocation Policies for a Serial Inventory System Under Advance Demand Information","authors":"Bhoomica M. Nataraja, Z. Atan","doi":"10.1109/WSC40007.2019.9004723","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004723","url":null,"abstract":"In this paper, we simulate allocation policies for a two-stage inventory system that receives perfect advance demand information (ADI) from customers belonging to different demand classes. Demands for each customer class are generated by independent Poisson processes while the processing times are deterministic. All customers in the same class have the same demand lead time (the difference between the due date and the requested date) and back-ordering costs. Each stage in the inventory system follows order-base-stock-policies where the replenishment order is issued upon arrival of a customer order. The problem requires a fast and reliable method that determines the system performance under different policies and ADI. Thus, we employ discrete event simulation to obtain output parameters such as inventory costs, fill rates, waiting time, and order allocation times. A numerical analysis is conducted to identify a reasonable policy to use in this type of system.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"437 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Mittal, Nilufer Oran Gibson, Caroline C. Krejci
{"title":"An Agent-based Model of Surplus Food Rescue Using Crowd-shipping","authors":"A. Mittal, Nilufer Oran Gibson, Caroline C. Krejci","doi":"10.1109/WSC40007.2019.9004732","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004732","url":null,"abstract":"As climate change approaches a point of irreversibility, it is becoming increasingly important to find ways of preventing food waste from reaching landfills and emitting greenhouse gases. Food rescue programs offer a means of simultaneously diverting surplus food from landfills and addressing food insecurity. Recently, some food rescue organizations in the U.S. have begun leveraging crowd-shipping to more efficiently transport surplus food from donors to food-insecure recipients. However, the success of such initiatives relies on achieving a critical mass of donor and crowd-shipper participation. This paper describes a conceptual agent-based model that was developed to evaluate the design parameters of a volunteer-based crowd-shipping system for food rescue. Preliminary experimental results demonstrate the importance of generating sufficient awareness and commitment among potential volunteers in the early stages of the program’s development to ensure consistent participation and service.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115542361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abhijin Adiga, S. Swarup, A. Vullikanti, C. Barrett, S. Eubank, C. Kuhlman, M. Marathe, H. Mortveit, S. Ravi, D. Rosenkrantz, R. Stearns
{"title":"Validating Agent-Based Models of Large Networked Systems","authors":"Abhijin Adiga, S. Swarup, A. Vullikanti, C. Barrett, S. Eubank, C. Kuhlman, M. Marathe, H. Mortveit, S. Ravi, D. Rosenkrantz, R. Stearns","doi":"10.1109/WSC40007.2019.9004718","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004718","url":null,"abstract":"The paper describes a systematic approach for validating real-world biological, information, social and technical (BIST) networks. BIST systems are usually represented using agent-based models and computer simulations are used to study their dynamical (state-space) properties. Here, we use a formal representation called a graph dynamical system (GDS). We present two types of results. First we describe two real-world validation studies spanning a variety of BIST networks. Various types of validation are considered and unique challenges presented by each domain are discussed. Each system is represented using the GDS formalism. This illustrates the power of the formalism and enables a unified approach for validation. We complement the case studies by presenting new theoretical results on validating BIST systems represented as GDSs. These theoretical results delineate computationally intractable and efficiently solvable versions of validation problems.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122473807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. Furian, Clemens Gutschi, D. Neubacher, C. Walker, M. O'Sullivan
{"title":"The Activity-Entity-Impact Method: Understanding Bottleneck Behavior of Simulation Models Demonstrated by an Emergency Department Model","authors":"N. Furian, Clemens Gutschi, D. Neubacher, C. Walker, M. O'Sullivan","doi":"10.1109/WSC40007.2019.9004751","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004751","url":null,"abstract":"Simulation models are often used to gain a better understanding of a system’s sensitivity to changes in the input parameters. Data gathered during simulation runs is aggregated to Key Performance Indicators (KPIs) that allow one to assess a model’s or system’s performance. KPIs do not provide a deeper understanding of the causes of the observed output because this is not their primary objective. By contrast, dynamic bottleneck methods both identify elements that yield the largest gain in productivity with increased availability and also visualize these elements over time to enable bottlenecks to be better understood. In this paper we discuss whether dynamic bottleneck detection methods can be utilized to identify, measure, and visualize causes of observed behavior in complex models. We extend standard bottleneck detection methods, and introduce the Activity-Entity-Impact-Method. The practicality of the method is demonstrated by an example model of a typical Emergency Department setting.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122645015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of Discrete-Event Simulation for Planning and Operations Issues in Mental Healthcare","authors":"Sheema Noorain, Kathy Kotiadis, M. P. Scaparra","doi":"10.1109/WSC40007.2019.9004749","DOIUrl":"https://doi.org/10.1109/WSC40007.2019.9004749","url":null,"abstract":"Mental health disorders are on the rise around the world. Inadequate service provision and lack of access have led to wide gaps between the need for treatment and service delivery. Despite the popularity of Discrete-event Simulation (DES) in healthcare planning and operations, there is evidence of limited application of DES in planning for mental healthcare services. This paper identifies and reviews all the papers that utilize DES modelling to address planning and operations issues in mental healthcare services. The aim is to contribute a roadmap for the future application of DES in mental healthcare services, with an emphasis on planning and operations.","PeriodicalId":127025,"journal":{"name":"2019 Winter Simulation Conference (WSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122656907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}