A Mathematical Programming Approach for IoT-Enabled, Energy-Efficient Heterogeneous Wireless Sensor Network Design and Implementation

The Internet of Things (IoT) is playing a pivotal role in transforming various industries, and Wireless Sensor Networks (WSNs) are emerging as the key drivers of this innovation. This research explores the utilization of a heterogeneous network model to optimize the deployment of sensors in agricultural settings. The primary objective is to strategically position sensor nodes for efficient energy consumption, prolonged network lifetime, and dependable data transmission. The proposed strategy incorporates an offline model for placing sensor nodes within the target region, taking into account the coverage requirements and network connectivity. We propose a two-stage centralized control model that ensures cohesive decision making, grouping sensor nodes into protective boxes. This grouping facilitates shared resource utilization, including batteries and bandwidth, while minimizing box number for cost-effectiveness. Noteworthy contributions of this research encompass addressing connectivity and coverage challenges through an offline deployment model in the first stage, and resolving real-time adaptability concerns using an online energy optimization model in the second stage. Emphasis is placed on the energy efficiency, achieved through the sensor consolidation within boxes, minimizing data transmission hops, and considering energy expenditures in sensing, transmitting, and active/sleep modes. Our simulations on an agricultural farmland highlights its practicality, particularly focusing on the sensor placement for measuring soil temperature and humidity. Hardware tests validate the proposed model, incorporating parameters from the real-world implementation to enhance calculation accuracy. This study provides not only theoretical insights but also extends its relevance to smart farming practices, illustrating the potential of WSNs in revolutionizing sustainable agriculture.

Strategic Planning of a Joint SARS-CoV-2 and Influenza Vaccination Campaign in the UK

The simultaneous administration of SARS-CoV-2 and influenza vaccines is being carried out for the first time in the UK and around the globe in order to mitigate the health, economic, and societal impacts of these respiratory tract diseases. However, a systematic approach for planning the vaccine distribution and administration aspects of the vaccination campaigns would be beneficial. This work develops a novel multi-product mixed-integer linear programming (MILP) vaccine supply chain model that can be used to plan and optimise the simultaneous distribution and administration of SARS-CoV-2 and influenza vaccines. The outcomes from this study reveal that the total budget required to successfully accomplish the SARS-CoV-2 and influenza vaccination campaigns is equivalent to USD 7.29 billion, of which the procurement costs of SARS-CoV-2 and influenza vaccines correspond to USD 2.1 billion and USD 0.83 billion, respectively. The logistics cost is equivalent to USD 3.45 billion, and the costs of vaccinating individuals, quality control checks, and vaccine shipper and dry ice correspond to USD 1.66, 0.066, and 0.014, respectively. The analysis of the results shows that the choice of rolling out the SARS-CoV-2 vaccine during the vaccination campaign can have a significant impact not only on the total vaccination cost but also on vaccine wastage rate.

Model-Based Planning and Delivery of Mass Vaccination Campaigns against Infectious Disease: Application to the COVID-19 Pandemic in the UK

Vaccination plays a key role in reducing morbidity and mortality caused by infectious diseases, including the recent COVID-19 pandemic. However, a comprehensive approach that allows the planning of vaccination campaigns and the estimation of the resources required to deliver and administer COVID-19 vaccines is lacking. This work implements a new framework that supports the planning and delivery of vaccination campaigns. Firstly, the framework segments and priorities target populations, then estimates vaccination timeframe and workforce requirements, and lastly predicts logistics costs and facilitates the distribution of vaccines from manufacturing plants to vaccination centres. The outcomes from this study reveal the necessary resources required and their associated costs ahead of a vaccination campaign. Analysis of results shows that by integrating demand stratification, administration, and the supply chain, the synergy amongst these activities can be exploited to allow planning and cost-effective delivery of a vaccination campaign against COVID-19 and demonstrates how to sustain high rates of vaccination in a resource-efficient fashion.

A Two-Stage Location Problem with Order Solved Using a Lagrangian Algorithm and Stochastic Programming for a Potential Use in COVID-19 Vaccination Based on Sensor-Related Data

