JTIDS自组织组网路由协议及性能分析

文章在分析JTIDS数据链系统消息的基础上,提出了一种支持地面组网的路由协议(JMR),在不改动现有消息内容的前提下,可以实现JTIDS端机间的无中心自组织组网,并对时延、吞吐量、交付率、路由开销等方面性能进行了仿真分析。     

战场信息分发服务语义描述方法的分析与比较

文章针对基于语义的战场信息分发这一特定应用,对OWL-S和SAWSDL两种常用的语义服务描述语言进行了深入的比较与分析。首先,以航迹信息为例构建了战场态势信息本体,并对战场传感器所提供的服务进行封装;然后,详细描述了如何采用OWL-S和SAWSDL描述本体及服务,并结合战场态势语义的特殊需求,对两种语言的描述能力、匹配组合的支持能力等性能进行了比较。分析表明OWL-S更适合于复杂多变的战场信息环境。     

基于SOA的战场武器协同系统服务语义描述

高效的武器协同能充分发挥各作战单元的整体作战效能。SOA(Service Oriented Architecture)体系结构松耦合性、平台独立性及可重用性等特点,为武器协同系统的实现提供了有效的技术途径。文章针对现行集中式的武器协同系统体系结构,重点讨论了武器协同本体构建及战场服务语义描述的实现问题。首先介绍了武器协同系统的组成及工作流程;然后依据系统的操作过程,构建了完整一致的武器协同本体,并用OWL语言对其进行描述;分析、比较了几种服务描述语言优缺点,选择了WSDL-S语言进行服务描述,并以火炮射击服务为例,给出了战场服务的封装和描述方法,主要包括基本服务信息描述和服务描述的语义扩展。最后,对下一步工作进行了展望。     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

外场维护指挥控制系统可靠度模型

分析了影响外场指挥控制系统可靠性的主要因素,以指挥人员为主体,根据战时的实际,对指挥关系进行了重构,将串联指挥关系变为并联关系,通过利用马尔可夫链给出了指挥控制系统状态转移图,建立了计算外场指挥系统可靠性的数学模型。并且进一步给出了计算指挥控制系统的可靠性的方法。     

EMS磁浮列车的轨道共振和悬浮控制系统设计

主要从悬浮控制系统设计的角度来解决磁浮列车的轨道共振问题,研究鲁棒状态观测器的设计,讨论观测器参数的选择方法。仿真和实验的结果表明,所设计的悬浮控制系统可以消除轨道共振,实现磁浮列车的稳定悬浮     

Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

The shortest queue model with jockeying

In this article we deal with the shortest queue model with jockeying. We assume that the arrivals are Poisson, each of the exponential servers has his own queue, and jockeying among the queues is permitted. Explicit solutions of the equilibrium probabilities, the expected customers, and the expected waiting time of a customer in the system are given, which only depend on the traffic intensity. Numerical results can be easily obtained from our solutions. Several examples are provided in the article.