Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

A refined deterministic linear program for the network revenue management problem with customer choice behavior

We present a new deterministic linear program for the network revenue management problem with customer choice behavior. The novel aspect of our linear program is that it naturally generates bid prices that depend on how much time is left until the time of departure. Similar to the earlier linear program used by van Ryzin and Liu (2004), the optimal objective value of our linear program provides an upper bound on the optimal total expected revenue over the planning horizon. In addition, the percent gap between the optimal objective value of our linear program and the optimal total expected revenue diminishes in an asymptotic regime where the leg capacities and the number of time periods in the planning horizon increase linearly with the same rate. Computational experiments indicate that when compared with the linear program that appears in the existing literature, our linear program can provide tighter upper bounds, and the control policies that are based on our linear program can obtain higher total expected revenues. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于Fisher线性判别模型的文本特征选择算法

在采用向量空间模型表示方法的文本分类系统中,维数约简是必要的步骤,特征选择方法由于计算复杂度较低而被广泛采用.本文基于Fisher线性判别模型提出了一种新的文本特征选择算法,将其求解过程转换为一个特征项优化组合的问题,避免了复杂的矩阵变换运算.实验表明,该方法与信息增益、卡方统计方法比较,具有较明显的优势.     

卫星移动通信信道模型及仿真

对移动卫星通信的三种典型信道进行了完整的理论分析.通信信号在不同的信道参数条件下,经过瑞利(Rayleingh)信道、莱斯(Rician)信道和阻挡效应下的莱斯信道(Rician/Lognormal)进行了计算机仿真,得到了仿真结果.经分析比较发现,信道参数不同,得到的误码率曲线不同.信道的性能主要取决于信道参数,各种因素的影响可以归结到这些参数的影响,理论分析和仿真实验结果一致.     

机械抖动偏频激光陀螺静态测角方法

阐述采用机械抖动偏频激光陀螺进行静态角度测量的原理,分析测角随机误差与激光陀螺角随机游走系数、测量时间的关系,通过转台分度误差实验验证了测角随机误差公式。采用排列互比法对测角系统误差和转台分度误差进行分离。实验与理论分析表明,静态测角方法具有良好的环境适应性和稳定性,测角随机误差优于0.26″,系统误差优于1″。最后分析了进一步减小测角随机误差和系统误差的措施。     

尾流自导鱼雷直进射击系统误差的提前角修正方法

针对尾流自导鱼雷直进射击方式下弹道简化产生的命中结果系统误差问题,采用几何分析法,首先,分析了尾流自导鱼雷的直进射击原理;然后,依据尾流自导鱼雷弹道过程,建立了尾流自导鱼雷命中点偏差的解析计算模型,并分析了该偏差对鱼雷命中效果的影响;最后,研究了消除该系统误差的提前角修正方法。通过实例论证了该修正方法的可行性和有效性。     

测速雷达使用新方法研究

通过舰炮武器系统测速雷达作战使用分析,提出初速预测新模型、修正量新模型等测速雷达使用新方法。分别对使用新方法前后效能进行比较仿真,仿真证明,本方法极大地提高了舰炮武器系统对海作战时首群命中效能。所提出的方法对于提高舰炮武器作战效能具有理论和实际意义。     

基于预定作业周期的航母作战部署调度研究

为科学筹划航母作战部署调度,优化航母作战兵力的运用,对航母作战部署调度问题进行建模研究。介绍航母预定作业周期,重点阐述航母综合训练期、维修保障期和人员/作战节奏等相关内容;在此基础上,分析航母作战部署调度的约束条件,在满足对作战区域有效时间覆盖条件下,以最小化航母作战兵力数量为目标函数,构建航母作战部署调度优化模型,并通过实例进行验证。结果表明,该模型是有效、实用的,可为科学决策航母作战部署调度提供依据和方法。     

JTIDS数据链在部分频带干扰下的性能分析

联合战术信息分发系统(Joint Tactical Information Distribution System,简称JTIDS)采用组合调制体制和多层编码体系保证报文传输的可靠性。分析了JTIDS数据链在莱斯衰落信道环境下的抗干扰性能,并通过仿真分析了该系统在部分频带干扰下的符号误码率和报文丢失率。仿真结果显示,由于JTIDS系统将RS编码、交织等多种编码技术和DS/FFH MSK调制技术相结合,使其在复杂信道环境下保持较低的符号误码率及报文丢失率,满足数据链报文传输可靠性的要求。     

流动危险源泄漏事故应急疏散决策优化

在流动危险源泄漏事故中,如何根据流动危险源的危险特性,快速制定最优疏散决策,使应急疏散的成本最低是现场指挥人员急需解决的重要问题。在分析讨论疏散范围、疏散人员、疏散方式、疏散路径、避难场所等影响应急疏散决策因素的基础上,采用线性规划方法,建立了应急疏散的优化模型。以运输液氯槽车泄漏事故为例,研究危险区域的人员疏散,并利用Lingo软件对优化模型进行了求解,得到了应急疏散的最佳方案。研究结果对消防部队有效地指导疏散救人行动具有参考价值。