基于保障时间窗的油料调拨运输模型

通过引入保障时间窗,同时考虑油料保障的时间约束和运力约束,建立了基于保障开始时间最早,并尽可能满足保障需求量的调度模型。针对问题的多目标性,基于理想点法将初始模型转化为单目标优化模型。采用粒子群算法对模型进行求解,并设计了算法编码和求解步骤。通过算例验证了模型和算法的可行性及有效性。     

脉冲微分方程边值问题的全局分支与多解性

研究非线性脉冲微分方程边值问题,应用分歧技巧,得到非线性脉冲微分方程边值问题多个解的存在性结果.     

基于熵权多目标决策的战时物资运输方案优选研究

提出了战时物资运输方案优选问题,分析战时运输的影响因素,提出了评估战时物资运输方案的较有代表性的指标,并给出了具体计算方法.在没有指标权重的情况下,应用熵权多目标决策方法对多个合理方案进行优选评估,得出了可信度较高的优选方案.     

一类带容量限制的运输问题

考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Resource allocation with lumpy demand: To speed or not to speed?

In the classical EPQ model with continuous and constant demand, holding and setup costs are minimized when the production rate is no larger than the demand rate. However, the situation may change when demand is lumpy. We consider a firm that produces multiple products, each having a unique lumpy demand pattern. The decision involves determining both the lot size for each product and the allocation of resources for production rate improvements among the products. We find that each product's optimal production policy will take on only one of two forms: either continuous production or lot‐for‐lot production. The problem is then formulated as a nonlinear nonsmooth knapsack problem among products determined to be candidates for resource allocation. A heuristic procedure is developed to determine allocation amounts. The procedure decomposes the problem into a mixed integer program and a nonlinear convex resource allocation problem. Numerical tests suggest that the heuristic performs very well on average compared to the optimal solution. Both the model and the heuristic procedure can be extended to allow the company to simultaneously alter both the production rates and the incoming demand lot sizes through quantity discounts. Extensions can also be made to address the case where a single investment increases the production rate of multiple products. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

消防电气施工图审查中几个值得探讨的问题

由于对规范的不同认识和理解,设计中对同一问题常常出现不同的设计方案和方法。针对在日常消防电气施工图审查中发现的关于消防电源、消防应急照明的专用供电回路、手动直接控制、高层住宅底部商业网点火灾自动报警系统设置等方面存在的问题,提出自己的看法。     

Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Allocating capacity in parallel queues to improve their resilience to deliberate attack

We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

机动管线便携式混油界面检测仪研制

机动管线大量运用于抢险、救灾、作战等特殊场合,顺序输送多种油品(水)是其主要输送工艺.及时、准确地检测和跟踪混油界面是保证输送油品质量、正确进行混油切割、减少混油损失的关键.根据机动管线特点和使用要求,在分析研究国内外常用混油界面检测技术的基础上,采用超声波“波辐射”法,研制出一种新型便携式混油界面检测仪.