Healthcare service centers must be sited in strategic locations that meet the immediate needs of patients. The current situation due to the COVID-19 pandemic makes this problem particularly relevant. Assume that each center corresponds to an assigned place for vaccination and that each center uses one or more vaccine brands/laboratories. Then, each patient could choose a center instead of another, because she/he may prefer the vaccine from a more reliable laboratory. This defines an order of preference that might depend on each patient who may not want to be vaccinated in a center where there are only her/his non-preferred vaccine brands. In countries where the vaccination process is considered successful, the order assigned by each patient to the vaccination centers is defined by incentives that local governments give to their population. These same incentives for foreign citizens are seen as a strategic decision to generate income from tourism. The simple plant/center location problem (SPLP) is a combinatorial approach that has been extensively studied. However, a less-known natural extension of it with order (SPLPO) has not been explored in the same depth. In this case, the size of the instances that can be solved is limited. The SPLPO considers an order of preference that patients have over a set of facilities to meet their demands. This order adds a new set of constraints in its formulation that increases the complexity of the problem to obtain an optimal solution. In this paper, we propose a new two-stage stochastic formulation for the SPLPO (2S-SPLPO) that mimics the mentioned pandemic situation, where the order of preference is treated as a random vector. We carry out computational experiments on simulated 2S-SPLPO instances to evaluate the performance of the new proposal. We apply an algorithm based on Lagrangian relaxation that has been shown to be efficient for large instances of the SPLPO. A potential application of this new algorithm to COVID-19 vaccination is discussed and explored based on sensor-related data. Two further algorithms are proposed to store the patient’s records in a data warehouse and generate 2S-SPLPO instances using sensors.

Static and dynamic appointment scheduling to improve patient access time

Appointment schedules for outpatient clinics have great influence on efficiency and timely access to health care services. The number of new patients per week fluctuates, and capacity at the clinic varies because physicians have other obligations. However, most outpatient clinics use static appointment schedules, which reserve capacity for each patient type. In this paper, we aim to optimise appointment scheduling with respect to access time, taking fluctuating patient arrivals and unavailabilities of physicians into account. To this end, we formulate a stochastic mixed integer programming problem, and approximate its solution invoking two different approaches: (1) a mixed integer programming approach that results in a static appointment schedule, and (2) Markov decision theory, which results in a dynamic scheduling strategy. We apply the methodologies to a case study of the surgical outpatient clinic of the Jeroen Bosch Hospital. We evaluate the effectiveness and limitations of both approaches by discrete event simulation; it appears that allocating only 2% of the capacity flexibly already increases the performance of the clinic significantly.

A Moment Matching Approach for Generating Synthetic Data

Synthetic data are becoming increasingly important mechanisms for sharing data among collaborators and with the public. Multiple methods for the generation of synthetic data have been proposed, but many have short comings with respect to maintaining the statistical properties of the original data. We propose a new method for fully synthetic data generation that leverages linear and integer mathematical programming models in order to match the moments of the original data in the synthetic data. This method has no inherent disclosure risk and does not require parametric or distributional assumptions. We demonstrate this methodology using the Framingham Heart Study. Existing synthetic data methods that use chained equations were compared with our approach. We fit Cox proportional hazards, logistic regression, and nonparametric models to synthetic data and compared with models fitted to the original data. True coverage, the proportion of synthetic data parameter confidence intervals that include the original data's parameter estimate, was 100% for parametric models when up to four moments were matched, and consistently outperformed the chained equations approach. The area under the curve and accuracy of the nonparametric models trained on synthetic data marginally differed when tested on the full original data. Models were also trained on synthetic data and a partition of original data and were tested on a held-out portion of original data. Fourth-order moment matched synthetic data outperformed others with respect to fitted parametric models but did not always outperform other methods with fitted nonparametric models. No single synthetic data method consistently outperformed others when assessing the performance of nonparametric models. The performance of fourth-order moment matched synthetic data in fitting parametric models suggests its use in these cases. Our empirical results also suggest that the performance of synthetic data generation techniques, including the moment matching approach, is less stable for use with nonparametric models. The benefits of the moment matching approach should be weighed against additional computational costs. In summary, our results demonstrate that the introduced moment matching approach may be considered as an alternative to existing synthetic data generation methods.

Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem

