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     

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     

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     

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     

计算机辅助三向伴流场的测试技术研究

运用计算机技术对三向伴流场的测试进行研究,对多点三向伴流场测量系统原理、方法及计算机辅助采样、计算和分析进行了阐述．     

The Organization of the Defense Support System: An Economic Geography Perspective

In the context of restricted budgetary resources and the growing cost of maintenance, repair, and overhaul (MRO) activities, a major issue for modern armed forces is to sustain defense platforms. A possible method consists of realizing economies of scale through the concentration of maintenance activities, which involves the spatial reorganization of existing industrial sites dedicated to MRO. This article provides a formalized framework to discuss the optimal organization for the MRO of defense platforms in space. The public planner organizes the maintenance of defense platforms with only two possible spatial configurations. In the dispersed configuration, two industrial production units in charge of the maintenance optimally cover space, whereas in the concentrated configuration, a unique industrial unit covers space. Focusing on the tipping point between the two configurations, the balance of forces between agglomeration and dispersion in defense support activities is described and discussed. On the one hand, economies of scale provide an opportunity to optimize defense support costs, favoring concentration in a unique industrial unit. On the other hand, space causes dispersion to reduce both transport costs and operational social costs. This trade-off illustrates a general principle in spatial economics with an application to MRO production in the French case.     

实二次函数域基本单位范的判别法

本文给出实二次函数域基本单位范为g(g为F_q~*中本原元)的充分条件,从而解决了一批实二次函数域基本单位范的问题。     

三维高超音速复杂流场的分区数值计算

基于拼接网格系统 ,推导了一种适用于高超音速复杂流场分区数值计算的区域边界格式 ,通过区域边界格式对区域边界上的通量进行守恒性处理 ;在此基础上 ,发展了一个高超音速复杂流场分区算法。对高超音速粘性绕流流场进行了分区数值模拟 ,取得了较好的结果。     

基于分布式数据流的的指控系统服务集成方法

针对SOA服务集成架构应用于军用指控系统遇到的问题,提出了一种基于分布式数据流的服务集成方法。其设计思想不同于现在常用的服务集成方法中采取的集中式数据流,该方法支持指控服务构件之间数据的直接通信,可避免集中式处理带来的通信瓶颈问题,提高了服务集成的性能,较好地适应了军用异构网络环境。     

气—固两相自由射流的粒子仿真方法

采用粒子仿真方法直接跟踪颗粒相运动轨迹,采用NND格式求解NS方程,数值模拟了气-固两相自由射流流场.计算结果表明,将粒子仿真与CFD方法相结合是研究气-固两相流动问题的有效途径.颗粒相参数变化将对气体流场产生一定影响.