Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

NUCLEAR ISLANDS

Current International Atomic Energy Agency safeguards do not provide adequate protection against the diversion to military use of materials or technology from certain types of sensitive nuclear fuel cycle facilities. In view of highly enriched uranium's relatively greater ease of use as a nuclear explosive material than plutonium and the significant diseconomies of commercial spent fuel reprocessing, this article focuses on the need for improved international controls over uranium enrichment facilities as the proximate justification for creation of an International Nuclear Fuel Cycle Association (INFCA). In principle, the proposal is equally applicable to alleviating the proliferation concerns provoked by nuclear fuel reprocessing plants and other sensitive nuclear fuel cycle facilities. The INFCA would provide significantly increased nonproliferation assurance to its member states and the wider international community by holding long-term leasehold contracts to operate secure restricted zones containing such sensitive nuclear facilities.     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

方位多相位中心SAR信号重建误差分析

就方位多相位中心(Azimuth Multiple-Phase-Center,AMPC)合成孔径雷达(Synthetic Aperture Radar,SAR)系统的阵列误差对信号重建性能的影响进行分析。将阵列误差建模为随机过程,结合最小二乘(Least-Square,LS)算法,推导了AMPC SAR误差功率谱的解析表达式,进而得到了AMPC SAR的信噪比与方位模糊比的解析表达式。仿真实验验证了理论分析的正确性。分析指出,随着系统脉冲重复频率的升高,有必要通过减小重建系数以实现重建性能的提升。分析方法与结果对AMPC SAR系统设计以及图像质量预估提供有效支撑。     

基于全寿命周期费用分析的可重复使用运载器级数选择

建立了可重复使用运载器全寿命周期费用模型 ,并利用该费用模型分析了不同级数的可重复使用运载器方案的全寿命周期费用 ,对全寿命周期费用的各部分组成比例及其随级数的变化规律进行了分析。研究结果表明两级入轨的可重复使用运载器方案全寿命周期费用最低 ,是基于目前技术水平的一种较优的可重复使用运载器级数选择方案     

不可逆闭式燃气轮机循环的最佳功率效率特性

本文研究恒温热源条件下不可逆闭式燃气轮机循环的有限时间热力学性能,导出其最佳功率输出与效率间的关系,它包含内可逆和理想换热条件下的最佳特性关系。     

液氧/煤油推进剂液体火箭发动机循环动力平衡分析

本文对以液氧/煤油为推进剂的发生器循环和分级燃烧循环方案进行了分析,求出了各种循环方案的最大室压,给出了室压、推力、燃烧室混合比和喷管出口直径对发动机比冲和系统平衡参数的影响,并探讨了平衡参数对效率、涡轮压比和发生器(或预燃室)混合比等设许参数变化的敏感性     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

使用三个数域的数域筛算法

大整数分解难题是RSA密码的数学安全基础.目前数域筛算法是分解365比特以上大整数的最有效方法,然而它的时间复杂度仍然是亚指数的.对于目前普遍使用的1024比特以上大整数,数域筛算法还不能分解,所以研究数域筛算法具有重要的意义.现有的一般数域筛算法普遍使用两个数域,对多个数域的研究极少.一般数域筛算法经过修改可以使用三个数域,即两个代数数域和一个有理数域.分析表明:修改后的数域筛算法与原来的一般数域筛算法在时间复杂度上处于同一量级.但修改后的数域筛算法有更多地方可以合并计算,所以计算速度更快了.通过两个实验也验证了这一结论.     

改进的高脉冲重复频率雷达多假设距离估计方法

高脉冲重复频率雷达目标距离估计时面临距离模糊问题,因此必须采取一定方法解距离模糊。现有方法大都需要在每个驻留时间内至少两帧(包括两帧)检测到目标来实现目标距离估计,多假设方法虽然不要求在每个驻留时间内都需至少两帧检测到目标,但是当模糊区间发生变化时会出现目标距离估计错误。针对现有多假设方法的不足,提出改进的多假设方法,通过建立相关波门来判断目标所在的模糊区间是否改变并对目标状态作出修正,实现对模糊区间发生变化时目标距离的正确估计。仿真表明,方法可以不受模糊区间变化的影响,以较高精度实现目标距离估计。