建筑防排烟系统存在问题及对策

结合火灾烟气蔓延扩散的客观规律和防排烟工程的实际状况,分析了建筑防排烟工程存在的几个共性问题及其危害,剖析了出现这些问题的根本原因,提出了尽快制定一部统一的《防排烟系统设计规范》、加强防排烟系统的设计、施工队伍监督管理和部件质量管理的对策。     

消防无线通信存在问题及对策研究

介绍了我国消防无线通信在灭火救援中的重要性,重点从消防通信装备的配备、技术和管理等方面分析了消防无线通信在使用中存在的问题,并提出了解决这些问题的对策。     

面向信息化战争的广义兰切斯特作战模型

由于经典兰切斯特方程不能描述信息对于信息化战争的影响,因此在分析兰切斯特线性律和平方律的基础上,通过引入战场感知系数和信息优势系数,并利用信息优势系数对线性律和平方律中毁伤系数进行修正,提出了能够描述信息对战争影响的广义兰切斯特作战模型,仿真实验结果说明其能够有效地描述信息优势对于改变战争进程所发挥的重要作用。该模型为研究信息化战争的交战过程提供理论参考。     

The bottleneck problem with minimum quantity commitments

Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

浅议我国的生态旅游发展

本文阐述了生态旅游的内涵以及我国发展生态旅游的现状,提出了生态旅游发展中应注意的问题。     

兵力展开问题研究

如何将基地的兵力以最短时间展开到多个阵地中,是运输问题中的一种。为解决此问题对著名的兵力展开问题进行了研究。建立了兵力展开问题的数学模型,此模型是一个混合整数规划模型。提出了一种求解方法,该方法可解决类似的混合整数规划问题。最后给出了一个实例。     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

The impact of manufacturer rebates on supply chain profits

Manufacturer rebates are commonly used as price discount tools for attracting end customers. In this study, we consider a two‐stage supply chain with a manufacturer and a retailer, where a single seasonal product faces uncertain and price‐sensitive demand. We characterize the impact of a manufacturer rebate on the expected profits of both the manufacturer and the retailer. We show that unless all of the customers claim the rebate, the rebate always benefits the manufacturer. Our results thus imply that “mail‐in rebates,” where some customers end up not claiming the rebate, particularly when the size of the rebate is relatively small, always benefit the manufacturer. On the other hand, an “instant rebate,” such as the one offered in the automotive industry where every customer redeems the rebate on the spot when he/she purchases a car, does not necessarily benefit the manufacturer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Screening multi-dimensional heterogeneous populations for infectious diseases under scarce testing resources,with application to COVID-19

Testing provides essential information for managing infectious disease outbreaks, such as the COVID-19 pandemic. When testing resources are scarce, an important managerial decision is who to test. This decision is compounded by the fact that potential testing subjects are heterogeneous in multiple dimensions that are important to consider, including their likelihood of being disease-positive, and how much potential harm would be averted through testing and the subsequent interventions. To increase testing coverage, pooled testing can be utilized, but this comes at a cost of increased false-negatives when the test is imperfect. Then, the decision problem is to partition the heterogeneous testing population into three mutually exclusive sets: those to be individually tested, those to be pool tested, and those not to be tested. Additionally, the subjects to be pool tested must be further partitioned into testing pools, potentially containing different numbers of subjects. The objectives include the minimization of harm (through detection and mitigation) or maximization of testing coverage. We develop data-driven optimization models and algorithms to design pooled testing strategies, and show, via a COVID-19 contact tracing case study, that the proposed testing strategies can substantially outperform the current practice used for COVID-19 contact tracing (individually testing those contacts with symptoms). Our results demonstrate the substantial benefits of optimizing the testing design, while considering the multiple dimensions of population heterogeneity and the limited testing capacity.