基于遗传算法的虚拟物流联合库存控制研究

针对随机需求条件下的虚拟物流库存控制问题进行了深入研究,提出了一种新的联合库存控制策略——（T,S,s）策略,建立了相应的库存成本模型,并构造遗传算法对模型进行求解。结果分析表明,所提出的（T,S,S）联合库存控制策略是有效的。     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

二阶矩模糊随机过程的均方极限

给出了二阶矩模糊随机过程均方极限的两种定义,证明了这两种定义的等价性,并讨论了二阶矩模糊随机过程均方极限的性质。     

When are observed failures more informative than observed survivals?

A framework involving independent competing risks permits observing failures due to a specific cause and failures due to a competing cause, which constitute survival times from the cause of primary interest. Is observing more failures more informative than observing survivals? Intuitively, due to the definitiveness of failures, the answer seems to be the former. However, it has been shown before that this intuition holds when estimating the mean but not the failure rate of the exponential model with a gamma prior distribution for the failure rate. In this article, we address this question at a more general level. We show that for a certain class of distributions failures can be more informative than survivals for prediction of life length and vice versa for some others. We also show that for a large class of lifetime models, failure is less informative than survival for estimating the proportional hazards parameter with gamma, Jeffreys, and uniform priors. We further show that, for this class of lifetime models, on average, failure is more informative than survival for parameter estimation and for prediction. These results imply that the inferential purpose and properties of the lifetime distribution are germane for conducting life tests. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Inventory control and periodic price discounting campaigns

This paper develops an inventory model that determines replenishment strategies for buyers facing situations in which sellers offer price‐discounting campaigns at random times as a way to drive sales or clear excess inventory. Specifically, the model deals with the inventory of a single item that is maintained to meet a constant demand over time. The item can be purchased at two different prices denoted high and low. We assume that the low price goes into effect at random points in time following an exponential distribution and lasts for a random length of time following another exponential distribution. We highlight a replenishment strategy that will lead to the lowest inventory holding and ordering costs possible. This strategy is to replenish inventory only when current levels are below a certain threshold when the low price is offered and the replenishment is to a higher order‐up‐to level than the one currently in use when inventory depletes to zero and the price is high. Our analysis provides new insight into the behavior of the optimal replenishment strategy in response to changes in the ratio of purchase prices together with changes in the ratio of the duration of a low‐price period to that of a high‐price period. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

双层随机机会约束规划的通信干扰任务分配优化仿真

研究不确定条件下的通信干扰任务分配优化问题具有重要的军事意义。基于干扰效益因子的概念,剖析了影响通信干扰任务分配的不确定性因素,建立了基于双层随机机会约束规划的通信干扰任务分配优化模型,设计了遗传蚁群智能算法,实例计算得到了通信干扰任务分配的最佳策略。     

一类随机生态-流行病系统的分析

对一类食饵染病的随机食饵-捕食者系统,应用伊藤公式,给出系统均衡解的全局随机渐近稳定的条件,并通过数值模拟对理论结果进行论证.     

New results on a stochastic duel game with each force consisting of heterogeneous units

Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.