战时装备保障过程建模仿真研究

目前战时装备保障方案制定,多是依靠基本原则和经验,过程描述随意性大,同时保障活动的组织缺乏有效的手段,导致方案缺乏科学性、可操作性差。为此借鉴过程管理的思想,应用IDEF3方法建立装备保障准备阶段过程模型,形成规范的、易于交流的保障流程,依据过程模型采用离散事件仿真的方法对不同活动组合的过程效率进行了分析,改变以往根据排队理论经过大量计算分析效率的方式,实现战时快速准确优化过程的目的,为装备保障方案的形成提供方法支持。     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

On finding spanning eulerian subgraphs

In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.     

Some implications of pricing bundles

In this article, we consider a problem in which two suppliers can sell their respective products both individually and together as a bundle, and study the impact of bundle pricing. Four pricing models (centralized, decentralized, coop–comp, and comp–coop) are analyzed with regard to the competition formats and sequences. As one would expect, the firms are always better off when pricing decisions are centralized. However, rather surprisingly, we find that firms may be worse off if the bundle prices are set in a cooperative way; we provide analytical characterization of those instances. Numerical studies show that these insights also hold for some nonlinear demand. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

不同损失函数下指数-泊松分布的Bayes估计

基于定数截尾样本,在熵损失、Linex损失和刻度平方损失函数下,给出了指数-泊松分布参数的Bayes估计,并证明了所给估计都是容许的。最后给出了随机模拟例子,对所给估计结果的优良性进行了分析比较。     

逐次求导法在一类非齐次微分方程中的应用

利用逐次求导的方法先对方程进行简化 ,再通过积分得到所求特解的一个待定式 ,然后比较方程两端的系数 ,从而得到最终结果 ,并辅以实例说明     

代谢网络结构特征的生物信息学研究

作为生物信息学的重要研究内容,近年来代谢网络结构特征方面的研究取得了许多成果。回顾了代谢网络的重构和表示方法,重点综述了代谢网络宏观结构特征所蕴含的生物学意义,以及拓扑特征所揭示的网络演化过程和网络稳健性信息,提出了目前研究中仍然存在的问题及可能的解决思路,并对将来的研究趋势进行了阐述。     

A note on the “value” of bounds on EVPI in stochastic programming

The existing literature concentrates on determining sharp upper bounds for EVPI in stochastic programming problems. This seems to be a problem without an application. Lower bounds, which we view as having an important application, are only the incidental subject of study and in the few instances that are available are obtained at an extremely high cost. In order to suggest a rethinking of the course of this research, we analyze the need for bounds on EVPI in the context of its significance in decision problems.     

Relative Aging of Coherent Systems

In this article, we carry out the stochastic comparison between coherent systems through the relative aging order when component lifetimes are independent and identically distributed. We make use of the signature to characterize the structure of coherent systems, and derive several sufficient conditions under which the compared systems with the common size can be ordered in the sense of relative aging. Specially, we present some scenarios wherein the better a coherent system is, the faster it ages. Moreover, we discuss the relative aging of dual systems as well. Several numerical examples are provided to illustrate the theoretical results. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 345–354, 2017     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

一种Fuzzy优化模型及其满意解

本文给出了一种目标函数和约束条件都具有模糊性的优化模型。采用求条件极值的方法,得到了求这一模型的满意解。     

光纤陀螺仪(FOG)技术及发展应用

介绍了当前惯性导航领域一门新型技术光纤陀螺仪(FOG)的基本原理、类型及两种典型光纤陀螺仪的结构,分析了光纤陀螺仪的误差及消除误差的方法,通过介绍光纤陀螺技术发展的过程及世界各主要国家在光纤陀螺实用化方面取得的进展,指出了光纤陀螺仪与其它光学陀螺相比具有的优点及良好的发展前景。     

Rendezvous search on labeled networks

Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011     

Multiproduct lot-size scheduling with proportional product demands

In this paper we consider the multiproduct, multiperiod production-scheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the ratio of setup to production-run time of each product. This structure holds for any length horizon and may permit a substantial (time) savings for column generation solution procedures.     

Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model

In this article, we consider a multi‐product closed‐loop supply chain network design problem where we locate collection centers and remanufacturing facilities while coordinating the forward and reverse flows in the network so as to minimize the processing, transportation, and fixed location costs. The problem of interest is motivated by the practice of an original equipment manufacturer in the automotive industry that provides service parts for vehicle maintenance and repair. We provide an effective problem formulation that is amenable to efficient Benders reformulation and an exact solution approach. More specifically, we develop an efficient dual solution approach to generate strong Benders cuts, and, in addition to the classical single Benders cut approach, we propose three different approaches for adding multiple Benders cuts. These cuts are obtained via dual problem disaggregation based either on the forward and reverse flows, or the products, or both. We present computational results which illustrate the superior performance of the proposed solution methodology with multiple Benders cuts in comparison to the branch‐and‐cut approach as well as the traditional Benders decomposition approach with a single cut. In particular, we observe that the use of multiple Benders cuts generates stronger lower bounds and promotes faster convergence to optimality. We also observe that if the model parameters are such that the different costs are not balanced, but, rather, are biased towards one of the major cost categories (processing, transportation or fixed location costs), the time required to obtain the optimal solution decreases considerably when using the proposed solution methodology as well as the branch‐and‐cut approach. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

有限扩域上的Fuzzy子域

在文[3]中,引入了更一般的Fuzzy理想等概念,使Fuzzy代数结构的研究进一步深入进行。本文作为Fuzzy结构理论中的又一课题,引入了Fuzzy子域等概念,对有限扩域上的Fuzzy子域的构造问题进行了比较详细的讨论,得到了几个类似于[2]中的表示定理。尔后,引入了诱导Fuzzy子域,对单纯代数扩域上的诱导Fuzzy子域进行了研究。     

基于事件的系统可靠性参数仿真算法

介绍了可以用扩展可靠性框图表示的系统的可靠性参数的仿真算法。首先,对扩展可靠性框图进行了介绍,提出了利用树状结构来描述扩展可靠性框图的结构。其次,对基于扩展可靠性框图的系统行为进行了分析。然后,依据离散事件系统仿真思想,分别给出了计算可修系统可靠性参数的仿真算法与不可修系统可靠性参数的仿真算法。最后,给出了计算实例。该仿真算法不仅可以对状态独立系统进行可靠性参数计算,而且可以对具有冷储备关系以及冷储备嵌套关系的状态相关系统进行可靠性参数计算,具有很强的通用性与实用性。     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

神经计算机并行模拟结构

神经网络实现技术是神经网络研究的一个极重要的领域。本文首先分析了神经网络模拟对并行计算机系统的要求,认为影响神经网络计算机速度和容量提高的主要因素是单个处理单元的速度、单个处理单元的局部存储器的容量以及互连网络的通信带宽。要提高模拟神经计算机的速度和容量,就要有相应的并行结构来支持。在定量的需求分析的基础上,本文还提出了一种模拟神经计算机的并行结构。