Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Generalized orienteering problem with resource dependent rewards

We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于VCSEL实时点到点OFDM光信号在MMFs中的传输

通过实验,在使用未冷却直调3.63 GHz垂直腔面发射激光器的简单强度调制和直接检测系统中,首次证明在800 m OM2多模光纤上采用正交频分复用技术进行64 QAM(正交幅度调制)编码实现实时点到点通信,传输速度为11.25 Gb/s,功率损失1 d B。     

基于混合高斯概率密度的加权打分方法

针对当前评比打分方法不能有效反映选手真实情况的问题,提出了一种基于混合高斯概率密度的加权打分方法。该方法的重点在于引入混合高斯分布来确定专家评分的权重。首先利用EM算法确定混合高斯分布模型参数,然后通过区间划分得到每个区间上的概率,再将专家打分映射到混合高斯概率密度函数区间上得到对应的权重,最后经加权求和得到选手的最终成绩。通过实例证明了该方法的合理性和公正性。     

GPS动态定位中整周模糊度的快速解算

在导航中快速和高精度GPS定位需要解算差分载波相位的整周模糊度值.目前整周模糊度的求解方法,丢失了对提高未知参数估值精度很有用的历元信息,并且在去相关过程中必须使方差阵为正定阵,不仅解算难度大,还可能出现病态分解,使得去相关失败.提出了一种GPS整周模糊度的快速解算方法,首先利用卡尔曼算法求解整周模糊度的浮点解;其次确定搜索空间,对协方差阵进行Cholesky分解,削弱其相关性;最后用ratio检验得出最终解.通过理论推导和基于实测数据的仿真分析表明,卡尔曼算法有效地利用多历元信息提高了浮点解的精度,并且在去相关过程中解决了方差阵必须为正定阵的问题,避免出现病态分解,使得搜索空间得到明显的改善,提高了效率,具有实际的应用价值.     

军队人力资源培训问题的整数线性规划模型

文章研究了军队人力资源培训问题,并基于时间和费用两个指标,建立了一个满足培训时间约束且费用最省的0-1整数线性规划模型,给出了基于Lagrange松驰分解的模型求解算法。在算法中,采用一种简单可行的Lagrange乘子更新方法代替传统的次梯度法。另外,文章证明了算法获得最优解的两个充分条件,计算实例初步表明给出的算法是行之有效的。     

层次分析法在装甲师火力战能力评估中的应用

对装甲师火力战能力的评估将对装甲部队建设有很大的推动作用,但影响装甲师火力战能力的因素很多。采用AHP法,综合考虑火力战能力的多方面因素,以定量和定性相结合的方式来评估装甲师实施火力战的能力,弥补以往人数与火器统计评估法等存在的不足。     

波分复用光传飞行控制系统的开发

针对光传飞控系统的技术特点,开发了一种多路数字信息进行波分复用的光纤传输系统.着重构建了光发射端机、光接收端机及光波分复用器的物理系统,开发途径力求提高信号的传输速率,减少误码率.在具有良好解耦及动特性的直升机显模型跟踪电传飞行控制系统(MFCS)的基础上,进行了直升机贴地飞行波分复用光传系统地面实时半物理仿真验证,通过光传与电传性能对比,验证了所开发的波分复用光传飞行控制系统的可行性.     

一种基于0-1整数规划的全局数据分布优化方法

数据分布是影响并行程序在分布主存多处理机上执行性能的重要因素.针对分布主存多处理机中的数据分布问题,提出了一种基于0-1整数规划、利用数据变换技术进行有效数据分布的方法.该方法通过数据变换技术改变数据的存储布局,以使得数据能被有效地分布,并且该方法还利用数据分布图描述程序被并行的情况及其所含数组被访问的情况,并将全局数据分布优化问题转换为求解数据分布图中最优路径的问题,从而可用0-1整数规划求解最优路径问题.该方法能对多个嵌套循环中具有仿射数组下标的任意维数组进行有效的数据分布,并且也能使嵌套循环的并行度尽可能地大.另外,该方法也考虑了偏移常量的对准问题,从而能使数据通信量尽量地小.实验结果验证了该方法的有效性.     

基于舰艇编队的反舰导弹航路规划区域划分

根据舰艇编队对海导弹攻击中航路规划指挥决策的需要,为避免各舰发射的导弹出现航路交叉现象,提出了单舰导弹航路规划功能区域的概念和编队导弹航路规划区域划分的思想,建立了编队导弹航路规划区域划分模型。分别研究了一般情况和复杂情况下的导弹航路规划区域划分方法,并且结合想定装备参数进行了编程实现和算例分析。为编队指挥员实施导弹航路规划决策提供辅助决策和科学依据。