We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.

Climate change mitigation through livestock system transitions

Livestock are responsible for 12% of anthropogenic greenhouse gas emissions. Sustainable intensification of livestock production systems might become a key climate mitigation technology. However, livestock production systems vary substantially, making the implementation of climate mitigation policies a formidable challenge. Here, we provide results from an economic model using a detailed and high-resolution representation of livestock production systems. We project that by 2030 autonomous transitions toward more efficient systems would decrease emissions by 736 million metric tons of carbon dioxide equivalent per year (MtCO2e⋅y(-1)), mainly through avoided emissions from the conversion of 162 Mha of natural land. A moderate mitigation policy targeting emissions from both the agricultural and land-use change sectors with a carbon price of US$10 per tCO2e could lead to an abatement of 3,223 MtCO2e⋅y(-1). Livestock system transitions would contribute 21% of the total abatement, intra- and interregional relocation of livestock production another 40%, and all other mechanisms would add 39%. A comparable abatement of 3,068 MtCO2e⋅y(-1) could be achieved also with a policy targeting only emissions from land-use change. Stringent climate policies might lead to reductions in food availability of up to 200 kcal per capita per day globally. We find that mitigation policies targeting emissions from land-use change are 5 to 10 times more efficient--measured in "total abatement calorie cost"--than policies targeting emissions from livestock only. Thus, fostering transitions toward more productive livestock production systems in combination with climate policies targeting the land-use change appears to be the most efficient lever to deliver desirable climate and food availability outcomes.

Generalized framework for context-specific metabolic model extraction methods

Genome-scale metabolic models (GEMs) are increasingly applied to investigate the physiology not only of simple prokaryotes, but also eukaryotes, such as plants, characterized with compartmentalized cells of multiple types. While genome-scale models aim at including the entirety of known metabolic reactions, mounting evidence has indicated that only a subset of these reactions is active in a given context, including: developmental stage, cell type, or environment. As a result, several methods have been proposed to reconstruct context-specific models from existing genome-scale models by integrating various types of high-throughput data. Here we present a mathematical framework that puts all existing methods under one umbrella and provides the means to better understand their functioning, highlight similarities and differences, and to help users in selecting a most suitable method for an application.

Building and assessing atomic models of proteins from structural templates: learning and benchmarks

One approach to predict a protein fold from a sequence (a target) is based on structures of related proteins that are used as templates. We present an algorithm that examines a set of candidates for templates, builds from each of the templates an atomically detailed model, and ranks the models. The algorithm performs a hierarchical selection of the best model using a diverse set of signals. After a quick and suboptimal screening of template candidates from the protein data bank, the current method fine-tunes the selection to a few models. More detailed signals test the compatibility of the sequence and the proposed structures, and are merged to give a global fitness measure using linear programming. This algorithm is a component of the prediction server LOOPP (http://www.loopp.org). Large-scale training and tests sets were designed and are presented. Recent results of the LOOPP server in CASP8 are discussed.

A template-finding algorithm and a comprehensive benchmark for homology modeling of proteins

The first step in homology modeling is to identify a template protein for the target sequence. The template structure is used in later phases of the calculation to construct an atomically detailed model for the target. We have built from the Protein Data Bank (PDB) a large-scale learning set that includes tens of millions of pair matches that can be either a true template or a false one. Discriminatory learning (learning from positive and negative examples) is used to train a decision tree. Each branch of the tree is a mathematical programming model. The decision tree is tested on an independent set from PDB entries and on the sequences of CASP7. It provides significant enrichment of true templates (between 50 and 100%) when compared to PSI-BLAST. The model is further verified by building atomically detailed structures for each of the tentative true templates with modeller. The probability that a true match does not yield an acceptable structural model (within 6 A RMSD from the native structure) decays linearly as a function of the TM structural-alignment score.