求解非线性规划的小生境遗传模拟退火算法

提出了用小生境遗传模拟退火算法求解带复杂约束的非线性规划问题。首先分析了遗传算法＂早熟＂收敛以及局部搜索能力弱的不足,由此引入小生境以增加种群多样性,并抑制＂早熟＂收敛现象,同时引入模拟退火算法以增强局部搜索能力,改进进化后期收敛速度慢的不足,最后结合典型非线性规划算例验证了混合算法的效率、精度和可靠性。     

重型鱼雷的机动搜索及机动搜索弹道架构

针对潜射重型鱼雷在技术性能上的大幅提高和智能化作战的需要,在提出并分析鱼雷机动搜索概念和机动搜索时机的基础上,研究了远程重型鱼雷实现机动搜索在弥补发射平台目标定位误差、鱼雷发射后目标的有意机动和适应点对域攻击战法转变等作战环节中的必要性,构建了重型鱼雷机动搜索弹道的技术框架.     

Designing and pricing menus of extended warranty contracts

Extended warranties provide “piece of mind” to a consumer in that product failures which occur after the base warranty expires are rectified at little or no cost. They also provide an additional source of revenue for manufacturers or third‐party providers, such as retailers or insurance providers, and help cultivate consumer loyalty. In this article, we analyze a number of extended warranty contracts which differ in design, including restrictions on deferrals and renewals. With the use of dynamic programming, we compute the optimal strategy for a consumer with perfect information and determine the optimal pricing policy for the provider given the consumer's risk characterization. We also provide insight into when different contracts should be issued. Finally, we illustrate how profits can be dramatically increased by offering menus of warranty contracts, as opposed to stand alone contracts, with the use of integer programming. Surprisingly, risk‐taking consumers provide the greatest benefit to offering menus. These insights can help a company develop a comprehensive warranty planning strategy for given products or product lines. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

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编码的仿真实验,表明新的方法在旁瓣抑制能力和运算速度等性能方面,都有较大的提高。     

混合推理在某型雷达故障诊断中的应用

传统诊断方法各有优缺点,对于大型装备的故障诊断来说,由于故障的复杂性、故障信息的多样性,单一的诊断方法满足不了实际应用的要求。为此,在介绍基于案例、模型、神经网络专家系统诊断推理方法的基础上,论述了基于案例、模型和神经网络的混合推理策略,给出了建立混合推理系统的方法,并在某型雷达的故障诊断系统中得到了应用。     

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 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