首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 391 毫秒
1.
在(1+1)EAs中,采用马尔可夫链推移时间分析法,推导出了平均首次命中时间的表达式。从理论上分析了变异概率对平均首次命中时间的影响。结果表明适当的变异概率会缩短平均首次命中时间,加快进化算法的寻优时间。  相似文献   

2.
在基于模型的故障诊断仿真系统的诊断流程中,由最小冲突集计算最小碰集是整个流程中的关键步骤。针对现有计算最小碰集方法中存在的缺陷,提出了运用集合逻辑运算法计算最小碰集,将冲突集表示为集合的逻辑"与"、逻辑"或"运算,通过其运算法则进行运算简化,可得到全部的最小碰集。该方法具有简单有效、数据结构简单、计算简便快捷和易于程序实现等优点。最后通过实例计算,验证了该算法的正确性、简单性和高效性。  相似文献   

3.
在强激光武器的跟踪误差为均方可导、各态历经、零均值的正态过程的条件下,通过明晰的物理概念与严谨的数理演绎,导出了它的动态毁伤概率的级数表达式。通过算例探讨了动态毁伤概率的性质:它存在两个极大值所对应的随机穿越的自然频率,当跟踪系统工作在其中的非零频率上时,更具有快速反应能力;展现了跟踪误差的传递函数与动态毁伤概率间的定量关系。为论证、设计、检验强激光武器系统的动态毁伤概率提供了理论依据与技术支持。  相似文献   

4.
Sufficient conditions are developed for the ergodicity of a single server, first-come-first-serve queue with waiting time dependent service times.  相似文献   

5.
本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。  相似文献   

6.
The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method.  相似文献   

7.
点和区间混合型维度数据集是空间数据库系统和GIS中重要的数据对象.在分析SS树的基础上,提出了一种适用于索引点和区间混合型维度数据集的索引结构--PI树.PI树利用超球划分数据集的多维空间,以提高结点存储利用率,从而降低数据插入时的I/O次数.文章给出了PI树插入、删除和查询算法的形式化描述.理论分析和实验结果表明,所提的PI树性能上总体优于R·树.  相似文献   

8.
以(Cg,|.|g)为相空间,研究具有无限时滞非线性积分方程周期解的存在性,利用Schauder-Tychonov不动点定理证明方程解的g一致有界性和g一致最终有界性蕴含周期解的存在性。  相似文献   

9.
Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   

10.
We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented.  相似文献   

11.
通过对地攻击自动瞄准弹的引导方法的分析,提出角度误差导引方法,给出在三维空间的实现方法,结果证明角度误差导引方法适用于无推力可控弹的攻击过程,它所需总的操纵力最小,具有高命中精度,并通过仿真试验验证。  相似文献   

12.
The capacitated multicommodity network flow problem presents itself in a number of problem contexts including transportation, communication, and production. To solve the large-scale multicommodity flow problems encountered in these fields, we develop dual-ascent heuristics and a primal solution generator. The dual-ascent solutions, in addition to determining lower bounds on the optimal objective function value, provide advanced starting solutions for use with primal-based solution techniques. The primal solution generator uses the dual-ascent solution to obtain heuristically primal solutions to the multicommodity flow problems. Computational experiments performed on three test problem sets show that the dual-ascent and primal heuristic procedures typically determine nearoptimal solutions quickly. In addition, by using the dual-ascent procedure to obtain advanced starting solutions, run times for optimal multicommodity flow procedures are reduced significantly and greatly improved solutions are obtained by the new primal solution generator. © 1993 John Wiley & Sons, Inc.  相似文献   

13.
Military Standard 105D has been almost universally adopted by government and private consumers for the lot-by-lot sampling inspection of product which may be inspected on a dichotomoun basis The plan specifies, for each lot size, a random sample size and set of acceptance numbers (maximum allowable number of defectives in each sample). The acceptance numbers are based upon the binomial distribution and depend upon the quality required by the purchaser. Where several consecutive lots are submitted, a shift to less severe (“reduced”) inspection or more severe (“tightened”) inspection is specified when the ongoing quality is very high or low. Further experience permits a return to normal sampling from either of these states This paper examines the long range costs of such a sampling scheme. The three inspection types are considered as three distinct Markov chains, with periodic transitions from chain to chain. The expected sample size and the expected proportion of rejected product are determined as a function of the two parameters under control of the manufacturer, lot size and product quality. Some numerical examples are given which illustrate how to compute the overall cost of sampling inspection. Suggestions are made concerning the choice of parameters to minimize this cost.  相似文献   

14.
Polling systems are used to model a wide variety of real-world applications, for example, telecommunication and material handling systems. Consequently, there is continued interest in developing efficient algorithms to analyze the performance of polling systems. Recent interest in the optimization of these systems has brought up the need for developing very efficient techniques for analyzing their waiting times. This article presents the Individual Station technique for cyclic polling systems. The technique possesses the following features: (a) it allows the user to compute the mean waiting time at a selected station independent of the mean waiting time computations at other stations, and (b) its complexity is low and independent of the system utilization. In addition the technique provides explicit closed-form expressions for (i) the mean waiting times in a system with 3 stations, and (ii) the second moment of the waiting times in a system with 2 stations, for an exhaustive service system. © 1996 John Wiley & Sons, Inc.  相似文献   

15.
This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player. Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope. As a consequence the set of (perfect) equilibria is a finite union of polytopes. © 1994 John Wiley & Sons. Inc.  相似文献   

16.
利用结构矩阵分析的方法得到了一类拟单生过程在离散情形时普通遍历、Ⅰ遍历和几何遍历的关系,并利用得到的结论对排队论中的一类问题作了处理,因而具有理论和实际应用的价值。  相似文献   

17.
We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   

18.
对机场跑道打击效果的评估,通常采用的跑道失效率指标无法描述封锁失败时的具体打击效果。因此提出了存在窗口数序列指标,建立了该指标的计算模型,并给出了最小升降窗口搜索策略。仿真结果表明,该指标能够很好地描述封锁跑道失败时的具体毁伤效果。  相似文献   

19.
本文在文《度重空间的非标准特性(Ⅰ)》的基础上,用非标准分析方法刻划了度量空间上的全有界映射与紧映射的许多特性,并给出了一个赋范线性空间的维数有限的非标准特征。最后,在赋范线性空间中,通过弱拓扑性质的非标准刻划,简洁地证明了Eberlein-Ⅲ定理。  相似文献   

20.
We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号