排序方式: 共有119条查询结果,搜索用时 0 毫秒
111.
装备器材供应网是装备器材供应保障工作的重要基石,其规划问题是我军装备器材保障过程的重要战略决策之一。针对节点、边和需求的不确定性,对不确定条件下由多个区域供应子网构成的装备器材供应网的规划问题展开研究。针对问题的特点,用区间分析理论对供应网规划中的不确定性因素进行度量和运算,得到不确定性规划模型,通过区间运算转化,将不确定性模型转化为确定性混合整数规划模型,并设计采用基于禁忌搜索算法的两阶段算法进行求解,分别得到了不同参数设置下的模型求解结果,并将所用算法与模糊规划和随机规划算法的求解结果进行了比较分析。实例分析结果表明所建立的模型和算法具有较强的实用性。 相似文献
112.
113.
114.
风险偏好的区间值灰色模糊综合评判及其应用 总被引:1,自引:0,他引:1
由于被评判对象有时会带有某些不确定性以及信息量的多少及充分程度不同,使得这些对象在某些评判指标上属于某个评语的程度-隶属度及其对应的灰度不再是一个确定的数,常常是一个范围,针对此特点,尝试用区间值来表示灰度.引入一种反映风险偏好的风险指标,以此对评判结果灰度进行处理,定义了信息充分程度转化公式,利用其将评判结果转化为区间值集合,在此基础上建立了风险偏好的区间值灰色模糊综合评判的数学模型,并给出了它在方案优选中的应用.实例结果表明,这种方法是合理的、可行的、有效的. 相似文献
115.
我军拥有丰富的遂行非战争军事行动理论总结和实践经验,但总体来说,还缺乏一个遂行具体任务的科学机制。从构建我军遂行非战争军事行动的操作机制、运行机制和保障机制入手,构建我军遂行非战争军事行动的科学机制,为新形势下我军更好地遂行非战争军事行动提供理论指导。 相似文献
116.
吴树和 《海军工程大学学报》1998,(3)
分析了在给定圆域D及D内的障碍点集V后,用于生成基本避障圆的几个性质定理.然后由这些定理提出了求最大避障圆的一种新算法.用这种方法可降低计算的复杂性和便于人工作图. 相似文献
117.
This article studies the problem of designing Bayesian sampling plans (BSP) with interval censored samples. First, an algorithm for deriving the conventional BSP is proposed. The BSP is shown to possess some monotonicity. Based on the BSP and using the property of monotonicity, a new sampling plan modified by the curtailment procedure is proposed. The resulting curtailed Bayesian sampling plan (CBSP) can reduce the duration time of life test experiment, and it is optimal in the sense that its associated Bayes risk is smaller than the Bayes risk of the BSP if the cost of the duration time of life test experiment is considered. A numerical example to compute the Bayes risks of BSP and CBSP and related quantities is given. Also, a Monte Carlo simulation study is performed to illustrate the performance of the CBSP compared with the BSP. The simulation results demonstrate that our proposed CBSP has better performance because it has smaller risk. The CBSP is recommended. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 604–616, 2015 相似文献
118.
针对当前评比打分方法不能有效反映选手真实情况的问题,提出了一种基于混合高斯概率密度的加权打分方法。该方法的重点在于引入混合高斯分布来确定专家评分的权重。首先利用EM算法确定混合高斯分布模型参数,然后通过区间划分得到每个区间上的概率,再将专家打分映射到混合高斯概率密度函数区间上得到对应的权重,最后经加权求和得到选手的最终成绩。通过实例证明了该方法的合理性和公正性。 相似文献
119.
We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献