基于规则预置的应急事件指挥控制建模研究

为提高应急事件仿真过程中指挥控制模型的智能化程度和仿真结果的可信度,分析了应急事件指挥实体的指挥控制过程和指挥实体阃的信息交互关系,建立了基于预置规则的指挥控制模型,提出了驱动指挥控制模型运转的、表达应急事件指挥专业化知识的产生式指挥控制规则表达方式,重点研究了指挥控制规则的分类、定义和设计方法,并对该方法在仿真系统中的应用进行了分析,取得了比较理想的模拟效果.     

基于遗传算法的MIL-STD-188-220c标准最佳转发树的构造

针对MIL-STD-188-220C标准的路由协议多目的地址最佳转发树问题,提出一种基于遗传算法的优化算法,仿真结果表明,该算法具有收敛快,寻路成功率高的优点。     

无线传感器网络安全研究综述

无线传感器网络有着良好的应用前景,其安全问题同样受到了人们的高度重视。论文首先对无线传感器网络进行了简要的介绍,而后总结了这种网络的安全相关特点以及其存在的安全威胁,随后分别综述了无线传感器网络的三个安全研究热点方向:安全路由、安全认证协议和密钥管理。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种基于多目标优化的QoS路由交互式算法

为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性     

军事通信中ad hoc网络路由协议性能分析

移动ad hoc组网灵活,抗毁性很强,将在未来的军事通信中发挥重要作用。因此,对于移动ad hoc网络研究中的首要的路由问题作了探讨,先简要介绍了两种典型的路由协议OLSR(Optimized Link State Routing)和AODV(Ad hoc On-Demand Distance Vector Routing),接着利用网络仿真工具OPNET分析了AODV的协议特点,最后比较了两种路由协议的性能。仿真结果表明AODV路由开销小,但时延大,节点移动过快时存在路由稳定性的问题;OLSR路由开销很大,但时延相对较小。因此在搭建军用adhoc网时,应根据实际使用情形做出选择。     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

卫星中断容忍网络路由算法研究

针对卫星网络易中断、长时延等问题,提出一种适合卫星DTN网络的路由算法——SDTNR算法。该算法在节点缓存中设置了3个存放不同服务等级报文的队列,队列根据报文响应比排序,响应比小的报文优先发送。SDTNR算法根据卫星运行规律,建立节点选择表并实时更新该表,根据表中信息选择满足条件的节点作为下一跳节点,以此保证通信的可靠性。仿真结果表明,SDTNR与EPR、PR、FC 3种算法相比,SDTNR更好地提高了报文的投递率、降低了网络开销和平均时延。     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999