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     

基于页面关联比重的PageRank排序算法的改进

对比分析了基于链接分析的搜索引擎排序算法PageRank和HITS,针对原有PageRank算法采用的平分页面自身PageRank值的策略,提出了按基于关键词集的网页关联比重分配PageRank值的改进算法。该改进算法根据用户搜索的关键词,按照超链接的网页关联比重为超链接赋予权重,增强了已有算法的有效性。     

舰艇火控系统的现状与发展设想

通过对舰艇火控系统的技术现状和发展趋势的分析,提出了未来舰艇综合火控系统、舰艇编队协同火控系统和海上联合火控系统的发展设想。     

基于网格技术的联合空情预警体系建设

网格技术的先进理念与联合空情预警体系的思想不谋而合,将网格技术应用于联合空情预警体系的建设之中,必将引发联合空情预警体系系统功能全面性、革命性的提升。首先提出基于网格技术构建联合空情预警体系的建设思路,详细分析了联合空情预警体系的功能构想,着重探讨了联合空情预警体系的作战体系结构、系统体系结构、技术体系结构,并提出联合空情预警体系构建中应把握的几个重要问题。     

TIG熔修改善船体钢焊接接头使用性能原因分析

本文通过４５ｋｇ级船体用钢焊接接头趾部熔修前后显微组织、残余应力、应力集中及表面状态等变化的研究,分析探讨了ＴＩＧ熔修改善接头使用性能的原因所在。这对于制定合理的熔修工艺,保证熔修质量,提高熔修效果具有重要的参考价值。     

几何凸集中一个递归关系的建立与求解

几何凸集中递归关系的建立是求解问题的关键。本文对一个定理中递归关系的建立给出了容易理解的详细表述,然后利用生成函数法求其解。     

轻型鱼雷及飞机投放装置

本文主要概述了轻型鱼雷的性能、飞机空投鱼雷使用条件及飞机投放鱼雷装置,同时也对主要直升机性能作了概括。这对于使用轻型鱼雷进行空投反潜具有重要参考价值。