New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种新的进化规划算法

参考高斯变异算子和柯西变异算子,提出了基于学生概率分布变异的进化规划算法。学生概率分布能够衔接高斯分布和柯西分布,其性能通过改变参数n来获得。通过仿真得到了学生概率分布变异的规律。仿真表明,基于学生概率分布变异的进化算法具有较好的性能。     

Optimal switchover times between two activities utilizing the same resource

The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008     

基于进化规划的RBF网络用于二相码旁瓣优化

研究了低截获概率技术中常用的二相编码信号处理中的距离旁瓣压缩问题,采用改进的进化规划算法优化径向基函数网络,提出了一种基于改进进化规划算法的计算方法。通过对13位巴克码和31位M编码的仿真实验,表明新的方法在旁瓣抑制能力和运算速度等性能方面,都有较大的提高。     

天地预警系统与机敏传感信息网

建立高效的天地预警系统对于赢得现代立体战争的胜利有着极其重要的意义。探讨了天地预警系统与机敏传感信息网 (Sm art Sensor Web)的构成 ,结合我国的部分研究现状 ,较详细地阐述了设计与构造天地预警系统所需解决的若干关键技术问题。     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.     

一种开发逻辑程序中AND并行性的静态编译方法

逻辑程序AND并行性的开发是逻辑程序并行执行研究中的一个重要课题。文中提出了一种开发逻辑程序中AND并行性的静态编译方法。该方法分成三个阶段:第一阶段,进入模式(entry mode) 的分析;第二阶段,退出模式(exit mode) 的生成;第三阶段,执行图表达式(execution graphexpression) 的确定。通过运行一些基准程序可知,与其它方法相比,该方法能在“生产者一消费者”原则(producer-consumer scheme) 下最大限度地开发AND并行性,且只需很小的动态开销。     

基于 ∆TOA 和方位角测量辅以间歇高度信息的双基地定位跟踪技术

本文讨论了双基地雷达系统中一种以收站△TOA和方位角测量为基础并辅以发射站传送的间歇高度信息的运动目标三维定位跟踪算法,详细分析了该技术的定位原理。在电子对抗条件下,发射站数据往往难以连续传送到接收站加以融合,因此有必要对间断传送的数据加以利用的方法进行研究。本文通过典型目标航迹的计算机仿真对该算法的性能做了评估。由于这种融合方法在双基地研究领域尚属初探,因此有待于在今后的研究中加以完善。