成本分担定价方式的装备采购博弈研究

承包商的努力程度直接决定了装备的制造成本。为有效激励承包商降低装备制造成本,提高装备采购效益,基于里昂惕夫劳资博弈模型建立了成本分担定价方式的装备采购博弈模型。并在承包商边际效用非线性和定价方式多变量的假设基础上,分别对价格、成本、承包商努力程度和承包商效用之间的关系进行了研究,对原模型进行了拓展,为定价方式中参数的确定提供了量化方法。     

基于状态的检查与修理综合决策模型

分析了单部件系统退化过程的特点,建立了基于状态的检查与修理决策模型。该模型根据系统的当前状态来决定检查与修理,通过分析计算系统在一个更新周期内平均检查次数、预防性维修及修复性故障的概率,建立维修费用与检查问隔及预防性维修阈值的关系,以平均维修费用最小为目标,优化检查间隔及预防性维修阈值。最后运用Matlab对模型进行数值计算,结果表明,模型能有效地降低维修费用。     

基于博弈论的装备采办成本控制问题研究

从武器装备采办的理论需求出发,以博弈论为理论工具,对武器装备采办过程中的生产成本控制问题进行了分析;建立了基于激励的生产成本控制模型,并对成本控制模型的特点进行了分析和解释;针对军方在激励合同执行过程中有可能出现的2类错误,对成本控制模型进行了优化。在非对称信息条件下,优化后的成本控制模型不但能有效减少2类错误的发生,而且可提高军方装备采办效用,减少代理方合同风险。     

一种基于HLA分布式仿真系统的动态负载平衡算法

基于兴趣域的"快递式"动态负载平衡算法从HLA/RTI提供的服务出发,当节点成为重载节点时,将节点部分负载转移到兴趣域内的轻载节点上,同时采用两次"握手"方式解决了负载迁移过程中出现的问题.通过使用两个评价参数--CPU占有率和内存使用率进行实验证明,负载平衡前后重载节点的CPU利用率和内存使用率有明显差别,结果表明该方法能有效地平衡系统各节点之间的负载,保证系统的实时性,提高系统的服务质量.     

间歇采样转发假目标对CFAR检测影响分析

分析间歇采样转发形成的假目标干扰对雷达CFAR检测的影响和间歇采样转发假目标生成机理,给出间歇采样转发假目标产生方法。在此基础上,以雷达一次搜索周期内虚警、漏警造成的检测代价作为检测性能指标,分别分析单元平均恒虚警检测器、有序恒虚警检测器、剔除和平均恒虚警检测器在间歇采样转发假目标干扰下的检测代价。着重分析间歇采样转发干扰关键参数对检测代价的影响。仿真结果表明,间歇采样转发产生的多个假目标显著提高了雷达的检测代价,检测代价受转发占空比、转发功率的影响较大,而受转发频率影响较小。在三种恒虚警检测器的对比中,剔除和平均恒虚警检测器相对于另两种检测器的检测代价更大些。     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

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     

Capacity investment decisions under risk aversion

This article studies the optimal capacity investment problem for a risk‐averse decision maker. The capacity can be either purchased or salvaged, whereas both involve a fixed cost and a proportional cost/revenue. We incorporate risk preference and use a consumption model to capture the decision maker's risk sensitivity in a multiperiod capacity investment model. We show that, in each period, capacity and consumption decisions can be separately determined. In addition, we characterize the structure of the optimal capacity strategy. When the parameters are stationary, we present certain conditions under which the optimal capacity strategy could be easily characterized by a static two‐sided (s, S) policy, whereby, the capacity is determined only at the beginning of period one, and held constant during the entire planning horizon. It is purchased up to B when the initial capacity is below b, salvaged down to Σ when it is above σ, and remains constant otherwise. Numerical tests are presented to investigate the impact of demand volatility on the optimal capacity strategy. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 218–235, 2016     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016