A cover based competitive facility location model with continuous demand

In this paper we propose and solve a competitive facility location model when demand is continuously distributed in an area and each facility attracts customers within a given distance. This distance is a measure of the facility's attractiveness level which may be different for different facilities. The market share captured by each facility is calculated by two numerical integration methods. These approaches can be used for evaluating functional values in other operations research models as well. The single facility location problem is optimally solved by the big triangle small triangle global optimization algorithm and the multiple facility problem is heuristically solved by the Nelder‐Mead algorithm. Extensive computational experiments demonstrate the effectiveness of the solution approaches.     

Dynamic coordination of production planning and sales admission control in the presence of a spot market

We consider the decision‐making problem of dynamically scheduling the production of a single make‐to stock (MTS) product in connection with the product's concurrent sales in a spot market and a long‐term supply channel. The spot market is run by a business to business (B2B) online exchange, whereas the long‐term channel is established by a structured contract. The product's price in the spot market is exogenous, evolves as a continuous time Markov chain, and affects demand, which arrives sequentially as a Markov‐modulated Poisson process (MMPP). The manufacturer is obliged to fulfill demand in the long‐term channel, but is able to rein in sales in the spot market. This is a significant strategic decision for a manufacturer in entering a favorable contract. The profitability of the contract must be evaluated by optimal performance. The current problem, therefore, arises as a prerequisite to exploring contracting strategies. We reveal that the optimal strategy of coordinating production and sales is structured by the spot price dependent on the base stock and sell‐down thresholds. Moreover, we can exploit the structural properties of the optimal strategy to conceive an efficient algorithm. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

装备维修中备件需求率的预计方法

通过研究装备维修过程中器件的固有可靠性和维修性,着重分析了影响维修器件需求率的主要因素.利用系统建模和仿真的方法,分别针对耗损类型器件和可修复类型器件建立了相应的需求数学模型,最后给出了维修备件需求率的预计方法.     

基于QFD的武器装备使用需求映射方法

针对传统优化方法不能有效考虑部队需求的问题,提出了基于质量功能展开(Quality Function Deployment,QFD)的武器装备使用需求映射方法,给出了部队需求和武器装备性能指标自相关性的处理方法,并使用松弛系数法保证了最优解集的寻求与重点需求的优先实现。结合实例对该方法的实用性和反映部队需求的准确性进行了验证。结果表明:该方法既克服了传统需求分析侧重于论证人员的推理而对实际使用方的需求考虑不足的弊端,又充分体现了"用户"为主的思想。     

基于熵权的导弹型号论证方案评价模型

针对导弹型号论证决策中的部分属性信息具有模糊性,给出了一种基于熵权的模糊信息多目标决策方案评估方法。该方法在只有模糊判断矩阵而没有专家权重的情况下,通过多指标的模糊评价矩阵的熵权计算,得到各属性信息提供的有用信息量的程度;再通过各方案与理想点的距离,得出了可信度较高的优选方案。     

联合火力打击弹药需求计算动态模型研究

弹药是火力打击和火力毁伤的基础.传统的火力毁伤弹药需求计算主要有两种思路,一种是不考虑对抗,单纯基于目标的幅员和弹药的毁伤概率静态计算弹药的需求,一种是考虑对抗,运用兰切斯特方程计算弹药的消耗,这样求得的预测结果与实际需求均有较大的差距.研究发现,将基于目标打击的弹药需求和在对抗条件下武器损耗因素结合起来考虑,可以有机地将两种弹药消耗的计算思路融合在一起,建立新的数学模型,所得结果反映了弹药实际需求与外部因素的内在关系,与实际作战更加相符,对战时的弹药供应决策具有重要意义.     

武警学院实验教学示范中心建设的实践与思考

总结在实验教学示范中心建设中的经验,阐述了示范中心建设需要把握的重点和需要处理的问题,为建设好示范性的实验教学基地提供参考。     

结构化装备型号需求论证模式研究

结构化是系统工程分析问题的重要手段。为给装备型号需求论证工程化提供理论依据与技术支撑,对结构化装备型号需求论证模式的相关问题进行了研究。分析了装备型号需求论证流程,界定了装备型号需求论证工作范围,明确了装备型号需求论证的内部流程和外部边界;针对一体化联合作战要求,提出了有指导性的需求论证策略,确保结构化装备型号需求论证模式的科学性;借鉴美军体系结构技术,构建了结构化装备型号需求论证空间,对整个论证空间的结构设计、论证域的划分和各论证环节的论证任务进行了深入研究,从技术角度实现了需求论证过程的结构化。     

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

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

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008