一种新的进化规划算法

参考高斯变异算子和柯西变异算子,提出了基于学生概率分布变异的进化规划算法。学生概率分布能够衔接高斯分布和柯西分布,其性能通过改变参数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编码的仿真实验,表明新的方法在旁瓣抑制能力和运算速度等性能方面,都有较大的提高。     

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

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

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

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

线性分式规划原始单纯形算法有限性问题

本文用一个数值例子说明用[1] 和[2] 中的原始单纯形算法求解退化的线性分式规划(LFP) 可能会出现基循环,从而得不到最优解。于是就此情形引入了Bland规则,并建立了有限性算法。     

两种选址问题的算法及有关结论

本文提出两种选址问题,对其局部最优性建立了充要条件,并在此基础上提出了该类问题的有效算法。     

Dynamic order acceptance and capacity planning on a single bottleneck resource

We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

谈算法研究

算法是计算机程序设计的核心。本文结合实际应用,通过研究算法所取得的成效,说明算法研究的必要性和重要作用。     

42－160柴油机离合器换向拨叉叉头优化设计的光弹验证

本文用光弹性实验方法验证了有限元法对４２—１６０柴油机离合器换向拨叉优化设计的结果。实验证明,有限元优化设计是正确、可靠的,效果是非常好的。