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.     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

Challenges of institutional coordination in complex defense acquisition programs: the case of the Republic of Korea’s F-X program

Decision-making in defense acquisition programs in the Republic of Korea (ROK) has been problematic, especially in highly advanced complex systems. The highly disputed force modernization program for the ROK Air Force’s fifth-generation fighter, dubbed the Fighter eXperiment, went through extreme turbulence during the type selection phase. The gist of the turbulence became evident through poor institutional coordination within the defense acquisition authorities that eventually forced them to rescind the decision generated from their own yearlong efforts, thus basically shooting themselves on the foot. The paper highlights the background of the program and reviews the institutional elements that influenced the decision-making process, and conclude that the absence of an effective coordination mechanism has made decision-making in complex defense programs even more troublesome.     

实兵演习战场态势研究

实兵演习战场态势是指挥员通过实战化训练提升获取战场情况、指挥部队行动能力的重要支撑和手段。首先针对当前实兵演习战场态势存在的数据结构、传输机制、系统架构和聚合显示等重点难点问题进行了详细地阐述和分析,然后在此基础上提出了态势数据结构的层次化设计、按需公布订购的数据传输机制、态势框架的柔性化设计和基于作战能力的态势聚合机制等相关的解决方法。以期能够建立一个支持大规模、分布式联合应用,并且可以显示综合战场态势和专用战场态势的战场态势系统。     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

机场目标打击顺序灰色决策分析

对军事机场目标的结构、特征进行了系统分析,确立了军事机场目标评估体系,并运用灰色决策分析方法建立了军事机场多目标打击顺序确定的优化模型,为对该类实施导弹打击所进行的火力计划拟制提供了一种新的数学方法。     

非专业英语听说能力提高的教学策略

听说能力是语言综合能力的重要体现,本应受到高度的重视,然而在传统的大学公共英语教学中,“轻听说、重读写”的教学模式造就了一大批读写尚可但张口即结舌的英语习得者。所幸,当前大学英语的教和学双方都开始注重对语言习得读、说、听、写、译5种技能全方位的提高。国家CET考试委员会从1996年初起也正式启用听写等新题型。但近几次的四、六级统考结果统计表明,对于大多数考生来说,听写部分仍是难以突破的关口。针对这一现状,结合多年的教学和阅卷经验,对提高英语听说能力的教学策略进行了探讨。     

基于内外子区域划分的高阶精度CFD程序异构并行算法

对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法,结合结构化网格下有限差分计算和四阶龙格库塔方法的特点,引入ghost网格点区域,设计了一种ghost区域收缩计算策略,显著降低了异构计算资源之间的数据传输开销,负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠,提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数,分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)＋加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍,较MPI/OpenMP两级并行算法使用24个纯CPU核的性能,该算法使用单加速器时加速1.27倍,使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。     

Kriging与改进一次二阶矩融合的可靠性分析方法

针对结构可靠性分析问题,提出了Kriging与改进一次二阶矩方法相融合的分析方法。传统的改进一次二阶矩需要计算结构功能函数的梯度信息,在处理包含有限元模型的隐式极限状态问题时会比较困难。该方法将Kriging代理模型与改进一次二阶矩迭代有效而充分地结合,借助Kriging方法提供功能函数的梯度信息,以解决隐式极限状态函数的求导难题,提高分析效率。通过数值与工程算例验证了所提方法的可行性和高效性。     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010