使用直接模拟法研究选择快中子屏蔽参数

使用蒙特卡罗直接模拟法模拟了300keV氘束流T（d,n）4He中子源发出的中子在球壳屏蔽体介质铁中的输运规律。分析了不同介质厚度的铁对中子的反射性质和吸收性质,这些解释和分析对快中子球壳屏蔽参数的选取具有重要价值。     

The fertile ground of Hell’s carnival: Charles T. R. Bohannan and the US Army’s Counter Intelligence Corps’ investigations of war criminals,collaborators, and the Huk,in the Philippines 1945–1947

Insurgencies thrive in regions where government legitimacy is absent. In the post-war Philippines, Captain Charles T. R. Bohannan of the Army’s Counter Intelligence Corps became actively aware of this dynamic. Bohannan is best known for his later work with Edward Lansdale and Ramon Magsaysay in defeating the Huk Rebellion (1950–1954). Here the author examines Bohannan’s early investigative work against Japanese war criminals, wartime Filipino collaborators, and the rising threat of communist subversion most associated with the Huk. All of these experiences fed into what would be the successful campaign against the Huk, chronicled in his seminal work, Counter Guerrilla Operations: The Philippines Experience, and offers lessons on the investigative (as opposed to tactical or psychological) nature of effective counter-insurgency work, as it relates to both legitimacy in governance and the rise of insurgencies.     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

太阳能光电热系统换热器性能实验研究

设计了新型半圆管形式的不锈钢板式换热器,对其作为太阳能光电热综合利用一体化系统集热组件的性能进行实验研究。通过新型集热光电热组件及光电组件系统的对比实验,研究该光电热组件在重庆地区夏季应用情况,分析其光电和光热特性。结果表明:在以晴朗为主的天气,半圆管形式的不锈钢板式光电热组件电热系统的电热性能与光电组件系统的相比较,前者的太阳能电池输出功率提高约26.48%,热利用效率提高23.70%以上,新型半圆管形式的光电热组件整体光电热(光电+光热)综合效率可达到25.70%,有效提高了光电热系统的综合效率。新型半圆管形式不锈钢板式换热器的换热面积增大,提高了换热效率,为太阳能光电热综合利用一体化系统在重庆等太阳辐射强度较小地区的应用提供了参考。     

基于瞬态冲击法的方钢管混凝土柱脱空检测试验

通过对有脱空缺陷的方钢管混凝土柱试件进行瞬态冲击作用下的检测试验,提出了根据振动信号频率变化、频谱峰值和WVD时频分布中频率的时间连续性等特征来进行脱空检测的新方法。基于WVD时频分布特性,提出了使用平均频率作为脱空判别指标。结果表明：当方钢管混凝土柱存在脱空,振动信号的平均频率发生明显降低,频谱图中频率成分简单,归一化频谱峰值高,在WVD时频分布三维图上呈现沿时间轴连续的偏平峰。说明该方法对检测方钢管混凝土柱脱空具有一定的有效性。     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

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     

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     

确定螺旋桨直径切割量的图谱和方法

当螺旋桨要求的功率过高以至于轴转速达不到额定值时,可以采用切割螺旋桨叶梢的方法减小螺旋桨的负荷。本文提出了依据切割桨性能系列图谱确定螺旋桨直径切割量的方法,同时也提供了适用于高速船常规螺旋桨的系列图谱。按本文所述方法得到的计算结果与实船测试结果吻合良好。