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     

An economic lot‐sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis

The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于HLA/RTI 的仿真系统设计

结合雷达电子对抗仿真实例，论述了基于ＨＬＡ／ＲＴＩ的分布交互式多机仿真系统的体系结构、底层通信网络、运行支持系统、仿真应用对象模型和仿真运行管理及其设计与实现问题。     

论人才成长中的非智力因素

随着个性化时代的来临,一个新的概念“情商”被引入,国内外不少研究人员提出了这样一个公式即:一个人的成功=20％IQ(智力商数)+80％EQ(感情商数),故不难看出,在21世纪人才的成长过程中,非智力因素所起的作用将越来越大。     

气压高度滞后对火控系统靶试精度影响及采用GPS进行修正的飞行试验方法

气压高度滞后修正在试飞院从未进行过飞行试验,通常采用地面试验结果。介绍了首次采用ＧＰＳ差分进行气压高度延迟修正的飞行试验方法,为火控系统俯冲状态提供气压高度修正曲线。     

矩阵转置的一种快速算法

本文给出一个数据体积超过计算机可用内存容量的n×n 矩阵快速转置的新方法。与常用的算法相比,所需的计算时间显著减小。     

被动式寻的导弹的目标自适应制导算法

主要解决以下两个问题 :一是在仅有角度信息的被动制导中如何获得距离信息 ;二是对攻击点的选择问题作了初步的探索 ,在获得距离信息的基础上 ,利用交战双方几何关系实现目标自适应制导算法 ,解决在红外被动制导中跟踪点和攻击点不同的问题。文末给出实验仿真结果及分析     

Comparison of rank aggregation methods based on inherent ability

Ranking is a common task for selecting and evaluating alternatives. In the past few decades, combining rankings results from various sources into a consensus ranking has become an increasingly active research topic. In this study, we focus on the evaluation of rank aggregation methods. We first develop an experimental data generation method, which can provide ground truth ranking for alternatives based on their “inherent ability.” This experimental data generation method can generate the required individual synthetic rankings with adjustable accuracy and length. We propose characterizing the effectiveness of rank aggregation methods by calculating the Kendall tau distance between the aggregated ranking and the ground truth ranking. We then compare four classical rank aggregation methods and present some useful findings on the relative performances of the four methods. The results reveal that both the accuracy and length of individual rankings have a remarkable effect on the comparison results between rank aggregation methods. Our methods and results may be helpful to both researchers and decision‐makers.     

无人飞行器Ad Hoc网络中容错节点移动控制算法

针对无人飞行器Ad Hoc网络的容错设计需求,基于UAV节点的可控移动特性,提出了一种基于强化边启发的节点移动控制算法.首先采用文化基因算法对给定通信网络对应的拓扑图进行搜索,求解使图获取顶点2 -连通属性所需新增的最小成本强化边组合.以强化边为启发,将连接的节点移动到彼此通信范围内来实现强化边,同时以这些节点为leader,采用基于一致性算法的leader-follower控制算法移动其他关联节点,使变化后的网络为顶点2-连通,从而实现网络容错.仿真实验结果表明算法的可行性与有效性,节点总的移动距离少于用于对比的块移动算法和紧缩算法.     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012