A safe supply of blood for transfusion is a critical component of the healthcare system in all countries. Most health systems manage the risk of transfusion-transmissible infections (TTIs) through a portfolio of blood...
详细信息
A safe supply of blood for transfusion is a critical component of the healthcare system in all countries. Most health systems manage the risk of transfusion-transmissible infections (TTIs) through a portfolio of blood safety interventions. These portfolios must be updated periodically to reflect shifting epidemiological conditions, emerging infectious diseases, and new technologies. However, the number of available blood safety portfolios grows exponentially with the number of available interventions, making it impossible for policymakers to evaluate all feasible portfolios without the assistance of a computer model. We develop a novel optimization model for evaluating blood safety portfolios that enables systematic comparison of all feasible portfolios of deferral, testing, and modification interventions to identify the portfolio that is preferred from a cost-utility perspective. We present structural properties that reduce the state space and required computation time in certain cases, and we develop a linear approximation of the model. We apply the model to retrospectively evaluate U.S. blood safety policies for Zika and West Nile virus for the years 2017, 2018, and 2019, defining donor groups based on season and geography. We leverage structural properties to efficiently find an optimal solution. We find that the optimal portfolio varies geographically, seasonally, and over time. Additionally, we show that for this problem the approximated model yields the same optimal solution as the exact model. Our method enables systematic identification of the optimal blood safety portfolio in any setting and any time period, thereby supporting decision makers in efforts to ensure the safety of the blood supply.
An evolutionary strategy (ES) scheme is proposed to solve the subcarrier, hit, and power allocation problem in this paper. By the property of the real-valued representation in the evolutionary strategy, the difficulti...
详细信息
ISBN:
(纸本)9781424416448
An evolutionary strategy (ES) scheme is proposed to solve the subcarrier, hit, and power allocation problem in this paper. By the property of the real-valued representation in the evolutionary strategy, the difficulties in coding with the genetic-based algorithms (GA) are conquered. This paper utilizes the method of the binary, integerprogramming to perform the bit loading to overcome the limitation met in the water-filling algorithm. A fuzzy logic controller (FLC) is introduced to adjust the mutation probability in the iteration process. A simple subcarrier assignment modification step is also introduced to speed up the convergence rate and improve the performance. Simulation results are conducted to veri v the features of better convergence rates with the proposed schemes, and the performance is improved.
In this paper we developed a cost-varied Vogel-based approximation method, namely the Dynamic Vogel Approximation Method (DVAM), to solve a multi-level capacitated facility location problem (MCFLP), of which each clie...
详细信息
ISBN:
(纸本)9781424415281
In this paper we developed a cost-varied Vogel-based approximation method, namely the Dynamic Vogel Approximation Method (DVAM), to solve a multi-level capacitated facility location problem (MCFLP), of which each client will be served by all levels of facilities with limited capacities. We discuss two kinds of MCFLP which are derived from two kinds of demand structures. The proposed algorithm is comparatively more efficient and accurate.
This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complet...
详细信息
ISBN:
(纸本)9781467373890
This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complete observability, complete observability with N - 1 redundancy, different depths of unobservability, multi-stage sequential placement, real-time monitoring of critical buses are the various PMU placement approaches considered in this paper. The required input for the proposed algorithm is system information and other key aspects like locations of existing PMUs, locations unsuitable for PMU placement, and knowledge of critical buses. binary integer programming is used to find the respective PMU placement location and minimum number of PMUs. The algorithm is tested on IEEE 39-bus system, IEEE 118-bus system, and IEEE 300-bus system. The results suggest that the algorithm can be used on any power system network and the suitable PMU placement approach can be implemented for application.
For the Internet of Things in smart home environments, the smart gateway is the key component to collect/disseminate information from/to various sensors/actuators. In this study we investigate the smart gateway deploy...
详细信息
ISBN:
(纸本)9781479987511
For the Internet of Things in smart home environments, the smart gateway is the key component to collect/disseminate information from/to various sensors/actuators. In this study we investigate the smart gateway deployment problem in smart home environments. This problem is formulated as a constrained optimization problem with the objective to minimize the deployment cost subject to the constraints that all service areas should be covered. The smart gateway deployment problem under consideration is formulated as a binary integer programming problem. We solve it by the branch and bound method which could effectively reduce the complexity.
In this article, the problem of selection and configuration of visual sensors in Visual Sensor Networks (VSNs) is studied for coverage of the existing targets in the three-dimensional network area. It is assumed that ...
详细信息
ISBN:
(纸本)9781467320733
In this article, the problem of selection and configuration of visual sensors in Visual Sensor Networks (VSNs) is studied for coverage of the existing targets in the three-dimensional network area. It is assumed that visual sensors are capable of Pan-Tilt-Zoom (PTZ) ability and able to choose the covered area and desirable target through configuration of the angle of view in two horizontal and vertical dimensions and alteration of the enlargement scale. In order to solve the problem of selection and configuration, a method is presented according to binary integer programming (BIP). It ensures to find the best solution. In addition, it has less calculation complexity compared with other optimization methods. Applying the proposed solution, two problems of k-coverage and full angle coverage have been assessed using two models of point target model and circular target model. The perceived results properly confirm the efficiency of the proposed method in terms of execution speed and decreasing the computation complexity.
The Central American Power System (CAPS) comprises of the electrical power networks of Guatemala, El Salvador, Honduras, Nicaragua, Costa Rica and Panama. The topology of the network, the geographical distribution of ...
详细信息
ISBN:
(纸本)9781457718014
The Central American Power System (CAPS) comprises of the electrical power networks of Guatemala, El Salvador, Honduras, Nicaragua, Costa Rica and Panama. The topology of the network, the geographical distribution of the load and generation blocks, and the localized weaknesses in some sections of the transmission grid have made this system prone to frequent partial or total blackouts. At the same time, this area has the advantage of having a control center that can promote international measures in order to safeguard the integrity of the transmission network. This paper presents a gradual optimal PMU placement approach that guarantees minimum regional observability at the initial stage and full observability for the complete implementation. The paper also states how WAMS can provide real-time information to the control center for a more secure operation of the system. The practical constraints of ensuring real-time monitoring of critical buses of the network are taken into account during PMU Placement.
This paper presents an effective practical approach for identifying optimal locations of Phasor Measurement Units (PMUs) to achieve complete system observability. The approach, implemented in Physical and Operational ...
详细信息
ISBN:
(纸本)9781538628904
This paper presents an effective practical approach for identifying optimal locations of Phasor Measurement Units (PMUs) to achieve complete system observability. The approach, implemented in Physical and Operational Margins/Region Of Stability Existence (POM/ROSE) software, is based on automated iterative process of forming variables and constraints of a binary integer programming problem. The problem is then solved with standard linear programming solvers. The proposed approach was tested using Idaho Power Co. (IPC) system. It allows us to reduce the number of PMUs as compared to conventional techniques while maintaining complete system observability. A fast topological approach was also demonstrated and tested using IPC data in order to analyze the observability of the IPC network. The algorithm is fast and can be used in real-time as a part of bad data detection framework.
In this paper, we propose a mathematical optimisation model to solve the simple assembly line rebalancing problem. This problem arises when an existing assembly line has to be rebalanced in order to meet new productio...
详细信息
ISBN:
(纸本)9783642412653;9783642412660
In this paper, we propose a mathematical optimisation model to solve the simple assembly line rebalancing problem. This problem arises when an existing assembly line has to be rebalanced in order to meet new production requirements. In this paper, a Mixed integer Program is proposed for solving this problem with the objective to minimize the number of changes in the initial line. The computational experiments show the efficacy of the proposed method.
A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availabil...
详细信息
A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availability is not continuous and described by a resource calendar, to be used to accomplish the jobs. Further the scheduling must be optimum and must comply various constraints. The proposed model is a typical binary integer programming problem for the scheduling problem subject to various constraints and hence it could be solved using the techniques of binary integer programming. One heuristic method is also discussed to solve the scheduling problem.
暂无评论