灰数兰彻斯特方程

为解决联合作战模拟中武器装备的作战能力评估问题,提出了基于打击力、机动力、信息力、防护力、保障力等的武器装备作战能力灰色层次分析模型,目的在于提供在联合作战模拟中,对武器装备的作战能力进行比较的算法。即从打击、机动、信息、防护、保障等来考虑武器装备的性能,采用灰色层次分析的方法,根据灰数的大小确定各类各对象的优劣,由此做出作战能力的合理判断,给出了实例及求解方案。最后,提出了不同灰类的总评估系数作为损耗方程的损耗系数的设想及其算例。     

网络化防空作战C~2结构模型抗毁性

从网络动力学特征的角度,研究网络化防空作战C2结构模型抗毁性问题,针对以往的抗毁性测度指数不适用于C2网络抗毁性研究的现状,考虑C2网络信息融合的时延及战场感知覆盖率等因素,提出的抗毁性测度指标:最大连通片尺寸与网络规模比,最大连通片平均最短路径长度L,网络化效能系数。在指标的基础上对C2网络模型的抗毁性进行研究,并分析不同的空袭策略对防空作战C2网络抗毁性的影响。     

无人侦察机作战效能评估模型

以层次分析法为基础,应用模糊评价的方法,综合考虑无人侦察机自身系统以及在作战运用中的多种情况,提出了完整的无人侦察机作战效能评估指标体系.建立了无人侦察机作战效能评估模型,从而实现了无人侦察机作战效能的定量评估,其中效能指标综合计算中融合了层次分析法和模糊系统理论.通过仿真计算,验证了模型的正确性.研究结果避免了复杂推理过程,且计算方便,可用于无人侦察机发展论证及实际作战.     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

战术地地导弹打击复杂飞机跑道的火力运用

在文献 [1,2 ,3]的基础上 ,研究了运用战术地地导弹对复杂飞机跑道实施打击中 ,最优瞄准点选择和毁伤效果指标计算原理和步骤 ,给出了描述复杂飞机跑道失效率的毁伤指标体系和内涵     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000     

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     

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     

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     

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