Abstract

In this paper we develop modeling techniques for a social partitioning problem. Different social interaction regulations are imposed during pandemics to prevent the spread of diseases. We suggest partitioning a set of company employees as an effective way to curb the spread, and use integer programming techniques to model it. The goal of the model is to maximize the number of direct interactions between employees who are essential for company’s work subject to the constraint that all employees should be partitioned into components of no more than a certain size implied by the regulations. Then we further develop the basic model to take into account different restrictions and provisions. We also give heuristics for solving the problem. Our computational results include sensitivity analysis on some of the models and analysis of the heuristic performance.

Highlights

  • Statement To fight the Covid-19 pandemic, measures restricting social gatherings were taken by many countries and states

  • In this paper we develop modeling techniques for a social partitioning problem

  • Different social interaction regulations are imposed during pandemics to prevent the spread of diseases

Read more

Summary

Introduction

Background and Problem Statement To fight the Covid-19 pandemic, measures restricting social gatherings were taken by many countries and states. Many restrictions set limits on the number of people allowed in gatherings. Germany and UK at some point limited social gatherings of more than 2 people [1] while in many US states that number was 10 [2]. While that type of restrictions might help to prevent the spread of the disease they have the following shortcoming. A sick but asymptomatic person could attend several meetings of no more than 10 people (different people in each meeting). People from those meetings could get the virus and at-

Melkonian DOI
Melkonian
The Basic Model
A Computationally Refined Version of the Basic Model
The AMPL Implementation
Variations of the Model
Models with Required Connections
Model with Restricted Connections
Models with Penalties for Exceeding the Maximum Component Size
Heuristics
A Heuristic for the Main Problem
The Heuristic Applied to the Variation with Subset Interaction Requirements
The Heuristic Applied to the Model with Restricted Connections
The Heuristic Applied to the Models with Penalties
Computational Results
Future Directions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call